Category:Root-finding algorithms

From Wikipedia, the free encyclopedia
Revision as of 10:21, 5 March 2017 by imported>BrownHairedGirl (Cat-a-lot: Moving from Category:0 to Category:0 (number))
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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.

Script error: No such module "anchor".Pages in category "Root-finding algorithms"

The following 12 pages are in this category, out of 12 total.

 

A

B

C

I

M

N

R

S

Retrieved from "http://debianws.lexgopc.com/wiki143/index.php?title=Category:Root-finding_algorithms&oldid=414547"