A parallel sparse linear system solver based on Hermitian/skew-Hermitian splitting
DOI10.1016/j.camwa.2016.08.016zbMath1359.65068OpenAlexW2516497978MaRDI QIDQ521832
Publication date: 12 April 2017
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2016.08.016
preconditionersnumerical linear algebraKrylov subspace methodsparallel numerical algorithmsHermitian/skew-Hermitian splitting
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05) Preconditioners for iterative methods (65F08)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On preconditioned MHSS iteration methods for complex symmetric linear systems
- On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix
- Preconditioning Highly Indefinite and Nonsymmetric Matrices
- The university of Florida sparse matrix collection
- Orderings for Incomplete Factorization Preconditioning of Nonsymmetric Problems
- Parallel Preconditioning with Sparse Approximate Inverses
- Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
- A Preconditioner for Generalized Saddle Point Problems
- ILUT: A dual threshold incomplete LU factorization
- Preconditioned MHSS iteration methods for a class of block two-by-two linear systems with applications to distributed control problems
- Matrix Iterative Analysis
This page was built for publication: A parallel sparse linear system solver based on Hermitian/skew-Hermitian splitting