Sampling algebraic sets in local intrinsic coordinates

Details Sampling algebraic sets in local intrinsic coordinates Sampling algebraic sets in local intrinsic coordinates

2009-12-14

arxiv.org/abs/0912.2751v1

Mathematics

Numerical Analysis

13 pages, 2 figures, 2 algorithms, 2 tables

Scientific paper

Numerical data structures for positive dimensional solution sets of polynomial systems are sets of generic points cut out by random planes of complimentary dimension. We may represent the linear spaces defined by those planes either by explicit linear equations or in parametric form. These descriptions are respectively called extrinsic and intrinsic representations. While intrinsic representations lower the cost of the linear algebra operations, we observe worse condition numbers. In this paper we describe the local adaptation of intrinsic coordinates to improve the numerical conditioning of sampling algebraic sets. Local intrinsic coordinates also lead to a better stepsize control. We illustrate our results with Maple experiments and computations with PHCpack on some benchmark polynomial systems.

Affiliated with

Also associated with

No associations

Rating

Sampling algebraic sets in local intrinsic coordinates does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Sampling algebraic sets in local intrinsic coordinates, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sampling algebraic sets in local intrinsic coordinates will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-304343