W. Trench. An algorithm for the inversion of nite Toeplitz matrices. J. SIAM, 12:515-522, September 1964. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Approximate Polynomial Decomposition - Corless, Giesbrecht, Jeffrey, Watt (1999) (Correct)
....can be easily constructed using only series manipulations. T can be constructed with O(n log 2 n) operations using the series manipulation algorithms of Brent Kung [4] and an FFT for polynomial multiplication. The solution to the system can be obtained via the stable Toeplitz solvers of Trench [14] using (d 2 ) operations, or the fast and stable methods (for positive de nite matrices) 3, 12] which require O(d log 2 d) operations. In summary, each iteration requires O(n log 2 n) oating point operations. 5 NEWTON ITERATION In this section we explore the direct use of Newton s method ....
W. Trench. An algorithm for the inversion of - nite Toeplitz matrices. SIAM J. Applied Mathematics, 12:515-522, 1964.
On Prefilter Computation for Reduced-State Equalization - Gerstacker.. (2002) (2 citations) (Correct)
No context found.
W. Trench. An algorithm for the inversion of nite Toeplitz matrices. J. SIAM, 12:515-522, September 1964.
On Prefilter Computation for Reduced-State Equalization - Gerstacker.. (2002) (2 citations) (Correct)
No context found.
W. Trench. An algorithm for the inversion of nite Toeplitz matrices. J. SIAM, 12:515-522, September 1964.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC