modified Richardson iteration
Modified Richardson iteration is an iterative method used to solve a linear system of equations.
All 3 facts, and where they come from
Facts
3 facts · 0 confirmed by two sources · 0 cited · 3 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 17, 2026 · revision 2436105598
- Described as
- iterative method used to solve a linear system of equations
- What it is
- method; mathematical concept
- Named after
- Lewis Fry Richardson
- Wikipedias with a page
- 2
Wikidata item Q1375161 (wikidata.org/wiki/Q1375161), public domain (CC0). Copied 2026-11-17.
What Wikipedia says · copied November 17, 2026 · revision 1345210806
Modified Richardson iteration is an iterative method for solving a system of linear equations. Richardson iteration was proposed by Lewis Fry Richardson in work that was published in 1911. It is similar to the Jacobi and Gauss–Seidel method.
We seek the solution to a set of linear equations, expressed in matrix terms as
Ax=b.
The Richardson iteration is
x(k+1)=x(k)+ω(b−Ax(k)),
where ω is a scalar parameter that has to be chosen such that the sequence x(k) converges.
It is easy to see that the method has the correct fixed points, because if it converges, then x(k+1)≈x(k) and x(k) has to approximate a solution of Ax=b.
From the Wikipedia article “Modified Richardson iteration” (en.wikipedia.org/wiki/Modified_Richardson_iteration), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
