Optimality in a Class of Rootfinding Algorithms

DOI10.1137/0709019MaRDI QIDQ5649371zbMATH OpenOpenAlexFDO

Authors A. C. Hindmarsh

Publication date 1972

Published in SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0709019

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Cited in

(8)

• An adaptive method of lines with error control for parabolic equations of the reaction-diffusion type
• A linear ADI method for the shallow-water equations
• A geometric interpretation of hyperbolic grid generation
• Über Matrixdarstellungen für Iterationsverfahren bei nichtlinearen Gleichungen
• A \(C^ 1\) interpolant for codes based on backward differentiation formulae
• A note on neta's family of sixth-order methods for solving equations
• Asymptotic Behavior of Vector Recurrences with Applications
• Efficient polynomial root-refiners: a survey and new record efficiency estimates

This page was built for publication: Optimality in a Class of Rootfinding Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5649371)