Fast multiplication of a recursive block Toeplitz matrix by a vector and its application (Q578851)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fast multiplication of a recursive block Toeplitz matrix by a vector and its application |
scientific article; zbMATH DE number 4013872
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast multiplication of a recursive block Toeplitz matrix by a vector and its application |
scientific article; zbMATH DE number 4013872 |
Statements
Fast multiplication of a recursive block Toeplitz matrix by a vector and its application (English)
0 references
1986
0 references
To multiply an \(N\times N\) matrix by a vector costs O(N log N) operations using FFT. In this paper an algorithm for multiplying an \(N\times N\) k- level recursive block Toeplitz matrix by a vector is studied, which costs O(N log N) operations as well. As an application the spline interpolation based on reproducing kernels is considered.
0 references
fast Fourier transform
0 references
matrix vector multiplication
0 references
surface interpolation
0 references
k-level recursive block Toeplitz matrix
0 references
spline interpolation
0 references
reproducing kernels
0 references
