Hybrid procedures for solving linear systems (Q1326467): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s002110050015 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s002110050015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W164251211 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S002110050015 / rank
 
Normal rank

Latest revision as of 18:11, 10 December 2024

scientific article
Language Label Description Also known as
English
Hybrid procedures for solving linear systems
scientific article

    Statements

    Hybrid procedures for solving linear systems (English)
    0 references
    9 October 1994
    0 references
    The idea of the hybrid procedure is as follows. Let \(x'\), \(x''\) be two approximations of the solution of \(Ax = b\). Define \(r' = Ax' - b\), \(r'' = Ax'' - b\). For \(\alpha \in \mathbb{R}\) define \(y = \alpha x' + (1 - \alpha) x''\) and let \(r = Ay - b\). It is easy to see that \(r = \alpha r' + (1 - \alpha) r''\). Therefore \(\alpha\) may be chosen in a straightforward way so that \(r\) has minimal norm. Typically \(x'\), \(x''\) are obtained from two iterative methods (sometimes they are two iterates of the same method). The computed \(y\) can be used to start the next iteration. The authors consider many applications and examples, in particular Lanczos, Gauss-Seidel, Jacobi, and Gastinel methods.
    0 references
    conjugate gradient
    0 references
    Lanczos method
    0 references
    Gauss-Seidel method
    0 references
    Jacobi method
    0 references
    Gastinel method
    0 references
    iterative methods
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers