pith. sign in

arxiv: 2605.00328 · v2 · submitted 2026-05-01 · 🧮 math.NA · cs.NA

Spectral decomposition of (star, ε)-palindromic matrix polynomial and its applications

Kang Zhao , Xin Wang , Xiaoxiao Ma This is my paper

Pith reviewed 2026-05-09 19:28 UTC · model grok-4.3

classification 🧮 math.NA cs.NA
keywords palindromic matrix polynomialspectral decompositionquadratic matrix polynomialinverse eigenvalue problemeigenvalue embeddingstandard pairno spill-over
0
0 comments X

The pith

The paper establishes the spectral decomposition of (⋆, ε)-palindromic quadratic matrix polynomials using a standard pair and a parameter matrix.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper derives a spectral decomposition for quadratic matrix polynomials that satisfy a palindromic symmetry condition. The decomposition is expressed in terms of a standard pair of matrices and an additional parameter matrix Γ. When the auxiliary matrix J is taken to be block diagonal, Γ acquires a corresponding special structure. The authors then apply this decomposition to solve the inverse eigenvalue problem and the eigenvalue embedding problem while avoiding spill-over.

Core claim

Any (⋆, ε)-palindromic quadratic matrix polynomial P(λ) can be spectrally decomposed using a standard pair and a parameter matrix Γ that has a special structure when J is block diagonal.

What carries the argument

The standard pair of matrices combined with the parameter matrix Γ that respects the palindromic symmetry.

If this is right

  • The inverse eigenvalue problem for (⋆, ε)-palindromic quadratics admits an exact solution via this decomposition.
  • The eigenvalue embedding problem can be solved without spill-over to the original eigenvalues.
  • The block structure of Γ ensures that the palindromic property is preserved in the decomposition.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • This decomposition technique could extend naturally to palindromic polynomials of higher degree.
  • Applications in mechanical systems or control theory may benefit from the no-spill-over property for embedding new modes.

Load-bearing premise

The auxiliary matrix J is block diagonal, which forces the parameter matrix Γ to have its special structure.

What would settle it

A concrete (⋆, ε)-palindromic quadratic polynomial for which the constructed decomposition fails to equal the original P(λ) or violates the symmetry condition.

read the original abstract

This paper provides the spectral decomposition of $(\star,\epsilon)$-palindromic quadratic matrix polynomial $P(\lambda)$ by a standard pair and a parameter matrix. When $J$ is assumed to be a block diagonal matrix, the parameter matrix $\Gamma$ has a special structure. And then the spectral decomposition is applied to solve the inverse eigenvalue problem and the eigenvalue embedding problem with no spill-over.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript claims to derive a spectral decomposition of (⋆, ε)-palindromic quadratic matrix polynomials P(λ) expressed via a standard pair (X, T) and a parameter matrix Γ. It restricts the result to the case where the matrix J is block-diagonal (forcing Γ to have a corresponding block structure) and then applies the decomposition to the inverse eigenvalue problem and to eigenvalue embedding without spill-over.

Significance. A general, parameter-free spectral decomposition for this structured class of matrix polynomials would be a useful addition to the literature on palindromic eigenproblems and could streamline structured inverse problems. The current restriction to block-diagonal J, however, leaves open whether the claimed applications hold for the full class of (⋆, ε)-palindromic quadratics that arise in practice; if the restriction is essential and not shown to be without loss of generality, the practical impact is substantially reduced.

major comments (2)
  1. [Abstract / decomposition statement] Abstract and the setup of the decomposition: the result is explicitly conditioned on J being block-diagonal so that Γ acquires a special structure. No argument is given that every (⋆, ε)-palindromic quadratic admits such a J, nor is a counter-example or generality proof supplied. This assumption is load-bearing for the subsequent claims that the decomposition solves the inverse eigenvalue and no-spill-over embedding problems for arbitrary data.
  2. [Applications to inverse problems] Applications section: the no-spill-over embedding and inverse-eigenvalue constructions rely on the structured Γ produced by the block-diagonal J. It is not shown that the resulting pencils remain (⋆, ε)-palindromic or that the prescribed eigenvalues are recovered exactly when the input data do not already satisfy the block-diagonal hypothesis.
minor comments (2)
  1. [Introduction] Notation for the involution ⋆ and the sign ε should be defined at first use rather than assumed from the title.
  2. [Preliminaries] The manuscript would benefit from an explicit statement of the precise class of quadratics to which the decomposition applies (e.g., regular vs. singular, degree exactly 2, etc.).

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments on our manuscript. We address each major point below, clarifying the scope of our assumptions and results while preserving the focus of the work.

