From dynamic programming to fast transforms (Q1085959)
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: From dynamic programming to fast transforms |
scientific article; zbMATH DE number 3984500
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | From dynamic programming to fast transforms |
scientific article; zbMATH DE number 3984500 |
Statements
From dynamic programming to fast transforms (English)
0 references
1986
0 references
By reformulating the standard finite approach to the numerical solution of elliptic equations in two dimensions, one can use dynamic programming and fast Fourier transform to get efficient algorithms.
0 references
smoothing
0 references
dynamic programming
0 references
fast Fourier transform
0 references
