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
## 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
## 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
the method of finite difference in a following paper. The results are useful in susceptibility or radiated emission tests and transmission line theory.