Nearest structured matrix having an eigenvalue with prescribed lower bounds of algebraic and geometric multiplicities
Abstract
We study the problem of perturbing a given matrix X belonging to a subspace S of linearly structured real matrices of order n to its nearest counterpart Y=X+D, where D belongs to S and Y possesses an eigenvalue with prescribed lower bounds on its algebraic multiplicity and geometric multiplicity. The proposed framework takes care of both cases where the target eigenvalue is known and where it is treated as an unknown decision variable to be determined jointly with the structured perturbation. We establish necessary and sufficient conditions for the existence of such matrices by expressing the feasibility constraints through Jordan-chain relations in structural coordinates. This allows us to formulate the problem as a nonlinear constrained nested optimization that minimizes the Frobenius norm of the perturbation. To solve this, we implemented a two-level strategy, utilizing MATLAB's fmincon for continuous inner optimization via a multi-start Sequential Quadratic Programming approach, while the outer level solves a discrete optimization problem. Comprehensive numerical experiments on various classes of structured matrices, including comparisons with existing methods, demonstrate the effectiveness and accuracy of the proposed approach.
Related
- Arbitrary Dirichlet Eigenvalue Multiplicities on Smooth Star-Shaped Euclidean Domains
- Prescribed Steklov spectra and multiplicities on surfaces
- Porteous Meets Walsh: Counting Critical Points for ℋ2-Norm Model Order Reduction Using Algebraic Geometry Behind Multiparameter Eigenvalue Problems
- A geometric lower bound for the clamped plate eigenvalue problem in low dimensions and extensions
- The algebraic and geometric classification of semi-alternative superalgebras
BibTeX
@misc{lalhriatpuia2026nearest,
title = {{Nearest structured matrix having an eigenvalue with prescribed lower bounds of algebraic and geometric multiplicities}},
author = {H. Lalhriatpuia and Tanay Saha and Punit Sharma},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.08351},
eprint = {2609.08351},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.08351},
}
RIS
TY - UNPB
TI - Nearest structured matrix having an eigenvalue with prescribed lower bounds of algebraic and geometric multiplicities
AU - H. Lalhriatpuia
AU - Tanay Saha
AU - Punit Sharma
PY - 2026
DA - 2026/09/08
PB - arXiv
DO - 10.48550/arxiv.2609.08351
UR - https://arxiv.org/abs/2609.08351
AB - We study the problem of perturbing a given matrix X belonging to a subspace S of linearly structured real matrices of order n to its nearest counterpart Y=X+D, where D belongs to S and Y possesses an eigenvalue with prescribed lower bounds on its algebraic multiplicity and geometric multiplicity. The proposed framework takes care of both cases where the target eigenvalue is known and where it is treated as an unknown decision variable to be determined jointly with the structured perturbation. We establish necessary and sufficient conditions for the existence of such matrices by expressing the feasibility constraints through Jordan-chain relations in structural coordinates. This allows us to formulate the problem as a nonlinear constrained nested optimization that minimizes the Frobenius norm of the perturbation. To solve this, we implemented a two-level strategy, utilizing MATLAB's fmincon for continuous inner optimization via a multi-start Sequential Quadratic Programming approach, while the outer level solves a discrete optimization problem. Comprehensive numerical experiments on various classes of structured matrices, including comparisons with existing methods, demonstrate the effectiveness and accuracy of the proposed approach.
ER -