Why using symbolic computation for proving the convergence of iterative methods? (Q2937247)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Why using symbolic computation for proving the convergence of iterative methods? |
scientific article; zbMATH DE number 6384768
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Why using symbolic computation for proving the convergence of iterative methods? |
scientific article; zbMATH DE number 6384768 |
Statements
8 January 2015
0 references
iterative methods
0 references
order of convergence
0 references
error of convergence
0 references
symbolic computation
0 references
Newton's method
0 references
nonlinear equations
0 references
0.9013733863830566
0 references
0.8579656481742859
0 references
0.8076202869415283
0 references
0.7740947008132935
0 references
