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
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.22199/issn.0717-6279-2020-05-0072 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3090219247 / rank | |||
Normal rank | |||
Revision as of 21:30, 19 March 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
