Polynomial preconditioning on vector computers

DOI10.1016/0096-3003(93)90085-SzbMath0789.65026OpenAlexW2054047259MaRDI QIDQ1316153

Valeria Ruggiero

Publication date: 13 June 1994

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0096-3003(93)90085-s

zbMATH Keywords

eigenvaluesconditioningpreconditioned conjugate gradient methodcomputer experimentsgeneralized eigenproblemCray Y-MP computerminimal eigenpairSSOR polynomial preconditioner

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items (1)

A minimization method for the solution of large symmetriric eigenproblems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An iterative method for large sparse linear systems on a vector computer
• Approximating the inverse of a matrix for use in iterative algorithms on vector processors
• The effect of ordering on preconditioned conjugate gradients
• Incomplete Factorization Methods for Fully Implicit Simulation of Enhanced Oil Recovery
• Polynomial Preconditioners for Conjugate Gradient Calculations
• m-Step Preconditioned Conjugate Gradient Methods
• Analysis of the SOR Iteration for the 9-Point Laplacian
• Conjugate-gradient subroutines for the IBM 3090 Vector Facility
• The arithmetic mean preconditioner for multivector computers
• Numerical Experiments Using Dissection Methods to Solve n by n Grid Problems
• Numerical comparison of preconditionings for large sparse finite element problems

This page was built for publication: Polynomial preconditioning on vector computers