The Solution of Large Sparse Unsymmetric Systems of Linear Equations
From MaRDI portal
Publication:5637814
Cited in
(23)- An alternate implementation of Goldfarb's minimization algorithm
- A survey of direct methods for sparse linear systems
- A survey of the advances in the exploitation of the sparsity in the solution of large problems
- Sparse linear problems and the least squares method
- Computational methods of linear algebra
- Computing with sparse matrices
- Matrix factorizations in optimization of nonlinear functions subject to linear constraints
- A wavenumber based extrapolation and interpolation method for use in conjunction with high-order finite difference schemes
- A kinetic study of enzyme systems
- A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over \(\mathbb F_2\)
- scientific article; zbMATH DE number 3683294 (Why is no real title available?)
- Factorizing symmetric indefinite matrices
- Band algorithm for unsymmetric matrices in finite element and semi-discrete methods
- ๐๐๐ -methods for the eigenvalue problem with large sparse matrices
- An exact solution to a class of queueing systems with multipurpose counters
- Modified ROW methods for stiff problems
- A second order self-consistent IMEX method for radiation hydrodynamics
- Application of the Cramer rule in the solution of sparse systems of linear algebraic equations
- Conjugate gradient method for computing the Moore-Penrose inverse and rank of a matrix
- A fully second order implicit/explicit time integration technique for hydrodynamics plus nonlinear heat conduction problems
- Pivot selection and row ordering in Givens reduction on sparse matrices
- Maintaining LU factors of a general sparse matrix
- Tecniche di riordinamento delle equazioni per la risoluzione dei sistemi lineari sparsi
This page was built for publication: The Solution of Large Sparse Unsymmetric Systems of Linear Equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5637814)