Parallel iterative refinement in polynomial eigenvalue problems.

DOI10.1002/NLA.2052MaRDI QIDQ2955979zbMATH OpenOpenAlexWikidataFDO

Authors Carmen Campos, J. 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

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

Recommendations

• Parallel Krylov solvers for the polynomial eigenvalue problem in SLEPc
• A parallel refined Davidson method for solving the large scale eigen problem
• Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems
• A polynomial Jacobi-Davidson solver with support for non-monomial bases and deflation
• Is the iterative refinement of eigenelements an expensive technique

Cites work

• A Krylov--Schur algorithm for large eigenproblems
• A block Newton method for nonlinear eigenvalue problems
• A fully asynchronous multifrontal solver using distributed dynamic scheduling
• A parallel additive Schwarz preconditioned Jacobi-Davidson algorithm for polynomial eigenvalue problems in quantum dot simulation
• Backward Error of Polynomial Eigenproblems Solved by Linearization
• Computing matrix functions
• Linearization of matrix polynomials expressed in polynomial bases
• Mixed block elimination for linear systems with wider borders
• NLEVP, a collection of nonlinear eigenvalue problems
• Newton's method in floating point arithmetic and iterative refinement of generalized eigenvalue problems
• Optimal Scaling of Generalized and Polynomial Eigenvalue Problems
• Parallel Krylov solvers for the polynomial eigenvalue problem in SLEPc
• Perturbation, extraction and refinement of invariant pairs for matrix polynomials
• SLEPc
• Stable Solvers and Block Elimination for Bordered Systems
• The quadratic eigenvalue problem

Cited in

(3)

• The nonlinear eigenvalue problem
• Parallel Krylov solvers for the polynomial eigenvalue problem in SLEPc
• Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems

Describes a project that uses

Uses Software

• NLEVP
• MUMPS
• PETSc
• SLEPc

This page was built for publication: Parallel iterative refinement in polynomial eigenvalue problems.

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