Parallel iterative refinement in polynomial eigenvalue problems

DOI10.1002/nla.2052zbMath1413.65091OpenAlexW2404492143WikidataQ112878897 ScholiaQ112878897MaRDI QIDQ2955979

Carmen Campos, Jose E. Roman

Publication date: 13 January 2017

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10251/84108

zbMATH Keywords

parallel computingiterative refinementinvariant pairspolynomial eigenvalue problems

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05)

Related Items

The nonlinear eigenvalue problem, Parallel Krylov Solvers for the Polynomial Eigenvalue Problem in SLEPc

Uses Software

• SLEPc
• PETSc
• MUMPS
• NLEVP

Cites Work

• A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
• Perturbation, extraction and refinement of invariant pairs for matrix polynomials
• A block Newton method for nonlinear eigenvalue problems
• A parallel additive Schwarz preconditioned Jacobi-Davidson algorithm for polynomial eigenvalue problems in quantum dot simulation
• Newton's Method in Floating Point Arithmetic and Iterative Refinement of Generalized Eigenvalue Problems
• The Quadratic Eigenvalue Problem
• A Krylov--Schur Algorithm for Large Eigenproblems
• Parallel Krylov Solvers for the Polynomial Eigenvalue Problem in SLEPc
• Computing matrix functions
• NLEVP
• SLEPc
• Backward Error of Polynomial Eigenproblems Solved by Linearization
• Linearization of matrix polynomials expressed in polynomial bases
• Optimal Scaling of Generalized and Polynomial Eigenvalue Problems
• Stable Solvers and Block Elimination for Bordered Systems
• Mixed block elimination for linear systems with wider borders