Algorithm 825: A deep-cut bisection envelope algorithm for fixed points

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Spencer Shellman University of Utah, Salt Lake City, UT
K. Sikorski University of Utah, Salt Lake City, UT
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS) TOMS Homepage archive
Volume 29 Issue 3, September 2003
Pages 309-325
ACM New York, NY, USA
table of contents doi>10.1145/838250.838255
Algorithm 825: A deep-cut bisection envelope algorithm for fixed points Published by ACM 2003 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 11
· Downloads (cumulative): 421
· Citation Count: 5


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder