Pages that link to "Item:Q3881819"
From MaRDI portal
The following pages link to Can Any Stationary Iteration Using Linear Information Be Globally Convergent? (Q3881819):
Displaying 4 items.
- The strength of nonstationary iteration (Q796255) (← links)
- Optimal solution of nonlinear equations (Q1086985) (← links)
- On a class of omnibus algorithms for zero-finding (Q1118978) (← links)
- Any iteration for polynomial equations using linear information has infinite complexity (Q1170011) (← links)
