An interval algorithm FRANGE which determines computationally rigorous bounds on the ranges of functions f : R1 → R1 [a, b] c R1 with prescribed over-estimation is described. It is assumed that f ∈ C2(D) where D c R1 is an open interval containing [a, b]. The algorithm FRANGE is based on an algorithm due to Rall and offers a choice of four selections of function, derivative and slope evaluations. Numerical results from a Fortran 90 implementation of FRANGE are presented.
Reliable Computing – Springer Journals
Published: Oct 22, 2004
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.
Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.
All the latest content is available, no embargo periods.
“Hi guys, I cannot tell you how much I love this resource. Incredible. I really believe you've hit the nail on the head with this site in regards to solving the research-purchase issue.”Daniel C.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud
“I must say, @deepdyve is a fabulous solution to the independent researcher's problem of #access to #information.”@deepthiw
“My last article couldn't be possible without the platform @deepdyve that makes journal papers cheaper.”@JoseServera