betaFeedback

WorksMathematics

Matrix Nearness Problems Revisited

Abstract

Given a nonempty set of matrices E⊆Cm×n\mathcal{E} \subseteq \mathbb{C}^{m \times n} and a matrix A∉EA \not\in\mathcal{E}, a matrix nearness problem (or matrix distance problem) consists in finding a matrix in E\mathcal{E} that is closest to AA, in some norm, as well as the corresponding distance. This article is a survey of matrix nearness problems and of numerical algorithms for their solution. We pay special attention to modern related topics, such as Riemannian optimization and pseudospectra, that were not discussed in depth in previous reviews about this topic. Besides collecting known facts, we also prove some foundational results that, at least in the present form, we could not locate in the literature.

Paper details

vlnc:W_k7bct398
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

ChatGPT 6.0, Claude Opus 4.8–5.5

View statement
Looking for related papers…