Unrestricted algorithm - Revision history

Citation bot: Added bibcode. | Use this bot. Report bugs. | Suggested by Dominic3203 | Category:Theoretical computer science | #UCB_Category 115/137

2025-03-26T03:20:44Z

Added bibcode. | Use this bot. Report bugs. | Suggested by Dominic3203 | Category:Theoretical computer science | #UCB_Category 115/137

← Previous revision		Revision as of 03:20, 26 March 2025
Line 1:		Line 1:
	An '''unrestricted algorithm''' is an [[algorithm]] for the computation of a [[mathematical function]] that puts no restrictions on the range of the [[argument of a function\|argument]] or on the precision that may be demanded in the result.<ref name="Clenshaw">{{cite journal\|last1=C.W. Clenshaw and F. W. J. Olver\|title=An unrestricted algorithm for the exponential function\|journal=SIAM Journal on Numerical Analysis\|date=April 1980\|volume= 17\|issue=2\|pages=310–331\|jstor=2156615\|doi=10.1137/0717026}}</ref> The idea of such an algorithm was put forward by C. W. Clenshaw and F. W. J. Olver in a paper published in 1980.<ref name=Clenshaw/><ref name="Brent">{{cite book\|last1=Richard P Brent\|chapter=Unrestricted algorithms for elementary and special functions\|title=Information Processing \|volume=80 \|editor=S. H. Lavington \|publisher=North-Holland, Amsterdam\|date=1980\|pages=613–619\|arxiv=1004.3621}}</ref>		An '''unrestricted algorithm''' is an [[algorithm]] for the computation of a [[mathematical function]] that puts no restrictions on the range of the [[argument of a function\|argument]] or on the precision that may be demanded in the result.<ref name="Clenshaw">{{cite journal\|last1=C.W. Clenshaw and F. W. J. Olver\|title=An unrestricted algorithm for the exponential function\|journal=SIAM Journal on Numerical Analysis\|date=April 1980\|volume= 17\|issue=2\|pages=310–331\|jstor=2156615\|doi=10.1137/0717026\|bibcode=1980SJNA...17..310C }}</ref> The idea of such an algorithm was put forward by C. W. Clenshaw and F. W. J. Olver in a paper published in 1980.<ref name=Clenshaw/><ref name="Brent">{{cite book\|last1=Richard P Brent\|chapter=Unrestricted algorithms for elementary and special functions\|title=Information Processing \|volume=80 \|editor=S. H. Lavington \|publisher=North-Holland, Amsterdam\|date=1980\|pages=613–619\|arxiv=1004.3621}}</ref>

	In the problem of developing algorithms for computing, as regards the values of a [[real-valued function]] of a [[Function of a real variable\|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.<ref name = Clenshaw/>		In the problem of developing algorithms for computing, as regards the values of a [[real-valued function]] of a [[Function of a real variable\|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.<ref name = Clenshaw/>

Rjwilmsi: /* top */Added 1 doi to a journal cite

2020-03-31T11:20:15Z

top: Added 1 doi to a journal cite

← Previous revision		Revision as of 11:20, 31 March 2020
Line 1:		Line 1:
	An '''unrestricted algorithm''' is an [[algorithm]] for the computation of a [[mathematical function]] that puts no restrictions on the range of the [[argument of a function\|argument]] or on the precision that may be demanded in the result.<ref name="Clenshaw">{{cite journal\|last1=C.W. Clenshaw and F. W. J. Olver\|title=An unrestricted algorithm for the exponential function\|journal=SIAM Journal on Numerical Analysis\|date=April 1980\|volume= 17\|issue=2\|pages=310–331\|jstor=2156615}}</ref> The idea of such an algorithm was put forward by C. W. Clenshaw and F. W. J. Olver in a paper published in 1980.<ref name=Clenshaw/><ref name="Brent">{{cite book\|last1=Richard P Brent\|chapter=Unrestricted algorithms for elementary and special functions\|title=Information Processing \|volume=80 \|editor=S. H. Lavington \|publisher=North-Holland, Amsterdam\|date=1980\|pages=613–619\|arxiv=1004.3621}}</ref>		An '''unrestricted algorithm''' is an [[algorithm]] for the computation of a [[mathematical function]] that puts no restrictions on the range of the [[argument of a function\|argument]] or on the precision that may be demanded in the result.<ref name="Clenshaw">{{cite journal\|last1=C.W. Clenshaw and F. W. J. Olver\|title=An unrestricted algorithm for the exponential function\|journal=SIAM Journal on Numerical Analysis\|date=April 1980\|volume= 17\|issue=2\|pages=310–331\|jstor=2156615\|doi=10.1137/0717026}}</ref> The idea of such an algorithm was put forward by C. W. Clenshaw and F. W. J. Olver in a paper published in 1980.<ref name=Clenshaw/><ref name="Brent">{{cite book\|last1=Richard P Brent\|chapter=Unrestricted algorithms for elementary and special functions\|title=Information Processing \|volume=80 \|editor=S. H. Lavington \|publisher=North-Holland, Amsterdam\|date=1980\|pages=613–619\|arxiv=1004.3621}}</ref>

	In the problem of developing algorithms for computing, as regards the values of a [[real-valued function]] of a [[Function of a real variable\|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.<ref name = Clenshaw/>		In the problem of developing algorithms for computing, as regards the values of a [[real-valued function]] of a [[Function of a real variable\|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.<ref name = Clenshaw/>

Niceguyedc: v2.0 - Repaired 2 links to disambiguation pages - (You can help) - Argument (mathematics), Real variable

2018-12-19T14:08:26Z

v2.0 - Repaired 2 links to disambiguation pages - (You can help) - Argument (mathematics), Real variable

← Previous revision		Revision as of 14:08, 19 December 2018
Line 1:		Line 1:
	An '''unrestricted algorithm''' is an [[algorithm]] for the computation of a [[mathematical function]] that puts no restrictions on the range of the [[~~Argument~~ ~~(mathematics)~~\|argument]] or on the precision that may be demanded in the result.<ref name="Clenshaw">{{cite journal\|last1=C.W. Clenshaw and F. W. J. Olver\|title=An unrestricted algorithm for the exponential function\|journal=SIAM Journal on Numerical Analysis\|date=April 1980\|volume= 17\|issue=2\|pages=310–331\|jstor=2156615}}</ref> The idea of such an algorithm was put forward by C. W. Clenshaw and F. W. J. Olver in a paper published in 1980.<ref name=Clenshaw/><ref name="Brent">{{cite book\|last1=Richard P Brent\|chapter=Unrestricted algorithms for elementary and special functions\|title=Information Processing \|volume=80 \|editor=S. H. Lavington \|publisher=North-Holland, Amsterdam\|date=1980\|pages=613–619\|arxiv=1004.3621}}</ref>		An '''unrestricted algorithm''' is an [[algorithm]] for the computation of a [[mathematical function]] that puts no restrictions on the range of the [[argument of a function\|argument]] or on the precision that may be demanded in the result.<ref name="Clenshaw">{{cite journal\|last1=C.W. Clenshaw and F. W. J. Olver\|title=An unrestricted algorithm for the exponential function\|journal=SIAM Journal on Numerical Analysis\|date=April 1980\|volume= 17\|issue=2\|pages=310–331\|jstor=2156615}}</ref> The idea of such an algorithm was put forward by C. W. Clenshaw and F. W. J. Olver in a paper published in 1980.<ref name=Clenshaw/><ref name="Brent">{{cite book\|last1=Richard P Brent\|chapter=Unrestricted algorithms for elementary and special functions\|title=Information Processing \|volume=80 \|editor=S. H. Lavington \|publisher=North-Holland, Amsterdam\|date=1980\|pages=613–619\|arxiv=1004.3621}}</ref>

	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.<ref name = Clenshaw/>		In the problem of developing algorithms for computing, as regards the values of a [[real-valued function]] of a [[Function of a real variable\|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.<ref name = Clenshaw/>

	==References==		==References==

Veryproicelandic: added some links, removed that flag, cleaned up the syntax... removed notable flag- this is real math, real calculus... very notable...

2018-12-18T08:12:46Z

added some links, removed that flag, cleaned up the syntax... removed notable flag- this is real math, real calculus... very notable...

← Previous revision		Revision as of 08:12, 18 December 2018
Line 1:		Line 1:
		⚫	An '''unrestricted algorithm''' is an [[algorithm]] for the computation of a [[mathematical function]] that puts no restrictions on the range of the [[Argument (mathematics)\|argument]] or on the precision that may be demanded in the result.<ref name="Clenshaw">{{cite journal\|last1=C.W. Clenshaw and F. W. J. Olver\|title=An unrestricted algorithm for the exponential function\|journal=SIAM Journal on Numerical Analysis\|date=April 1980\|volume= 17\|issue=2\|pages=310–331\|jstor=2156615}}</ref> The idea of such an algorithm was put forward by C. W. Clenshaw and F. W. J. Olver in a paper published in 1980.<ref name=Clenshaw/><ref name="Brent">{{cite book\|last1=Richard P Brent\|chapter=Unrestricted algorithms for elementary and special functions\|title=Information Processing \|volume=80 \|editor=S. H. Lavington \|publisher=North-Holland, Amsterdam\|date=1980\|pages=613–619\|arxiv=1004.3621}}</ref>
	{{Multiple issues\|
	{{Underlinked\|date=June 2018}}
	{{notability\|date=May 2017}}
	}}

		⚫	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.<ref name = Clenshaw/>
⚫	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.<ref name="Clenshaw">{{cite journal\|last1=C.W. Clenshaw and F. W. J. Olver\|title=An unrestricted algorithm for the exponential function\|journal=SIAM Journal on Numerical Analysis\|date=April 1980\|volume= 17\|issue=2\|pages=310–331\|jstor=2156615}}</ref> The idea of such an algorithm was put forward by C. W. Clenshaw and F. W. J. Olver in a paper published in 1980.<ref name=Clenshaw/><ref name="Brent">{{cite book\|last1=Richard P Brent\|chapter=Unrestricted algorithms for elementary and special functions\|title=Information Processing \|volume=80 \|editor=S. H. Lavington \|publisher=North-Holland, Amsterdam\|date=1980\|pages=613–619\|arxiv=1004.3621}}</ref>

⚫	In the problem of developing algorithms for computing the values of a real-valued function of a real variable, ~~say~~ ''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 ~~where in~~ the values of function are to be evaluated. Different algorithms may have to 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.<ref name = Clenshaw/>

	==References==		==References==

CitationCleanerBot: cleanup, added underlinked tag

2018-06-26T18:21:59Z

cleanup, added underlinked tag

← Previous revision		Revision as of 18:21, 26 June 2018
Line 1:		Line 1:
			{{Multiple issues\|
			{{Underlinked\|date=June 2018}}
	{{notability\|date=May 2017}}		{{notability\|date=May 2017}}
			}}
⚫	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.<ref name="Clenshaw">{{cite journal\|last1=C.W. Clenshaw and F. W. J. Olver\|title=An unrestricted algorithm for the exponential function\|journal=SIAM Journal on Numerical Analysis\|date=April 1980\|volume=~~Vol.~~ 17\|issue=2\|pages=~~310 -- 331~~\|~~url~~=~~https://www.jstor.org/stable/~~2156615}}</ref> The idea of such an algorithm was put forward by C. W. Clenshaw and F. W. J. Olver in a paper published in 1980.<ref name=Clenshaw/><ref name="Brent">{{cite ~~journal~~\|last1=Richard P Brent\|~~title~~=Unrestricted algorithms for elementary and special functions\|~~journal~~=Information Processing 80 ~~(edited by~~ S. H. Lavington), North-Holland, Amsterdam\|date=1980\|pages=~~613 -- 619~~\|~~url~~=~~https://arxiv.org/pdf/~~1004.3621~~.pdf~~}}</ref>

		⚫	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.<ref name="Clenshaw">{{cite journal\|last1=C.W. Clenshaw and F. W. J. Olver\|title=An unrestricted algorithm for the exponential function\|journal=SIAM Journal on Numerical Analysis\|date=April 1980\|volume= 17\|issue=2\|pages=310–331\|jstor=2156615}}</ref> The idea of such an algorithm was put forward by C. W. Clenshaw and F. W. J. Olver in a paper published in 1980.<ref name=Clenshaw/><ref name="Brent">{{cite book\|last1=Richard P Brent\|chapter=Unrestricted algorithms for elementary and special functions\|title=Information Processing \|volume=80 \|editor=S. H. Lavington \|publisher=North-Holland, Amsterdam\|date=1980\|pages=613–619\|arxiv=1004.3621}}</ref>

	In the problem of developing algorithms for computing the values of a real-valued function of a real variable, say ''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 where in the values of function are to be evaluated. Different algorithms may have to 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.<ref name = Clenshaw/>		In the problem of developing algorithms for computing the values of a real-valued function of a real variable, say ''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 where in the values of function are to be evaluated. Different algorithms may have to 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.<ref name = Clenshaw/>

	==References==		==References==
	{{reflist}}		{{reflist}}

	[[Category:Numerical analysis]]		[[Category:Numerical analysis]]
	[[Category:Algorithms\|*]]		[[Category:Algorithms\|*]]

Allforrous: new key for Category:Algorithms: "*" using HotCat

2018-04-26T00:56:49Z

new key for Category:Algorithms: "*" using HotCat

← Previous revision		Revision as of 00:56, 26 April 2018
Line 6:		Line 6:
	{{reflist}}		{{reflist}}
	[[Category:Numerical analysis]]		[[Category:Numerical analysis]]
	[[Category:Algorithms\| ]]		[[Category:Algorithms\|*]]
	[[Category:Theoretical computer science]]		[[Category:Theoretical computer science]]

KolbertBot: Bot: HTTP→HTTPS (v478)

2017-12-14T08:01:44Z

Bot: HTTP→HTTPS (v478)

← Previous revision		Revision as of 08:01, 14 December 2017
Line 1:		Line 1:
	{{notability\|date=May 2017}}		{{notability\|date=May 2017}}
	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.<ref name="Clenshaw">{{cite journal\|last1=C.W. Clenshaw and F. W. J. Olver\|title=An unrestricted algorithm for the exponential function\|journal=SIAM Journal on Numerical Analysis\|date=April 1980\|volume=Vol. 17\|issue=2\|pages=310 -- 331\|url=~~http~~://www.jstor.org/stable/2156615}}</ref> The idea of such an algorithm was put forward by C. W. Clenshaw and F. W. J. Olver in a paper published in 1980.<ref name=Clenshaw/><ref name="Brent">{{cite journal\|last1=Richard P Brent\|title=Unrestricted algorithms for elementary and special functions\|journal=Information Processing 80 (edited by S. H. Lavington), North-Holland, Amsterdam\|date=1980\|pages=613 -- 619\|url=https://arxiv.org/pdf/1004.3621.pdf}}</ref>		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.<ref name="Clenshaw">{{cite journal\|last1=C.W. Clenshaw and F. W. J. Olver\|title=An unrestricted algorithm for the exponential function\|journal=SIAM Journal on Numerical Analysis\|date=April 1980\|volume=Vol. 17\|issue=2\|pages=310 -- 331\|url=https://www.jstor.org/stable/2156615}}</ref> The idea of such an algorithm was put forward by C. W. Clenshaw and F. W. J. Olver in a paper published in 1980.<ref name=Clenshaw/><ref name="Brent">{{cite journal\|last1=Richard P Brent\|title=Unrestricted algorithms for elementary and special functions\|journal=Information Processing 80 (edited by S. H. Lavington), North-Holland, Amsterdam\|date=1980\|pages=613 -- 619\|url=https://arxiv.org/pdf/1004.3621.pdf}}</ref>

	In the problem of developing algorithms for computing the values of a real-valued function of a real variable, say ''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 where in the values of function are to be evaluated. Different algorithms may have to 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.<ref name = Clenshaw/>		In the problem of developing algorithms for computing the values of a real-valued function of a real variable, say ''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 where in the values of function are to be evaluated. Different algorithms may have to 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.<ref name = Clenshaw/>

WereSpielChequers: /* top */Typo fixing, replaced: on the on the → on the using AWB

2017-05-29T08:52:57Z

top: Typo fixing, replaced: on the on the → on the using AWB

← Previous revision		Revision as of 08:52, 29 May 2017
Line 1:		Line 1:
	{{notability\|date=May 2017}}		{{notability\|date=May 2017}}
	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~~ on the precision that may be demanded in the result.<ref name="Clenshaw">{{cite journal\|last1=C.W. Clenshaw and F. W. J. Olver\|title=An unrestricted algorithm for the exponential function\|journal=SIAM Journal on Numerical Analysis\|date=April 1980\|volume=Vol. 17\|issue=2\|pages=310 -- 331\|url=http://www.jstor.org/stable/2156615}}</ref> The idea of such an algorithm was put forward by C. W. Clenshaw and F. W. J. Olver in a paper published in 1980.<ref name=Clenshaw/><ref name="Brent">{{cite journal\|last1=Richard P Brent\|title=Unrestricted algorithms for elementary and special functions\|journal=Information Processing 80 (edited by S. H. Lavington), North-Holland, Amsterdam\|date=1980\|pages=613 -- 619\|url=https://arxiv.org/pdf/1004.3621.pdf}}</ref>		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.<ref name="Clenshaw">{{cite journal\|last1=C.W. Clenshaw and F. W. J. Olver\|title=An unrestricted algorithm for the exponential function\|journal=SIAM Journal on Numerical Analysis\|date=April 1980\|volume=Vol. 17\|issue=2\|pages=310 -- 331\|url=http://www.jstor.org/stable/2156615}}</ref> The idea of such an algorithm was put forward by C. W. Clenshaw and F. W. J. Olver in a paper published in 1980.<ref name=Clenshaw/><ref name="Brent">{{cite journal\|last1=Richard P Brent\|title=Unrestricted algorithms for elementary and special functions\|journal=Information Processing 80 (edited by S. H. Lavington), North-Holland, Amsterdam\|date=1980\|pages=613 -- 619\|url=https://arxiv.org/pdf/1004.3621.pdf}}</ref>

	In the problem of developing algorithms for computing the values of a real-valued function of a real variable, say ''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 where in the values of function are to be evaluated. Different algorithms may have to 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.<ref name = Clenshaw/>		In the problem of developing algorithms for computing the values of a real-valued function of a real variable, say ''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 where in the values of function are to be evaluated. Different algorithms may have to 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.<ref name = Clenshaw/>

Michael Hardy at 18:19, 24 May 2017

2017-05-24T18:19:09Z

← Previous revision		Revision as of 18:19, 24 May 2017
Line 1:		Line 1:
	{{notability\|date=May 2017}}		{{notability\|date=May 2017}}
	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 on the precision that may be demanded in the result.<ref name="Clenshaw">{{cite journal\|last1=C.W. Clenshaw and F. W. J. Olver\|title=An unrestricted algorithm for the exponential function\|journal=SIAM Journal on Numerical Analysis\|date=April 1980\|volume=Vol. 17\|issue=2\|pages=310 -- 331\|url=http://www.jstor.org/stable/2156615}}</ref> The idea of such an algorithm was put forward by C.W. Clenshaw and F. W. J. Olver in a paper published in 1980.<ref name=Clenshaw/><ref name="Brent">{{cite journal\|last1=Richard P Brent\|title=Unrestricted algorithms for elementary and special functions\|journal=Information Processing 80 (edited by S. H. Lavington), North-Holland, Amsterdam\|date=1980\|pages=613 -- 619\|url=https://arxiv.org/pdf/1004.3621.pdf}}</ref>		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 on the precision that may be demanded in the result.<ref name="Clenshaw">{{cite journal\|last1=C.W. Clenshaw and F. W. J. Olver\|title=An unrestricted algorithm for the exponential function\|journal=SIAM Journal on Numerical Analysis\|date=April 1980\|volume=Vol. 17\|issue=2\|pages=310 -- 331\|url=http://www.jstor.org/stable/2156615}}</ref> The idea of such an algorithm was put forward by C. W. Clenshaw and F. W. J. Olver in a paper published in 1980.<ref name=Clenshaw/><ref name="Brent">{{cite journal\|last1=Richard P Brent\|title=Unrestricted algorithms for elementary and special functions\|journal=Information Processing 80 (edited by S. H. Lavington), North-Holland, Amsterdam\|date=1980\|pages=613 -- 619\|url=https://arxiv.org/pdf/1004.3621.pdf}}</ref>

	In the problem of developing algorithms for computing the values of a real-valued function of a real variable, say ''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 where in the values of function are to be evaluated. Different algorithms may have to 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.<ref name = Clenshaw/>		In the problem of developing algorithms for computing the values of a real-valued function of a real variable, say ''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 where in the values of function are to be evaluated. Different algorithms may have to 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.<ref name = Clenshaw/>

AnomieBOT: Dating maintenance tags: {{Notability}}

2017-05-24T00:04:44Z

Dating maintenance tags: {{Notability}}

← Previous revision		Revision as of 00:04, 24 May 2017
Line 1:		Line 1:
	{{notability}}		{{notability\|date=May 2017}}
	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 on the precision that may be demanded in the result.<ref name="Clenshaw">{{cite journal\|last1=C.W. Clenshaw and F. W. J. Olver\|title=An unrestricted algorithm for the exponential function\|journal=SIAM Journal on Numerical Analysis\|date=April 1980\|volume=Vol. 17\|issue=2\|pages=310 -- 331\|url=http://www.jstor.org/stable/2156615}}</ref> The idea of such an algorithm was put forward by C.W. Clenshaw and F. W. J. Olver in a paper published in 1980.<ref name=Clenshaw/><ref name="Brent">{{cite journal\|last1=Richard P Brent\|title=Unrestricted algorithms for elementary and special functions\|journal=Information Processing 80 (edited by S. H. Lavington), North-Holland, Amsterdam\|date=1980\|pages=613 -- 619\|url=https://arxiv.org/pdf/1004.3621.pdf}}</ref>		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 on the precision that may be demanded in the result.<ref name="Clenshaw">{{cite journal\|last1=C.W. Clenshaw and F. W. J. Olver\|title=An unrestricted algorithm for the exponential function\|journal=SIAM Journal on Numerical Analysis\|date=April 1980\|volume=Vol. 17\|issue=2\|pages=310 -- 331\|url=http://www.jstor.org/stable/2156615}}</ref> The idea of such an algorithm was put forward by C.W. Clenshaw and F. W. J. Olver in a paper published in 1980.<ref name=Clenshaw/><ref name="Brent">{{cite journal\|last1=Richard P Brent\|title=Unrestricted algorithms for elementary and special functions\|journal=Information Processing 80 (edited by S. H. Lavington), North-Holland, Amsterdam\|date=1980\|pages=613 -- 619\|url=https://arxiv.org/pdf/1004.3621.pdf}}</ref>