A fast algorithm for the discrete Laplace transformation

DOI10.1016/0885-064X(88)90007-6zbMATH Open0646.65094OpenAlexW1980193323MaRDI QIDQ1104064FDOQ1104064

Vladimir Rokhlin

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

Recommendations

• A Fast Laplace Transform Based on Laguerre Functions
• Improved FFT-based numerical inversion of Laplace transforms via fast Hartley transform algorithm
• scientific article
• scientific article; zbMATH DE number 766215
• Algorithms for unequally spaced fast Laplace transforms

zbMATH Keywords

numerical examplesalgorithmdiscrete Laplace transformation

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Laplace transform (44A10) Algorithms for approximation of functions (65D15) Numerical methods for integral transforms (65R10)

Cites Work

• On the computational power of pushdown automata
• Title not available (Why is that?)

Cited In (21)

• Title not available (Why is that?)
• A fast simple algorithm for computing the potential of charges on a line
• New transformations of Cauchy matrices and Trummer's problem
• Title not available (Why is that?)
• Fast algorithm for transformation of lattices
• Algorithms for unequally spaced fast Laplace transforms
• Fast Expansion into Harmonics on the Disk: A Steerable Basis with Fast Radial Convolutions
• Fast direct solvers for integral equations in complex three-dimensional domains
• Title not available (Why is that?)
• A comparative study of two globally convergent numerical methods for acoustic tomography
• Adaptive fast multipole boundary element method for three-dimensional half-space acoustic wave problems
• Title not available (Why is that?)
• Fast evaluation and interpolation at the Chebyshev sets of points
• An adaptive fast multipole boundary element method for three-dimensional acoustic wave problems based on the Burton-Miller formulation
• On Computations with Dense Structured Matrices
• Title not available (Why is that?)
• A fast direct solver for scattering problems involving elongated structures
• A new approach to fast polynomial interpolation and multipoint evaluation
• A Fast Laplace Transform Based on Laguerre Functions
• An algebraic approach to approximate evaluation of a polynomial on a set of real points
• Fast Fourier transforms of piecewise polynomials

This page was built for publication: A fast algorithm for the discrete Laplace transformation

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