LLL-Based Hermite Normal Form Computation
Using lattice reduction to control entry growth during Hermite normal form computation, and when this beats the modular approach.
Every page in the KEVOS library tagged coefficient growth. 5 pages.
Using lattice reduction to control entry growth during Hermite normal form computation, and when this beats the modular approach.
Dense and sparse matrix representations, the cost model for exact linear algebra, and why coefficient growth rather than operation count usually decides performance.
Computing polynomial GCDs over the integers, the growth problem in remainder sequences, and the modular approach that sidesteps it.
Computing Bezout coefficients alongside the GCD, modular inversion as its principal application, and controlling coefficient growth.
The sub-resultant remainder sequence: predicting the divisible factor at each step to keep coefficients near minimal without content computation.