A modification of krawczyk's algorithm
In order to enclose a simple zero \(\rho\) of a continuously differentiable function \(f:\mathbb{R}^n \to\mathbb{R}^n\) by a tight compact interval vector the authors consider the iteration \[ \begin{cases} KM(X_k) & =x_k-Y_k f(x_k)+ {1\over \gamma} \bigl(I-Y_kF'(X_k) \bigr) (X_k-x_k) \\ X_{k+1} & = X_k\cap KM (X_k) \end{cases} \quad k=0,1, \dots \] where \(x_k\) is the midpoint of the interval vector \(X_k\), \(X_0\) is given, \(Y_k\) is some preconditioning real nonsingular \(n \times n\) matrix and \(F'(X_k)\) is an inclusion monotone interval extension of the Fréchet derivative of \(f\) at \(X_k\). The parameter \(\gamma\) is newly introduced; its choice depends on \(k\). For \(\gamma=1\) the method contains the well-known Krawczyk method. By choosing \(\gamma\) such that \[ {2\over \gamma} \biggl\| \bigl| I-Y_kF'(X_k) \bigr| \biggr \|_\infty \leq q, \] \[ q\in (0,1) \text{ being a preselected real number}, \] the authors show that \(\rho\in X_0\) implies \(\rho\in X_k \subseteq X_{k-1} \subseteq \dots \subseteq X_0\) and \(\lim_{k \to \infty} X_k= \rho\). (Some assumptions seem to be missing the paper in order to verify this result; note that \(KM(X_0) \approx x_0- f(x_0)\) for \(Y_0=I\) and for \(\gamma\) sufficiently large which can yield to \(\rho \notin X_1\).) Conditions for \(\gamma\) are presented which guarantee the quadratic convergence of the method. The one-dimensional case is handled separately. Numerical examples conclude the paper.
- scientific article; zbMATH DE number 123365
- scientific article; zbMATH DE number 3903712
- scientific article; zbMATH DE number 3993296
- scientific article; zbMATH DE number 1131789
- scientific article; zbMATH DE number 3874507
- A modified version of the Waxman algorithm
- Some properties and applications of a modified Kovarik algorithm
- One modification of Gomory's algorithm
- scientific article; zbMATH DE number 721769
- scientific article; zbMATH DE number 5605689
- A class of interval-Newton-operators
- A Computational Test for Convergence of Iterative Methods for Nonlinear Systems
- A Test for Existence of Solutions to Nonlinear Systems
- An improved interval Newton operator
- Automatic errorbounds for the approximate solution of equations
- Bounding Sets in Function Spaces with Applications to Nonlinear Operator Equations
- Bounding solutions of systems of equations using interval analysis
- Die vollautomatische Berechnung einer einfachen Nullstelle von \(F(t) = 0\) einschließlich einer Fehlerabschätzung
- Einschließung von Nullstellen mit Hilfe einer Intervallarithmetik
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- Interval forms of Newtons method
- Interval iterations for including a set of solutions
- Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken
- Nullstelleneinschließung mit dem Newton-Verfahren ohne Invertierung von Intervallmatrizen
- On the solution of nonlinear equations in interval arithmetic
- Quadratisch konvergente Einschließung von Lösungen nichtkonvexer Gleichungssysteme
- Safe Starting Regions for Iterative Methods
- Über das Newton‐Verfahren bei nichtlinearen Gleichungssystemen
- Über die Nullstellenbestimmung bei näherungsweise berechneten Funktionen
- Am improved form of the Krawczyk-Moore algorithm
- A class of componentwise Krawczyk-Moore type iteration methods
- A derivation of Kohnert's algorithm from Monk's rule
- Producing an interval extension of the King method
- Higher order multi-step interval iterative methods for solving nonlinear equations in R^n
- On the componentwise Krawczyk-Moore iteration
- A modification to the LINPACK downdating algorithm
- A Variant of the F4 Algorithm
- scientific article; zbMATH DE number 3886105 (Why is no real title available?)
- scientific article; zbMATH DE number 3848699 (Why is no real title available?)
- scientific article; zbMATH DE number 3874507 (Why is no real title available?)
- A modified version of the Waxman algorithm
- scientific article; zbMATH DE number 3903712 (Why is no real title available?)
- scientific article; zbMATH DE number 4098624 (Why is no real title available?)
- A Kiefer-Wolfowitz algorithm with randomized differences
- scientific article; zbMATH DE number 6845491 (Why is no real title available?)
- A modified DIRECT algorithm with bilevel partition
- scientific article; zbMATH DE number 857603 (Why is no real title available?)
- A modification of Shanks' baby-step giant-step algorithm
- Modifying Faugère's F5 algorithm to ensure termination
This page was built for publication: A modification of krawczyk's algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4375411)