Approximations and expansions Definition
Optimal truncation
Builds on Asymptotic expansion
Definition
Let be an asymptotic expansion of as , and fix a value of near . Assume that the sequence , , attains a minimum, and let be the smallest index at which it does. The optimally truncated sum at is the partial sum that stops just before the smallest term. Optimal truncation is the approximation of by .
Remarks
Some authors include the smallest term, or half of it; these choices change the error only by a fraction of the smallest term. The index depends on and usually tends to infinity as .
Example: as . For the terms decrease while , the terms with and are equal, and then they increase. So , and the error of the optimally truncated sum is at most the first omitted term , since the remainder after terms is bounded by the next term.
Non-example: for a convergent series such as at the terms decrease forever, no minimum is attained, and optimal truncation is not defined; one simply sums the series.
Reading path
To understand this page from the ground up, read these 2 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Asymptotic expansion concept
- Optimal truncation definition
Further reading
About this page
| Tag | 7DMEGGFD0J |
|---|---|
| URI | m2://7DMEGGFD0J |
| Kind | definition |
| Writing | W0 stub |
| MSC | 41A60, 40A05 |
| Defines | Optimal truncation |
| Uses | Asymptotic expansion |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.