doi:10.1137/1.9780898718003

Saad, Y. (2003). doi:10.1137/1.9780898718003. Iterative Methods for Sparse Linear Systems.

Type

Book

Intellectual base

Review or monograph

Year

2003

DOI

10.1137/1.9780898718003

ISBN

9780898715347

DOI registrant

Society for Industrial and Applied Mathematics

Link

https://doi.org/10.1137/1.9780898718003

Cited by

4 citations across 4 artifacts.

Domain-specific

• Conjugate Gradient Method
  • In exact arithmetic it reaches the solution in at most \(n\) steps for an \(n\)-dimensional system, and often fewer according to the relevant minimal polynomial/eigenvalue structure.
• Gauss–Seidel Method
  • Strict diagonal dominance and Hermitian positive definiteness are familiar sufficient conditions for standard forms, not membership criteria and not necessary conditions.
• Jacobi Method
  • Strict diagonal dominance is a common sufficient condition, not a definition and not a necessary condition.
• Matrix-Free Methods
  • Saad's standard treatment develops iterative linear-system and eigenvalue methods around this operator action and distinguishes storage, convergence, and preconditioning issues.

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. Neither this nor any other of the 4 citations of this work carries a recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Links previously used in the corpus

Before the registry existed this work was also linked 1 other way.

• https://www-users.cse.umn.edu/~saad/IterMethBook_2ndEd.pdf ×2

Registry ID ref:8887a11d610d · see in the full table