Title :
Minimax algorithm for matrix inversion
Author :
Corral, Celestino A.
Author_Institution :
Div. of Electron. Syst., Sci.-Atlanta Inc., GA, USA
Abstract :
This paper introduces a minimax algorithm for obtaining the inverse of a non-singular matrix. Unlike the classical iterative methods barred on affine transformations of the defining vector equation, the proposed method establishes a set of linear constraints based on the matrix supremum norm and then uses the simplex method of linear programming in an iterative process to compute the inverse. Properties of the minimax algorithm an described and an illustrative example of the proposed method is presented
Keywords :
iterative methods; linear programming; matrix inversion; minimax techniques; iterative process; linear constraints; linear programming; matrix supremum norm; minimax algorithm; nonsingular matrix inversion; simplex method; Convergence; Equations; Gaussian processes; Iterative algorithms; Iterative methods; Jacobian matrices; Linear programming; Matrix converters; Minimax techniques; Vectors;
Conference_Titel :
Circuits and Systems, 1996. ISCAS '96., Connecting the World., 1996 IEEE International Symposium on
Conference_Location :
Atlanta, GA
Print_ISBN :
0-7803-3073-0
DOI :
10.1109/ISCAS.1996.540367
