Project

Iterative Solvers and Preconditioning

Status: Study in progress · Follow existing steepest-descent and conjugate-gradient notes toward preconditioned Krylov methods.

Question

How do spectrum, conditioning, and preconditioning influence convergence and the cost of solving a sparse system?

Reading and implementation order

  1. IEEE 754, Errors, and Algorithms — floating-point prerequisites and Python examples.
  2. Steepest Descent with SPD Matrices — derivation, convergence discussion, and MATLAB/Python code.
  3. Conjugate Gradient — working theory and MATLAB implementation notes.
  4. Planned: compare CG and GMRES under their respective assumptions.
  5. Planned: add preconditioning and connect it to domain decomposition.

Current evidence and limits

The linked posts contain derivations and code snippets. A standalone solver repository, automated numerical regression suite, and reproducible benchmark dataset are not linked yet. Some mathematical arguments are still working notes.

Planned experiments

Record matrix source and dimensions, conditioning information when available, initial guess, residual definition, stopping tolerance, iteration count, setup time, solve time, and memory use. Compare methods against the same accuracy target and report failures as well as successes.

Study skeleton

Linear Algebra prerequisites → Saad Study

Linked notes

Linked paper notes

No paper notes linked yet.

All projects · Research directions