Linked from

The 10 pages that link to Root-finding algorithm, each with the reason it gives.

• Newton's methodNarrower topic: Newton's method is one member of this broad class of numerical algorithms.

• Algebraic numberRelated: Algebraic numbers are often represented by defining polynomials together with isolating approximations.

• Fixed pointRelated: An equation f(x)=0 can be rewritten as a fixed-point equation g(x)=x.

• Intermediate value theoremNarrower topic: Methods such as bisection use the theorem to justify that a root exists in a bracket.

• Polynomial rootNarrower topic: Polynomial roots are the targets of both exact and numerical root-finding.

• Fixed-point iterationNarrower topic: Solving f(x)=0 can be recast as finding a fixed point of a suitable map.

• Secant methodNarrower topic: The secant method is one member of this algorithm family.

• Qin JiushaoNarrower topic: Qin’s polynomial techniques are early systematic root-finding algorithms.

• Bolzano's theoremNarrower topic: Bolzano's theorem certifies that a bracketed root-finding problem has a solution.

• Seki TakakazuRelated: Seki’s mathematical practice included computational techniques for obtaining equation roots.