Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Comparison of iterative methods for the calculation of n th roots

From MaRDI portal
Publication:3277669
Jump to:navigation, search

DOI10.1145/366199.366252zbMath0098.09203OpenAlexW2008696349MaRDI QIDQ3277669

J. F. Traub

Publication date: 1961

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/366199.366252


zbMATH Keywords

numerical analysis



Related Items (max. 100)

A note on machine method for root extraction ⋮ Recent developments in information-based complexity ⋮ High order algorithms for calculating roots ⋮ Long-time integration methods for mesoscopic models of pattern-forming systems ⋮ Infinite product expansions for matrix n-th roots




This page was built for publication: Comparison of iterative methods for the calculation of n th roots

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3277669&oldid=16480853"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 4 February 2024, at 12:17.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki