A preconditioned MINRES method for block lower triangular Toeplitz systems (2307.07749v3)
Abstract: In this study, a novel preconditioner based on the absolute-value block $\alpha$-circulant matrix approximation is developed, specifically designed for nonsymmetric dense block lower triangular Toeplitz (BLTT) systems that emerge from the numerical discretization of evolutionary equations. Our preconditioner is constructed by taking an absolute-value of a block $\alpha$-circulant matrix approximation to the BLTT matrix. To apply our preconditioner, the original BLTT linear system is converted into a symmetric form by applying a time-reversing permutation transformation. Then, with our preconditioner, the preconditioned minimal residual method (MINRES) solver is employed to solve the symmetrized linear system. With properly chosen $\alpha$, the eigenvalues of the preconditioned matrix are proven to be clustered around $\pm1$ without any significant outliers. With the clustered spectrum, we show that the preconditioned MINRES solver for the preconditioned system has a convergence rate independent of system size. To the best of our knowledge, this is the first preconditioned MINRES method with size-independent convergence rate for the dense BLTT system. The efficacy of the proposed preconditioner is corroborated by our numerical experiments, which reveal that it attains optimal convergence.
- Calcolo 40(2), 71–90 (2003)
- OUP Oxford (2005)
- SIAM review 38(3), 427–482 (1996)
- Oxford university press (2014)
- SIAM Journal on Matrix Analysis and Applications 40(3), 1066–1086 (2019)
- Numerische mathematik 60(1), 315–339 (1991)
- Applied Numerical Mathematics 19(3), 319–341 (1995)
- Journal of Computational Physics 230(3), 586–595 (2011)
- Siam journal on matrix analysis and applications 17(3), 465–469 (1996)
- Journal of Scientific Computing 72, 957–985 (2017)
- Journal of research of the National Bureau of Standards 49(6), 409–436 (1952)
- Linear Algebra and its Applications 579, 32–50 (2019)
- Numerical Algorithms, 1–31 (2023)
- Electronic Transactions on Numerical Analysis 58, 177–195 (2023)
- Cambridge university press (2012)
- Journal of Computational Physics 303, 203–211 (2015)
- Numer. Math. Theor. Meth. Appl 11, 827–853 (2018)
- arXiv: 2306.03574 (2023)
- Journal of Computational Physics 323, 204–218 (2016)
- SIAM Journal on Scientific Computing 43(4), A2766–A2784 (2021)
- Journal of Computational Physics 434, 110221 (2021)
- Journal of computational physics 225(2), 1533–1552 (2007)
- SIAM Journal on Matrix Analysis and Applications 41(4), 1912–1943 (2020)
- Numerical Linear Algebra with Applications 22(5), 866–882 (2015)
- BIT Numerical Mathematics 59, 463–482 (2019)
- In Lecture Notes in Computational Science and Engineering, Springer International Publishing, 116, 81–91 (2017).
- SIAM Journal on Scientific Computing 40(2), A1012–A1033 (2018)
- Ng, M.K.: Iterative methods for Toeplitz systems. Numerical Mathematics and Scientific Computation. Oxford University Press, New York (2004)
- SIAM journal on numerical analysis 12(4), 617–629 (1975)
- SIAM Journal on Matrix Analysis and Applications 36(1), 273–288 (2015)
- Linear algebra and its applications 174, 215-227 (1992)
- SIAM Journal on scientific and statistical computing 7(3), 856–869 (1986)
- Van der Vorst, H.A.: Bi-cgstab: A fast and smoothly converging variant of bi-cg for the solution of nonsymmetric linear systems. SIAM Journal on scientific and Statistical Computing 13(2), 631–644 (1992)