Annotation of OpenXM_contrib/PHC/Ada/READ_ME, Revision 1.1.1.1
1.1 maekawa 1: Ada source code of Polynomial Homotopy Continuation version 2.
2:
3: The same hierarchical structure as in the original version is preserved,
4: with the addition of numerical Schubert calculus.
5: New in this release is the introduction of multi-precision arithmetic.
6: The mathematical library has been rebuilt using Ada 95 concepts.
7:
8: The Ada sources of PHCv2 are organized in the following tree of directories:
9:
10: Ada : Ada source code of PHC
11: |-- System : 0. UNIX dependencies, e.g.: timing package
12: |-- Math_Lib : 1. general mathematical library
13: | |-- Numbers : 1.1. number representations
14: | |-- Matrices : 1.2. matrices and linear-system solvers
15: | |-- Polynomials : 1.3. multivariate polynomial systems
16: | |-- Supports : 1.4. support sets and linear programming
17: |-- Homotopy : 2. homotopy and solution lists
18: |-- Continuation : 3. path-tracking routines
19: |-- Root_Counts : 4. root counts and homotopy construction
20: | |-- Product : 4.1. linear-product start systems
21: | |-- Implift : 4.2. implicit lifting
22: | |-- Stalift : 4.3. static lifting
23: | |-- Dynlift : 4.4. dynamic lifting
24: | |-- Symmetry : 4.5. exploitation of symmetry relations
25: |-- Schubert : 5. numerical Schubert calculus
26: |-- Main : 6. main dispatcher
27: |-- Objects : 7. to install, type: make phc
28:
29: There are four parts:
30: 1. System and Mathematical Library
31: 2. Homotopy and Continuation
32: 3. Root Counts and Start Systems
33: 4. Schubert and Main Interfacing Library
34:
35: Homotopy Continuation is a symbolic-numeric method:
36: root counting is a symbolic action for the resolution of a start system,
37: whereas path-following has Newton's method as main computational engine.
38:
39: PHC occupies by now about 100,000 lines of source code:
40: about 20,000 lines package specifications and about 80,000 lines Ada code.
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>