Diagonalization of Quadratic Forms by Gauss Elimination

Published Online:https://doi.org/10.1287/mnsc.12.5.371

The La Grange linear similarity transformation (completing the square) can be used to remove all cross-product terms from a quadratic form. It is shown that the La Grange transformation may be found conveniently by adapting the well-known Gauss elimination procedure for solving linear equations. A simple algorithm for finding the inverse transformation is given. This diagonalization scheme takes much less effort than finding the characteristic roots and vectors. It produces important simplifications in quadratic programming, statistics, and optimization problems.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.