SOME FAST ALGORITHMS FOR SOLVING TRIDIAGONAL TOEPLITZ LINEAR SYSTEMS

Date:2019-07-08Clicks:10设置

Topic: SOME FAST ALGORITHMS FOR SOLVING TRIDIAGONAL TOEPLITZ LINEAR SYSTEMS

Speaker: Professor Liu Zhongyun

Event date: 7/8/2019

Event time: 16:30 pm

Venue: Lecture Hall 204, Building 9

Sponsor: School of Mathematics and Statistics, Institute of Science and Technology

Abstract: In this paper, some fast solvers for a tridiagonal Toeplitz linear system Ax = b areconsidered. We first transform the original system Ax = b into an equivalent system A^x = b^ by an elementary transformation, then partition the matrix A^into a block 2×2 form and finally develop a block LU factorization. We show that when A is subdiagonally (or superdiagonally) dominant (defined in text) our algorithms are numerically stable and outperform the conventional LUfactorization with pivoting, in terms of floating-point operations (flops), memory units, data transmission. Numerical experiments are given to illustratethe effectiveness of our algorithms.


返回原图
/