A new look at expression templates for matrix computation

Computing in Science and Engineering

Volumn 5, Issue 3, 2003, Pages 66-70

  Kirby, Robert C ^a  

^a THE UNIVERSITY OF CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CACHE MEMORY; CODES (SYMBOLS); FUNCTIONS; MATHEMATICAL OPERATORS; MATHEMATICAL PROGRAMMING; MATRIX ALGEBRA; NATURAL SCIENCES COMPUTING; PROGRAM COMPILERS; SEMANTICS; STORAGE ALLOCATION (COMPUTER); SUBROUTINES;

FUNCTIONAL PROGRAMMING; PROGRAM TEMPLATES;

OBJECT ORIENTED PROGRAMMING;

EID: 0038220973     PISSN: 15219615     EISSN: None     Source Type: Journal    
DOI: 10.1109/MCISE.2003.1196309     Document Type: Article

References (5)

1. S.W. Haney, "Is C++ Fast Enough for Scientific Computing?" Computers in Physics, vol. 8, no. 6, 1994, pp. 690-695.
2. S.W. Haney, "Beating the Abstraction Penalty in C++ Using Expression Templates," Computers in Physics, vol. 10, no. 6, 1996, pp. 552-557.
3. A.D. Robison, "C++ Gets Faster for Scientific Computing?" Computers in Physics, vol. 10, no. 6, 1996, pp. 458-462.
4. T. Veldhuizen, "Arrays in Blitz++," 2nd Int'l Scientific Computing in Object Oriented Parallel Environments (ISCOPE '98), Springer-Verlag, 1998; www.oonumerics.org/blitz.
5. G. Golub and C. van Loan, Matrix Computations, Johns Hopkins Univ. Press, 1996.