SIGN IN
SIGN UP
The mathematical basis and a prototype implementation of a new polynomial rootfinder with quadratic convergence
Full Text:
PDF
Buy this Article
Authors:
T. E. Hull
Univ. of Toronto, Toronto, Ont., Canada
R. Mathon
Univ. of Toronto, Toronto, Ont., Canada
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS)
TOMS Homepage
archive
Volume 22 Issue 3, Sept. 1996
Pages 261-280
ACM
New York, NY
, USA
table of contents
doi>
10.1145/232826.232830
1996 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 12
· Downloads (cumulative): 363
· Citation Count: 2
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithm design and analysis
algorithms
convergence
design
error analysis
iterative methods
numerical algorithms
polynomial rootfinder
polynomial zerofinder
polynomials, methods for
quadratic convergence
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder