Mathematical Logic And Computation Codexery

Successive over-relaxation

A variant of Gauss–Seidel for faster convergence.

Successive over-relaxation

Successive over-relaxation, or SOR, is a technique in numerical linear algebra that modifies the Gauss–Seidel method for solving linear systems, typically achieving quicker convergence. The same principle can be applied to any iterative process that converges slowly.

The method was developed independently by David M. Young Jr. and Stanley P. Frankel in 1950, specifically to automate the solution of linear systems on digital computers. While over-relaxation methods existed earlier—for instance, those by Lewis Fry Richardson and R. V. Southwell—these earlier approaches were designed for human calculators. They required a degree of expertise to ensure convergence, which made them unsuitable for programming on digital machines. These details are covered in Young’s doctoral thesis.

For a square system of *n* linear equations in the unknown vector **x**, written as \( A\mathbf{x} = \mathbf{b} \), where \( A \) is an \( n \times n \) matrix with entries \( a_{ij} \), and **b** is a vector of constants, the SOR method iteratively updates each component of **x** using a relaxation parameter to accelerate convergence beyond the standard Gauss–Seidel approach.

field
Numerical linear algebra
known_for
Successive over-relaxation (SOR) method
devised_by
David M. Young Jr. and Stanley P. Frankel

Lore & Background

The method of successive over-relaxation (SOR) is a variant of the Gauss–Seidel method used in numerical linear algebra to solve a system of linear equations, with the primary advantage of achieving faster convergence. It is also applicable to any slowly converging iterative process. The technique was developed independently by David M. Young Jr. and Stanley P. Frankel in 1950, specifically to enable the automatic solution of linear systems on digital computers. Earlier over-relaxation methods existed, including those by Lewis Fry Richardson and R. V. Southwell, but these were designed for human calculators and required significant expertise to ensure convergence, rendering them unsuitable for automated programming on digital machines. This historical context is detailed in Young’s thesis. The SOR method works by decomposing the coefficient matrix into diagonal, strictly lower, and strictly upper triangular components. A relaxation factor ω, greater than 1, is introduced to accelerate convergence. The iterative process solves for the unknown vector using forward substitution, taking advantage of the triangular form of the decomposed matrix. Convergence is guaranteed if the coefficient matrix is symmetric and positive-definite, with ω between 0 and 2, a result proven by Ostrowski in 1947. The optimal relaxation parameter can be derived under specific conditions, such as when the Jacobi iteration matrix has only real eigenvalues and the method is convergent. For tridiagonal matrices, the optimal ω yields a convergence rate roughly four times more efficient than the Gauss–Seidel method. The algorithm is implemented using a single storage vector, as elements can be overwritten during computation.

Reader's Guide

Successive over-relaxation (SOR) is a significant development in numerical linear algebra because it provided a way to accelerate the convergence of iterative methods for solving linear systems, specifically as a variant of the Gauss–Seidel method. Its importance lies in its automatic applicability to digital computers, unlike earlier over-relaxation methods that relied on human judgment. The method remains a standard technique in scientific computing, particularly for large sparse systems. Its legacy is tied to the broader shift toward algorithmic methods that could be programmed, enabling the efficient solution of linear equations in fields such as engineering and physics.

Did You Know?

Prodigious Beginnings in Budapest

His father, a banker with a law doctorate, had moved the household from Pécs to the capital in the late 1880s, where they occupied an eighteen-room apartment above the Kann-Heller offices. As the eldest of three brothers, young János was tutored at home in English, French, German, and Italian. Family legend says that by age eight he already knew differential and integral calculus, and by twelve he had read Borel's treatise on functions. His father insisted he attend school at his own grade level but permitted private tutors. At fifteen he began advanced calculus with Gábor Szegő, whose wife recalled the analyst coming home in tears, stunned by the teenager's speed. By nineteen, von Neumann had published two major papers, the second giving the modern definition of ordinal numbers that superseded Cantor's. He concluded his gymnasium years by winning the national Eötvös Prize in mathematics.

