Eigensolution sensitivity revisited

Abstract An explicit formulation is developed for the sensitivity of eigensolutions associated with matrix-valued operator pencils depending nonlinearly on a scalar parameter. The eigenproblem is expressed as a nonlinear algebraic system for the eigenvalue and eigenvector, including a normalization constraint. Differentiation of this system yields the sensitivity equations. Regularization of the augmented system followed by symbolic inversion and limiting yields compact, closed-form expressions for the derivatives, applicable also in the presence of algebraic multiplicity. The interpretation of the sensitivity problem relies on an inversion formula for the sum of singular complex matrices, extended through decomposition-based constructions to ensure numerical robustness. Applications to structural dynamics, rigid-body degeneracies, time-delay systems, and continuum eigenproblems illustrate the method’s capability to handle ill-conditioning near eigenvalue coalescence and to provide stable sensitivity estimates for both self-adjoint and non-self-adjoint operators.

Authors

Institutions

Publication Details

Journal
Meccanica
Published
2026-10-16
DOI
https://doi.org/10.1007/s11012-026-02190-8
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Eigensolution sensitivity revisited

Pierangelo Masarati
Meccanica
Matrix Theory and Algorithms
article

Eigensolution sensitivity revisited

Pierangelo Masarati
article en

Abstract

Abstract An explicit formulation is developed for the sensitivity of eigensolutions associated with matrix-valued operator pencils depending nonlinearly on a scalar parameter. The eigenproblem is expressed as a nonlinear algebraic system for the eigenvalue and eigenvector, including a normalization constraint. Differentiation of this system yields the sensitivity equations. Regularization of the augmented system followed by symbolic inversion and limiting yields compact, closed-form expressions for the derivatives, applicable also in the presence of algebraic multiplicity. The interpretation of the sensitivity problem relies on an inversion formula for the sum of singular complex matrices, extended through decomposition-based constructions to ensure numerical robustness. Applications to structural dynamics, rigid-body degeneracies, time-delay systems, and continuum eigenproblems illustrate the method’s capability to handle ill-conditioning near eigenvalue coalescence and to provide stable sensitivity estimates for both self-adjoint and non-self-adjoint operators.

MeccanicaVol. 61(6)
Politecnico di Milano (IT)
Openalex Percentile: Top 14%
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.