✦ LIBER ✦

Low-rank incremental methods for computing dominant singular subspaces

✍ Scribed by C.G. Baker; K.A. Gallivan; P. Van Dooren

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lanczos, Householder transformations, an

Lanczos, Householder transformations, and implicit deflation for fast and reliable dominant singular subspace computation

✍ Ricardo D. Fierro 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 183 KB

## Abstract Many applications, such as subspace‐based models in information retrieval and signal processing, require the computation of singular subspaces associated with the __k__ dominant, or largest, singular values of an __m__×__n__ data matrix __A__, where __k__≪min(__m__,__n__). Frequently, _

A simple, low-computation peak detection

A simple, low-computation peak detection algorithm for the angle-of-arrival spectrum for signal subspace methods

✍ Judd, M.D. 📂 Article 📅 1992 🏛 IEEE 🌐 English ⚖ 456 KB

A Method with Low Computing Cost to Appr

A Method with Low Computing Cost to Approximate Increments of Determinants Needed for Derivative-Free Restricted Maximum Likelihood

✍ M. Rico; L.A. García-Cortés 📂 Article 📅 1995 🏛 American Dairy Science Association 🌐 English ⚖ 522 KB

An improved non-linear method for the co

An improved non-linear method for the computation of a structured low rank approximation of the Sylvester resultant matrix

✍ Joab R. Winkler; Madina Hasan 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 467 KB