A fast algorithm for the discrete Laplace transformation (Q1104064): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0885-064x(88)90007-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1980193323 / rank | |||
Normal rank | |||
Latest revision as of 11:33, 30 July 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
