66
Views
15
CrossRef citations to date
0
Altmetric
Original Articles

Semi-optimal bases for linear dependencies

Pages 1-4 | Received 20 Mar 1984, Published online: 30 May 2007
 

Abstract

Let A be an m × n matrix of real or complex numbers, and let μ. be a given constant ≥ 1. If A has rank m, it is possible to choose m columns of A such that, if B is the m × m matrix formed by these m columns, all entries of B −1 A are less than or equal to μ in absolute value. Moreover, if μ > 1, it is possible to find m such columns in a number of steps that is polynomial in m and n and inversely proportional to log μ.

*This research was supported in part by National Science Foundation grant MCS 83-00984.

*This research was supported in part by National Science Foundation grant MCS 83-00984.

Notes

*This research was supported in part by National Science Foundation grant MCS 83-00984.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.