𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Generalized Gauss Reduction Algorithm

✍ Scribed by Michael Kaib; Claus P. Schnorr

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
178 KB
Volume
21
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

✦ Synopsis

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.

πŸ“œ SIMILAR VOLUMES

Algorithms for the Gauss–Manin Connectio
Algorithms for the Gauss–Manin Connection
✍ Mathias Schulze πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 402 KB

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 var

The Gauss-Huard algorithm and LU factori
The Gauss-Huard algorithm and LU factorization
✍ Walter Hoffmann πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 341 KB

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.

A fast VQ codebook generation algorithm
A fast VQ codebook generation algorithm via pattern reduction
✍ Chun-Wei Tsai; Chao-Yang Lee; Ming-Chao Chiang; Chu-Sing Yang πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 559 KB

In this paper, we present a simple but fast codebook generation algorithm, called PREGLA (Pattern Reduction Enhanced GLA). The proposed algorithm is fundamentally different from the previous approaches in that the previous approaches focus on reducing the size of the codebook whereas the proposed al