Live briefing
Everything about Iterative method
Numerical approximation algorithm
In computational mathematics, an iterative method is a mathematical procedure that uses an initial value to generate a sequence of improving approximate solutions for a class of problems, in which the i-th approximation is derived from the previous ones. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Iterative methodA 5-minute orientation
- Skim a recent paper: A Trained Iterative Shrinkage Approach Based on Born Iterative Method for Electromagnetic ImagingInfluential work since 2022
- Pick up a classic book: The theory and applications of iteration methodsThe most-reprinted book on the subject
- Read the landmark paper: Common method biases in behavioral research: A critical review of the literature and recommended remedies.Cited 72,983 times
- Go sideways: Successive over-relaxationA closely related topic
- Go sideways: Generalized minimal residual methodA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Common method biases in behavioral research: A critical review of the literature and recommended remedies.
General Methods for Monitoring Convergence of Iterative Simulations
Iterative shrinking method for clustering problems
Iterative multiscale finite-volume method
Adaptive iterative multiscale finite volume method
An iterative method for shakedown analysis
AN ITERATIVE ITEM BIAS DETECTION METHOD
A generalized ADI iterative method
🆕 Influential since 2022
A Trained Iterative Shrinkage Approach Based on Born Iterative Method for Electromagnetic Imaging
Conformable Double Laplace–Sumudu Iterative Method
Iterative optimization method for determining optimal shape parameter in RBF-FD method
Enhancing the practicality of Newton–Cotes iterative method
On Timoshenko’s iterative method in buckling of nanobeams
📚 Books worth reading
The theory and applications of iteration methodsIoannis K. Argyros · 1993
Metod momentov v prikladnoĭ matematikeVorobʹev, I͡U. V. · 1958
Parallel iterative algorithmsJacques Mohcine Bahi · 2007
Polynomial operator equations in abstract spaces and applicationsIoannis K. Argyros · 1998
Iterative methods in combinatorial optimizationLap Chi Lau · 2011
Applied Iterative MethodsCharles L. Byrne · 2007- 📕Iterative Methods and Preconditioning for Large and Sparse Linear Systems with ApplicationsDaniele Bertaccini, Fabio Durastante · 2018
Iterative splitting methods for differential equationsJuergen Geiser · 2011
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Successive over-relaxation In numerical linear algebra, the method of successive over-relaxation (SOR) is a variant of the Gauss–Seidel method for solving a linear system of equations…
- Generalized minimal residual method In mathematics, the generalized minimal residual method (GMRES) is an iterative method for the numerical solution of an indefinite nonsymmetric system…
- Conjugate gradient method In mathematics, the conjugate gradient method is an algorithm for the numerical solution of particular systems of linear equations, namely those whose…
- Anderson acceleration In mathematics, Anderson acceleration, also called Anderson mixing, is a method for the acceleration of the convergence rate of fixed-point iterations…
- Krylov subspace In linear algebra, the order-r Krylov subspace generated by an n-by-n matrix A and a vector b of dimension n is the linear subspace spanned by the images…
- Broyden's method In numerical analysis, Broyden's method is a quasi-Newton method for finding roots in k variables. It was originally described by C. G. Broyden in 1965…
- Jacobi method In numerical linear algebra, the Jacobi method (a.k.a. the Jacobi iteration method) is an iterative algorithm for determining the solutions of a strictly…
- Newton's method In numerical analysis, the Newton–Raphson method, also known simply as Newton's method, named after Isaac Newton and Joseph Raphson, is a root-finding…