GRSIM: A FORTRAN subroutine for the solution of non-symmetric linear systems
DOI10.1002/cnm.540zbMath1015.65016OpenAlexW2063349012MaRDI QIDQ4804578
Publication date: 28 April 2003
Published in: Communications in Numerical Methods in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/cnm.540
discretizationconvergence\(M\)-matrixsparse matrixCholesky factorsdiagonally dominantSPD matrixnearly-symmetricregular-splitting
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Packaged methods for numerical algorithms (65Y15) Software, source code, etc. for problems pertaining to linear algebra (15-04)
Related Items (2)
Uses Software
Cites Work
- The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
- Convergence estimates for solution of integral equations with GMRES
- A Combined Direct-Iterative Method for Certain M-Matrix Linear Systems
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- Comparison of Some Direct Methods for Computing Stationary Distributions of Markov Chains
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- OAHM: A fortran subroutine for solving a class of unsymmetric linear systems of equations
- How Fast are Nonsymmetric Matrix Iterations?
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Some Design Features of a Sparse Matrix Code
- Variants of BICGSTAB for Matrices with Complex Spectrum
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- Unnamed Item
- Unnamed Item
This page was built for publication: GRSIM: A FORTRAN subroutine for the solution of non-symmetric linear systems
