Partial Pivoting Strategies for Symmetric Matrices
From MaRDI portal
Cited in
(15)- Computational methods of linear algebra
- On the natural factor in nonlinear analysis
- Stability of block LDL^T factorization of a symmetric tridiagonal matrix
- Stability analysis of block factorization for complex symmetric block tridiagonal matrices
- Full block \(J\)-Jacobi method for Hermitian matrices
- On solving sparse symmetric linear systems whose definiteness is unknown
- Indefinite QR factorization
- A backward stability analysis of diagonal pivoting methods for solving unsymmetric tridiagonal systems without interchanges.
- Stable algorithms for solving symmetric and skew-symmetric systems
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
- Conjugate gradient (CG)-type method for the solution of Newton's equation within optimization frameworks
- A class of approximate inverse preconditioners based on Krylov-subspace methods for large-scale nonconvex optimization
- Preconditioned gradient iterations for the eigenproblem of definite matrix pairs
- A survey of direct methods for sparse linear systems
- Block-oriented J-Jacobi methods for Hermitian matrices
This page was built for publication: Partial Pivoting Strategies for Symmetric Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5667417)
