Unitary Triangularization of a Nonsymmetric Matrix

  title={Unitary Triangularization of a Nonsymmetric Matrix},
  author={A. Householder},
  journal={J. ACM},
A method for the inversion of a nonsymmetric matrix has been in use at ORNL and has proved to be highly stable numerically but to require a rather large number of arithmetic operations, including a total of N(N-1)/2 square roots. This note points out that the same result can be obtained with fewer arithmetic operations, and, in particular, for inverting a square matrix of order N, at most 2(N-1) square roots are required. For N > 4, this is a savings of (N-4)(N-1)/4 square roots. (T.B.A.) 
484 Citations
New Method of Givens Rotations for Triangularization of Square Matrices
  • 5
  • PDF
Remarks on the Unitary Triangularization of a Nonsymmetric Matrix
  • 15
Calculating the singular values and pseudo-inverse of a matrix
  • G. Golub, W. Kahan
  • Mathematics, Computer Science
  • Milestones in Matrix Computation
  • 2007
  • 1,206
  • PDF
A projection method of the Cimmino type for linear algebraic systems
  • F. Sloboda
  • Mathematics, Computer Science
  • Parallel Comput.
  • 1991
  • 9
Towards a Generalized Singular Value Decomposition
  • 470
On rank-deficient pseudoinverses
  • 23