read point-by-point responses

  1. Referee: [Abstract / decomposition statement] Abstract and the setup of the decomposition: the result is explicitly conditioned on J being block-diagonal so that Γ acquires a special structure. No argument is given that every (⋆, ε)-palindromic quadratic admits such a J, nor is a counter-example or generality proof supplied. This assumption is load-bearing for the subsequent claims that the decomposition solves the inverse eigenvalue and no-spill-over embedding problems for arbitrary data.

    Authors: The spectral decomposition is derived under the explicit assumption that J is block-diagonal, which induces the corresponding block structure on the parameter matrix Γ. This is stated clearly in the setup and is not claimed to hold for every possible (⋆, ε)-palindromic quadratic without qualification. The manuscript develops the decomposition and its consequences precisely in this setting, which is sufficient for the inverse eigenvalue and embedding constructions presented. We do not assert that the assumption covers arbitrary data outside this class; rather, the applications demonstrate how to obtain solutions when a block-diagonal J can be chosen consistently with the given spectral data. We will revise the abstract and the opening of Section 3 to emphasize this scope more explicitly. revision: partial

  2. Referee: [Applications to inverse problems] Applications section: the no-spill-over embedding and inverse-eigenvalue constructions rely on the structured Γ produced by the block-diagonal J. It is not shown that the resulting pencils remain (⋆, ε)-palindromic or that the prescribed eigenvalues are recovered exactly when the input data do not already satisfy the block-diagonal hypothesis.

    Authors: The constructions in the applications section are carried out entirely within the block-diagonal-J framework, so the resulting matrix polynomials are (⋆, ε)-palindromic by construction: the standard pair (X, T) and the structured Γ are chosen to enforce the required symmetry. Theorems in that section prove exact recovery of the prescribed eigenvalues under these choices. When input data do not admit a block-diagonal J, the method as formulated does not apply, which is consistent with the maintained hypothesis. We will add a short clarifying paragraph at the beginning of the applications section to state this limitation explicitly and to note that the constructions guarantee the palindromic property whenever the hypothesis holds. revision: partial

Circularity Check

0 steps flagged

No significant circularity; derivation is a direct algebraic construction under explicit assumptions.

full rationale

The paper derives the spectral decomposition of (⋆,ε)-palindromic quadratic matrix polynomials P(λ) expressed via a standard pair (X,T) and parameter matrix Γ, with the structural assumption that J is block-diagonal explicitly stated so that Γ acquires a corresponding block structure. This is presented as a mathematical result in the style of standard pair theory for matrix polynomials, followed by applications to the inverse eigenvalue problem and no-spill-over embedding. No equations are shown reducing the claimed decomposition to a fitted quantity or to the target eigenvalues by construction; the block-diagonal restriction on J is an upfront hypothesis rather than a hidden ansatz that forces the result. The derivation chain therefore remains self-contained and does not collapse to its inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review; no explicit free parameters, axioms, or invented entities are visible in the provided text.

pith-pipeline@v0.9.0 · 5356 in / 1084 out tokens · 40979 ms · 2026-05-09T19:28:36.408311+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

