On optimum root-finding algorithms

J Rissanen

doi:10.1016/0022-247X(71)90031-X

J. Math. Anal. Appl.

Paper

01 Jan 1971

On optimum root-finding algorithms

View publication

Abstract

It has been shown that the so-called secant method for finding roots of real-valued functions has the greatest power among all algorithms using the same amount of information and satisfying a smoothness condition. © 1971.

Paper

A remark on an algorithm for best L^p approximation

Charles Micchelli

Journal of Approximation Theory

Conference paper

Channel coding considerations for wireless LANs

Daniel J. Costello Jr., Pierre R. Chevillat, et al.

ISIT 1997

Paper

On the distance to the zero-set of a polynomial

Matthew A Grayson

Journal of Complexity

Paper

Neural network based iterative learning control for product qualities in batch processes

Zhihua Xiong, Yixin Xu, et al.

International Journal of Modelling, Identification and Control

View all publications

Abstract

Related

A remark on an algorithm for best Lp approximation

Channel coding considerations for wireless LANs

On the distance to the zero-set of a polynomial

Neural network based iterative learning control for product qualities in batch processes

A remark on an algorithm for best L^p approximation