Jump to content

Category:Root-finding algorithms

From Wikipedia, the free encyclopedia

This is the current revision of this page, as edited by BrownHairedGirl (talk | contribs) at 10:21, 5 March 2017 (Cat-a-lot: Moving from Category:0 to Category:0 (number)). The present address (URL) is a permanent link to this version.

(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 only the following subcategory.

Q

Quasi-Newton methods‎ (7 P)

Pages in category "Root-finding algorithms"

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

Root-finding algorithms

A

B

C

CORDIC

D

Durand–Kerner method

F

G

Graeffe's method

H

I

J

Jenkins–Traub algorithm

L

M

N

Newton's method

P

Polynomial root-finding algorithms

R

S

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