Classification of Fatou components: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>Adam majewski
en>Adam majewski
 
Line 1: Line 1:
{{Context|date=October 2009}}
Ed is what individuals call me and my spouse doesn't like it at all. I am really fond of handwriting but I can't make it my occupation truly. Her family members lives in Ohio but her husband desires them to move. My working day occupation is a journey agent.<br><br>Have a look at my web page [http://mybrandcp.com/xe/board_XmDx25/107997 clairvoyants]
In [[numerical analysis]], the '''Nyström method'''<ref>{{cite journal|last=Nyström|first=Evert Johannes|title=Über die praktische Auflösung von Integralgleichungen mit Anwendungen auf Randwertaufgaben|journal=Acta Mathematica|year=1930|volume=54|issue=1|pages=185–204|doi=10.1007/BF02547521}}</ref> or '''quadrature method''' seeks the numerical solution of an [[integral equation]] by replacing the integral with a representative weighted sum.  The continuous problem is broken into <math>n</math> discrete intervals, quadrature or [[numerical integration]] determines the weights and locations of representative points for the integral.  The discrete problem to be solved is now a [[system of linear equations]] with n equations and n unknowns.
 
From the n solved points the function value at other points is interpolated consistent with the chosen quadrature method.
Depending on the original problem and the choice of quadrature the problem may be ill-conditioned.
 
Since the linear equations require <math>O(n^3)</math> operations to solve, hence high-order quadrature rules perform better because low-order quadrature rules require large <math>n</math> for a given accuracy. [[Gaussian quadrature]] is normally a good choice for smooth, non-singular problems.
 
== Discretization of the integral ==
 
:<math>\int_a^b h (x) \;\mathrm d x \approx \sum_{k=1}^n w_k h (x_k)</math>
 
:where <math>w_k</math> are the weights of the quadrature rule, and points <math>x_k</math> are the abscissas.
 
== Example ==
 
Applying this to the inhomogeneous [[Fredholm equation]] of the second kind
 
:<math>f (x) = \lambda u (x) - \int_a^b K (x, x') f (x') \;\mathrm d x'</math>,
 
results in
 
:<math>f (x) \approx \lambda u (x) - \sum_{k=1}^n w_k K (x, x_k) f (x_k)</math>.
 
== References ==
 
{{reflist}}
* Leonard M. Delves & Joan Walsh (eds): ''Numerical Solution of Integral Equations'', Clarendon, Oxford, 1974.
* Hans-Jürgen Reinhardt: ''Analysis of Approximation Methods for Differential and Integral Equations'', Springer, New York, 1985.
 
{{DEFAULTSORT:Nystrom method}}
[[Category:Integral equations]]
[[Category:Numerical analysis]]
[[Category:Numerical integration (quadrature)]]
 
 
{{mathapplied-stub}}

Latest revision as of 13:49, 15 June 2014

Ed is what individuals call me and my spouse doesn't like it at all. I am really fond of handwriting but I can't make it my occupation truly. Her family members lives in Ohio but her husband desires them to move. My working day occupation is a journey agent.

Have a look at my web page clairvoyants