Solving linear recurrence systems on a Cray Y-MP

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 879 LNCS, Issue , 1994, Pages 416-424

  Paprzycki, Marcin ^a   Stpiczyński, Przemysław ^b  

^a UNIVERSITY OF TEXAS OF THE PERMIAN BASIN   (United States)

^b MARIA CURIE SK ODOWSKA UNIVERSITY   (Poland)

Author keywords

Divide and conquer algorithms; Linear recurrence systems; Shared memory multiprocessors; Speedup

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

CONSTANT COEFFICIENTS; DIVIDE-AND-CONQUER ALGORITHM; LINEAR RECURRENCES; SHARED MEMORY MULTIPROCESSOR; SPEEDUP;

ARTIFICIAL INTELLIGENCE;

EID: 33749473655     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0030170     Document Type: Conference Paper

References (14)

1. A. Borodin and I. Munro, The computational complexity of algebraic and numerical problems (American Elsevier, New York 1975).
2. D. A. Carlson, Solving linear recurrence systems on mesh-connected computers with multiple global buses, J. Parallel and Distrib. Comput. 8(1990) 89–95.
3. S. -C. Chen, Speedup of iterative programs in multiprocessing systems. Dissertation, University of Illinois at Urbana 1975.
4. S. -C. Chen and D. J. Kuck, Time and parallel processor bounds for linear recurrence systems. IEEE Trans, on Computers 24(1975) 701–717.
5. J. Dongarra and L. Johnsson, Solving Banded Systems on Parallel Processor. Parallel Comput. 5(1987) 219–246.
6. D. Heller, A survey of parallel algorithms in numerical linear algebra. SIAM Review 20(1978) 740–777.
7. A. C. Greenberg, R. E. Lander, M. S. Paterson and Z. Galil, Efficient parallel algorithms for linear recurrence computation, Inf. Proc. Letters 15(1982) 31–35.
8. D. J. Kuck, Structure of Computers and Computations (Wiley, New York, 1978).
9. J. Modi, Parallel Algorithms and Matrix Computations (Oxford University Press, Oxford, 1988).
10. M. Paprzycki and I. Gladwell, Solving Almost Block Diagonal Systems on Parallel Computers. Parallel Comput. 17(1991) 133–153.
11. M. Paprzycki and P. Stpiczyński, Solving linear recurrence systems on parallel computers, Proceedings of the Mardi Gras ‘94 Conference, Baton Rouge, Feb. 10–12, 1994 (Nova Science Publishers, New York, 1994) — to appear.
12. P. Stpiczyński, Parallel algorithms for solving linear recurrence systems, in: L. Bougé et al. eds., Lecture Notes in Computer Science 634, (Springer-Verlag, Berlin, 1992) 343–348.
13. P. Stpiczyński, Error analysis of two parallel algorithms for solving linear recurrence systems, Parallel Comput. 19(1993) 917–923.
14. P. Stpiczyński, M. Paprzycki and R. Daniel, Parallel algorithm for solving linear recurrence sytems with constant coefficients, in preparation.