Metraipolis › archive › dc_a62854c16ca5
Unrestricted algorithm — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Unrestricted_algorithm
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-07T23:34:17.637Z
- SHA-256 of the archived text
ed943f8ef74cf766c6ccf5e68405d570038e1108066350a331269cfab32ffd0d- Stable URL of this page
https://metraipolis.com/documento/dc_a62854c16ca5
How to cite
Unrestricted algorithm — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Unrestricted_algorithm (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_a62854c16ca5 (Metraipolis archive dc_a62854c16ca5, sha256 ed943f8ef74cf766c6ccf5e68405d570038e1108066350a331269cfab32ffd0d)
BibTeX
@misc{dca62854c16ca5,
title = {Unrestricted algorithm — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Unrestricted_algorithm},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_a62854c16ca5; sha256 ed943f8ef74cf766c6ccf5e68405d570038e1108066350a331269cfab32ffd0d},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Unrestricted_algorithm. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
An unrestricted algorithm is an algorithm for the computation of a mathematical function that puts no restrictions on the range of the argument or on the precision that may be demanded in the result. The idea of such an algorithm was put forward by C. W. Clenshaw and F. W. J. Olver in a paper published in 1980. In the problem of developing algorithms for computing, as regards the values of a real-valued function of a real variable (e.g., g[x] in "restricted" algorithms), the error that can be tolerated in the result is specified in advance. An interval on the real line would also be specified for values when the values of a function are to be evaluated. Different algorithms may have to be applied for evaluating functions outside the interval. An unrestricted algorithm envisages a situation in which a user may stipulate the value of x and also the precision required in g(x) quite arbitrarily. The algorithm should then produce an acceptable result without failure. Tema degli esploratori: matematica e informatica teorica (deposito sistematico; categoria «Numerical analysis»). Fonte: Wikipedia in inglese, voce «Unrestricted algorithm» — https://en.wikipedia.org/wiki/Unrestricted_algorithm Wikidata Q30674308 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q30674308 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Unrestricted_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 1282390521, consultata il 2026-10-07T23:13:15.326Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: b16bd4bca141e689be812d735b352527ee944ebc9b87dfe126901deb645d8267