SPIRAL
From MaRDI portal
SPIRAL Q13647
Cited in
(81)- Fast arithmetic for triangular sets: from theory to practice
- ATLAS
- Dagwood
- DFTI
- FLAME
- QUAFF
- DxTer
- rSQP++
- GEMMW
- UHFFT
- FFTW
- PHiPAC
- PAPI
- Decomposing monomial representations of solvable groups.
- modpn
- OSKI
- Analysa
- BER MetaOCaml
- PLuTo
- DynTile
- Generating C. System description
- cl1ck
- Algorithm 679
- In search of a program generator to implement generic transformations for high-performance computing
- AREP
- crs
- scientific article; zbMATH DE number 1728266 (Why is no real title available?)
- BLIS: a framework for rapidly instantiating BLAS functionality
- Reliable generation of high-performance matrix algebra
- The ``Seven Dwarfs of symbolic computation
- Camlp4
- Adaptive Winograd's matrix multiplications
- Exploiting parallelism in matrix-computation kernels for symmetric multiprocessor systems: matrix-multiplication and matrix-addition algorithm optimizations by software pipelining and threads allocation
- Functional and dynamic programming in the design of parallel prefix networks
- A program generator for Intel AES-NI instructions
- Knowledge-based automatic generation of partitioned matrix expressions
- Algorithm 784
- Resilient distributed field estimation
- Strymonas
- High performance implementation of the TFT
- DFTI---a new interface for Fast Fourier Transform libraries
- Applying Automated Memory Analysis to Improve Iterative Algorithms
- Petabricks
- Terra
- Formal semantics applied to the implementation of a skeleton-based parallel programming library
- CTF
- dijitso
- CIRFE
- MatchPy
- SAGE
- SMATER
- pOSKI
- TSFC: A Structure-Preserving Form Compiler
- Simultaneous conversions with the residue number system using linear algebra
- Design and implementation of adaptive SpMV library for multicore and many-core architecture
- Automatic generation of fast algorithms for matrix–vector multiplication
- 10.1162/jmlr.2003.3.4-5.887
- Automatic derivation and implementation of signal processing algorithms
- Linnea
- Computing one billion roots using the tangent Graeffe method
- Automatic parallel library generation for general-size modular FFT algorithms
- Unified embedded parallel finite element computations via software-based Fréchet differentiation
- MulticoreBSP
- mARGOt: A Dynamic Autotuning Framework for Self-Aware Approximate Computing
- Recent progress and applications in group FFTs
- MULTI-LEARNER BASED RECURSIVE SUPERVISED TRAINING
- Generating symmetric DFTs and equivariant FFT algorithms
- Multi-stage programming with functors and monads: eliminating abstraction overhead from generic code
- Geometric Optimization of the Evaluation of Finite Element Matrices
- A Rewriting System for the Vectorization of Signal Transforms
- Case Studies in Model Manipulation for Scientific Computing
- Daubechies wavelets for high performance electronic structure calculations: the BigDFT project
- Languages and Compilers for Parallel Computing
- Symmetry-based matrix factorization
- Automatic derivation and implementation of fast convolution algorithms
- SpMV
- tangent Graeffe
- An efficient time-step-based self-adaptive algorithm for predictor-corrector methods of Runge-Kutta type
- Distribution of a class of divide and conquer recurrences arising from the computation of the Walsh-Hadamard transform
- An optimizing compiler for parallel chemistry simulations
- Automated FEM discretizations for the Stokes equation
This page was built for software: SPIRAL
