An algorithm for the inversion of a discrete convolution by the partitioning method

MaRDI QIDQ1803087zbMATH OpenFDO

Authors B. V. Titkov

Publication date 29 June 1993

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

algorithmcyclic convolutionsdiscrete convolutionfast algorithmsinversionnumerical examplespartial overlappingpartitioning methodToeplitz systems

Mathematics Subject Classification ID

Review text

A partitioning method with partial overlapping of adjacent sections for the inversion of a long discrete conduction is proposed. Each section is processed in turn by means of cyclic convolutions. The cyclic convolutions of short sections are transformed into Toeplitz systems of equations with non-singular triangular matrices. This enables to construct fast algorithms for inversion of long convolutions without using the Fourier transformation. A detailed description of this algorithm is given. Two examples of applications of this algorithm are presented. (One misprint is noted. On p. 204 in the Russian original the matrix of the triangular system for the first section contains a wrong element.).

Recommendations

• A recursive partitioning algorithm for inverting tridiagonal matrices
• ON THE CONVOLUTION INVERSE OF DISCRETE SEQUENCES
• ON THE CONVOLUTION INVERSE OF DISCRETE SEQUENCES
• A fast algorithm for the inversion of general Toeplitz matrices
• Fast inversion of triangular Toeplitz matrices

This page was built for publication: An algorithm for the inversion of a discrete convolution by the partitioning method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1803087)