Courant Institute / Korea Institute of Advanced Study / New York University / /
IndustryTerm
conceptual algorithm / simplex algorithm / algebraic computing community / theoretical algorithms / subdivision algorithm / continuous and numerical algorithms / Subdivision algorithms / multidimensional systems / binary search / geometric modeling applications / adaptive algorithms / real root isolation algorithm / numerical and continuous algorithms / root isolation algorithms / abstract algorithm / combinatorial and discrete algorithms / evaluation-based root isolation algorithm / numerical algorithms / generic subdivision algorithms / important tool / multidimensional search literature / Similar subdivision algorithms / evaluation-based subdivision algorithm / /
Organization
New York University / Hausdorff Center for Mathematics / PEV AL / National Science Foundation / Korea Institute of Advanced Study / Courant Institute / /
Person
FELIX KRAHMER / MICHAEL BURR / /
Position
General / /
ProvinceOrState
New York / /
Technology
GEN. This algorithm / Evaluation-based Algorithm / This algorithm / following algorithm / 3-D meshing algorithm / Subdivision algorithms / root isolation algorithms / EVAL algorithm / numerical and continuous algorithms / Evaluation Algorithm / simplex algorithm / evaluation-based root isolation algorithm / GENERIC algorithm / subdivision algorithm / abstract algorithm / 7 algorithm / example algorithm / Marching Cube algorithm / generic subdivision algorithms / GEN algorithm / evaluation-based subdivision algorithm / conceptual algorithm / Similar subdivision algorithms / real root isolation algorithm / continuous and numerical algorithms / X. This algorithm / /
CONTINUOUS AMORTIZATION: A NON-PROBABILISTIC ADAPTIVE ANALYSIS TECHNIQUE∗ MICHAEL BURR† , FELIX KRAHMER‡ , AND CHEE YAP† Abstract. Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision