Numerical algorithms for high-performance computational science
From MaRDI portal
Publication:4993515
DOI10.1098/rsta.2019.0066zbMath1462.65231OpenAlexW2997728548WikidataQ92754272 ScholiaQ92754272MaRDI QIDQ4993515
Laura Grigori, Nicholas J. Higham, Jack J. Dongarra
Publication date: 15 June 2021
Published in: Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)
Full work available at URL: https://www.research.manchester.ac.uk/portal/en/publications/numerical-algorithms-for-highperformance-computational-science(688062da-5a17-40f4-bea1-b5393a7d88c1).html
computational mathematicsnumerical linear algebrafloating-point arithmeticrounding errorsnumerical algorithmshigh-performance computingapplied mathematicscomputer modelling and simulationexascale computer
Related Items
Exploiting higher computational efficiency index for computing outer generalized inverses, On the use of the infinity computer architecture to set up a dynamic precision floating-point arithmetic, TRAVOLTA: GPU acceleration and algorithmic improvements for constructing quantum optimal control fields in photo-excited systems, Designing CFD methods for bandwidth -- a physical approach, Iterative preconditioned methods in Krylov spaces: trends of the 21st century
Cites Work
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Tensor Decompositions and Applications
- Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
- Introduction to hierarchical matrices with applications.
- Communication lower bounds for distributed-memory matrix multiplication
- Handbook series linear algebra. Linear least squares solutions by Householder transformations
- Chaotic relaxation
- Enlarged Krylov Subspace Conjugate Gradient Methods for Reducing Communication
- On the Stability of Some Hierarchical Rank Structured Matrix Algorithms
- Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication
- A literature survey of low-rank tensor approximation techniques
- Communication-optimal Parallel and Sequential QR and LU Factorizations
- Computational Advertising: Techniques for Targeting Relevant Ads
- Hierarchical Matrices: Algorithms and Analysis
- Minimizing Communication in Numerical Linear Algebra
- Tensor Spaces and Numerical Tensor Calculus
- Accelerating Linear System Solutions Using Randomization Techniques
- CALU: A Communication Optimal LU Factorization Algorithm
- Solution of Simultaneous Linear Equations using a Magnetic-Tape Store
- Mixed Precision Block Fused Multiply-Add: Error Analysis and Application to GPU Tensor Cores
- Communication Avoiding Rank Revealing QR Factorization with Column Pivoting
- Distributed Orthogonal Factorization: Givens and Householder Algorithms
- An Accelerated Kernel-Independent Fast Multipole Method in One Dimension
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- LAPACK Users' Guide
- Error Analysis of Direct Methods of Matrix Inversion
- ScaLAPACK Users' Guide
- A New Analysis of Iterative Refinement and Its Application to Accurate Solution of Ill-Conditioned Sparse Linear Systems
- Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting
- Accelerating the Solution of Linear Systems by Iterative Refinement in Three Precisions
- Avoiding Communication in Primal and Dual Block Coordinate Descent Methods
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Stochastic rounding and reduced-precision fixed-point arithmetic for solving neural ordinary differential equations
- Hierarchical algorithms on hierarchical architectures
- The physics of numerical analysis: a climate modelling case study
- The future of computing beyond Moore’s Law
- Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions
- Squeezing a Matrix into Half Precision, with an Application to Solving Linear Systems
- PLASMA
- A New Approach to Probabilistic Rounding Error Analysis
- Scalable Linear Solvers Based on Enlarged Krylov Subspaces with Dynamic Reduction of Search Directions
- Simulating Low Precision Floating-Point Arithmetic
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Three-Precision GMRES-Based Iterative Refinement for Least Squares Problems
- Exploiting Lower Precision Arithmetic in Solving Symmetric Positive Definite Linear Systems and Least Squares Problems
- A fast algorithm for particle simulations
- Automated empirical optimizations of software and the ATLAS project
