Improved SSOR and incomplete Cholesky solution of linear equations on shared memory and distributed memory parallel computers
DOI10.1002/NLA.1680010306zbMATH Open0838.65028OpenAlexW2117673385MaRDI QIDQ4868083FDOQ4868083
Wayne D. Joubert, Thomas C. Oppe
Publication date: 9 June 1996
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.1680010306
Recommendations
numerical comparisonspreconditionersincomplete factorizationdiffusion problemparallel computerssymmetric successive overrelaxationimplementationsblock cyclic reduction
Parallel numerical computation (65Y05) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Boundary value problems for second-order elliptic equations (35J25) Finite difference methods for boundary value problems involving PDEs (65N06)
Cites Work
Cited In (7)
- Additive polynomial preconditions for parallel computers
- An efficient implementation for SSOR and incomplete factorization preconditionings
- Title not available (Why is that?)
- Fine-Grained Parallel Incomplete LU Factorization
- On Vectorizing Incomplete Factorization and SSOR Preconditioners
- Parallel SSOR preconditioning for lattice QCD
- New parallel symmetric SOR preconditioners by multi-type partitioning
This page was built for publication: Improved SSOR and incomplete Cholesky solution of linear equations on shared memory and distributed memory parallel computers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4868083)
