The Nearest Hermitian Inverse Eigenvalue Problem Solution with Respect to the 2-Norm
Lists
Only you see this
Abstract
Assume that the eigenvalues of a finite hermitian linear operator have been deduced accurately but the linear operator itself could not be determined with precision. Given a set of eigenvalues $λ$ and a hermitian matrix $M$, this paper will explain, with proofs, how to find a hermitian matrix $A$ with the desired eigenvalues $λ$ that is as close as possible to the given operator $M$ according to the operator 2-norm metric. Furthermore the effects of this solution are put to a test using random matrices and grayscale images which evidently show the smoothing property of eigenvalue corrections.
BibTeX
@misc{padilla2017nearest,
author = {Marcel Padilla and Benedikt Kolbe and Aniruddha Chakraborty},
title = {{The Nearest Hermitian Inverse Eigenvalue Problem Solution with Respect to the 2-Norm}},
year = {2017},
eprint = {1703.00829},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/1703.00829},
}| Generalized Matrix Nearness Problems | arXiv · 2022 |
| Perturbation Bounds for Low-Rank Inverse Approximations under Noise | NeurIPS · 2025 |
| Optimal Shrinkage of Singular Values | IEEE Trans. Information Theory · 2017 |
| Optimal Eigenvalue Approximation via Sketching | arXiv · 2023 |
| Operator Shifting for General Noisy Matrix Systems | arXiv · 2021 |
| Is there a small skew Cayley transform with zero diagonal? | Linear Algebra and its Applications · 2006 |