Georg Heinig
Abstract
Fast algorithms for the inversion of Toeplitz-plus-Hankel matrices are presented that work, in contrast to algorithms in the literature, for any nonsingular Toeplitz-plus-Hankel matrix. The design of the algorithms is based on the kernel structure properties of Toeplitz-plus-Hankel matrices.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Fast algorithms for the inversion of Toeplitz-plus-Hankel matrices are presented that work, in contrast to algorithms in the literature, for any nonsingular Toeplitz-plus-Hankel matrix. The design of the algorithms is based on the kernel structure properties of Toeplitz-plus-Hankel matrices.
Key concepts: Toeplitz matrix, Mathematics, Rank (graph theory), Inversion (geology), Hankel matrix, Pure mathematics, Algebra over a field, Combinatorics