A two-dimensional bisection envelope algorithm for fixed points (Q700187): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Spencer D. Shellman / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Krzysztof Sikorski / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Boris Vladimirovich Loginov / rank | |||
Normal rank | |||
Revision as of 20:22, 12 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A two-dimensional bisection envelope algorithm for fixed points |
scientific article |
Statements
A two-dimensional bisection envelope algorithm for fixed points (English)
0 references
30 September 2002
0 references
The authors suggest now algorithm for the solving of the two-dimensional fixed point problem \(f(x)=x\) with Lipschitz continuous function \(f\) with respect to the infinity norm with constant 1 and give the upper bound on the number of required function evaluations.
0 references
fixed points approximations
0 references
two-dimensional bisection envelope algorithm
0 references
fixed point problem
0 references
Lipschitz continuous function
0 references
infinity norm
0 references
