𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A generalization of the Levinson algorithm for Hermitian Toeplitz matrices with any rank profile

✍ Scribed by Delsarte, P.; Genin, Y.; Kamp, Y.

Book ID
117906276
Publisher
IEEE
Year
1985
Weight
888 KB
Volume
33
Category
Article
ISSN
0096-3518

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A fast algorithm for the inversion of ge
A fast algorithm for the inversion of general Toeplitz matrices
✍ P.G. Martinsson; V. Rokhlin; M. Tygert πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 590 KB

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

Direct exponential curve resolution algo
Direct exponential curve resolution algorithm (DECRA): A novel application of the generalized rank annihilation method for a single spectral mixture data set with exponentially decaying contribution profiles
✍ Willem Windig; Brian Antalek πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 791 KB

The generalized rank annihilation method (GRAM) is a powerful method for calibration and self-modeling curve resolution. The mathematical treatment requires two data sets, which implies two experiments. The required relation between the two data sets is strict and minor differences, such as in reten