30 extracted references · 30 canonical work pages

  1. [1]

    Mackey, N

    D. Mackey, N. Mackey, C. Mehl, V . Mehrmann, Structured polynomial eigenvalue problems: good vibrations from good linearizations, SIAM J. Matrix Anal. Appl. 28 (4) (2006) 1029–1051

    work page 2006

  2. [2]

    T. M. Huang, W. W. Lin, W. Su, Palindromic quadratization and structure-preserving algorithm for palindromic matrix polynomials of even degree, Numer. Math. 118 (2011) 713–735

    work page 2011

  3. [3]

    Adhikari, R

    B. Adhikari, R. Alam, Structured backward errors and pseudospectra of structured matrix pencils, SIAM J. Matrix Anal. Appl. 31 (2009) 331–359

    work page 2009

  4. [4]

    Hilliges, Numerische l¨ osung von quadratischen eigenwertproblemen mit anwendung in der schienendynamik, Diplomarbeit, Technical University Berlin

    A. Hilliges, Numerische l¨ osung von quadratischen eigenwertproblemen mit anwendung in der schienendynamik, Diplomarbeit, Technical University Berlin. Inst. F¨ur Mathematik, Germany (2004)

    work page 2004

  5. [5]

    Ipsen, Accurate eigenvalues for fast trains, SIAM News, 37

    I. Ipsen, Accurate eigenvalues for fast trains, SIAM News, 37. SIAM, Philadelphia, 2004

    work page 2004

  6. [6]

    Zaglmayr, Eigenvalue problems in saw-filter simulations, Diplomarbeit, Institute of Computational Mathematics, Johannes Kepler Univer- sity Linz, Austria (2002)

    S. Zaglmayr, Eigenvalue problems in saw-filter simulations, Diplomarbeit, Institute of Computational Mathematics, Johannes Kepler Univer- sity Linz, Austria (2002)

    work page 2002

  7. [7]

    N. J. Higham, F. Tisseur, V . P. M, Detecting a definite hermitian pair and a hyperbolic or elliptic quadratic eigenvalue problem and associated nearness problems, Linear Algebra Appl. 351 (2002) 455–474

    work page 2002

  8. [8]

    E. Chu, T. M. Huang, W. W. Lin, C. T. Wu, Palindromic eigenvalue problems: a brief survey, Taiwan J. Math. 14 (2010) 743–779

    work page 2010

  9. [9]

    Schr¨oder, Palindromic and even eigenvalue problems–analysis and numerical methods, Diplomarbeit, Technical University Berlin, Ger- many (2008)

    C. Schr¨oder, Palindromic and even eigenvalue problems–analysis and numerical methods, Diplomarbeit, Technical University Berlin, Ger- many (2008). 24

    work page 2008

  10. [10]

    Mackey, N

    D. Mackey, N. Mackey, C. Mehl, V . Mehrmann, Vector spaces of linearizations for matrix polynomials, SIAM J. Matrix Anal. Appl. 28 (4) (2006) 971–1004

    work page 2006

  11. [11]

    Gohberg, P

    I. Gohberg, P. Lancaster, L. Rodman, Matrix polynomials, Academic Press, Inc., New York, 1982

    work page 1982

  12. [12]

    M. T. Chu, S. F. Xu, Spectral decomposition of real symmetric quadratic λ-matrices and its applications, Math. Comp. 78 (2009) 293–313

    work page 2009

  13. [13]

    Z. Jia, M. Wei, A real-valued spectral decomposition of the undamped gyroscopic system with applications, SIAM J. Matrix Anal. Appl. 32 (2011) 584–604

    work page 2011

  14. [14]

    K. Zhao, Z. Liu, Eigenvalue embedding of damped vibroacoustic system with no-spillover, SIAM J. Matrix Anal. Appl. 44 (2023) 1189–1217

    work page 2023

  15. [15]

    K. Zhao, P. Luo, Robust partial eigenvalue assignment problem of high order control system, Mech. Syst. Signal. Pr. 239 (2025) 113323

    work page 2025

  16. [16]

    H. A. Roger, R. J. Charles, Matrix Analysis, Cambridge University Press, Cambridge, 1999

    work page 1999

  17. [17]

    Y . Cai, Y . Kuo, W. W. Lin, S. F. Xu, Solutions to a quadratic inverse eigenvalue problem, Linear Algebra Appl. 430 (2009) 1590–1606

    work page 2009

  18. [18]

    M. T. Chu, Y . C. Kuo, W. W. Lin, On inverse quadratic eigenvalue problems with partially prescribed eigenstructure, SIAM J. Matrix Anal. Appl. 25 (2004) 995–1020

    work page 2004

  19. [19]

    M. T. Chu, G. H. Golub, Inverse Eigenvalue Problems: Theory, Algorithms, and Applications, Oxford University Press, New York, 2005

    work page 2005

  20. [20]

    B. N. Datta, V . Sokolov, Quadratic inverse eigenvalue problems, active vibration control and model updating, Appl. Comput. Math. 8 (2009) 170–191

    work page 2009

  21. [21]

    Y . C. Kuo, W. W. Lin, S. F. Xu, Solutions of the partially described inverse quadratic eigenvalue problem, SIAM J. Matrix Anal. Appl. 29 (2006) 33–53

    work page 2006

  22. [22]

    Z. Bai, M. Chen, X. Yuan, Applications of the alternating direction method of multipliers to the semidefinite inverse quadratic eigenvalue problem with a partial eigenstructure, Inverse Probl. 29 (2013) 075011

    work page 2013

  23. [23]

    Batzke, C

    L. Batzke, C. Mehl, On the inverse eigenvalue problem for t-alternating and t-palindromic matrix polynomials, Linear Algebra Appl. 452 (2014) 172–191

    work page 2014

  24. [24]

    K. Zhao, L. Cheng, A. Liao, S. Li, On the inverse eigenvalue problem of quadratic palindromic systems with partially prescribed eigenstruc- ture, Taiwanese J. Math. 23 (2019) 1511–1534

    work page 2019

  25. [25]

    M. Chu, B. N. Datta, W. Lin, S. Xu, Spillover phenomenon in quadratic model updating, AIAA J. 46 (2) (2008) 420–428

    work page 2008

  26. [26]

    M. M. Chu, W. Lin, S. F. Xu, Updating quadratic models with no spillover effect on unmeasured spectral data, Inverse Problems 23 (1) (2007) 243–256

    work page 2007

  27. [27]

    D. Chu, M. T. Chu, W. W. Lin, Quadratic model updating with symmetry, positive definiteness, and no spill-over, SIAM J. Matrix Anal. Appl. 31 (2009) 546–564

    work page 2009

  28. [28]

    Ganai, B

    T. Ganai, B. Adhikari, Eigenvalue embedding problem for quadratic regular matrix polynomials with symmetry structures, Linear Algebra Appl. 640 (2022) 118–148

    work page 2022

  29. [29]

    K. Zhao, L. Z. Cheng, A. Liao, Updating ⋆-palindromic quadratic systems with no spill-over, Comput. Appl. Math. 37 (2018) 5587–5608

    work page 2018

  30. [30]

    Y . Cai, S. Xu, A new eigenvalue embedding approach for finite element model updating, Taiwanese J. Math. 14 (3) (2010) 911–932. 25

    work page 2010