โ Scribed by I. Babushka; M. Prager; E. Vitasek
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Asymptotically, as the solution to an equation is approached, superlinearly convergent methods (SCM's) are faster than the method of successive substitution (MSS) and are less troubled by rounding error (Pizer. 1975). However, earlyin an iteration MSS may converge more quickly so that if modest accu
We provide a setting for analyzing the efficiency of algorithms that compute the integral closure of affine rings. It gives quadratic (cubic in the non-homogeneous case) multiplicity-based but dimension-independent bounds for the number of passes the basic construction will make. An approach that do
Schiermeyer, I., Computation of the O-dual closure for hamiltonian graphs, Discrete Mathematics 111 (1993) 455-464. The well-known closure concept of Bondy and Chvbtal (1976) is based on degree sums of pairs of nonadjacent vertices. It generalizes six earlier sufficient degree conditions for hamilto