Debian Codegraph @

doc/packages.html

raw
1 <?xml version="1.0" encoding="iso-8859-1"?>
2 <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
3 "DTD/xhtml1-transitional.dtd">
4 <html xmlns="http://www.w3.org/1999/xhtml">
5 <head>
6 <link rel="stylesheet" type="text/css" href="html.css" />
7 <title>JAS Packages</title>
8 </head>
9 <body class="main">
10 <h2>Java Algebra System (JAS) Packages</h2>
11
12 <p>
13 The JAS software library contains at the moment of the following <a
14 name="package">packages</a>. The relations and dependencies between
15 the packages are shown in figure 1.
16 </p>
17
18 <dl>
19 <dt>edu.jas.structure:</dt>
20 <dd>
21 contains interfaces for the most general algebraic structures like
22 <code>RingElem</code> and <code>RingFactory</code>.
23 </dd>
24 <dt>edu.jas.arith:</dt>
25 <dd>
26 contains classes for arithmetic in the basic coefficient rings like
27 <code>BigRational</code>, <code>BigInteger</code>,
28 <code>ModInteger</code>, <code>BigDecimal</code> or
29 <code>BigComplex</code>.
30 </dd>
31 <dt>edu.jas.poly:</dt>
32 <dd>
33 contains classes for commutative polynomial, solvable polynomial and
34 free non-commutative polynomial arithmetic like
35 <code>GenPolynomial</code>, <code>GenSolvablePolynomial</code>,
36 <code>GenWordPolynomial</code> and others such as
37 <code>AlgebraicNumber</code> and a polynomial parser
38 <code>GenPolynomialTokenizer</code>.
39 </dd>
40 <dt>edu.jas.vector:</dt>
41 <dd>
42 contains classes for vectors and lists of polynomials and solvable
43 polynomials like <code>GenVector</code> or <code>GenMatrix</code>.
44 </dd>
45 <dt>edu.jas.gb:</dt>
46 <dd>
47 contains classes for polynomial and solvable polynomial reduction,
48 Gr&ouml;bner bases over fields and ideal arithmetic as well as
49 thread parallel and distributed versions of Buchbergers algorithm
50 like <code>ReductionSeq</code>, <code>GroebnerBaseAbstract</code>,
51 <code>GroebnerBaseSeq</code>, <code>GroebnerBaseParallel</code> and
52 <code>GroebnerBaseDistributedHybridEC</code>. There are also Gr&ouml;bner
53 bases in polynomial rings over principal ideal domains and Euclidean
54 domains, so called D- and E-Gr&ouml;bner bases,
55 e.g. <code>EGroebnerBaseSeq</code>. New are Gr&ouml;bner bases in
56 free non-commutative polynomial rings over (skew) fields,
57 see <code>WordGroebnerBaseSeq</code>.
58 </dd>
59 <dt>edu.jas.gbmod:</dt>
60 <dd>
61 contains classes for module Gr&ouml;bner bases and syzygies over
62 polynomials and solvable polynomials like
63 <code>ModGroebnerBase</code> or <code>SolvableSyzygy</code>.
64 </dd>
65 <dt>edu.jas.application:</dt>
66 <dd>
67 contains classes with applications of Gr&ouml;bner bases such as ideal
68 intersections and ideal quotients implemented in <code>Ideal</code>
69 or <code>SolvableIdeal</code>. Comprehensive Gr&ouml;bner bases for
70 polynomial rings over parameter rings are contained in class
71 <code>ComprehensiveGroebnerBaseSeq</code>. Latest additions are
72 zero and arbitrary dimensional radical-, irreducible-, prime- and
73 primary-decomposition implemented in class <code>Ideal</code>.
74 </dd>
75 <dt>edu.jas.ufd:</dt>
76 <dd>
77 contains classes for unique factorization domains. Like the
78 interface <code>GreatestCommonDivisor</code>, the abstract class
79 <code>GreatestCommonDivisorAbstract</code> and various
80 implementations, e.g. polynomial remainder sequences and modular
81 algorithms. The package now contains factorization algorithms for
82 univariate polynomials over several coefficient rings: modulo primes
83 in class <code>FactorModular</code>, over integers in class
84 <code>FactorInteger</code>, over rational numbers in class
85 <code>FactorRational</code> and over algebraic numbers in class
86 <code>FactorAlgebraic&lt;C&gt;</code>.
87 </dd>
88 <dt>edu.jas.gbufd:</dt>
89 <dd>
90 contains classes for Gr&ouml;bner base computation using classes
91 from the <em>edu.jas.ufd</em> package for polynomial
92 coefficients. The main classes deal with pseudo reduction
93 <code>PseudoReduction</code>, <code>PseudoReductionSeq</code> and
94 greatest common divisors computation on coefficients
95 <code>GroebnerBasePseudoSeq</code>. Multiplicative sets of
96 polynomials with several simplifications, e.g. maintaining co-prime
97 factors or co-prime and squarefree factors, are contained in classes
98 <code>MultiplicativeSet</code>, <code>MultiplicativeSetCoPrime</code>
99 or <code>MultiplicativeSetSquarefree</code>. Also contained are
100 Gr&ouml;bner bases for polynomial rings over regular rings (direct
101 products of fields or integral domains) in
102 <code>RGroebnerBaseSeq</code> and <code>RGroebnerBasePseudoSeq</code>.
103 </dd>
104 <dt>edu.jas.root:</dt>
105 <dd>
106 contains classes for real root computations. Like the
107 interface <code>RealRoots</code>, the abstract class
108 <code>RealRootsAbstract</code> and at the moment of a single
109 implementation based on Sturm sequences <code>RealRootsSturm</code>.
110 The package further contains an implementation for real algebraic numbers
111 <code>RealAlgebraicNumber</code> with a corresponding factory
112 <code>RealAlgebraicRing</code>.
113 For complex root isolation there are <code>ComplexRoots</code> interface,
114 <code>ComplexRootsAbstract</code> and <code>ComplexRootsSturm</code> classes.
115 The implementation provides an exact infallible method which follows
116 the numeric method of Wilf. It uses Sturm sequences following the
117 Routh-Hurwitz Method to count the number of complex roots within a
118 rectangle in the complex plane.
119 There is also an implementation for complex algebraic numbers
120 <code>ComplexAlgebraicNumber</code> with a corresponding factory
121 <code>ComplexAlgebraicRing</code>.
122 </dd>
123 <dt>edu.jas.ufdroot:</dt>
124 <dd>
125 contains classes for factorization in structures used in root
126 computation, for example <code>FactorRealAlgebraic</code>.
127 </dd>
128 <dt>edu.jas.ps:</dt>
129 <dd>
130 contains univariate and multivariate power series arithmetic
131 in classes <code>UnivPowerSeries</code> and <code>MultiVarPowerSeries</code>.
132 There is an initial implementation of Mora's tangent cone reduction algorithm
133 in class <code>ReductionSeq</code> and a standard bases computation in
134 <code>StandardBaseSeq</code> with method <code>STD()</code>.
135 </dd>
136 <dt>edu.jas.integrate:</dt>
137 <dd>
138 contains methods for the elementary integration of univariate rational functions.
139 The main class is <code>ElementaryIntegration</code> with method
140 <code>integrate()</code>.
141 </dd>
142 <dt>edu.jas.util:</dt>
143 <dd>
144 contains further utilities for parallel and distributed computations
145 like <code>ThreadPool</code>, <code>DistThreadPool</code> or
146 <code>DistHashTable</code>. Part of this package has become obsolete
147 with JDK 1.5.
148 </dd>
149 <dt>edu.jas.fd:</dt>
150 <dd>
151 contains classes for solvable polynomials rings as (non-unique)
152 factorization domains. There are methods for polynomial pseudo
153 remainder computation over Ore domains in class <code>FDUtil</code>.
154 Further, methods for common divisors are included, but not yet
155 finished.
156 <!-- Methods provided with interface
157 <code>GreatestCommonDivisor</code> are e.g. greatest common divisors
158 <code>gcd()</code>, primitive part <code>primitivePart()</code>.-->
159 </dd>
160 </dl>
161
162
163 <p align="center">
164 <!--img src="../images/PackageOverview.png" width="50%" alt="Static package structure overview" /-->
165 <img src="../images/jas-pack-over.png" width="80%"
166 alt="Static package and component structure overview" />
167 <br />
168 <b>Figure 1:</b> Package and component structure overview
169 </p>
170
171
172
173 <hr />
174 <address><a name="contact"
175 href="mailto:kredel@[email protected]">Heinz Kredel</a>
176 </address>
177
178 <p>
179 <!-- Created: Thu Jun 4 23:42:20 CEST 2005 -->
180 <!-- hhmts start -->
181 Last modified: Mon Mar 28 23:49:24 CEST 2016
182 <!-- hhmts end -->
183 </p>
184 <!--p align="right" >
185 $Id: $
186 </p-->
187
188 </body>
189 </html>