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)

• A fast direct solver for structured linear systems by recursive skeletonization
• Bayesian treed Gaussian process models with an application to computer modeling
• 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?)
• Design, implementation and testing of extended and mixed precision BLAS
• PoLAPACK: Parallel factorization routines with algorithmic blocking
• 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?)
• 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
• 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?)
• Reconfigurable computing. The theory and practice of FPGA-based computation.
• Combinatorial optimization of matrix-vector multiplication in finite element assembly
• 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
• Emmerald: a fast matrix–matrix multiply using Intel's SSE instructions
• On the effect of linear algebra implementations in real-time multibody system dynamics
• Formal derivation of algorithms
• The science of deriving dense linear algebra algorithms
• R-Kleene: a high-performance divide-and-conquer algorithm for the all-pair shortest path for densely connected networks
• The shifted number system for fast linear algebra on integer matrices
• FFPACK
• A novel parallel QR algorithm for hybrid distributed memory HPC systems
• Automating the finite element method
• OpenMX 2.0: extended structural equation and statistical modeling
• EdgePack: A Parallel Vertex and Node Reordering Package for Optimizing Edge-Based Computations in Unstructured Grids
• Communication lower bounds for distributed-memory matrix multiplication
• A generic topology library
• Optimization of algorithms with OPAL
• Algorithm 1005
• Title not available (Why is that?)
• Title not available (Why is that?)
• A new numerical method for nonlocal electrostatics in biomolecular simulations
• Quantum Monte Carlo on graphical processing units
• Optimal cache-oblivious mesh layouts
• Optimizations and OpenMP implementation for the direct simulation Monte Carlo method
• Iterative algorithms to approximate canonical Gabor windows: Computational aspects
• Parallel direct Poisson solver for discretisations with one Fourier diagonalisable direction
• Parallel direct methods for solving the system of linear equations with pipelining on a multicore using OpenMP
• The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
• Newton-Krylov continuation of periodic orbits for Navier-Stokes flows
• Exploiting semidefinite relaxations in constraint programming
• Knowledge-based automatic generation of partitioned matrix expressions
• Anatomy of high-performance matrix multiplication
• Optimal block-tridiagonalization of matrices for coherent charge transport
• Title not available (Why is that?)
• Logic program specialisation through partial deduction: Control issues
• Optimization techniques for small matrix multiplication
• The lifted Newton method and its application in optimization
• An efficient parallel and fully implicit algorithm for the simulation of transient free-surface flows of multimode viscoelastic liquids
• The cache-oblivious Gaussian elimination paradigm: Theoretical framework, parallelization and Experimental evaluation
• ATLAS: a real-space finite-difference implementation of orbital-free density functional theory
• Algebraic Cryptanalysis
• Reducing floating point error in dot product using the superblock family of algorithms
• 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

This page was built for software: ATLAS