Am improved form of the Krawczyk-Moore algorithm (Q1069673): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 00:13, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Am improved form of the Krawczyk-Moore algorithm |
scientific article |
Statements
Am improved form of the Krawczyk-Moore algorithm (English)
0 references
1985
0 references
In a previous paper [SIAM J. Numer. Anal. 17, 376-379 (1980; Zbl 0444.65029)] the second author has described a modification of earlier methods in which the modification consists of reusing the value of an interval extension of the Jacobian of f and of the inverse of its center a fixed number p of times. It is shown that if in this modification the Krawczyk operator is replaced by the symmetric operator then an algorithm is obtained which is supported by a computationally effective existence, uniqueness and convergence theory. Numerical results which illustrate the effectiveness are also given.
0 references
Krawczyk-Moore algorithm
0 references
Hansen operator
0 references
interval extension
0 references
Krawczyk operator
0 references
symmetric operator
0 references
existence
0 references
uniqueness
0 references
convergence
0 references
Numerical results
0 references