A fast algorithm for the discrete Laplace transformation (Q1104064)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A fast algorithm for the discrete Laplace transformation
scientific article

    Statements

    A fast algorithm for the discrete Laplace transformation (English)
    0 references
    0 references
    1988
    0 references
    A fast algorithm based on approximation theory is obtained for the rapid evaluation of the discrete Laplace transformation. The algorithm is numerically stable and is supported by a number of numerical examples.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    algorithm
    0 references
    discrete Laplace transformation
    0 references
    numerical examples
    0 references
    0 references