Orthogonal iterations on companion-like pencils

DOI10.1007/S10915-022-01777-ZzbMATH Open1487.65040OpenAlexW4213240830MaRDI QIDQ2113645FDOQ2113645

Authors: Roberto Bevilacqua, Gianna M. Del Corso, L. Gemignani 

Publication date: 14 March 2022

Published in: Journal of Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10915-022-01777-z

Recommendations

• A fast QR algorithm for companion matrices
• Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
• A real QZ algorithm for structured companion pencils
• A refined subspace iteration algorithm for large sparse eigenproblems
• Fast parallelizable methods for computing invariant subspaces of Hermitian matrices

zbMATH Keywords

eigenvalueseigenvectorsunitary matricessubspace trackingorthogonal iterationlow rank correction

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Cites Work

• NLEVP, a collection of nonlinear eigenvalue problems
• Numerical Methods for Structured Markov Chains
• Delay equations modeling the effects of phase-specific drugs and immunotherapy on proliferating tumor cells
• Linearization of matrix polynomials expressed in polynomial bases
• Computing the zeros of analytic functions
• On a class of matrix pencils and \(\ell\)-ifications equivalent to a given matrix polynomial
• A numerical method for nonlinear eigenvalue problems using contour integrals
• Title not available (Why is that?)
• An integral method for solving nonlinear eigenvalue problems
• Algorithms for the Nonlinear Eigenvalue Problem
• Stability of discrete-time matrix polynomials
• Five-diagonal matrices and zeros of orthogonal polynomials on the unit circle
• Chebyshev interpolation for nonlinear eigenvalue problems
• Preconditioned iterative methods for a class of nonlinear eigenvalue problems
• Orthogonal matrix polynomials and applications
• Observable state space realizations for multivariable systems
• Chasing bulges or rotations? A metamorphosis of the QR-algorithm
• Fast and Backward Stable Computation of Roots of Polynomials
• A QR based approach for the nonlinear eigenvalue problem
• Optimal Scaling of Generalized and Polynomial Eigenvalue Problems
• Computational aspects of F. L. Bauer's simultaneous iteration method
• The nonlinear eigenvalue problem
• Bifurcation Analysis of Periodic Solutions of Neural Functional Differential Equations: A Case Study
• Core-Chasing Algorithms for the Eigenvalue Problem
• Fast and backward stable computation of eigenvalues and eigenvectors of matrix polynomials
• An explicit formula for the splitting of multiple eigenvalues for nonlinear eigenvalue problems and connections with the linearization for the delay eigenvalue problem
• Block power method for computing solvent and spectral factors of matrix polynomials
• Stabilisation of matrix polynomials
• NLEIGS: A Class of Fully Rational Krylov Methods for Nonlinear Eigenvalue Problems
• Computing several eigenvalues of nonlinear eigenvalue problems by selection
• An improved subspace iteration method with shifting
• Fast QR iterations for unitary plus low rank matrices
• Improving backward stability of Sakurai-Sugiura method with balancing technique in polynomial eigenvalue problem.
• Efficient reduction of compressed unitary plus low rank matrices to Hessenberg form

Cited In (1)

• Low-rank matrix iteration using polynomial-filtered subspace extraction

Uses Software

• NLEVP
• NLEIGS

This page was built for publication: Orthogonal iterations on companion-like pencils

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