General scheme for solving linear algebraic problems by direct methods
From MaRDI portal
Publication:799071
DOI10.1016/0168-9274(85)90023-6zbMath0547.65035OpenAlexW1970718901MaRDI QIDQ799071
Publication date: 1985
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-9274(85)90023-6
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (4)
A direct solver for a class of symmetric linear systems ⋮ A survey of the advances in the exploitation of the sparsity in the solution of large problems ⋮ Solving large and sparse linear least-squares problems by conjugate gradient algorithms ⋮ Direct method for a class of symmetric linear systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Y12M. Solution of large and sparse systems of linear algebraic equations. Documentation of subroutines
- Comparison of two pivotal strategies in sparse plane rotations
- Consistency and convergence of general linear multistep variable stepsize variable formula methods
- Numerical methods for solving linear least squares problems
- Application of backward differentiation methods to the finite element solution of time-dependent problems
- Error Analysis of Direct Methods of Matrix Inversion
- On Some Pivotal Strategies in Gaussian Elimination by Sparse Technique
- The use of sparse matrix technique in the numerical integration of stiff systems of linear ordinary differential equations
- Use of Iterative Refinement in the Solution of Sparse Linear Systems
- Comparison of Two Algorithms for Solving Large Linear Systems
- On the Reduction of Sparse Matrices to Condensed Forms by Similarity Transformations
- The least squares problem and pseudo-inverses
This page was built for publication: General scheme for solving linear algebraic problems by direct methods
