Abstract
The third author was partially financed by Portuguese Funds through FCT within the Project UID/MAT/00013/2013.
Highlights
An n × n matrix A is said to be quasi Toeplitz if it is a small rank perturbation of a Toeplitz matrix.Quasi-Toeplitz matrices arise in many mathematical and engineering investigations
Block quasi Toeplitz matrices arise in the numerical approximation of time-dependent partial differential equations (PDEs) by generalizations of implicit multistep formulas used in boundary value form, see [3] and references therein
In [9] the authors gave a fast algorithm for solving tridiagonal quasi-Toeplitz linear systems
Summary
An n × n matrix A is said to be quasi Toeplitz if it is a small rank perturbation of a Toeplitz matrix.Quasi-Toeplitz matrices arise in many mathematical and engineering investigations. Tridiagonal block quasi-Toeplitz matrix, Block LU decomposition, ShermanMorrison-Woodbury inversion. Block quasi Toeplitz matrices arise in the numerical approximation of time-dependent partial differential equations (PDEs) by generalizations of implicit multistep formulas used in boundary value form, see [3] and references therein.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
