Computational complexity of fixed points (Q2431381)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5877654
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity of fixed points |
scientific article; zbMATH DE number 5877654 |
Statements
Computational complexity of fixed points (English)
0 references
13 April 2011
0 references
The paper is a review of several fixed-point algorithms in finite dimension, mostly previously developed by the author, and their computational complexity. Some numerical experiments are summarized also.
0 references
bisection method
0 references
envelop method
0 references
contraction mapping
0 references
computational complexity
0 references
economics
0 references
game theory
0 references
fixed-point algorithms
0 references
numerical experiments
0 references
0.8818579912185669
0 references
0.8600783348083496
0 references
0.8039336204528809
0 references
