Combining binary search and Newton's method to compute real roots for a class of real functions (Q1336478): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Vasile Berinde / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Vasile Berinde / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jcom.1994.1014 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1973917838 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:50, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combining binary search and Newton's method to compute real roots for a class of real functions |
scientific article |
Statements
Combining binary search and Newton's method to compute real roots for a class of real functions (English)
0 references
29 August 1996
0 references
The paper is devoted to the study of the computation of a hybrid algorithm and its modified variant, for a class of real functions satisfying a Smale type condition of the form \[ |\Theta^{(k)}(x)/k'\Theta'(x)|^{1/(k- 1)}\leq \alpha/x. \] Various examples and applications to illustrate these results are also given.
0 references
binary search
0 references
Newton's method
0 references
real roots
0 references
real functions
0 references
bisection method
0 references
complexity
0 references
hybrid algorithm
0 references
Smale type condition
0 references
