Prescribed Eigenvalues via Optimal Perturbation of main-diagonal submatrix
By: M. R. Eslahchi, E. Kokabifar
Potential Business Impact:
Changes numbers to get specific results.
Consider a given square matrix $\textrm {K}$ with square blocks $A_{11},A_{22},\ldots,A_{nn}$ on the main diagonal. This paper aims to compute an optimal perturbation $\Delta$ of a preassigned block $A_{ii}\in\mathbb{C}^{d_i\times d_k}, \left(1\le i\le n\right)$,with respect to the spectral norm distance, such that the perturbed matrix ${\textrm {K}_X}$ has $k \le d_i$ prescribed eigenvalues. This paper presents a method for constructing the optimal perturbation by improving and extending the methodology, necessary definitions and lemmas of previous related works. Some conceivable applications of this subject are also presented. Numerical experiments are provided to illustrate the validity of the method.
Similar Papers
Matrix nearness problems and eigenvalue optimization
Numerical Analysis
Makes computer math problems easier to solve.
Invariant subspace perturbations related to defective eigenvalues of $Δ$-Hermitian and Hamiltonian matrices
Numerical Analysis
Finds hidden patterns in math problems.
Spectral Perturbation Bounds for Low-Rank Approximation with Applications to Privacy
Machine Learning (CS)
Protects private data while finding important patterns.