Metraipolis › archive › dc_a085cc82a57f
Minimum polynomial extrapolation — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Minimum_polynomial_extrapolation
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-07T17:23:21.163Z
- SHA-256 of the archived text
c6a1363a369e2e7febaa25c18a35b33e852f87db9428ed2c7766a972abc81223- Stable URL of this page
https://metraipolis.com/documento/dc_a085cc82a57f
How to cite
Minimum polynomial extrapolation — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Minimum_polynomial_extrapolation (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_a085cc82a57f (Metraipolis archive dc_a085cc82a57f, sha256 c6a1363a369e2e7febaa25c18a35b33e852f87db9428ed2c7766a972abc81223)
BibTeX
@misc{dca085cc82a57f,
title = {Minimum polynomial extrapolation — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Minimum_polynomial_extrapolation},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_a085cc82a57f; sha256 c6a1363a369e2e7febaa25c18a35b33e852f87db9428ed2c7766a972abc81223},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Minimum_polynomial_extrapolation. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In mathematics, minimum polynomial extrapolation is a sequence transformation used for convergence acceleration of vector sequences, due to Cabay and Jackson. While Aitken's method is the most famous, it often fails for vector sequences. An effective method for vector sequences is the minimum polynomial extrapolation. It is usually phrased in terms of the fixed point iteration: x k + 1 = f ( x k ) . {\displaystyle x_{k+1}=f(x_{k}).} Given iterates x 1 , x 2 , . . . , x k {\displaystyle x_{1},x_{2},...,x_{k}} in R n {\displaystyle \mathbb {R} ^{n}} , one constructs the n × ( k − 1 ) {\displaystyle n\times (k-1)} matrix U = ( x 2 − x 1 , x 3 − x 2 , . . . , x k − x k − 1 ) {\displaystyle U=(x_{2}-x_{1},x_{3}-x_{2},...,x_{k}-x_{k-1})} whose columns are the k − 1 {\displaystyle k-1} differences. Then, one computes the vector c = − U + ( x k + 1 − x k ) {\displaystyle c=-U^{+}(x_{k+1}-x_{k})} where U + {\displaystyle U^{+}} denotes the Moore–Penrose pseudoinverse of U {\displaystyle U} . The number 1 is then appended to the end of c {\displaystyle c} , and the extrapolated limit is s = X c ∑ i = 1 k c i , {\displaystyle s={Xc \over \sum _{i=1}^{k}c_{i}},} where X = ( x 2 , x 3 , . . . , x k + 1 ) {\displaystyle X=(x_{2},x_{3},...,x_{k+1})} is the matrix whose columns are the k {\displaystyle k} iterates starting at 2. The following 4 line MATLAB code segment implements the MPE algorithm:
Tema degli esploratori: matematica e informatica teorica (deposito sistematico; categoria «Numerical analysis»).
Fonte: Wikipedia in inglese, voce «Minimum polynomial extrapolation» — https://en.wikipedia.org/wiki/Minimum_polynomial_extrapolation
Wikidata Q6865482 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q6865482
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Minimum_polynomial_extrapolation?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1195313597, consultata il 2026-10-07T16:54:32.468Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 301be0872d68c77b56b0cde3d60c4fc947b01e891b6196ba56c843e945c5305f