Parallel Krylov Solvers for the Polynomial Eigenvalue Problem in SLEPc

DOI10.1137/15M1022458zbMath1352.65116OpenAlexW2539553730MaRDI QIDQ2830622

Carmen Campos, Jose E. Roman

Publication date: 28 October 2016

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/15m1022458

zbMATH Keywords

eigenvaluesnumerical experimentsparallel computingprojection methodsmatrix polynomialKrylov subspacespectral transformationSLEPccompanion linearizationnonmonomial bases

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05) Matrices over function rings in one or more variables (15A54)

Related Items

A block-symmetric linearization of odd degree matrix polynomials with optimal eigenvalue condition number and backward error ⋮ Computation of scattering resonances in absorptive and dispersive media with applications to metal-dielectric nano-structures ⋮ Mixed forward-backward stability of the two-level orthogonal Arnoldi method for quadratic problems ⋮ An Algorithm for the Complete Solution of the Quartic Eigenvalue Problem ⋮ A polynomial Jacobi-Davidson solver with support for non-monomial bases and deflation ⋮ The nonlinear eigenvalue problem ⋮ Parallel iterative refinement in polynomial eigenvalue problems ⋮ Acoustic modal analysis with heat release fluctuations using nonlinear eigensolvers ⋮ Non-linear eigenvalue problems with GetDP and SLEPc: eigenmode computations of frequency-dispersive photonic open structures ⋮ Physically agnostic quasi normal mode expansion in time dispersive structures: from mechanical vibrations to nanophotonic resonances ⋮ Refined isogeometric analysis for generalized Hermitian eigenproblems ⋮ Restarted Q-Arnoldi-type methods exploiting symmetry in quadratic eigenvalue problems ⋮ Inverse metamaterial design for controlling band gaps in scalar wave problems

Uses Software

• SLEPc
• PETSc
• MUMPS
• JDQR
• NLEVP
• JDQZ
• quadeig

Cites Work

• Unnamed Item
• A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
• Perturbation, extraction and refinement of invariant pairs for matrix polynomials
• Chebyshev interpolation for nonlinear eigenvalue problems
• A block Newton method for nonlinear eigenvalue problems
• A parallel additive Schwarz preconditioned Jacobi-Davidson algorithm for polynomial eigenvalue problems in quantum dot simulation
• Block \(\mathbf {LU}\) factors of generalized companion matrix pencils
• Backward error and condition of polynomial eigenvalue problems
• The Quadratic Eigenvalue Problem
• A Krylov--Schur Algorithm for Large Eigenproblems
• Parallel iterative refinement in polynomial eigenvalue problems
• NLEVP
• An algorithm for the complete solution of quadratic eigenvalue problems
• 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
• The Quadratic Arnoldi Method for the Solution of the Quadratic Eigenvalue Problem
• Templates for the Solution of Algebraic Eigenvalue Problems
• Normwise Scaling of Second Order Polynomial Matrices
• A Multilevel Jacobi–Davidson Method for Polynomial PDE Eigenvalue Problems Arising in Plasma Physics
• SOAR: A Second-order Arnoldi Method for the Solution of the Quadratic Eigenvalue Problem
• Vector Spaces of Linearizations for Matrix Polynomials
• Memory-efficient Arnoldi algorithms for linearizations of matrix polynomials in Chebyshev basis