Перевод: с русского на английский

с английского на русский

the iteration converges to a solution

См. также в других словарях:

  • Modified Richardson iteration — is an iterative method for solving a system of linear equations. Richardson iteration was proposed by Lewis Richardson in his work dated 1910. It is similar to the Jacobi and Gauss–Seidel method. We seek the solution to a set of linear equations …   Wikipedia

  • Arnoldi iteration — In numerical linear algebra, the Arnoldi iteration is an eigenvalue algorithm and an important example of iterative methods. Arnoldi finds the eigenvalues of general (possibly non Hermitian) matrices; an analogous method for Hermitian matrices is …   Wikipedia

  • Jenkins-Traub algorithm — The Jenkins Traub algorithm for polynomial zeros is a fast globally convergent iterative method. It has been described as practically a standard in black box polynomial root finders .Given a polynomial P ,:P(z)=sum {i=0}^na iz^{n i}, quad a… …   Wikipedia

  • Gauss–Newton algorithm — The Gauss–Newton algorithm is a method used to solve non linear least squares problems. It can be seen as a modification of Newton s method for finding a minimum of a function. Unlike Newton s method, the Gauss–Newton algorithm can only be used… …   Wikipedia

  • Kantorovich theorem — The Kantorovich theorem is a mathematical statement on the convergence of Newton s method. It was first stated by Leonid Kantorovich in 1940. Newton s method constructs a sequence of points that with good luck will converge to a solution x of an… …   Wikipedia

  • Jacobi method — The Jacobi method is an algorithm in linear algebra for determining the solutions of a system of linear equations with largest absolute values in each row and column dominated by the diagonal element. Each diagonal element is solved for, and an… …   Wikipedia

  • Nth root algorithm — The principal n th root sqrt [n] {A} of a positive real number A , is the positive real solution of the equation:x^n = A(for integer n there are n distinct complex solutions to this equation if A > 0, but only one is positive and real).There is a …   Wikipedia

  • nth root algorithm — The principal nth root of a positive real number A, is the positive real solution of the equation xn = A (for integer n there are n distinct complex solutions to this equation if A > 0, but only one is positive and real). There is a very fast… …   Wikipedia

  • Gauss–Seidel method — The Gauss–Seidel method is a technique used to solve a linear system of equations. The method is named after the German mathematicians Carl Friedrich Gauss and Philipp Ludwig von Seidel. The method is an improved version of the Jacobi method. It… …   Wikipedia

  • Richardson-Lucy deconvolution — The Richardson Lucy algorithm, also known as Richardson Lucy deconvolution, is an iterative procedure for recovering a latent image that has been blurred by a known point spread function.cite journal author = Richardson, William Hadley title =… …   Wikipedia

  • Newton's method — In numerical analysis, Newton s method (also known as the Newton–Raphson method), named after Isaac Newton and Joseph Raphson, is a method for finding successively better approximations to the roots (or zeroes) of a real valued function. The… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»