An algorithm for the inversion of a discrete convolution by the partitioning method (Q1803087)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 220228
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for the inversion of a discrete convolution by the partitioning method |
scientific article; zbMATH DE number 220228 |
Statements
An algorithm for the inversion of a discrete convolution by the partitioning method (English)
0 references
29 June 1993
0 references
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.).
0 references
discrete convolution
0 references
numerical examples
0 references
partitioning method
0 references
partial overlapping
0 references
cyclic convolutions
0 references
Toeplitz systems
0 references
fast algorithms
0 references
inversion
0 references
algorithm
0 references
0.7545505166053772
0 references
0.7476052641868591
0 references
0.7476052641868591
0 references
0.7460073232650757
0 references
0.7451996207237244
0 references
