A fast algorithm for the discrete Laplace transformation
From MaRDI portal
Publication:1104064
DOI10.1016/0885-064X(88)90007-6zbMath0646.65094OpenAlexW1980193323MaRDI QIDQ1104064
Publication date: 1988
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0885-064x(88)90007-6
Computation of special functions and constants, construction of tables (65D20) Laplace transform (44A10) Numerical methods for integral transforms (65R10) Algorithms for approximation of functions (65D15)
Related Items (15)
An algebraic approach to approximate evaluation of a polynomial on a set of real points ⋮ A fast direct solver for scattering problems involving elongated structures ⋮ Fast Expansion into Harmonics on the Disk: A Steerable Basis with Fast Radial Convolutions ⋮ A fast simple algorithm for computing the potential of charges on a line ⋮ Adaptive fast multipole boundary element method for three-dimensional half-space acoustic wave problems ⋮ Fast evaluation and interpolation at the Chebyshev sets of points ⋮ A Fast Laplace Transform Based on Laguerre Functions ⋮ Algorithms for unequally spaced fast Laplace transforms ⋮ On Computations with Dense Structured Matrices ⋮ A new approach to fast polynomial interpolation and multipoint evaluation ⋮ An adaptive fast multipole boundary element method for three-dimensional acoustic wave problems based on the Burton-Miller formulation ⋮ Fast direct solvers for integral equations in complex three-dimensional domains ⋮ Fast Fourier transforms of piecewise polynomials ⋮ Unnamed Item ⋮ New transformations of Cauchy matrices and Trummer's problem
Cites Work
This page was built for publication: A fast algorithm for the discrete Laplace transformation
