Skip to main content
Log in

Parallel Iterative Schemes of Linear Algebra with Application to the Stability Analysis of Solutions of Systems of Linear Differential Equations

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

Parallel modifications of linear iteration schemes are proposed that are used to solve systems of liner algebraic equations and to achieve the time complexity equal to T = log2 k · O(log2 n), where k is the number of iterations of an original scheme and n is the dimension of a system. Such schemes are extended to the case of approximate solution of systems of linear differential equations with constant coefficients. Based on them and using a program, the stability of solutions in the Lyapunov sense is analyzed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

REFERENCES

  1. B. P. Demidovich and A. I. Maron, Fundamentals of Computational Mathematics [in Russian], Fizmatgiz, Moscow (1963).

    Google Scholar 

  2. V. Strassen, “Gaussian elimination is not optimal,” Numer. Math., 13, No. 4, 354–356 (1969).

    Google Scholar 

  3. D. Bini, M. Capovani, F. Romani, and G. Lotti, “On O n () 2.7799 complexity for n×n approximate matrix multiplication,” Inform. Proc. Lett., 8, No. 5, 234–235 (1979).

    Google Scholar 

  4. V. I. Solodovnikov, “Upper estimates of complexity of solving systems of linear equations,” in: Theory of Complexity of Computations. I, Proceedings of Scientific Seminars, LOMI of Acad. of Sci. of the USSR, 118, Leningrad (1982), pp. 159–187.

    Google Scholar 

  5. V. N. Faddeyeva and D. K. Faddeyev, “Parallel computations in linear algebra. I,” Kibernetika, No. 6, 28–40 (1977).

    Google Scholar 

  6. V. N. Faddeyeva and D. K. Faddeyev, “Parallel computations in linear algebra. II,” Kibernetika, No. 3, 18–31 (1982).

    Google Scholar 

  7. I. N. Molchanov and M. F. Yakovlev, “Conditions of termination of iterative processes that guarantee a specified accuracy,” Dokl. AN UkrSSR, Ser. A, No. 6, 21–23 (1980).

    Google Scholar 

  8. Ya. E. Romm, “Speedup of linear stationary iteration processes in multiprocessor computers. I,” Kibernetika, No. 1, 47–54 (1982).

    Google Scholar 

  9. Ya. E. Romm, “Acceleration of linear stationary iterative processes in multiprocessor computers. II,” Kibernetika, No. 3, 64–67 (1982).

    Google Scholar 

  10. Ya. E. Romm, “Conflict-free and stable methods of deterministic parallel processing,” Doctoral Dissertation on Engineering Sciences, TRTU, Taganrog (1998); VNTI Tsentr, No. 05.990.001006.

  11. Ya. E. Romm, Parallel Iterative Methods of Solving Systems of Linear Algebraic Equations with a Logarithmic Number of Iterations [in Russian], pmIzd. TGPI (2000).

  12. M. V. Gavrilkevich and V. I. Solodovnikov, “Efficient algorithms for solution of problems of linear algebra over a field consisting of two elements,” Review of Applied and Industrial Mathematics, 2, No. 3, 399–439 (1995).

    Google Scholar 

  13. I. F. Surzhenko and Ya. E. Romm, “Machine error of parallel algorithms,” Kibernetika, No. 2, 19–26 (1988).

    Google Scholar 

  14. I. S. Berezin and N. G. Zhidkov, Methods of Calculations [in Russian], Vol. 1, Nauka, Moscow (1970).

    Google Scholar 

  15. H. S. Stone, “One-pass compilation of an arithmetic expression for a parallel processor,” Commun. ACM, 10, No. 4, 220–223 (1967).

    Google Scholar 

  16. Ya. E. Romm and S. A. Firsova, “A numerical experiment in tabular-algorithmic approximation of a function by a Fourier series,” TGPI, Taganrog (2001); Deposited at VINITI 13.02.01, No. 362-V2001.

  17. A. A. Samarskii, Introduction to Numerical Methods [in Russian], Nauka, Moscow (1982).

    Google Scholar 

  18. L. Cesari, Asymptotic Behavior and Stability of Problems in Ordinary Differential Equations [Russian translation], Mir, Moscow (1964).

    Google Scholar 

  19. N. M. Matveyev, Methods of Integration of Ordinary Differential Equations [in Russian], Izd. LGU, Leningrad (1955).

    Google Scholar 

  20. D. Kershaw, “Solution of a three-diagonal system of linear equations and vectorization of the algorithm of conjugate gradients with changing conditions with the help of incomplete Cholesky factorization on a CRAY-1 computer,” in: G. Rodriga (ed), Parallel Computations, Nauka, Moscow (1986), pp. 88–101.

    Google Scholar 

  21. Xu Ping and Li Lei, “A new method for solving linear equations,” Yinguong Shuxue = Math. Appl., 8, No. 2, 187–191 (1995).

    Google Scholar 

  22. K. Jbilou and H. Sadok, “Analysis of some vector extrapolation methods for solving systems of linear equations,” Numer. Math., 70, No. 1, 73–80 (1995).

    Google Scholar 

  23. F. B. Weissler, “Some remarks concerning iterative methods for linear systems,” SIAM J. Matrix Anal. and Appl., 16, No. 2, 675–687 (1995.)

    Google Scholar 

  24. Chi Xue-bin, “Parallell solving linear systems on a hierarchy memory multiprocessor,” Jisuan Shuxue = Math. Numer. Sin., 17, No. 2, 210–217 (1995).

    Google Scholar 

  25. J. Mikloshko, Synteta a Analyza Efektivnych Numerickych Algoritmov, VEDA (1979).

  26. Y. Wallach and V. Konrad, “On block-parallel methods for solving linear equations,” IEEE Trans. on Comput., 29, No. 5, 354–359 (1980).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Romm, Y.E. Parallel Iterative Schemes of Linear Algebra with Application to the Stability Analysis of Solutions of Systems of Linear Differential Equations. Cybernetics and Systems Analysis 40, 565–586 (2004). https://doi.org/10.1023/B:CASA.0000047878.21086.e9

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:CASA.0000047878.21086.e9

Navigation