Pivoting to normalize a basic matrix

DOI10.1007/BF01585183MaRDI QIDQ1319023zbMATH OpenOpenAlexFDO

Authors B. Curtis Eaves

Publication date 12 April 1994

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01585183

zbMATH Keywords

basic matrixpivotingsimplex method

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Numerical computation of matrix norms, conditioning, scaling (65F35)

Review text

The author calls an \(m\times n\) matrix \(A\) basic if some \(m\times n\) submatrix of columns is a permutation matrix. Given such \(A\), he shows that by repeatedly pivoting on elements which exceed one in absolute value, one brings \(A\) into a basic form, where all elements have an absolute value of one or less. The algorithm resembles the simplex method.

Recommendations

• Basic matrices.
• Orientation of matrices
• Normalization of row reduced matrices
• scientific article; zbMATH DE number 1775150
• An orthogonally based pivoting transformation of matrices and some applications

Cites work

• Computing Zeros of Sections of Vector Bundles Using Homotopies and Relocalization
• Equilibrium in incomplete markets. I: A basic model of generic existence

Cited in

(1)

• Computing equilibria of GEI by relocalization on a Grassmann manifold

This page was built for publication: Pivoting to normalize a basic matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1319023)