we propose a "fast" algorithm for the construction of a data-sparse inver'~ of a general Toeplitz matrix. The computational cost for inverting an N Γ N Toeplitz matrix equals the cost of four length-N FFTs plus an O(N)-term. This cost should be compared to the O(Nlog2N) cost of previously published
β¦ LIBER β¦
A new algorithm for the factorization and inversion of recursively generated matrices
β Scribed by Manuel D. Ortigueira
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 694 KB
- Volume
- 52
- Category
- Article
- ISSN
- 0165-1684
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A fast algorithm for the inversion of ge
β
P.G. Martinsson; V. Rokhlin; M. Tygert
π
Article
π
2005
π
Elsevier Science
π
English
β 590 KB
A recursive algorithm for generating the
A recursive algorithm for generating the transition matrices of multistation series production lines
β
H.T. Papadopoulos; M.E.J. O'Kelly
π
Article
π
1989
π
Elsevier Science
π
English
β 708 KB
The Fast Generalized ParkerβTraub Algori
β
I. Gohberg; V. Olshevsky
π
Article
π
1997
π
Elsevier Science
π
English
β 415 KB
A Lanczos-type algorithm for the QR fact
β
Dario Fasino; Luca Gemignani
π
Article
π
2002
π
John Wiley and Sons
π
English
β 181 KB
A unified approach for the recursive det
β
F.E. Udwadia; F.E. Kalaba
π
Article
π
1999
π
Elsevier Science
π
English
β 352 KB
A generalized algorithm for the recursiv
β
P. Agathoklis; H. Xu
π
Article
π
1990
π
Elsevier Science
π
English
β 644 KB
Polynomial jilters have many applications in real time control, estimation and identification, particularly when information about the system dynamics and noise statistics are not precisely known. In this paper, a generalized recursive algorithm for nth order polynomial jilters is developed. The par