Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
We study an iterative, locally quadratically convergent algorithm for solving Toeplitz systems of equations from [R. P. Brent, F. G. Gustavson and D. Y. Y. Yun. ''Fast solution of Toeplitz systems of equations and computation of Pade approximations'', J. Algorithms, 1:259-295, 1980]. We introduce a new iterative algorithm that is locally quadratically convergent when used to solve symmetric positive definite Toeplitz systems. We present a set of numerical experiments on randomly generated symmetric positive definite Toeplitz matrices. In these experiments, our algorithm performed significantly better than the previously proposed algorithm.
Wenzel Alban Jakob, Baptiste Alexandre Marie Philippe Claude Nicolet
Corentin Jean Dominique Fivet, Tao Sun
Daniel Kressner, Zvonimir Bujanovic