,

An Algorithm with Guaranteed Convergence for Finding a Zero of a Function

.
The Computer Journal, (1971)
DOI: 10.1093/comjnl/14.4.422

Аннотация

An algorithm is presented for finding a zero of a function which changes sign in a given interval. The algorithm combines linear interpolation and inverse quadratic interpolation with bisection. Convergence is usually superlinear, and is never much slower than for bisection. ALGOL 60 procedures are given.

тэги

Пользователи данного ресурса

  • @thorade
  • @dblp
  • @gdmcbain

Комментарии и рецензии