The Quadratic Arnoldi Method for the Solution of the Quadratic Eigenvalue Problem
From MaRDI portal
Publication:3642843
DOI10.1137/07069273XzbMath1176.65041OpenAlexW2007487989MaRDI QIDQ3642843
Publication date: 6 November 2009
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/07069273x
numerical examplesKrylov subspace methodquadratic eigenvalue problemArnoldi methodSchur decompositionlarge sparse matricesSOAR method
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Related Items
Mixed forward-backward stability of the two-level orthogonal Arnoldi method for quadratic problems ⋮ The Infinite Arnoldi Method and an Application to Time-Delay Systems with Distributed Delays ⋮ A Padé approximate linearization algorithm for solving the quadratic eigenvalue problem with low-rank damping ⋮ Local convergence analysis of several inexact Newton-type algorithms for general nonlinear eigenvalue problems ⋮ A structured quasi-Arnoldi procedure for model order reduction of second-order systems ⋮ An integral method for solving nonlinear eigenvalue problems ⋮ A memory-efficient model order reduction for time-delay systems ⋮ A linear eigenvalue algorithm for the nonlinear eigenvalue problem ⋮ Analyzing the convergence factor of residual inverse iteration ⋮ Broyden's Method for Nonlinear Eigenproblems ⋮ On restarting the tensor infinite Arnoldi method ⋮ Restarting iterative projection methods for Hermitian nonlinear eigenvalue problems with minmax property ⋮ Restarted Q-Arnoldi-type methods exploiting symmetry in quadratic eigenvalue problems ⋮ Parallel Krylov Solvers for the Polynomial Eigenvalue Problem in SLEPc ⋮ Model Order Reduction for Time-Delay Systems, with Application to Fixed-Order $$\mathscr {H}_2$$ H 2 Optimal Controller Design ⋮ Memory-efficient Arnoldi algorithms for linearizations of matrix polynomials in Chebyshev basis ⋮ The Polynomial Eigenvalue Problem is Well Conditioned for Random Inputs ⋮ Matrix Polynomials with Completely Prescribed Eigenstructure
Uses Software
