Abstract
This paper concerns some inverse eigenvalue problems of the quadratic $\star$-(anti)-palindromic system $Q(\lambda)=\lambda^2 A_1^{\star}+\lambda A_0 + \epsilon A_1$, where $\epsilon=\pm 1$, $A_1, A_0 \in \mathbb{C}^{n\times n}$, $A_0^{\star}=\epsilon A_0$, $A_1$ is nonsingular, and the symbol $\star$ is used as an abbreviation for transpose for real matrices and either transpose or conjugate transpose for complex matrices. By using the spectral decomposition of the quadratic $\star$-(anti)-palindromic system, the inverse eigenvalue problems with entire/partial eigenpairs given, and the model updating problems with no-spillover are considered. Some conditions on the solvabilities of these problems are given, and algorithms are proposed to find these solutions. These algorithms are illustrated by some numerical examples.
Introduction
In fields such as structural engineering, acoustics, and signal processing, the Quadratic Eigenvalue Problem (QEP) is a fundamental tool for modeling dynamic systems. A specific and mathematically rich class of QEPs is the palindromic system. These systems are characterized by a reciprocal symmetry in their spectra: if $\lambda$ is an eigenvalue, then $1/\lambda^\star$ is also an eigenvalue. Such structures appear naturally in applications like rail traffic noise analysis and the design of acoustic wave filters.
While the forward problem—computing eigenvalues from known matrices—is well-established, the Inverse Eigenvalue Problem (IEP) presents a greater challenge. The goal of an IEP is to construct the system matrices $A_1$ and $A_0$ from a prescribed set of eigenvalues and eigenvectors while ensuring the resulting system maintains its palindromic structure.
System Classification
The paper categorizes these systems into four distinct types based on the symmetry of their coefficients and the value of the parameter $\epsilon$.
These classifications—$\top$-palindromic, $\ast$-palindromic, $\top$-anti-palindromic, and $\ast$-anti-palindromic—dictate the specific constraints that the reconstructed matrices must satisfy, as shown in the equations above.
Methodology
The authors propose a unified framework based on Spectral Decomposition. The approach involves several key components:
- Standard Pairs and Parameter Matrices: The system is represented using a "standard pair" $(X, T)$, where $X$ contains the eigenvectors and $T$ contains the eigenvalues. A parameter matrix $S$ is introduced to capture the internal constraints of the palindromic structure.
- $\star$-Factorization: To handle complex symmetries (transpose vs. conjugate transpose), the authors utilize a specific matrix factorization to ensure the reconstructed matrices $A_1$ and $A_0$ maintain the required properties.
- Algorithm 1 (IEP-QP): This algorithm constructs the system matrices from $k$ prescribed eigenpairs. It is designed to work consistently regardless of whether the number of pairs $k$ is less than, equal to, or greater than the system dimension $n$.
- Algorithm 2 (MUP-QP): This addresses the Model Updating Problem (MUP). It allows for the replacement of specific "unwanted" eigenvalues with "desired" ones while ensuring that the rest of the system's spectral behavior remains unchanged—a property known as "no-spillover."
Key Insights and Results
A significant contribution of this work is the removal of the constraint that limited model updating to at most $n$ eigenvalues. The proposed methods allow for more flexible updates in complex systems. Furthermore, the authors identify conditions under which large systems can be broken down into smaller, independent subsystems through joint block diagonalization, significantly improving computational efficiency.
Numerical validation using synthetic examples demonstrates the robustness of these algorithms. The methods achieved residuals in the range of $10^{-13}$ to $10^{-15}$, indicating near-machine precision. Crucially, the algorithms successfully preserved the specific structural symmetries for all four system types.
Conclusion
This paper provides a rigorous mathematical foundation and efficient algorithms for solving inverse eigenvalue and model updating problems in quadratic palindromic systems. By leveraging spectral decomposition and $\star$-factorization, the authors offer a unified approach that maintains physical structural integrity. Future work may involve extending these results to higher-order palindromic polynomials and addressing cases where the leading coefficient matrix is singular.
Summary updated