We generalize the Gauss algorithm for the reduction of two-dimensional lattices w from the l -norm to arbitrary norms and extend Vallee's analysis J. Algorithms 12 2 Ž . x 1991 , 556᎐572 to the generalized algorithm.
Algorithms for the Gauss–Manin Connection
✍ Scribed by Mathias Schulze
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 402 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0747-7171
No coin nor oath required. For personal study only.
✦ Synopsis
We give an introduction to the theory of the Gauss-Manin connection of an isolated hypersurface singularity and describe an algorithm to compute the V-filtration on the Brieskorn lattice. We use an implementation in the computer algebra system Singular to prove C. Hertling's conjecture about the variance of the spectrum for Milnor number µ ≤ 16.
📜 SIMILAR VOLUMES
In this paper we analyze the Gauss-Huard algorithm. From a description of the algorithm in terms of matrix-vector operations we reveal a close relation between the Gauss-Huard algorithm and an LU factorization as constructed in an ikj variant.
Given a source node and a set of destination nodes in a network, multicast routing problem is usually treated as Steiner tree problem. Unlike this well-known tree based routing model, multicast routing under multi-path model is to find a set of paths rooted at the source node such that in each path
The Verlet, Verlet leap frog, Gear fixed time step. Gear variable time step, Runge-Kutta, and Gauss-Radau algorithms have been compared using trajectory data obtained from the integration of a one-dimensional diatomic chain under constant pressure. Investigation into the times of local and normal mo