Shalhav Zohar
Abstract
The solution of a set of m linear equations with a non-Hermitian Toeplitz associated matrix is considered. Presently available fast algorithms solve this set with 4m2 “operations” (an “operation” is defined here as a set of one addition and one multiplication). An improved algorithm requiring only 3m2 “operations” is presented.
- 1 ZOHAR, SHXLHAV. Toeplitz matrix inversion: The algorithm of W. F. Trench. J. ACM 16, 4 (Oct. 1969), 592-601. Google Scholar
- 2 LEVINSON, NORMAN. The Wiener RMS error criterion in filter design and prediction. J. Math. and Phys. 25, 4 (Jan. 1947), 261-278.Google Scholar
- 3 TRENCH, WILLIAM F. Weighting coefficients for the prediction of stationary time series from the finite past. SIAM J. Appl. Math. 15, 6 (Nov. 1967), 1502-1510.Google Scholar
Index Terms
- The Solution of a Toeplitz Set of Linear Equations
Recommendations
On the HSS iteration methods for positive definite Toeplitz linear systems
We study the HSS iteration method for large sparse non-Hermitian positive definite Toeplitz linear systems, which first appears in Bai, Golub and Ng's paper published in 2003 [Z.-Z. Bai, G.H. Golub, M.K. Ng, Hermitian and skew-Hermitian splitting ...
New preconditioners for systems of linear equations with Toeplitz structure
In this paper, we consider applying the preconditioned conjugate gradient (PCG) method to solve system of linear equations $$T x = \mathbf b $$ where $$T$$ is a block Toeplitz matrix with Toeplitz blocks (BTTB). We first consider Level -2 circulant preconditioners based on ...
A Superfast Algorithm for Toeplitz Systems of Linear Equations
In this paper we develop a new superfast solver for Toeplitz systems of linear equations. To solve Toeplitz systems many people use displacement equation methods. With displacement structures, Toeplitz matrices can be transformed into Cauchy-like ...
Comments