The solution of sparse linear equations by the conjugate gradient method
From MaRDI portal
Cites work
Cited in
(14)- Solving linear finite element systems by normalized approximate matrix factorization semi-direct methods
- The use of a preconditioned bi-conjugate gradient method for hybrid plasma stability analysis
- Accelerated solution techniques and concrete cracking
- Conjugate gradient methods for the solution of boundary integral equations on a piecewise smooth boundary
- Penalty finite element analysis of incompressible flows using element by element solution algorithms
- Parallel solution techniques in computational structural mechanics
- Symmetrized compact scheme for receptivity study of 2D transitional channel flow
- Comptutation of the flow past shiplike hulls
- Laplacian preconditioning of elliptic PDEs: localization of the eigenvalues of the discretized operator
- \texttt{HSL\_MI28}: an efficient and robust limited-memory incomplete Cholesky factorization code
- Computation of leading-edge contamination
- Natural finite element techniques for viscous fluid motion
- A parallel preconditioned block conjugate gradient method for solving large systems of linear equations on a MIMD supercomputer
- Some sufficient conditions for the convergence of the method of averaging functional corrections
This page was built for publication: The solution of sparse linear equations by the conjugate gradient method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4144107)
