findRoots = { var EPSILON = 1e-8 function nextPow2 (v) { v += v === 0 --v v |= v >>> 1 v |= v >>> 2 v |= v >>> 4 v |= v >>> 8 v |= v >>> 16 return v + 1 } var pr = new Float64Array(1024) var pi = new Float64Array(1024) function near(a, b, c, d, tol) { var qa = a - c var qb = b - d var r = qa * qa + qb * qb if(r * r < tol) { return true } return false } function solve(n, n_iters, tolerance, zr, zi) { var m = zr.length var i, j, k, a, b, na, nb, pa, pb, qa, qb, k1, k2, k3, s1, s2, t, d, r var max = Math.max, abs = Math.abs for(i=0; i=0; --k) { k1 = pa * (na + nb) k2 = na * s1 k3 = nb * s2 na = k1 - k3 + pr[k] nb = k1 + k2 + pi[k] } //Compute reciprocal k1 = a*a + b*b if(abs(k1) > EPSILON) { a /= k1 b /= -k1 } else { a = 1.0 b = 0.0 } //Multiply and accumulate k1 = na * (a + b) k2 = a * (nb - na) k3 = b * (na + nb) qa = k1 - k3 qb = k1 + k2 zr[j] = pa - qa zi[j] = pb - qb d = max(d, max(abs(qa), abs(qb))) } //If converged, exit early if(d < tolerance) { break } } //Post process: Combine any repeated roots var count for(i=0; i 1) { a /= count b /= count for(j=0; j