Algorithms for computing integral bases of an algebraic function field are implemented in some computer algebra systems. They are used e.g. for the integration of algebraic functions. The method used by Maple 5.2 and AXIOM is given by Trager in [Trager,1984]. He adapted an algorithm of Ford and Zass
An Algorithm for Computing the Integral Closure
β Scribed by Theo de Jong
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 267 KB
- Volume
- 26
- Category
- Article
- ISSN
- 0747-7171
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this article I describe an algorithm for computing finite dimensional graded algebras, and I describe an implementation of the algorithm. As an application of the algorithm, I investigate associative algebras satisfying the identity \(x^{4}=0\). I show that if \(A\) is an associative algebra over
In a previous article [Chem. Phys. 1994, 186, 355-374], Ruhoff derived a set of recursion relations for calculating multidimensional Franck-Condon overlap integrals within the harmonic approximation, taking into account the Duschinsky mixing effect. We show here how these relations can be implemente
We provide a setting for analyzing the efficiency of algorithms that compute the integral closure of affine rings. It gives quadratic (cubic in the non-homogeneous case) multiplicity-based but dimension-independent bounds for the number of passes the basic construction will make. An approach that do
A new algorithm is proposed for integrating the spin in the frame of large deformation analysis. The method is based on the integration of a matrix relation, obtained from an adapted decomposition of the deformation gradient, and directly written in convected co-ordinates. The input of this algorith