Continuation of Invariant Subspaces for Parameterized Quadratic Eigenvalue Problems
From MaRDI portal
Publication:3584164
DOI10.1137/080723107zbMath1201.65050MaRDI QIDQ3584164
Publication date: 19 August 2010
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/9f4300a4d442a711f7e75b930c88043b02439af6
Newton's method; numerical examples; predictor-corrector method; sparse matrices; numerical continuation; Bartels-Stewart algorithm; quadratic eigenvalue problem; bifurcation problems
65F50: Computational methods for sparse matrices
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
Related Items
The nonlinear eigenvalue problem, Memory-efficient Arnoldi algorithms for linearizations of matrix polynomials in Chebyshev basis, Efficient and reliable hp-FEM estimates for quadratic eigenvalue problems and photonic crystal applications, Perturbation, extraction and refinement of invariant pairs for matrix polynomials, Continuation of eigenvalues and invariant pairs for parameterized nonlinear eigenvalue problems, A block Newton method for nonlinear eigenvalue problems, Möbius transformations of matrix polynomials, A contour integral approach to the computation of invariant pairs, Block Newton method and block Rayleigh quotient iteration for computing invariant subspaces of general complex matrices
Uses Software
