Article View: sci.math.num-analysis
Article #226Crashing a Basis
From: Jeffrey Horn
Date: Mon, 10 Aug 1992 14:51
Date: Mon, 10 Aug 1992 14:51
12 lines
839 bytes
839 bytes
Given an m x n matrix with linearly independand rows ( n > m ) is there any good way to find m columns that form an invertible submatrix? Does anyone know of any code that might do this? Given that it can be done, can one do it in a way that makes the resulting m x m matrix as close to triangular as possible? as sparse as possible? Any comments, references or code is welcome. Regards, Jeffrey Horn
Technical Details
Message-ID:
<1992Aug10.145140.12541@schaefer.math.wisc.edu>Path:
arc1-ca.pugleaf.net!sparky!uunet!cis.ohio-state.edu!zaphod.mps.ohio-state.edu!darwin.sura.net!wupost!uwm.edu!daffy!uwvax!zazen!schaefer.math.wisc.edu!hornShow Full Headers
Complete Article Headers
Newsgroups: sci.math.num-analysis Path: arc1-ca.pugleaf.net!sparky!uunet!cis.ohio-state.edu!zaphod.mps.ohio-state.edu!darwin.sura.net!wupost!uwm.edu!daffy!uwvax!zazen!schaefer.math.wisc.edu!horn From: horn@schaefer.math.wisc.edu (Jeffrey Horn) Subject: Crashing a Basis Message-ID: <1992Aug10.145140.12541@schaefer.math.wisc.edu> Organization: Univ. of Wisconsin Dept. of Mathematics Date: Mon, 10 Aug 92 14:51:40 GMT Lines: 12