Expand description
Generic implementations of iterative solvers
These implementations use primitive operations (BinaryOps, UnaryOps, ReduceOps) and can run on any backend that implements those traits.
Functions§
- adaptive_
gmres_ impl - Adaptive GMRES implementation
- amg_
preconditioned_ cg - Apply AMG as a preconditioner within CG
- amg_
setup - Build the AMG multigrid hierarchy (setup phase)
- amg_
vcycle - Apply one AMG V-cycle: smooth → restrict → coarse-solve → prolongate → smooth
- arnoldi_
eig_ impl - Generic Arnoldi eigensolver implementation
- bicgstab_
impl - Generic BiCGSTAB implementation
- cg_impl
- Generic preconditioned CG implementation
- cgs_
impl - Generic preconditioned CGS implementation
- gmres_
impl - Generic GMRES implementation
- jacobi_
impl - Generic weighted Jacobi implementation
- lanczos_
eig_ impl - Generic Lanczos eigensolver implementation
- lgmres_
impl - Generic LGMRES implementation
- minres_
impl - Generic MINRES implementation following Saad, “Iterative Methods for Sparse Linear Systems”, 2nd ed., Algorithm 6.12.
- qmr_
impl - Generic QMR implementation
- sor_
impl - Generic SOR implementation via sparse triangular solve
- svds_
impl - Generic sparse SVD implementation via Lanczos bidiagonalization