Proceedings of the ... Southeastern Conference on Combinatorics, Graph Theory, and Computing, Volume 3Utilitas Mathematica Pub., 1972 - Combinatorial analysis |
From inside the book
Results 1-3 of 29
Page 97
... approximation to || p * - P│ | - p❘ and hence when △ from 3.2 is too small the iteration takes many function ... approximation to the minima of functions of several variables , J. Assoc . Comp . Mach . 16 ( 1969 ) 286-294 ...
... approximation to || p * - P│ | - p❘ and hence when △ from 3.2 is too small the iteration takes many function ... approximation to the minima of functions of several variables , J. Assoc . Comp . Mach . 16 ( 1969 ) 286-294 ...
Page 329
... approximation x ( t ) on [ to , t ; ] . In the subinterval [ t ; -1 , t ; ] , the approximation is given by the function x ( t ) = B3 [ ( 6A2 + 3A + + A3 [ ( 6B2 + 3B + 1 ) × ̧ [ tj_ls 1 ) × ; -1 + A ( 3A + + + 1 ) hm ; -1 + 31⁄2A2n2M ...
... approximation x ( t ) on [ to , t ; ] . In the subinterval [ t ; -1 , t ; ] , the approximation is given by the function x ( t ) = B3 [ ( 6A2 + 3A + + A3 [ ( 6B2 + 3B + 1 ) × ̧ [ tj_ls 1 ) × ; -1 + A ( 3A + + + 1 ) hm ; -1 + 31⁄2A2n2M ...
Page 341
... APPROXIMATION . IS THE KNOT VALUE FROM WHICH WE CALCULATE THE APPROXIMATIONS USING THE PREDICTOR AND CORRECTOR FORMALAE . IS THE STEP SIZE . C EPSILM IS THE CONVERGENCE CRITERION USED FOR THE CORRECTOR . C ISTEP WE PRINT OUT EVERY OTHER ...
... APPROXIMATION . IS THE KNOT VALUE FROM WHICH WE CALCULATE THE APPROXIMATIONS USING THE PREDICTOR AND CORRECTOR FORMALAE . IS THE STEP SIZE . C EPSILM IS THE CONVERGENCE CRITERION USED FOR THE CORRECTOR . C ISTEP WE PRINT OUT EVERY OTHER ...
Other editions - View all
Common terms and phrases
3RD S-E CONF A₁ adjacent algebra algorithm approximation average number b-line block design cell Chromatic Polynomial closed braids coloration COMBINATORICS congruent number contains Corollary crossing number cycle defined denote Diophantine equation elements endpoints equation exist factor Figure finite function given graph G GRAPH THEORY hashing Hence hypohamiltonian graphs hypotraceable graph integer KNOT label Latin squares lattice Lemma linear major rotation Math matrix matroid method minimal modulo n-coloring nodes number of edges number of probes obtained occur odd chords P,Q)-homomorphism P,Q)-system pair partial cut partition planar graph polynomial prime problem PROC Proof quadratic Room square secondary flat solution solve spanning path spline square free square of side subsets Theorem tree edge type S Latin uniform edges University of Manitoba University of Waterloo V₁ values vector vertex vertices of valence ду