𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Using semiseparable matrices to compute the SVD of a general matrix product/quotient

✍ Scribed by Marc Van Barel; Yvette Vanberghen; Paul Van Dooren


Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
364 KB
Volume
234
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

✦ Synopsis


In this work we reduce the computation of the singular values of a general product/quotient of matrices to the computation of the singular values of an upper triangular semiseparable matrix. Compared to the reduction into a bidiagonal matrix the reduction into semiseparable form exhibits a nested subspace iteration. Hence, when there are large gaps between the singular values, these gaps manifest themselves already during the reduction algorithm in contrast to the bidiagonal case.


πŸ“œ SIMILAR VOLUMES


A method to generate a sparse matrix for
✍ Hemant Bansal; Shashank Saxena; Surendra Singh; Marsellas L. Waller; Sadasiva M. πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 123 KB

## Abstract In this work, a numerical procedure is presented to obtain a sparse moment matrix for thin‐wire electromagnetic scattering problems. The numerical procedure involves developing a set of basis functions spanning several subdomains, as opposed to spanning one or two subdomains in the conv

Cholesky decomposition with fixing nodes
✍ T. BrzobohatΓ½; Z. DostΓ‘l; T. Kozubek; P. KovΓ‘Ε™; A. Markopoulos πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 537 KB

## Abstract The direct methods for the solution of systems of linear equations with a symmetric positive‐semidefinite (SPS) matrix __A__ usually comprise the Cholesky decomposition of a nonsingular diagonal block **A**~π’₯~π’₯ of **A** and effective evaluation of the action of a generalized inverse of