A fast algorithm for the discrete Laplace transformation (Q1104064)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1104064 |
scientific article; zbMATH DE number 4054981
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast algorithm for the discrete Laplace transformation |
scientific article; zbMATH DE number 4054981 |
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
0.8614718914031982
0 references
0.8551492691040039
0 references
0.780890941619873
0 references
