Complexity of fixed point computation (Q4623274)
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 7023687
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of fixed point computation |
scientific article; zbMATH DE number 7023687 |
Statements
14 February 2019
0 references
fixed points
0 references
approximation
0 references
complexity
0 references
nonexpansive mappings
0 references
0.8637454509735107
0 references
0.8600783348083496
0 references
0.8360268473625183
0 references
0.8121740221977234
0 references
