Creating a new two-step recursive memory method with eight-order based on Kung and Traub’s method (Q5018662): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.22199/issn.0717-6279-2020-05-0072 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.22199/ISSN.0717-6279-2020-05-0072 / rank | |||
Normal rank | |||
Latest revision as of 15:39, 30 December 2024
scientific article; zbMATH DE number 7450331
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Creating a new two-step recursive memory method with eight-order based on Kung and Traub’s method |
scientific article; zbMATH DE number 7450331 |
Statements
Creating a new two-step recursive memory method with eight-order based on Kung and Traub’s method (English)
0 references
21 December 2021
0 references
nonlinear equations
0 references
simple roots
0 references
computational order of convergence
0 references
weight function
0 references
recursive method with memory
0 references
0 references
0 references
0 references
0 references
0 references
0 references
