2003/02/19 by Volodymyr Myrnyy, Myrnyy, Volodymyr
Computer Science · Mathematics · #Algebra over a field #Algorithm #Artificial intelligence #Computer science #Distributed and Parallel Computing Systems #Embedded Systems Design Techniques #Expression (computer science) #FOS: Computer and information sciences #Function (biology) #G.4 #Geometry #I.1.2 #I.1.3 #Linear algebra #Mathematical Software (cs.MS) #Mathematics #Object (grammar) #Parallel Computing and Optimization Techniques #Parallel computing #Programming Languages (cs.PL) #Programming language #Pure mathematics #Recursion (computer science) #Template #Theoretical computer science #cs.MS #cs.PL
paper · pdf · doi:10.48550/arxiv.cs/0302026
Latex2e, 8 pages, 3 figures
arxiv created 2003/02/19 · openalex publication_date 2003/02/19 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
The article deals with a kind of recursive function templates in C++, where the recursion is realized corresponding template parameters to achieve better computational performance. Some specialization of these template functions ends the recursion and can be implemented using optimized hardware dependent or independent routines. The method is applied in addition to the known expression templates technique to solve linear algebra expressions with the help of the BLAS library. The whole implementation produces a new library, which keeps object-oriented benefits and has a higher computational speed represented in the tests.