Unrestricted algorithm
id:
unrestricted-algorithm-269-11825306
title:
Unrestricted algorithm
text:
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 to
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Unrestricted_algorithm
date created:
date modified:
2020-03-31T11:20:15Z
main entity:
{"identifier":"Q30674308","url":"https://www.wikidata.org/entity/Q30674308"}
image:
fields total:
13
integrity:
13