Generic Gram-Schmidt orthogonalization by exact division

  title={Generic Gram-Schmidt orthogonalization by exact division},
  author={{\'U}lfar Erlingsson and Erich L. Kaltofen and David R. Musser},
  booktitle={ISSAC '96},
Given a vector space basis with integral domain coefficients, a variant of the Gram-Schmidt process produces an orthogonal basis using exact divisions, so that all arithmetic is within the integral domain. Zero-division is avoided by the assumption that in the domain a sum of squares of nonzero elements is always nonzero. In this paper we fully develop this method and use it to illustrate and compare a variety of means for implementing generic algorithms. Previous generic programming methods… 

Figures from this paper

A verified LLL algorithm

The first mechanized soundness proof of the LLL algorithm to compute short vectors in lattices is presented, which follows a textbook by von zur Gathen and Gerhard.

Formalizing the LLL Basis Reduction Algorithm and the LLL Factorization Algorithm in Isabelle/HOL

This paper provides an implementation of the LLL basis reduction algorithm, and additionally integrates one application of LLL, namely a verified factorization algorithm for univariate integer polynomials which runs in polynomial time.

Fraction-free matrix factors: new forms for LU and QR factors

The new output format for fraction free LU factoring and for QR factoring is given, which contains smaller entries than previously suggested forms, and it avoids the gcd computations required by some other partially fraction free computations.

A Verified Efficient Implementation of the LLL Basis Reduction Algorithm

This paper formally proves the correctness of a more efficient implementation of the LLL algorithm that uses only integer computations and formally proves statements on the polynomial running-time.

Matrix factoring by fraction-free reduction

It is shown that existing fraction-free QR (Gram-Schmidt) algorithms create a common factor in the last column of Q, which relates the existence of row factors in LU decomposition to factors appearing in the Smith normal form of the matrix.

LinBox Founding Scope Allocation, Parallel Building Blocks, and Separate Compilation

The LinBox project is to address the problem of efficiency and genericity in the design of an efficient general-purpose C++ opensource library for exact linear algebra over the integers, the rationals, and finite fields.

Common Factors in Fraction-Free Matrix Decompositions

It is shown that fraction-free Gauß–Bareiss reduction leads to triangular matrices having a non-trivial number of common row factors in theLUandQRmatrix decompositions using exact computations.

FOXBOX: a system for manipulating symbolic objects in black box representation

A software package that puts in practice the black box representation of symbolic objects and provides algorithms for performing the symbolic calculus with such representations is introduced and the results of several challenge problems are presented, representing the first symbolic solutions of such problems.

1 Major Research Results 1 . 1 Polynomial Factorization

In the following the EKbib and BASE URL is https:// The COURSEBASE URL is https://kaltofen.math.ncsu. edu/courses/. Many of my publications are accessible

Cited References



Sylvester’s identity and multistep integer-preserving Gaussian elimination

A method is developed which permits integer-preserving elimination in systems of linear equations, AX = B, such that (a) the magnitudes of the coefficients in the transformed matrices are minimized,

Factoring polynomials with rational coefficients

In this paper we present a polynomial-time algorithm to solve the following problem: given a non-zero polynomial fe Q(X) in one variable with rational coefficients, find the decomposition of f into

Effective Noether Irreducibility Forms and Applications (Extended Abstract)

New irreducibility forms are derived which are integer polynomials in variables which are the generic coefficients of a multivariate polynomial of a given degree and the effective estimates can be applied to derive several factorization results in parallel computational complexity theory.

The art of computer programming. Vol.2: Seminumerical algorithms

This professional art of computer programming volume 2 seminumerical algorithms 3rd edition that has actually been written by is one of the best seller books in the world and is never late to read.

STL tutorial and reference guide - C++ programming with the standard template library

This second edition of the STL Tutorial and Reference Guide is fully updated to reflect all of the changes made to STL for the final ANSI/ISO C++ language standard and has been expanded with new chapters and appendices.

A Hadamard-Type Bound on the Coefficients of a Determinant of Polynomials

The final author version and the galley proof are versions of the publication after peer review that features the final layout of the paper including the volume, issue and page numbers.

The Art of Computer Programming

The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.

Standard template library

The Art of Computer Programmmg, implement ation of the Affirm verification system, the Ada Vol. 2, Semmumerical Algorithms, 2 ed. Addison Wes- Generic Library, and the C++ Standard Template Library

  • Icy,
  • 1981

Matrix computations