An algorithm requiring <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0(n log n)</tex> operations is proposed for the inversion of triangular Toeplitz matrices. This algorithm is faster than existing techniques, even for relatively small values of <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</tex> , and can easily be written in Fortran.
No takes yet. Share an insight, caveat, or question.
Commenges et al. (1984) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: