3. Fast Stable Solvers for Structured Linear Systems

Ali H. Sayed, Shivkumar ChandrasekaranSociety 1999 · DOI · OpenAlex

Abstract

3.1 INTRODUCTIONThe derivation in Ch. 2 showed how to obtain a stable implementation of the generalized Schur algorithm for positive-definite structured matrices R and, also, how to solve Rx=b when R is structured but still positive definite.We now use this stable implementation of the Schur algorithm, and the same notation of Ch. 2, to solve in a stable manner linear systems of equations with possibly indefinite or even nonsymmetric structured coefficient matrices. In other words, we show how to use the stability results of the positive-definite case to derive stable solvers for the indefinite and nonsymmetric cases.
BibTeX
@inproceedings{sayed1999fast,
  author = {Ali H. Sayed and Shivkumar Chandrasekaran},
  title = {{3. Fast Stable Solvers for Structured Linear Systems}},
  booktitle = {Society},
  year = {1999},
  doi = {10.1137/1.9781611971354.ch3},
}

Loading related content...

Figure