DocumentCode :
922298
Title :
An overlaying technique for solving linear equations in real-time computing
Author :
Berkovich, Simon Y.
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., George Washington Univ., Washington, DC, USA
Volume :
42
Issue :
5
fYear :
1993
fDate :
5/1/1993 12:00:00 AM
Firstpage :
513
Lastpage :
517
Abstract :
A computer organization for solving a continuous stream of sets of linear equations A×b with relatively close consecutive parameters is described. The conditions of closeness enabling this technique are monitored during the computations. The cycles of the computational process are divided into two stages: finding a solution of a current set of linear equations by multiplying components of a polynomial approximation of the inverse matrix by a right-hand-side vector; and calculating this inverse matrix in order to arrange for an approximation of the next inverse matrix. The former procedure can be performed in O(n2) operations, reducing the time for obtaining the solution of linear equations. The more lengthy calculation of the inverse itself, which requires O(n3) operations, can overlay the preparation of the upcoming set of equations in the next cycle. The approach can be effectively utilized for organization of real-time computations
Keywords :
computational complexity; matrix algebra; real-time systems; close consecutive parameters; computational process; computer organization; inverse matrix; linear equations; overlaying technique; polynomial approximation; real-time computations; real-time computing; Computerized monitoring; Concurrent computing; Condition monitoring; Iterative methods; Nonlinear equations; Parallel processing; Polynomials; Real time systems; Steady-state; Vectors;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/12.223670
Filename :
223670
Link To Document :
بازگشت