Dual Degrees and the Göttingen Circle

When it came time to choose a career, von Neumann's father wanted him in industry rather than pure mathematics. He asked his friend Theodore von Kármán to talk John out of a mathematical path, and the two settled on chemical engineering. Simultaneously, he enrolled as a Ph.D. candidate in mathematics at Pázmány Péter University in Budapest, where his thesis produced an axiomatization of Cantor's set theory. A Rockefeller Foundation grant then carried him to the University of Göttingen to study under David Hilbert.

Wartime Service and the Nuclear Defense Establishment

During the Second World War, von Neumann joined the Manhattan Project, where he developed the mathematical models underlying the explosive lenses critical to the implosion-type nuclear weapon. His consulting work extended well beyond the laboratory: before and after the war he served the Office of Scientific Research and Development, the Army's Ballistic Research Laboratory, the Armed Forces Special Weapons Project, and Oak Ridge National Laboratory. In the 1950s, at the height of his influence, he chaired several Defense Department committees, including the Strategic Missile Evaluation Committee and the ICBM Scientific Advisory Committee. He also sat on the Atomic Energy Commission, the body overseeing all atomic energy development in the United States. Working alongside Bernard Schriever and Trevor Gardner, he played a key role in designing and developing the country's first intercontinental ballistic missile programs. At that time he was regarded as the nation's foremost expert on nuclear weaponry and the leading defense scientist at the Department of Defense.

A Mind Without Boundaries and an Enduring Mark

Few mathematicians of the twentieth century matched von Neumann's range. He built the mathematical framework of quantum physics, advanced functional analysis, and introduced or codified game theory. His work on cellular automata, the universal constructor, and the architecture of the digital computer anticipated entire fields of computation. Notably, his analysis of the structure of self-replication preceded the discovery of DNA's structure. Colleagues across physics, mathematics, and the broader sciences praised both his contributions and his sheer intellectual ability. The breadth of his impact was recognized with the Medal of Freedom, and a crater on the Moon now bears his name. Whether in Budapest's reading rooms, the rain-wet streets of Göttingen, or the corridors of the Pentagon, von Neumann left a mark that spanned pure abstraction and the most consequential applied sciences of the age.

Frequently Asked Questions

Who is Successive over-relaxation?

Successive over-relaxation (SOR) is a numerical linear algebra technique that modifies the Gauss–Seidel iterative method by introducing an over-relaxation parameter to accelerate convergence when solving systems of linear equations.

What are Successive over-relaxation's powers or role?

Its core role is to take each Gauss–Seidel update and blend it with a weighted overshoot, so that successive iterates approach the true solution more quickly than plain Gauss–Seidel would allow. In practice this means fewer iterations are needed to reach a desired tolerance.

How does Successive over-relaxation's story end?

SOR remains a standard workhorse in computational linear algebra, still taught and applied whenever a diagonally dominant or symmetric positive-definite system must be solved iteratively. It has not been fully superseded, though modern Krylov-subspace methods now handle many large-scale problems more efficiently.

Why is Successive over-relaxation important?

It demonstrated that a simple scalar parameter could dramatically tighten the convergence rate of an existing iterative scheme, making it a foundational example of how small algorithmic tweaks yield large practical gains. That insight influenced later relaxation and preconditioning strategies throughout numerical analysis.

Who created Successive over-relaxation?

The method was devised independently and simultaneously by David M. Young Jr. and Stanley P. Frankel in the early 1950s. Both researchers published their formulations around the same period, so credit is shared between them in the canonical literature.

More in Mathematical Logic And Computation 1-21

Spotted an error? Know more?

This is a living reference — every entry is fact-audited, and reader corrections feed straight into our audit queue. Suggest an edit · See this site's audit record

Comments

Loading…
Open in the interactive codex →