Lines Matching defs:root
26 an iterative root polisher (CACM algorithm 283). It *is* possible
302 /* Newton-Raphson-Maehly actually functioned as a decent root finder,
303 but there are root sets for which it gets into limit cycles
319 /* iterate a root */
333 return(-1); /* complex root! The LPC generator handed us a bad filter */
369 double *root=alloca(ord*sizeof(*root));
371 for(i=0; i<ord;i++) root[i] = r[i];
378 double rooti=root[i];
387 root[i] -= delta;
399 for(i=0; i<ord;i++) r[i] = root[i];