A CONCISE ALGORITHM TO SOLVE OVER-DETERMINED UNDER-DETERMINED LINEAR-SYSTEMS

被引:11
作者
LORD, EA
SEN, SK
VENKAIAH, VC
机构
[1] Indian Institute of Science, Bangalore
关键词
linear equations; linear programming; Moore- Penrose inverse; nonnegative solution of linear equations; projection operator;
D O I
10.1177/003754979005400503
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
An O(mn2) direct algorithm to compute a solution of a system of m linear equations Ax=b with n variables is presented. It is concise and matrix inversion- free. It provides an in-built consistency check and also produces the rank of the matrix A. Further, if necessary, it can prune the redundant rows of A and convert A into a full row rank matrix thus preserving the complete information of the system. In addition, the algo rithm produces the unique projection operator that projects the real (n)-dimensional space orthogonally onto the null space of A and that provides a means of computing a relative error bound for the solution vector as well as a nonnegative solution. © 1990, Sage Publications. All rights reserved.
引用
收藏
页码:239 / 240
页数:2
相关论文
共 2 条
[1]  
BENISRAEL A, 1974, GENERALIZED INVERSES
[2]  
FITZGERALD BKE, 1970, J RES NBS B MATH SCI, V74, P251