Jump to content

Category:Root-finding algorithms

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Melchoir (talk | contribs) at 10:30, 10 November 2007 (Category:Zero). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

A root-finding algorithm is a numerical method or algorithm for finding a value x such that f(x) = 0, for a given function f. Here, x is a single real number. Root-finding algorithms are studied in numerical analysis.

Subcategories

This category has the following 2 subcategories, out of 2 total.

P

Polynomial factorization algorithms (20 P)

Q

Quasi-Newton methods (8 P)

Pages in category "Root-finding algorithms"

The following 23 pages are in this category, out of 23 total. This list may not reflect recent changes.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Category:Root-finding_algorithms&oldid=170523944"