Skip to main content
Log in

Abstract

In this paper we solve the Stein equationX+AXB=C, with A and B upper triangular matrices, by means of a bidimensional systolic array processor, independent of problem size. The problem is decomposed into two basic subproblems: the solution of an upper triangular system and a GAXPY operation. Then we obtain a size-dependent systolic algorithm by means of an appropriate chaining of the solutions of these subproblems. This systolic algorithm is transformed into a size-independent systolic array processor by using the Dense-to-Banded Transformation.

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. A.J. Laub, “Numerical linear algebra aspects of control design computations,”IEEE Trans. on Aut. Control, vol. AC-30, 1985, p. 97.

    Article  MathSciNet  Google Scholar 

  2. S. Barnett,Matrices in Control Theory, London: Van Nostrand Reinhold, 1971.

    MATH  Google Scholar 

  3. G.H. Golub and C. Van Loan,Matrix Computations, Baltimore: Johns Hopkins University Press, 1983.

    MATH  Google Scholar 

  4. N. Torralba and J.J. Navarro, “A one-dimensional systolic array to solve the QR iteration for matrices of any size,”Proceedings of the 36th ISMM Int. Conf. of Mini and Microcomputers and their Applications, June 1988.

  5. N. Torralba and J.J. Navarro, “A one-dimensional systolic array for solving arbitrarily large least mean square problems,”Proceedings of the Int. Conf. on Systolic Arrays, 1988, pp. 103–112.

  6. B. Kagström and P. Poromaa, “Distributed block algorithms for the triangular Sylvester equation with condition estimators,” inHypercube and Distributed Computers, (F. Andre and J.P. Verjas, eds.), North-Holland: Elsevier Science Publishers B.V., 1989, pp. 233–249.

    Google Scholar 

  7. B. Kagström, L. Nyströn, and P. Poromaa, “Parallel shared memory algorithms for the triangular Sylvester equation,” Report UMINF 155-88, Inst. of Information Processing, University of Umea, S-901 87 Umea, 1988.

  8. H.T. Kung and C.E. Leiserson, “Systolic arrays (for VLSI),” inIntroduction to VLSI Systems, sec. 8.3. (Mead and Conway, eds.), 1982.

  9. P. Quinton and Y. Robert,Algorithmes et Architectures Systoliques, (Ed. Masson), 1989.

  10. J.J. Navarro, J.M. Llaberia, and M. Valero, “Partitioning: an essential step in mapping algorithms into systolic array processors,”IEEE Computer, 1987, p. 77.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hueso, J.L., Martínez, G. & Hernández, V. A systolic algorithm for the triangular stein equation. J VLSI Sign Process Syst Sign Image Video Technol 5, 49–55 (1993). https://doi.org/10.1007/BF01880271

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01880271

Keywords

Navigation