ATLAS

swMATH56MaRDI QIDQ12829FDOQ12829

Author name not available (Why is that?)

Described by source

• Automated empirical optimizations of software and the ATLAS project

Cited In (only showing first 100 items - show all)

• Multi-core CPUs, clusters, and grid computing: A tutorial
• Recursive Blocked Algorithms and Hybrid Data Structures for Dense Matrix Library Software
• Block algorithms for reordering standard and generalized Schur forms
• A recursive formulation of Cholesky factorization of a matrix in packed storage
• Title not available (Why is that?)
• Combined selection of tile sizes and unroll factors using iterative compilation
• Computer algebra systems - new strategies and techniques
• Reducing and vectorizing procedures for telescoping languages
• A note on probabilistic models over strings: the linear algebra approach
• Mathematical software: Past, present, and future
• The design and implementation of a new out-of-core sparse cholesky factorization method
• Title not available (Why is that?)
• Optimizing Local Performance in HPF
• Transforming complex loop nests for locality
• Title not available (Why is that?)
• Scaling LAPACK panel operations using parallel cache assignment
• Title not available (Why is that?)
• Title not available (Why is that?)
• A method for the automatic selection and tuning of the parameters of a sparse SLE solver
• Large-Scale Scientific Computing
• The Singular Value Decomposition: Anatomy of Optimizing an Algorithm for Extreme Scale
• Characteristic cycles of highest weight Harish-Chandra modules for \(\mathrm{Sp}(2n,\mathbb{R})\)
• The retraction algorithm for factoring banded symmetric matrices
• A randomized blocked algorithm for efficiently computing rank-revealing factorizations of matrices
• Optimizing locality and scalability of embedded Runge-Kutta solvers using block-based pipelining
• Computational Science - ICCS 2004
• Geostatistical hierarchical model for temporally integrated radon measurements
• A Cache-Oblivious Sparse Matrix–Vector Multiplication Scheme Based on the Hilbert Curve
• Towards performance evaluation of high-performance computing on multiple Java platforms
• Parallel Processing and Applied Mathematics
• Adaptive Winograd's matrix multiplications
• Deterministic unimodularity certification
• When cache blocking of sparse matrix vector multiply works and why
• Benchmarking in data envelopment analysis: an approach based on genetic algorithms and parallel programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Improving memory performance of sorting algorithms
• An efficient time-step-based self-adaptive algorithm for predictor-corrector methods of Runge-Kutta type
• A fast semidirect least squares algorithm for hierarchically block separable matrices
• Improving the arithmetic intensity of multigrid with the help of polynomial smoothers
• Associated varieties for real reductive groups
• Cache oblivious matrix multiplication using an element ordering based on a Peano curve
• Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking
• Evaluation of novel wall function approach for supersonic flow problems involving separations induced by geometry and shocks
• Energy-efficient channel estimation in MIMO systems
• Title not available (Why is that?)
• A methodology pruning the search space of six compiler transformations by addressing them together as one problem and by exploiting the hardware architecture details
• IMF: An Incomplete Multifrontal $LU$-Factorization for Element-Structured Sparse Linear Systems
• A Parallel Divide and Conquer Algorithm for the Symmetric Eigenvalue Problem on Distributed Memory Architectures
• Title not available (Why is that?)
• Burnett spectral method for the spatially homogeneous Boltzmann equation
• Towards a fast parallel sparse symmetric matrix-vector multiplication
• Distribution of a class of divide and conquer recurrences arising from the computation of the Walsh-Hadamard transform
• Cache-Oblivious Sparse Matrix–Vector Multiplication by Using Sparse Matrix Partitioning Methods
• Error-free transformations of matrix multiplication by using fast routines of matrix multiplication and its applications
• Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
• Fast inclusion of interval matrix multiplication
• Simulation of unilateral constrained systems with many bodies
• Multi-stage programming with functors and monads: eliminating abstraction overhead from generic code
• The mimetic methods toolkit: an object-oriented API for mimetic finite differences
• Provably near-optimal solutions for very large single-row facility layout problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Design, implementation and testing of extended and mixed precision BLAS
• PoLAPACK: Parallel factorization routines with algorithmic blocking
• Knowledge-Based Automatic Generation of Partitioned Matrix Expressions
• Towards an efficient use of the BLAS library for multilinear tensor contractions
• Refining an approximate inverse
• BLIS: a framework for rapidly instantiating BLAS functionality
• NLO QCD corrections to \( {\text{t}}\overline{\text{t}} {\text{b}}\overline{\text{b}} \) production at the LHC: 2. Full hadronic results
• A Block Orthogonalization Procedure with Constant Synchronization Requirements
• A column pre-ordering strategy for the unsymmetric-pattern multifrontal method
• Elemental
• Randomized numerical linear algebra: Foundations and algorithms
• On the accuracy of finite-difference solutions for nonlinear water waves
• Title not available (Why is that?)
• The Lifted Newton Method and Its Application in Optimization
• An overview of the Advanced CompuTational Software (ACTS) collection
• Telescoping languages: A strategy for automatic generation of scientific problem-solving systems from annotated libraries
• Title not available (Why is that?)
• Geometric Optimization of the Evaluation of Finite Element Matrices
• Nodal discontinuous Galerkin methods on graphics processors
• Bayesian Treed Gaussian Process Models With an Application to Computer Modeling
• Locality of reference in sparse Cholesky factorization methods
• Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming
• Accurate computation of singular values in terms of shifted integrable schemes
• Computing discrete logarithms in the Jacobian of high-genus hyperelliptic curves over even characteristic finite fields
• Title not available (Why is that?)
• Title not available (Why is that?)
• Code Optimizations for Complex Microprocessors Applied to CFD Software
• Exploiting Symmetry in Tensors for High Performance: Multiplication with Symmetric Tensors
• Two-stage least squares and indirect least squares algorithms for simultaneous equations models
• Block splitting for distributed optimization
• Optimizing the Evaluation of Finite Element Matrices
• Accelerating a particle-in-cell simulation using a hybrid counting sort
• FLAME
• SIMPLE AND EFFECTIVE C++ MATRIX–VECTOR LIBRARY FOR NONPROFESSIONALS IN COMPUTER SCIENCE
• Gaussian elimination: a case study in efficient genericity with MetaOCaml
• In search of a program generator to implement generic transformations for high-performance computing

This page was built for software: ATLAS