SPIRAL

swMATH903MaRDI QIDQ13647FDOQ13647

Author name not available (Why is that?)

Cited In (44)

• A Rewriting System for the Vectorization of Signal Transforms
• Title not available (Why is that?)
• A Program Generator for Intel AES-NI Instructions
• Title not available (Why is that?)
• Multi-stage programming with functors and monads: eliminating abstraction overhead from generic code
• High performance implementation of the TFT
• Case Studies in Model Manipulation for Scientific Computing
• Knowledge-Based Automatic Generation of Partitioned Matrix Expressions
• MULTI-LEARNER BASED RECURSIVE SUPERVISED TRAINING
• BLIS: a framework for rapidly instantiating BLAS functionality
• An optimizing compiler for parallel chemistry simulations
• Computing one billion roots using the tangent Graeffe method
• Automatic derivation and implementation of signal processing algorithms
• DFTI---a new interface for Fast Fourier Transform libraries
• Unified Embedded Parallel Finite Element Computations via Software-Based Fréchet Differentiation
• Applying Automated Memory Analysis to Improve Iterative Algorithms
• Automatic generation of fast algorithms for matrix–vector multiplication
• Geometric Optimization of the Evaluation of Finite Element Matrices
• 10.1162/jmlr.2003.3.4-5.887
• Automatic derivation and implementation of fast convolution algorithms
• Symmetry-based matrix factorization
• TSFC: A Structure-Preserving Form Compiler
• Design and Implementation of Adaptive SpMV Library for Multicore and Many-Core Architecture
• In search of a program generator to implement generic transformations for high-performance computing
• Title not available (Why is that?)
• Linnea
• Languages and Compilers for Parallel Computing
• Generating C. System description
• Adaptive Winograd's matrix multiplications
• mARGOt: A Dynamic Autotuning Framework for Self-Aware Approximate Computing
• Reliable generation of high-performance matrix algebra
• Exploiting parallelism in matrix-computation kernels for symmetric multiprocessor systems
• Automatic Parallel Library Generation for General-Size Modular FFT Algorithms
• Title not available (Why is that?)
• Daubechies wavelets for high performance electronic structure calculations: the BigDFT project
• An efficient time-step-based self-adaptive algorithm for predictor-corrector methods of Runge-Kutta type
• The “Seven Dwarfs” of Symbolic Computation
• Resilient Distributed Field Estimation
• Simultaneous Conversions with the Residue Number System Using Linear Algebra
• Functional and dynamic programming in the design of parallel prefix networks
• Decomposing monomial representations of solvable groups.
• Automated FEM discretizations for the Stokes equation
• Distribution of a class of divide and conquer recurrences arising from the computation of the Walsh-Hadamard transform
• Fast arithmetic for triangular sets: from theory to practice

This page was built for software: SPIRAL