Milestones in the Development of Iterative Solution Methods

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68145535%3A_____%2F10%3A00353487" target="_blank" >RIV/68145535:_____/10:00353487 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Milestones in the Development of Iterative Solution Methods
Original language description
Iterative solution methods to solve linear systems of equations were originally formulated as basic iteration methods of defectcorrection 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 total computational complexity of optimal order, that is, proportional to the degrees of freedom involved in the equation. Methods that we have turned out to have been particularly important for the further developments of linear equation solvers are surveyed. Some if them are presented in greater detail.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
JC - Computer hardware and software
OECD FORD branch
—

Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)