zbMath0476.65097MaRDI QIDQ1159974
Henri J. Nussbaumer
Publication date: 1981
Published in: Springer Series in Information Sciences (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25)
Arithmetic and combinatorial problems involving abstract finite groups (20D60)
Signal detection and filtering (aspects of stochastic processes) (60G35)
Trigonometric interpolation (42A15)
Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02)
Numerical methods for trigonometric approximation and interpolation (65T40)
Software, source code, etc. for problems pertaining to number theory (11-04)
Discrete mathematics in relation to computer science (68R99)
Software, source code, etc. for problems pertaining to numerical analysis (65-04)
Software, source code, etc. for problems pertaining to field theory (12-04)
Software, source code, etc. for problems pertaining to harmonic analysis on Euclidean spaces (42-04)
Nonlinear spectral characteristics of large deformation elasticity theory,
The explicit solutions for a class of fractional Fourier–Laplace convolution equations,
Rapid ``algebraic Fourier transforms on uniformly distributed meshes, A low-rank approach to the computation of path integrals, The twenty-fourth Fermat number is composite, A fast algorithm for expansion over spherical harmonics, Index transforms for multidimensional DFT's and convolutions, Precise multidimensional deconvolution using the polynomial algebra concept, Self-correcting polynomial programs, Precise deconvolution using the Fermat number transform, A fast numerical method for two-dimensional Riesz space fractional diffusion equations on a convex bounded region, Generalized convolution as a tool for the multi-dimensional filtering tasks, Assessing fast Fourier transform algorithms., A review and a synthesis of the fast Fourier transform algorithms for exact analysis of discrete data, On one problem of calculating a two-dimensional convolution with an exponential kernel, An algebra of arrays and almost perfect watermarks, Unnamed Item, Discretization and FIR filtering of continuous linear systems with internal and external point delays, A Novel Approach Towards Degree and Walsh-Transform of Boolean Functions, On the solvability of certain discrete equations and related estimates of discrete operators, Block decomposition structures for the fast modular implementation of two-dimensional digital filters, Zur Algebraischen Diskreten Fourier-Transformation, Algorithms for numerical evaluation of the compound Poisson distribution, Derivation and Analysis of Fast Bilinear Algorithms for Convolution, Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules, Comparing methods and defining practical requirements for extracting harmonic tidal components from groundwater level measurements, Discrete Weighted Transforms and Large-Integer Arithmetic, The partial fast Fourier transform, Combining computation and data transmission in the systems with switches, Computing Invariant Sets of Random Differential Equations Using Polynomial Chaos, New frameworks for Montgomery’s modular multiplication method, A polynomial interpolation process at quasi-Chebyshev nodes with the FFT, Generating the Laguerre expansion coefficients by solving a one-dimensional transport equation, Generalizing the discrete Fourier transform, Unnamed Item, Unnamed Item, Computer implementation of efficient discrete-convolution algorithms, Towards an Implementation of a Computer Algebra System in a Functional Language, Two new algorithms for matrix multiplication and vector convolution, ON INVERSES AND EIGENPAIRS OF PERIODIC TRIDIAGONAL TOEPLITZ MATRICES WITH PERTURBED CORNERS, Fourier reconstruction in tomography, Improved upper complexity bounds for the discrete Fourier transform, Parameter Determination for Complex Number-Theoretic Transforms Using Cyclotomic Polynomials
