An iterative solution method for solving sparse nonsymmetric linear systems
From MaRDI portal
Publication:1079918
DOI10.1016/0377-0427(86)90225-6zbMath0598.65013OpenAlexW2033745611MaRDI QIDQ1079918
Publication date: 1986
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-0427(86)90225-6
Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)
Related Items
A Family of Immersed Finite Element Spaces and Applications to Three-Dimensional \(\bf{H}(\operatorname{curl})\) Interface Problems, Application of the Cramer rule in the solution of sparse systems of linear algebraic equations
Cites Work
- Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration
- Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methods. I, II
- Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
- The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
- Numerical solution of nonlinear elliptic partial differential equations by a generalized conjugate gradient method
- Extrapolated Iterative Methods for Linear Systems Approximation
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- A Lanczos Method for a Class of Nonsymmetric Systems of Linear Equations
- Methods of conjugate gradients for solving linear systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item