scientific article; zbMATH DE number 766215

MaRDI QIDQ4836653zbMATH OpenFDO

Authors Yuri M. Nechepurenko

Publication date 21 June 1995

zbMATH Keywords

stabilitynumerical experimentsVandermonde matrixCauchy matrixdiscrete Fourier sine transformfast numerically stable algorithmsfinite linear discrete transformations

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• scientific article; zbMATH DE number 4100583
• Fast and numerically stable algorithms for discrete cosine transforms
• A fast algorithm for the discrete Laplace transformation
• Fast algorithms for discrete polynomial transforms
• scientific article; zbMATH DE number 493126

Cited in

(6)

• scientific article; zbMATH DE number 4100583 (Why is no real title available?)
• A fast algorithm for the linear canonical transform
• Fast algorithm for transformation of lattices
• A fast algorithm for the discrete Laplace transformation
• A fast algorithm for linear least-squares smoothing and boundary value problems using number-theoretic transforms
• Fast Algorithms for Digital Computation of Linear Canonical Transforms

This page was built for publication:

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