Additive polynomial preconditions for parallel computers

DOI10.1016/0167-8191(89)90116-6MaRDI QIDQ1118974zbMATH OpenOpenAlexFDO

Authors Loyce M. Adams, Elizabeth G. Ong

Publication date 1989

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(89)90116-6

zbMATH Keywords

condition numberforward and backward SORLaplace equationmulti- coloringoptimal relaxation parameterparallel computersparallel implementationPolynomial preconditionerspreconditioned conjugate gradient methodsplittingSSORsubdivisionssymmetric successive overrelaxation

Mathematics Subject Classification ID

Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Parallel numerical computation (65Y05)

Recommendations

• scientific article; zbMATH DE number 3992788
• Improved SSOR and incomplete Cholesky solution of linear equations on shared memory and distributed memory parallel computers
• Efficient Polynomial Preconditioning for the Conjugate Gradient Method
• Multisplitting Preconditioners Based on Incomplete Choleski Factorizations
• New parallel symmetric SOR preconditioners by multi-type partitioning

Cited in

(22)

• On some new approximate factorization methods for block tridiagonal matrices suitable for vector and parallel processors
• On the additive splitting procedures and their computer realization
• On the theory and practice of multisplitting methods in parallel computation
• A parallel algorithm for solving block tridiagonal linear systems
• On the \(m\)-step two-parameter generalized Hermitian and skew-Hermitian splitting preconditioning method
• Polynomial preconditioners based on factorized sparse approximate inverses
• A preconditioned conjugate gradient method on a distributed memory multiprocessor
• On \(k\)-step CSCS-based polynomial preconditioners for Toeplitz linear systems with application to fractional diffusion equations
• Some notes on multisplitting methods and \(m\)-step preconditioners for linear systems
• The Block Successive Relaxation Additive Tterative method for least squares problems
• New parallel symmetric SOR preconditioners by multi-type partitioning
• The arithmetic mean preconditioner for multivector computers
• scientific article; zbMATH DE number 741208 (Why is no real title available?)
• A POLYNOMIAL PRECONDITIONER FOR BLOCK TRIDIAGONAL MATRICES
• THE ARITHMETIC MEAN METHOD FOR FINDING THE STATIONARY VECTOR OF MARKOV CHAINS
• The use of conjugate gradients methods with a segregated finite volume procedure for solving transient, incompressible Navier–Stokes equations
• Multisplitting Preconditioners Based on Incomplete Choleski Factorizations
• Improved SSOR and incomplete Cholesky solution of linear equations on shared memory and distributed memory parallel computers
• Proxy-GMRES: Preconditioning via GMRES in Polynomial Space
• On \(m\)-step Hermitian and skew-Hermitian splitting preconditioning methods
• An iterative method for large sparse linear systems on a vector computer
• The arithmetic mean method for solving systems of nonlinear equations in finite differences

This page was built for publication: Additive polynomial preconditions for parallel computers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1118974)