Partitioning And Tearing Applied To Cellular Array Processing
James W. Fawcett · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1982
Cellular arrays are regular structures of computing elements with fixed and simple modes of communication and control. they exhibit both parallel computation and pipelined data flow to achieve high performance for the execution of regular algebraic operations, as in matrix multiplication and solution of simultaneous linear equations. This paper is concerned with the use of partitioning and tearing algorithms to deal with problems which are not matched to the array size or have certain irregularities in structure. Lack of regularity may arise from a sparse model formulation or from irregularity in data flow, caused by pivoting failure during elimination. We provide specific algorithms for stable solution of partitioned linear equations, without conventional pivoting, and briefly discuss their use in efficiently handling sparse equation models.