Abstract
In this paper, we propose to solve the Toeplitz linear systems T n x = b by a recursive-based method. The method is based on repeatedly dividing the original problem into two subproblems that involve the solution of systems containing the Schur complement of the leading principal submatrix of the previous level. The idea is to solve the linear systems S m y = d, where S m is the Schur complement of T 2m (the principal submatrix of T n ), by using a self preconditioned iterative methods. The preconditioners, which are the approximate inverses of S m , are constructed based on famous Gohberg–Semencul formula. All occurring matrices are represented by proper generating vectors of their displacement rank characterization. We show that, for well conditioned problems, the proposed method is efficient and robust. For ill-conditioned problems, by using some iterative refinement method, the new method would be efficient and robust. Numerical experiments are presented to show the effectiveness of our new method.
Similar content being viewed by others
References
Ammar, G., Gragg, W.: Superfast solution of real positive definite Toeplitz systems. SIAM J. Matrix Anal. Appl. 9, 61–76 (1988)
Axelsson, O.: Iterative Solution Methods. Cambridge Univesity Press, Cambridge (1994)
Bitman, R., Andeson, B.: Asymptotically fast solution of Toeplitz and related systems of linear equations. Linear Algebra Appl. 34, 103–116 (1980)
Brent, R., Gustavson, F., Yun, D.: Fast solution of Toeplitz systems of equations and computation of padé approximations. J. Algorithms 1, 259–295 (1980)
Chan, R.: Ciculant preconditioners for Hermitian Toeplitz systems. SIAM J. Matrix Anal. Appl. 10, 542–550 (1989)
Chan, R., Strang, G.: Toeplitz equations by conjugate gradient with circulant preconditioner. SIAM J. Sci. Comput. 10(1), 104–119 (1989)
Chan, R., Ng, M.K.: Conjugate gradient methods for Toeplitz systems. SIAM Rev. 38, 427–482 (1996)
Chan, R., Potts, D., Steidl, G.: Preconditioners for non-Hermitian Toeplitz systems. Numer. Linear Algebra Appl. 8, 83–98 (2001)
Ching, W.: Iterative methods for queuing and manufacturing systems. In: Springer Monographs in Mathematics. Springer, London (2001)
Ching, W., Ng, M.K., Wen, Y.: Block diagonal and Schur complement preconditioners for block-Toeplitz systems with small size blocks. SIAM J. Matrix Anal. Appl. 29, 1101–1119 (2007)
De Hoog, F.: A new algorithm for solving Toeplitz systems of equations. Linear Algebra Appl. 88/89, 349–364 (1987)
Higham, N.J.: Accuracy and Stability of Numerical Algorithms, 2nd edn. SIAM, Philadelphia (2002)
Durbin, J.: The fitting of time series models. Int. Stat. Rev. 28, 233–244 (1960)
Gohberg, I., Semencul, A.: On the inversion of finite Toeplitz matrices and their continuous analyse. Mat. Issled. 2, 201–233 (1972)
Huckle, T.: Superfast solution of linear equations with low displacement rank. Manuscript SCCM-93-15. Computer Science Department, Stanford University, Stanford, CA (1993)
Huckle, T.: Computations with Gohberg–Semencul-type formulas for Toeplitz matrices. Linear Algebra Appl. 273, 169–198 (1998)
Levinson, N.: The Wiener RMS (root mean square) error criterion in filter design and prediction. J. Math. Phys. 25, 261–278 (1946)
Ng, M., Sun, H., Jin, X.: Recursive-based PCG methods for Toeplitz systems with nonnegative generating functions. SIAM J. Sci. Comput. 24, 1507–1529 (2003)
Notay, Y.: Flexible conjugate gradient. SIAM J. Sci. Comput. 22, 1444–1460 (2000)
Noutsos, D., Vassalos, P.: New band Toeplitz preconditioners for ill-conditioned symmetric positive definite Toeplitz systems. SIAM J. Matrix Anal. Appl. 23, 728–743 (2002)
Saad, Y.: A flexible inner-outer preconditioned GMRES algorithm. SIAM J. Sci. Stat. Comput. 14, 461–469 (1993)
Saad, Y.: Iterative Methods for Sparse Linear Systems. PWS Publishing Company, Boston (1996)
Serra, S.: Optimal, quasi-optimal and superlinear band Toeplitz preconditioners for asymptotically ill-conditioned positive definite Toeplitz systems. Math. Comput. 66, 651–665 (1997)
Toutounian, F., Akhoundi, N.: Displacement rank representation of Schur complement of Toeplitz matrix. Technical report (2012). Available from https://sites.google.com/site/nasserakhoundi
Trench, W.: An algorithm for the inversion of finite Toeplitz matrices. SIAM J. Appl. Math. 12, 515–522 (1964)
Wen, Y., Ching, W., Ng, M.K.: Approximate inverse-free preconditioners for Toeplitz matrices. Appl. Math. Comput. 16, 6856–6867 (2011)
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by the Center of Excellence on Modeling and Control Systems (CEMCS), Ferdowsi University of Mashhad, Iran.
Rights and permissions
About this article
Cite this article
Toutounian, F., Akhoundi, N. Recursive self preconditioning method based on Schur complement for Toeplitz matrices. Numer Algor 62, 505–525 (2013). https://doi.org/10.1007/s11075-012-9603-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11075-012-9603-9
Keywords
- Toeplitz matrices
- Gohberg–Semencul formula
- Displacement rank representation
- Recursive-based method
- Iterative methods
- Iterative improvement