PROC f = (DBL x)DBL: x UP 3 - LONG 3.1 * x UP 2 + LONG 2.0 * x # WHILE # ABS dx > x error AND ABS dy > y error DO
X1 := x2 y1 := y2 # retain for next iteration # XY(x1, y1) # we already have a solution! # Y error := (in y error|(DBL y error):y error|small real) X error := (in x error|(DBL x error):x error|small real), INT limit = ENTIER (long real width / log(2)) # worst case of a binary search) #ĭBL x1 := (in x1|(DBL x1):x1|-5.0), # if x1 is EMPTY then -5.0 # PROC find root = (PROC (DBL)DBL f, DBLOPT in x1, in x2, in x error, in y error)XYRES:( 62.1 Imperative version (Ugly, side effects)įORMAT dbl = $g(-long real width, long real width-6, -2)$ įORMAT xy root = $f(dbl)" ("b("Exactly", "Approximately")")"$.46.5 Factorization to quadratic factors.
0 kommentar(er)
