This paper shows how tight bounds for the range of a bivariate polynomial can be found using a matrix method based on affine arithmetic. Then, this method is applied to drawing an algebraic curve with a hierarchical algorithm, which demonstrates that more accurate answers can be obtained more rapidly than using conventional interval arithmetic.
|Number of pages||5|
|Journal||Progress in Natural Science|
|Publication status||Published - 2002|