A Minimum-Phase LU Factorization Preconditioner for Toeplitz Matrices
نویسندگان
چکیده
A new preconditioner is proposed for the solution of an N x N Toeplitz system TNX = b, where TN can be symmetric indefinite or nonsymmetric, by preconditioned iterative methods. The preconditioner FN is obtained based on factorizing the generating function T(z) into the product of two terms corresponding, respectively, to minimum-phase causal and anticausal systems and therefore called the minimum-phase LU (MPLU) factorization preconditioner. Due to the minimum-phase property, IIFJ1II is bounded. For rational Toeplitz TN with generating function T(z) = A(z1)/B(z1) + C(z)/D(z), where A(z), B(z), C(z) and D(z) are polynomials of orders p , q , P2 and q , we show that the eigenvalues of FJ1 TN are repeated exactly at 1 except at most cF outliers, where cF depends on Pi ,qi , P2 , q2 and the number w of the roots of T(z) = A(z1 )D(z) + B(z1 )C(z) outside the unit circle. A preconditioner IN in circulant form generalized from the symmetric case is also presented for comparison.
منابع مشابه
Computing a block incomplete LU preconditioner as the by-product of block left-looking A-biconjugation process
In this paper, we present a block version of incomplete LU preconditioner which is computed as the by-product of block A-biconjugation process. The pivot entries of this block preconditioner are one by one or two by two blocks. The L and U factors of this block preconditioner are computed separately. The block pivot selection of this preconditioner is inherited from one of the block versions of...
متن کاملTHE USE OF SEMI INHERITED LU FACTORIZATION OF MATRICES IN INTERPOLATION OF DATA
The polynomial interpolation in one dimensional space R is an important method to approximate the functions. The Lagrange and Newton methods are two well known types of interpolations. In this work, we describe the semi inherited interpolation for approximating the values of a function. In this case, the interpolation matrix has the semi inherited LU factorization.
متن کاملA Total Least Squares Methodfor Toeplitz
A Newton method to solve total least squares problems for Toeplitz systems of equations is considered. When coupled with a bisection scheme, which is based on an eecient algorithm for factoring Toeplitz matrices, global convergence can be guaranteed. Circulant and approximate factorization preconditioners are proposed to speed convergence when a conjugate gradient method is used to solve linear...
متن کاملTransformation Techniques for Toeplitz and Toeplitz-plus-hankel Matrices Part Ii. Algorithms
In the rst part 13] of the paper transformationsmappingToeplitz and Toeplitz-plus-Hankel matrices into generalizedCauchy matrices were studied. In this second part fast algorithms for LU-factorization and inversion of generalized Cauchy matrices are discussed. It is shown that the combinationof transformation pivoting techniques leads to algorithms for indeenite Toeplitz and Toeplitz-plus-Hanke...
متن کاملAsymptotic properties of the QR factorization of banded Hessenberg-Toeplitz matrices
We consider the Givens QR factorization of banded Hessenberg-Toeplitz matrices of large order and relatively small bandwidth. We investigate the asymptotic behavior of the R factor and the Givens rotation when the order of the matrix goes to infinity, and present some interesting convergence properties. These properties can lead to savings in the computation of the exact QR factorization and gi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Scientific Computing
دوره 13 شماره
صفحات -
تاریخ انتشار 1992