A Class of Optimal-Order Zero-Finding Methods Using Derivative Evaluations

Abstract

It is often necessary to find an approximation to a simple zero zeta of a function f , using evaluations of f and f' . In this paper the author considers some methods which are efficient if f' is easier to evaluate than f . Examples of such functions are given.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1975
Accession Number
ADA014058

Entities

People

  • Richard P. Brent

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Computational Complexity
  • Computations
  • Computer Science
  • Computers
  • Convergence
  • Differential Equations
  • Distribution Functions
  • Equations
  • Iterations
  • Military Research
  • New York
  • Nonlinear Algebraic Equations
  • Normal Distribution
  • Polynomials
  • Runge Kutta Method
  • Test And Evaluation

Fields of Study

  • Mathematics

Readers

  • Calculus or Mathematical Analysis
  • Computer Programming and Software Development.