
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
S.Y. Berkovich, "An Overlaying Technique for Solving Linear Equations in RealTime Computing," IEEE Transactions on Computers, vol. 42, no. 5, pp. 513517, May, 1993.  
BibTex  x  
@article{ 10.1109/12.223670, author = {S.Y. Berkovich}, title = {An Overlaying Technique for Solving Linear Equations in RealTime Computing}, journal ={IEEE Transactions on Computers}, volume = {42}, number = {5}, issn = {00189340}, year = {1993}, pages = {513517}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.223670}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  An Overlaying Technique for Solving Linear Equations in RealTime Computing IS  5 SN  00189340 SP513 EP517 EPD  513517 A1  S.Y. Berkovich, PY  1993 KW  overlaying technique; realtime computing; computer organization; linear equations; close consecutive parameters; computational process; polynomial approximation; inverse matrix; realtime computations; computational complexity; matrix algebra; realtime systems. VL  42 JA  IEEE Transactions on Computers ER   
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 righthandside 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(n/sup 2/) operations, reducing the time for obtaining the solution of linear equations. The more lengthy calculation of the inverse itself, which requires O(n/sup 3/) operations, can overlay the preparation of the upcoming set of equations in the next cycle. The approach can be effectively utilized for organization of realtime computations.
[1] M. Quinn,Designing Efficient Algorithms for Parallel Computers. New York: McGrawHill, 1987.
[2] D. P. Bertsekas and J. N. Tsitsiklis,Parallel and Distributed Computations. Englewood Cliffs, NJ: PrenticeHall, 1989.
[3] A. Jennings,Matrix Compuatiaon for Engineers and Scientists. London: Wiley, 1977.
[4] G. H. Golub and C. F. Van Loan,Matrix Computations, 2nd ed. Baltimore, MD: Johns Hopkins Press, 1989.
[5] V. Pan and J. Reif, "Efficient parallel solution of linear systems," inProc. 17th ACM STOC, 1985, pp. 14352.
[6] O. Axelson, "A survey of preconditioned iterative methods for linear systems of algebraic equations,"BIT, vol. 25, pp. 166187, 1985.
[7] M. Stojcev, E. Milovanovic´, and I. Milovanovic´, "An algorithm for multiplication of concatenated matrices,"Parallel Comput., vol. 13, pp. 211223, 1990.
[8] P.L. Shaffer, "A Multiprocessor Implementationof RealTime Control for a Turbojet Engine,"IEEE Control Systems Magazine, Vol. 10, No. 4, June 1990, pp. 3842.