A fast algorithm for the discrete Laplace transformation (Q1104064): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the computational power of pushdown automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4190138 / rank | |||
Normal rank | |||
Revision as of 16:39, 18 June 2024
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
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
algorithm
0 references
discrete Laplace transformation
0 references
numerical examples
0 references
