A new message passing algorithm for solving linear recurrence systems

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

Volumn 2328, Issue , 2002, Pages 466-473

  Stpiczyński, Przemysław ^a  

^a MARIA CURIE SK ODOWSKA UNIVERSITY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; COMPUTER OPERATING SYSTEMS; LINEAR ALGEBRA;

ALGORITHM FOR SOLVING; BASIC LINEAR ALGEBRA SUBPROGRAMS; CLUSTERS OF WORKSTATIONS; CONSTANT COEFFICIENTS; DISTRIBUTED MEMORY MACHINES; DIVIDE-AND-CONQUER ALGORITHM; MESSAGE PASSING ALGORITHM; MESSAGE PASSING INTERFACE;

MESSAGE PASSING;

EID: 0346634151     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48086-2_51     Document Type: Conference Paper

References (15)

1. Dongarra, J., Duff, I., Sorensen, D., Van der Vorst, H.: Solving Linear Systems on Vector and Shared Memory Computers. SIAM, Philadelphia (1991)
2. Dongarra, J. J., Whaley, R. C.: LAPACK Working Note 94: A User’s Guide to the BLACS v 1.1, http://www.netlib.org/lapack/lawns
3. Geist, A., Beguelin, A., Dongarra, J., Jiang, W., Manchek, R., Sunderam, V.: PVM: A Users’ Guide and Tutorial for Networked Parallel Computing. MIT Press (1994)
4. Gropp, W., Lusk, E.: User’s Guide for mpich, a Portable Implementation of MPI Version 1.2.0, ftp://ftp.mcs.anl.gov/pub/mpi/userguide.ps
5. Modi, J.: Parallel Algorithms and Matrix Computations. Oxford University Press, Oxford (1988)
6. Paprzycki, M., Stpiczyński, P.: Solving linear recurrence systems on parallel computers. In: Proceedings of the Mardi Gras’94 Conference, Baton Rouge, Feb. 10–12, 1994. Nova Science Publishers, New York (1995) 379–384
7. P. Pacheco: Parallel Programming with MPI. Morgan Kaufmann, San Francisco (1996)
8. M. Paprzycki and P. Stpiczyński: Parallel solution of linear recurrence systems. Z. Angew. Math. Mech. 76(1996), Suppl. 2, 5-8
9. Stoer, J., Bulirsch, R.: Introduction to Numerical Analysis. 2nd edn. Springer, New York (1993)
10. Stpiczyński, P.: Parallel algorithms for solving linear recurrence systems. In: L. Bougé et al. (eds.): Lecture Notes in Computer Science, Vol. 634. Springer–Verlag, Berlin (1992) 343–348
11. Stpiczyński, P.: Efficient data parallel algorithms for computing trigonometric sums. Submitted to Ann. Univ. Mariae Curie-Skłodowska Sect. A
12. Stpiczyński, P., Paprzycki, M.: Parallel algorithms for finding trigonometric sums, In: D.H. Bailey et al. (eds.): Parallel Processing for Scientific Computing. SIAM, Philadelphia (1995) 291–292
13. Stpiczyński, P., Paprzycki, M.: Fully Vectorized Solver for Linear Recurrence Systems with Constant Coefficients. In: Proceedings of VECPAR 2000. Facultade de Engerharia do Universidade do Porto, Porto (2000) 541–551
14. Whaley, R. C.: LAPACK Working Note 73: Basic Linear Communication Algebra Subprograms: Analysis and Implementation Across Multiple Parallel Architectures, http://www.netlib.org/lapack/lawns
15. Whaley, R. C., Petitet, A., Dongarra, J. J.: Automated empirical optimizations of software and the ATLAS project. Parallel Comput. 27 (2001) 3–35