✦ LIBER ✦

On generalized matrix approximation problem in the spectral norm

✍ Scribed by Kin Cheong Sou; Anders Rantzer

Book ID: 113772145
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 307 KB
Volume: 436
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2011.10.009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum Rank Solutions to the Matrix App

Minimum Rank Solutions to the Matrix Approximation Problems in the Spectral Norm

✍ Wei, Musheng; Shen, Dongmei 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 239 KB

On the best approximation matrix problem

On the best approximation matrix problem for integrable matrix functions

✍ Defez Emilio; Jódar Lucas 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 656 KB

On the best approximation matrix problem

On the best approximation matrix problem and matrix Fourier series

✍ L. Jódar; E. Navarro; E. Defez 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 434 KB

Rate of convergence estimates for the sp

Rate of convergence estimates for the spectral approximation of a generalized eigenvalue problem

✍ Carlos Conca; Mario Durán; Jacques Rappaz 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 225 KB

On Best Approximations of Polynomials in

On Best Approximations of Polynomials in Matrices in the Matrix 2-Norm

✍ Liesen, Jörg; Tichý, Petr 📂 Article 📅 2009 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 193 KB

On the accuracy of the ellipsoid norm ap

On the accuracy of the ellipsoid norm approximation of the joint spectral radius

✍ Vincent D. Blondel; Yurii Nesterov; Jacques Theys 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 260 KB

The joint spectral radius of a set of matrices is a measure of the maximal asymptotic growth rate that can be obtained by forming long products of matrices taken from the set. This quantity appears in a number of application contexts but is notoriously difficult to compute and to approximate. We int