DIVIDE-AND-CONQUER SOLUTIONS OF LEAST-SQUARES PROBLEMS FOR MATRICES WITH DISPLACEMENT STRUCTURE
A divide-and-conquer implementation of a generalized Schur algorithm enables (exact and) least-squares solutions of various block-Toeplitz or Toeplitz-block systems of equations with O(alpha-3n log2n) operations to be obtained, where the displacement rank-alpha is a small constant (typically between two to four for scalar near-Toeplitz matrices) independent of the size of the matrices.
- Publisher
- SIAM PUBLICATIONS
- Issue Date
- 1991-01
- Language
- English
- Article Type
- Article
- Citation
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, v.12, no.1, pp.128 - 145
- ISSN
- 0895-4798
- Appears in Collection
- EE-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 17 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.