Recurrence relations and fast algorithms (Q1045714)
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: Recurrence relations and fast algorithms |
scientific article; zbMATH DE number 5648449
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recurrence relations and fast algorithms |
scientific article; zbMATH DE number 5648449 |
Statements
Recurrence relations and fast algorithms (English)
0 references
15 December 2009
0 references
Faster algorithms are constructed for evaluating transforms associated with families of functions which satisfy recurrence relations. The algorithms are efficient in the sense that their computation costs are proportional to \(n\ln n\) at any fixed precision of computations, where \(n\) is the amount of input and output data.
0 references
fast algorithms
0 references
special functions
0 references
pseudospectral
0 references
transforms
0 references
recurrence relations
0 references
0 references
