Solving linear recurrence systems using level 2 and 3 BLAS routines

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

Volumn 3019, Issue , 2004, Pages 1059-1066

  Stpiczyński, Przemysław ^a  

^a MARIA CURIE SK ODOWSKA UNIVERSITY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

ALGORITHM FOR SOLVING; CLUSTERS OF WORKSTATIONS; CONSTANT COEFFICIENTS; DISTRIBUTED MEMORY MACHINES; ITS EFFICIENCIES; LEVEL 2; LINEAR RECURRENCES; PENTIUM;

ARTIFICIAL INTELLIGENCE;

EID: 84952311180     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24669-5_137     Document Type: Conference Paper

References (15)

1. Intel Fortran programmer’s manual. (http://www.intel.com)
2. Intel Math Kernel Library. reference manual. (http://www.intel.com)
3. Baker, A., Dennis, J., Jessup, E.R.: Toward memory-efficient linear solvers. Lecture Notes in Computer Science 2565 (2003) 315-238
4. Bario, R., Melendo, B., Serrano, S.: On the numerical evaluation of linear recurrences. J. Comput. Appl. Math. 150 (2003) 71-86
5. Dongarra, J., Duff, I., Sorensen, D., Van der Vorst, H.: Solving Linear Systems on Vector and Shared Memory Computers. SIAM, Philadelphia (1991)
6. Dongarra, J., Hammarling, S., Sorensen, D.: Block reduction of matrices to condensed form for eigenvalue computations. J. Comp. Appl. Math 27 (1989) 215-227
7. Larriba-Pey, J.L., Navarro, J.J., Jorba, A., Roig, O.: Review of general and Toeplitz vector bidiagonal solvers. Parallel Computing 22 (1996) 1091-1126
8. Murli, A., Rizzardi, M.: Algorithm 682: Talbot’s method for the Laplace inversion problem. ACM Trans. Math. Soft. 16 (1990) 158-168
9. Paprzycki, M., Stpiczyński, P.: Parallel solution of linear recurrence systems. Z. Angew. Math. Mech. 76 (1996) 5-8
10. Stoer, J., Bulirsh, R.: Introduction to Numerical Analysis. 2nd edn. Springer, New York (1993)
11. Stpiczyński, P.: Parallel algorithms for solving linear recurrence systems. Lecture Notes in Computer Science 634 (1992) 343-348
12. Stpiczyński, P.: Efficient data-parallel algorithms for computing trigonometric sums. Ann. Univ. Mariae Curie-Sklodowska Sect. A 56 (2002) 85-96
13. Stpiczyński, P.: Fast parallel algorithms for computing trigonometric sums. In Tudruj, M., Jordan, A., eds.: Proceedings of PARELEC 2002 - International Conference on Parallel Computing in Electrical Engineering, IEEE Computer Society Press (2002) 299-304
14. Stpiczyński, P.: A new message passing algorithm for solving linear recurrence systems. Lecture Notes in Computer Science 2328 (2002) 466-473
15. Van Der Vorst, H.A., Dekker, K.: Vectorization of linear recurrence relations. SIAM J. Sci. Stat. Comput. 16 (1989) 27-35