Algorithms for Sparse Linear Systems
From MaRDI portal
Recommendations
Cited in
(12)- Preconditioner design via Bregman divergences
- Caveats of three direct linear solvers for finite element analyses
- Support graph preconditioners for off-lattice cell-based models
- An accurate and effective computational method to solve brain tumor problems: a Jacobian-free Newton Krylov method with an innovative preconditioning strategy II
- Matérn and generalized Wendland correlation models that parameterize hole effect, smoothness, and support
- Developing robust incomplete Cholesky factorizations in half precision arithmetic
- A robust algebraic two-level Schwarz preconditioner for sparse matrices
- Sparse linear least-squares problems
- Regularized methods via cubic model subspace minimization for nonconvex optimization
- Estimation of spectral gaps for sparse symmetric matrices
- Minimal residual rational Krylov subspace method for sequences of shifted linear systems
- Iterative solvers for partial differential equations with dissipative structure: operator preconditioning and optimal control
This page was built for publication: Algorithms for Sparse Linear Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6044571)