Search results for "rootfinders"

Searching for rootfinders with no syntactic query expansion in all metadata.

Found 6 publication records. Showing 6 according to the selection in the facets

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
42	John P. Boyd 0001	Solving Transcendental Equations - the Chebyshev Polynomial Proxy and Other Numerical Rootfinders, Perturbation Series, and Oracles.		2014	RDF
42	John P. Boyd 0001	Finding the Zeros of a Univariate Equation: Proxy Rootfinders, Chebyshev Interpolation, and the Companion Matrix.	SIAM Rev.	2013	DBLP DOI BibTeX RDF
33	Thomas E. Hull, Rudolf Mathon	The Mathematical Basis and a Prototype Implementation of a New Polynomial Rootfinder With Quadratic Convergence.	ACM Trans. Math. Softw.	1996	DBLP DOI BibTeX RDF	polynomial rootfinder, polynomial zerofinder, quadratic convergence
31	Albert Noltemeier	Remark on algorithm 340 [C2]: roots of polynomials by a root-squaring and resultant routine.	Commun. ACM	1969	DBLP DOI BibTeX RDF	Graeffe method, resultant procedure, root-squaring operations, rootfinders, roots of polynomial equations, subresultant procedure, testing of roots, polynomial zeros, acceptance criteria
31	Terence R. F. Nonweiler	Algorithms: Algorithm 326: Roots of low-order polynomial equations.	Commun. ACM	1968	DBLP DOI BibTeX RDF	biquadratic equation roots, cubic equation roots, polynomial equation roots, quadratic equation roots, rootfinders, polynomial zeros
31	Albert Noltemeier	Algorithms: Algorithm 340: roots of polynomials by a root-squaring and resultant routine.	Commun. ACM	1968	DBLP DOI BibTeX RDF	Graeffe method, resultant procedure, root-squaring operations, rootfinders, roots of polynomial equations, subresultant procedure, testing of roots, polynomial zeros, acceptance criteria

Displaying result #1 - #6 of 6 (100 per page; Change: )

Maintained by L3S.

Previously maintained by Jörg Diederich.

Based upon DBLP by Michael Ley.

data released under the ODC-BY 1.0 license