Milestones in the Development of Iterative Solution Methods
Author(s) -
Owe Axelsson
Publication year - 2010
Publication title -
journal of electrical and computer engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.318
H-Index - 25
eISSN - 2090-0155
pISSN - 2090-0147
DOI - 10.1155/2010/972794
Subject(s) - conjugate gradient method , convergence (economics) , iterative method , chebyshev filter , mathematics , chebyshev iteration , linear system , acceleration , mathematical optimization , algorithm , computer science , mathematical analysis , physics , classical mechanics , economics , economic growth
Iterative solution methods to solve linear systems of equations were originally formulated as basic iteration methods of defect-correction type, commonly referred to as Richardson's iteration method. These methods developed further into various versions of splitting methods, including the successive overrelaxation (SOR) method. Later, immensely important developments included convergence acceleration methods, such as the Chebyshev and conjugate gradient iteration methods and preconditioning methods of various forms. A major strive has been to find methods with a total computational complexity of optimal order, that is, proportional to the degrees of freedom involved in the equation. Methods that have turned out to have been particularly important for the further developments of linear equation solvers are surveyed. Some of them are presented in greater detail
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom