Efficient algorithm for solving tridiagonal quasi-Toeplitz linear systems
preprint
OA: closed
Abstract
In this paper, a fast algorithm for solving the special tridiagonal quasi-Toeplitz system is presented where the bandwidth of a quasi-Toeplitz is larger than the one of Toeplitz. Our algorithm is quite competitive with the classic LU method. Some examples demonstrate the good efficiency and stability of our algorithm.
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.
Source provenance
- europepmc
- last seen: 2026-05-19T01:45:01.086888+00:00