𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Modifiable low-rank approximation to a matrix

✍ Scribed by Jesse L. Barlow; Hasan Erbay

Publisher
John Wiley and Sons
Year
2009
Tongue
English
Weight
273 KB
Volume
16
Category
Article
ISSN
1070-5325

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A minimum norm approach for low-rank app
A minimum norm approach for low-rank approximations of a matrix
✍ Achiya Dax πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 367 KB

The problems of calculating a dominant eigenvector or a dominant pair of singular vectors, arise in several large scale matrix computations. In this paper we propose a minimum norm approach for solving these problems. Given a matrix, A, the new method computes a rankone matrix that is nearest to A,

Existence of a low rank or β„‹-matrix appr
Existence of a low rank or β„‹-matrix approximant to the solution of a Sylvester equation
✍ L. Grasedyck πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 190 KB

## Abstract We consider the Sylvester equation __AX__βˆ’__XB__+__C__=0 where the matrix __C__βˆˆβ„‚^__n__Γ—__m__^ is of low rank and the spectra of __A__βˆˆβ„‚^__n__Γ—__n__^ and __B__βˆˆβ„‚^__m__Γ—__m__^ are separated by a line. We prove that the singular values of the solution X decay exponentially, that means for