✦ LIBER ✦

Dynamical Low‐Rank Approximation

✍ Scribed by Koch, Othmar; Lubich, Christian

Book ID: 118215344
Publisher: Society for Industrial and Applied Mathematics
Year: 2007
Tongue: English
Weight: 824 KB
Volume: 29
Category: Article
ISSN: 0895-4798
DOI: 10.1137/050639703

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dynamical low-rank approximation: applic

Dynamical low-rank approximation: applications and numerical experiments

✍ Achim Nonnenmacher; Christian Lubich 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 729 KB

Structured weighted low rank approximati

Structured weighted low rank approximation

✍ M. Schuermans; P. Lemmerling; S. Van Huffel 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 106 KB

Real-Valued, Low Rank, Circulant Approxi

Real-Valued, Low Rank, Circulant Approximation

✍ Chu, Moody T.; Plemmons, Robert J. 📂 Article 📅 2003 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 170 KB

Grassmann algorithms for low rank approx

Grassmann algorithms for low rank approximation of

✍ Lennart Simonsson; Lars Eldén 📂 Article 📅 2010 🏛 Springer Netherlands 🌐 English ⚖ 548 KB

Adaptive Low-Rank Approximation of Collo

Adaptive Low-Rank Approximation of Collocation Matrices

✍ M. Bebendorf; S. Rjasanow 📂 Article 📅 2003 🏛 Springer Vienna 🌐 English ⚖ 535 KB

Structured low-rank approximation and it

Structured low-rank approximation and its applications

✍ Ivan Markovsky 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 364 KB

Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equivalent to the existence of a linear time-invariant system that fits the data and the rank constraint is related to a bound o