Pith. sign in

REVIEW 1 cited by

Numerical methods for computing the discrete and continuous Laplace transforms

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2304.13204 v1 pith:IPNW2KOD submitted 2023-04-26 math.NA cs.NAmath-phmath.CVmath.MP

classification math.NAcs.NAmath-phmath.CVmath.MP
keywords laplacediscretetransformfunctionsanalyticdatatransformsinverse
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We propose a numerical method to spline-interpolate discrete signals and then apply the integral transforms to the corresponding analytical spline functions. This represents a robust and computationally efficient technique for estimating the Laplace transform for noisy data. We revisited a Meijer-G symbolic approach to compute the Laplace transform and alternative approaches to extend canonical observed time-series. A discrete quantization scheme provides the foundation for rapid and reliable estimation of the inverse Laplace transform. We derive theoretic estimates for the inverse Laplace transform of analytic functions and demonstrate empirical results validating the algorithmic performance using observed and simulated data. We also introduce a generalization of the Laplace transform in higher dimensional space-time. We tested the discrete LT algorithm on data sampled from analytic functions with known exact Laplace transforms. The validation of the discrete ILT involves using complex functions with known analytic ILTs.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Theory and Fast Learned Solver for $\ell^1$-TV Regularization

    math.NA 2024-12 conditional novelty 5.0 of 10

    A sample-complexity bound for l1-TV compressed sensing is derived, and an unrolled proximal-gradient solver (LPGM-ISTA) recovers ECG signals with better accuracy and speed than standard iterative methods.

Pith tools