Problems and solutions by the application of Julia set theory to one-dot and multi-dots numerical methods (Q1607775)
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: Problems and solutions by the application of Julia set theory to one-dot and multi-dots numerical methods |
scientific article; zbMATH DE number 1780293
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Problems and solutions by the application of Julia set theory to one-dot and multi-dots numerical methods |
scientific article; zbMATH DE number 1780293 |
Statements
Problems and solutions by the application of Julia set theory to one-dot and multi-dots numerical methods (English)
0 references
13 August 2002
0 references
Summary: In 1977 Hubbard developed the ideas of Cayley (1879) and solved in particular the Newton-Fourier imaginary problem. We solve the Newton-Fourier and the Chebyshev-Fourier imaginary problems completely. It is known that the application of Julia set theory is possible to the one-dot numerical method like the Newton's method for computing solution of the nonlinear equations. The secants method is the two-dots numerical method and the application of Julia set theory to it is not demonstrated. Previously we have defined two one-dot combinations: the Newton's-secants and the Chebyshev's-secants methods and have used the escape time algorithm to analyse the application of Julia set theory to these two combinations in some special cases. We consider and solve the Newton's-secants and Tchebicheff's-secants imaginary problems completely.
0 references