The arithmetic mean preconditioner for multivector computers
From MaRDI portal
Publication:4021067
DOI10.1080/00207169208804105zbMath0756.65069OpenAlexW2030903364MaRDI QIDQ4021067
Emanuele Galligani, Valeria Ruggiero
Publication date: 17 January 1993
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169208804105
comparison of methodsparallel computationconjugate gradient methodsuccessive overrelaxationmultiprocessor systemlinear systems of equationspreconditioning methodsarithmetic mean preconditioner
Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05)
Related Items
A minimization method for the solution of large symmetriric eigenproblems ⋮ The two-stage arithmetic mean method ⋮ The arithmetic mean method for solving systems of nonlinear equations in finite differences ⋮ Performance analysis of Arithmetic Mean method for solving composite 6-point closed Newton–Cotes quadrature algebraic equation ⋮ Polynomial preconditioning on vector computers
Cites Work
- Squeezing the most out of eigenvalue solvers on high-performance computers
- Additive polynomial preconditions for parallel computers
- m-Step Preconditioned Conjugate Gradient Methods
- Multi-Splittings of Matrices and Parallel Solution of Linear Systems
- The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators
- Multisplitting with Different Weighting Schemes