The following pages link to SPIRAL (Q13647):
Displaying 44 items.
- Multi-stage programming with functors and monads: eliminating abstraction overhead from generic code (Q532398) (← links)
- Daubechies wavelets for high performance electronic structure calculations: the BigDFT project (Q553221) (← links)
- Symmetry-based matrix factorization (Q597055) (← links)
- Automatic derivation and implementation of fast convolution algorithms (Q597062) (← links)
- An efficient time-step-based self-adaptive algorithm for predictor-corrector methods of Runge-Kutta type (Q645734) (← links)
- Distribution of a class of divide and conquer recurrences arising from the computation of the Walsh-Hadamard transform (Q818111) (← links)
- An optimizing compiler for parallel chemistry simulations (Q842842) (← links)
- Automated FEM discretizations for the Stokes equation (Q943933) (← links)
- Fast arithmetic for triangular sets: from theory to practice (Q1025397) (← links)
- Decomposing monomial representations of solvable groups. (Q1867001) (← links)
- Generating C. System description (Q2163158) (← links)
- In search of a program generator to implement generic transformations for high-performance computing (Q2507772) (← links)
- (Q2779295) (← links)
- BLIS: a framework for rapidly instantiating BLAS functionality (Q2828133) (← links)
- Reliable generation of high-performance matrix algebra (Q2828141) (← links)
- The “Seven Dwarfs” of Symbolic Computation (Q2912116) (← links)
- Adaptive Winograd's matrix multiplications (Q2989058) (← links)
- Exploiting parallelism in matrix-computation kernels for symmetric multiprocessor systems (Q2989138) (← links)
- Functional and dynamic programming in the design of parallel prefix networks (Q3021416) (← links)
- A Program Generator for Intel AES-NI Instructions (Q3058735) (← links)
- Knowledge-Based Automatic Generation of Partitioned Matrix Expressions (Q3090898) (← links)
- Resilient Distributed Field Estimation (Q3300776) (← links)
- High performance implementation of the TFT (Q3452412) (← links)
- DFTI---a new interface for Fast Fourier Transform libraries (Q3507304) (← links)
- Applying Automated Memory Analysis to Improve Iterative Algorithms (Q3525962) (← links)
- (Q3601069) (← links)
- TSFC: A Structure-Preserving Form Compiler (Q4569311) (← links)
- Simultaneous Conversions with the Residue Number System Using Linear Algebra (Q4581392) (← links)
- Design and Implementation of Adaptive SpMV Library for Multicore and Many-Core Architecture (Q4611317) (← links)
- Automatic generation of fast algorithms for matrix–vector multiplication (Q4641573) (← links)
- 10.1162/jmlr.2003.3.4-5.887 (Q4656014) (← links)
- Automatic derivation and implementation of signal processing algorithms (Q4810181) (← links)
- Linnea (Q5025207) (← links)
- Computing one billion roots using the tangent Graeffe method (Q5102031) (← links)
- Automatic Parallel Library Generation for General-Size Modular FFT Algorithms (Q5168478) (← links)
- Unified Embedded Parallel Finite Element Computations via Software-Based Fréchet Differentiation (Q5200253) (← links)
- mARGOt: A Dynamic Autotuning Framework for Self-Aware Approximate Computing (Q5228942) (← links)
- (Q5290331) (← links)
- MULTI-LEARNER BASED RECURSIVE SUPERVISED TRAINING (Q5294609) (← links)
- (Q5301670) (← links)
- Geometric Optimization of the Evaluation of Finite Element Matrices (Q5453564) (← links)
- A Rewriting System for the Vectorization of Signal Transforms (Q5503808) (← links)
- Case Studies in Model Manipulation for Scientific Computing (Q5505487) (← links)
- Languages and Compilers for Parallel Computing (Q5714206) (← links)
