Solving systems of linear equations with quasi-Toeplitz coefficient matrices
Zapiski Nauchnykh Seminarov POMI, Computational methods and algorithms. Part XXV, Tome 405 (2012), pp. 127-132
Citer cet article
Voir la notice du chapitre de livre provenant de la source Math-Net.Ru
A matrix $A$ is said to be quasi-Toeplitz if its entries in positions $(i,j)$, $(i-1,j)$, $(i,j-1)$, and $(i-1,j-1)$ obey a linear relation with coefficients that are independent of $i$ and $j$. It is shown that a system of linear equations with a quasi-Toeplitz $n\times n$ coefficient matrix can be solved in $O(n^2)$ arithmetic operations.
[1] G.-S. Cheon, S.-G. Hwang, S.-H. Rim, S.-Z. Song, “Matrices determined by a linear recurrence relation among entries”, Linear Algebra Appl., 373 (2003), 89–99 | DOI | MR | Zbl
[2] T. Mingshu, “Matrices associated to biindexed linear recurrence relations”, Ars. Comb., 86 (2008), 305–319 | MR | Zbl