Solving a Structured Quadratic Eigenvalue Problem by a Structure-Preserving Doubling Algorithm

@article{Guo2010SolvingAS,
  title={Solving a Structured Quadratic Eigenvalue Problem by a Structure-Preserving Doubling Algorithm},
  author={Chun-Hua Guo and Wen-Wei Lin},
  journal={SIAM J. Matrix Anal. Appl.},
  year={2010},
  volume={31},
  pages={2784-2801}
}
In studying the vibration of fast trains, we encounter a palindromic quadratic eigenvalue problem (QEP) $(\lambda^{2}A^{T}+\lambda Q+A)z=0$, where $A,Q\in\mathbb{C}^{n\times n}$ and $Q^{T}=Q$. Moreover, the matrix $Q$ is block tridiagonal and block Toeplitz, and the matrix $A$ has only one nonzero block in the upper-right corner. So most of the eigenvalues of the QEP are zero or infinity. In a linearization approach, one typically starts with deflating these known eigenvalues for the sake of… 

Tables from this paper

An Improved Structure-Preserving Doubling Algorithm For a Structured Palindromic Quadratic Eigenvalue Problem

An improved version of Guo and Lin’s efficient solvent approach which solves the palindromic quadratic eigenvalue problem (PQEP) by computing the so-called stabilizing solution to the mk×mk nonlinear matrix equation X + ATX−1A = Q via the doubling algorithm.

A Fast Algorithm For Fast Train Palindromic Quadratic Eigenvalue Problems

This paper presents a solvent approach to solve a palindromic quadratic eigenvalue problem in vibration analysis of high speed trains that has eigenvalues 0 and $\infty$ each of multiplicity $(m-1)k$ just by examining $A$, but it is its remaining $2k$ eigen values that are of interest.

A new look at the doubling algorithm for a structured palindromic quadratic eigenvalue problem

Replacing Guo and Lin's key intermediate step by a modified one leads to an alternative method for the PQEP that is faster, but the improvement in speed is not as dramatic as just for solving the respective nonlinear matrix equations and levels off as m increases.

Updating $$\star $$⋆-palindromic quadratic systems with no spill-over

This paper concerns the model updating problems of the $$\star $$⋆-palindromic quadratic system $$P(\lambda )=\lambda ^2 A^{\star }+\lambda Q+A$$P(λ)=λ2A⋆+λQ+A, where $$A, Q\in {\mathbb {C}}^{n\times

Structured backward error for palindromic polynomial eigenvalue problems

The analysis reveals distinctive features of PPEP from general polynomial eigenvalue problems (PEP) investigated by Tisseur and Liu and Wang and obtained Computable formulas and bounds for the structured backward errors are obtained.

On the tripling algorithm for large-scale nonlinear matrix equations with low rank structure

On Inverse Eigenvalue Problems of Quadratic Palindromic Systems with Partially Prescribed Eigenstructure

. The palindromic inverse eigenvalue problem (PIEP) of constructing matrices A and Q of size n × n for the quadratic palindromic polynomial P ( λ ) = λ 2 A (cid:63) + λQ + A so that P ( λ ) has p

Iterative and doubling algorithms for Riccati‐type matrix equations: A comparative introduction

A family of algorithms for Lyapunov- and Riccati-type equations which are all related to each other by the idea of doubling are reviewed, and the connections between them and to other algorithms such as subspace iteration are highlighted.

References

SHOWING 1-10 OF 33 REFERENCES

Numerical Solution of a Quadratic Matrix Equation

This paper is concerned with the efficient numerical solution of the matrix equation $AX^2 + BX + C = 0$, where A, B, C and X are all square matrices. Such a matrix X is called a solvent. This

Algorithms for hyperbolic quadratic eigenvalue problems

It is shown that a relatively efficient test forhyperbolicity can be obtained by computing the eigenvalues of the QEP, and that a hyperbolic QEP is overdamped if and only if its largest eigenvalue is nonpositive.

Structured backward error for palindromic polynomial eigenvalue problems

The analysis reveals distinctive features of PPEP from general polynomial eigenvalue problems (PEP) investigated by Tisseur and Liu and Wang and obtained Computable formulas and bounds for the structured backward errors are obtained.

Numerical solution of a quadratic eigenvalue problem

Implicit QR algorithms for palindromic and even eigenvalue problems

By an extension of the implicit Q theorem, the palindromic QR algorithm is shown to be equivalent to a previously developed explicit version and the classical convergence theory for the QR algorithm can be extended to prove local quadratic convergence.

Numerical analysis of a quadratic matrix equation

The quadratic matrix equation AX2+ BX + C = 0in n x nmatrices arises in applications and is of intrinsic interest as one of the simplest nonlinear matrix equations. We give a complete

Numerical methods for palindromic eigenvalue problems: Computing the anti‐triangular Schur form

It is shown how a combination of unstructured methods followed by a structured refinement can be used to solve ill-conditioned problems with eigenvalues near the unit circle, in particular near $\pm 1$.

A new application of random matrices: Ext(C^*_{red}(F_2)) is not a group

In the process of developing the theory of free probability and free entropy, Voiculescu introduced in 1991 a random matrix model for a free semicircular system. Since then, random matrices have