Skip to main content
Log in

Parallel factorization of banded linear matrices using a systolic array processor

  • Published:
Advances in Computational Mathematics Aims and scope Submit manuscript

Abstract

A parallel algorithm for calculating theQR factorization of a banded system of linear equations using a systolic array processor is presented and an application to spline fitting is given. The major advantage of the method is that the size of the processor array is fixed by the size of the bandwidth of the system to be solved. This allows the factorization of large systems using small systolic arrays. The cost of the method, in terms of storage and time, is optimal.

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. I.J. Anderson, M.G. Cox, S.K. Harbour and J.C. Mason, Implementation on a shared memory parallel computer of algorithms for approximating data on a family of parallel lines, in:Wavelets, Images and Surface Fitting, eds. A. Le Méhauté, P.J. Laurent and L.L. Schumaker (A.K. Peters, Wellesley, MA, 1994) pp. 11–20.

    Google Scholar 

  2. I.J. Anderson, M.G. Cox and J.C. Mason, Tensor-product spline interpolation to data on or near a family of lines, Numerical Algorithms 5 (1993) 193–204.

    MathSciNet  Google Scholar 

  3. I.J. Anderson and S.K. Harbour, Parallel factorization of banded linear systems, Technical Report RR9402, School of Computing and Mathematics, University of Huddersfield, Huddersfield, UK (1994).

    Google Scholar 

  4. I.J. Anderson, Efficient multivariate approximation for large sets of structured data, PhD thesis, University of Huddersfield, UK (1994).

    Google Scholar 

  5. Å. Björck,Least Squares Methods: Handbook of Numerical Analysis. Vol. 1: Solution of Equations inN (Elsevier/North-Holland, 1988).

  6. M.G. Cox, The numerical evaluation of a spline from its B-spline representation, J. Inst. Math. Appl. 21 (1978) 135–143.

    Google Scholar 

  7. M.G. Cox, The least squares solution of overdetermined linear equations having band or augmented band structure, IMA J. Numer. Anal. 1 (1981) 3–22.

    Google Scholar 

  8. T.L. Freeman and C. Phillips,Parallel Numerical Algorithms (Prentice-Hall, Englewood Cliffs, NJ, 1992).

    Google Scholar 

  9. W.M. Gentleman and H.T. Kung, Matrix triangularization by systolic arrays, Proc. Soc. Photooptical Instrumentation Engineers 298 (1981) 19–26.

    Google Scholar 

  10. G.H. Golub and C.F. Van Loan,Matrix Computations (North Oxford Academic, Oxford, 1989).

    Google Scholar 

  11. MathWorks Inc.,MATLAB Reference Guide (The Math Works Inc., Natick, MA, USA, 1992).

    Google Scholar 

  12. J.V. McCanny and J.G. McWhirter, Some systolic array developments in the United Kingdom, Computer (1987) 51–63.

  13. P. Quinton and Y. Robert,Systolic Algorithms and Architectures (Prentice Hall, Englewood Cliffs, NJ, 1991).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by M. G. Cox

Rights and permissions

Reprints and permissions

About this article

Cite this article

Anderson, I.J., Harbour, S.K. Parallel factorization of banded linear matrices using a systolic array processor. Adv Comput Math 5, 1–14 (1996). https://doi.org/10.1007/BF02124732

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation