
doi: 10.1137/0720014
In this paper we introduce a method for computing a solution of a nonlinear system, which is similar to that proposed by R. Krawczyk [Computing, 4 (1969), pp. 187–201]. Our method, however, needs considerably less work per step. Starting with an interval vector, we give a criterion under which the method is convergent to the solution of the system if a solution is contained in the interval vector. If the starting vector contains no solution then the method will break down after a finite number of steps.
Numerical computation of solutions to systems of equations, Interval and finite arithmetic, iteration method, interval matrix, Gaussian algorithm, quadratically convergent, interval arithmetic, Krawczyk algorithm
Numerical computation of solutions to systems of equations, Interval and finite arithmetic, iteration method, interval matrix, Gaussian algorithm, quadratically convergent, interval arithmetic, Krawczyk algorithm
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 32 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
