In the second step, Newton's root finding technique is used to determine the accurate locations of the witness points on the identified boundary elements. The first step of the method identifies a pair of boundary elements that contains a pair of witness points from the boundaries of the two regions that realizes their distances. In this paper, we present a new two-step method with quadratic convergence for fast computation of distance between two disjoint convex regions. For example, the method of Gilbert and Foo 4 has linear convergence. There is, in general, a lack of analysis of numerical behaviors of these methods, and the rate of convergence of these methods is relatively slow. Existing methods for this problem use numerical methods to produce approximate solutions. The problem of computing the distance between two disjoint 2D convex regions with curved boundaries is discussed. Readership: Researchers, university lecturers and graduate students in numerical and computational mathematics, applied mathematics and computer science. Symbolic, Algebraic, and Geometric Computation.Researchers, teachers, students, and engineers interested in doing mathematics using computers will find this volume good reading and a valuable reference. 39 peer-reviewed original contributions together with full papers and extended abstracts by the four invited speakers, G H Gonnet, D Lazard, W McCune, and W-T Wu, cover some of the most recent and significant advances in computer mathematics, including algebraic, symbolic, numeric, and geometric computation, automated mathematical reasoning, mathematical software, and computer-aided geometric design.
This volume contains selected papers presented at the Fourth Asian Symposium on Computer Mathematics.
0 kommentar(er)
