Metraipolis › archive › dc_d7e395dcf330

Minimax approximation algorithm — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Minimax_approximation_algorithm
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T17:23:20.815Z
SHA-256 of the archived text
c98fc997869340a431b8126c971196237f8ae68e0b80d21068818b6cb0bd30f1
Stable URL of this page
https://metraipolis.com/documento/dc_d7e395dcf330

How to cite

Minimax approximation algorithm — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Minimax_approximation_algorithm (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_d7e395dcf330 (Metraipolis archive dc_d7e395dcf330, sha256 c98fc997869340a431b8126c971196237f8ae68e0b80d21068818b6cb0bd30f1)
BibTeX
@misc{dcd7e395dcf330,
  title = {Minimax approximation algorithm — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Minimax_approximation_algorithm},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_d7e395dcf330; sha256 c98fc997869340a431b8126c971196237f8ae68e0b80d21068818b6cb0bd30f1},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Minimax_approximation_algorithm. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

A minimax approximation algorithm (or L∞ approximation or uniform approximation) is a method to find an approximation of a mathematical function that minimizes maximum error. For example, given a function f {\displaystyle f} defined on the interval [ a , b ] {\displaystyle [a,b]} and a degree bound n {\displaystyle n} , a minimax polynomial approximation algorithm will find a polynomial p {\displaystyle p} of degree at most n {\displaystyle n} to minimize max a ≤ x ≤ b | f ( x ) − p ( x ) | . {\displaystyle \max _{a\leq x\leq b}|f(x)-p(x)|.}

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; categoria «Numerical analysis»).
Fonte: Wikipedia in inglese, voce «Minimax approximation algorithm» — https://en.wikipedia.org/wiki/Minimax_approximation_algorithm
Wikidata Q6865376 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q6865376
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Minimax_approximation_algorithm?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 1339368423, consultata il 2026-10-07T16:54:32.466Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 4b5224280a1bb8c5f6509b5f1cda1f63b2652df06ab7f14e9f0559f003f4e44d