|
|
|
|
Laguerre's method
Laguerre's method In numerical analysis, Laguerre's method is a root-finding algorithm tailored to polynomials. In other words, Laguerre's method can be used to ...
http://en.wikipedia.org/wiki/Laguerre's_method - 4k - Cached - Similar pages
|
List of numerical analysis topics
... Wikipedia page. General Kahan summation algorithm Iterative method Richardson extrapolation Evaluation of polynomials: Horner scheme ... root algorithm CORDIC Lanczos approximation Level set method Abramowitz and Stegun Curse of dimensionality Superconvergence ... degree algorithm Symbolic Cholesky decomposition Conjugate gradient method Levinson recursion — for solving a system ... with a Toeplitz matrix Eigenvalue algorithms: Power method Inverse iteration Rayleigh quotient iteration Arnoldi iteration ... equations Root-finding algorithm General methods: Bisection method Lehmer-Schur algorithm False position method ...
http://en.wikipedia.org/wiki/List_of_numerical_analysis_topics - 20k - Cached - Similar pages
|
Talk:Root-finding algorithm
Talk:Root-finding algorithm Jacoby's method This method is now described at Jacoby's method. -- Jitse Niesen (talk) 13:04, 10 January ... illconditioned equation is readily solved by 'my' method. Bo Jacoby 07:27, 13 September 2005 ... algorithm. I don't remembering seeing this method before, but that's does not ...
http://en.wikipedia.org/wiki/Talk:Root-finding_algorithm - 25k - Cached - Similar pages
|
Root-finding algorithm
... A root-finding algorithm is a numerical method, or algorithm, for finding a value x ... of this series are initial guesses. The method computes subsequent values based on the old ... simplest root-finding algorithm is the bisection method. It works when f is a continuous ... f(b) have opposite signs. Newton's method, assumes the function f to have a derivative. Newton's method may not converge if you start ...
http://en.wikipedia.org/wiki/Root-finding_algorithm - 8k - Cached - Similar pages
|
Algorithm of search for one zero of a function (translated from French)
... zero of a function is a numerical method or one algorithm of search for an ... of [has, B] which contains one zero. Method of dichotomy guaranteed convergence towards one zero ... Newton-Raphson méthode of Newton , called also method of Newton-Raphson, "linearizes" the function F ... frac{f(x_k)}{f' (x_k)}. The method of Newton can not converge if you ... converge, it is much faster than the method of dichotomy (its complexity is quadratic). ...
http://fr.wikipedia.org/wiki/Algorithme_de_recherche_d'un_zéro_d'une_fonction - 10k - Cached (French) - Wikipedia (French) - Similar pages
|
Orthogonal polynomials
... three cases lead to the Jacobi-like, Laguerre-like, and Hermite-like polynomials, respectively. In ... of them, relating to the Chebyshev, Associated Laguerre, and Hermite polynomials: |
Calculation of the zero of one function (translated from Italian)
... the solution of equations_, sottintendendo that this method can apply be to equation linear that ... resolve not linear equations. Specific algorithms The method of search of the simpler root is metodo dicotomico or bisection method. Part knowing itself a real interval [to ... course. metodo of the tangents (called also method of Newton and method of Newton - Raphson, servants of the ...
http://it.wikipedia.org/wiki/Calcolo_dello_zero_di_una_funzione - 6k - Cached (Italian) - Wikipedia (Italian) - Similar pages
|
Methods of squaring of Gauss (translated from French)
... name of Carl Friedrich Gauss , is a method of exact squaring for one polynôme of ... mathbb{R}^+ e^{-x} Laguerre \mathbb{R} e^{-x ... a degree of exactitude of 2n-1. Method of Gauss-Legendre For the most traditional ... problem of the integration, one uses the method of Gauss-Legendre. It is a question ... x_i + \frac{a+b}{2}\right) Method of Chebychev Gauss This formula is ...
http://fr.wikipedia.org/wiki/Méthodes_de_quadrature_de_Gauss - 12k - Cached (French) - Wikipedia (French) - Similar pages
|
List of mathematics articles (J-L)
... s theory -- Jacobi field -- Jacobi identity -- Jacobi method -- Jacobi polynomials -- Jacobi sum -- Jacobi symbol -- Jacobi ... Jacobson density theorem -- Jacobson radical -- Jacoby's method -- James-Stein estimator -- Janko group -- János Bolyai ... physics) -- K3 surface -- Kac-Moody algebra -- Kaczmarz Method -- Kadomtsev-Petviashvili equation -- Kahan summation algorithm -- Kähler ... foliation -- Lagrangian Grassmannian -- Lagrangian mechanics -- Lagrangian point -- Laguerre form -- Laguerre polynomials -- Laguerre's method -- Lah number -- ...
http://en.wikipedia.org/wiki/List_of_mathematics_articles_(J-L) - 48k - Cached - Similar pages
|
Optical tweezers
... had first envisioned optical tweezing as a method for trapping atoms. Ashkin was able to ... beams i.e Hermite Gaussian beam (TEMxy), [Laguerre-Gaussian beams](LG) (TEMpl) and Bessel beams ... alternative optical tweezers. Optical tweezers based on Laguerre Gaussian beam have the unique capability of ... particles that are optically reflective and absorptive. Laguerre-Gaussian beam also possess a well-defined ... angular momentum[16]. Besides the use of Laguerre Gaussian beam for optical tweezing, both ...
http://en.wikipedia.org/wiki/Optical_tweezers - 44k - Cached - Similar pages
|
| Page:1 2 3 Next >> |
