Numerical algorithms for high-performance computational science
From MaRDI portal
Recommendations
- Challenges of future hardware development and consequences for numerical algorithms
- Editorial: Efficient algorithms for large scale scientific computations: introduction
- Some features of modern computational mathematics: problems and new generation of algorithms
- High-precision numerical simulations on a CUDA GPU: Kerr black hole tails
- scientific article; zbMATH DE number 4058726
Cites work
- scientific article; zbMATH DE number 1049353 (Why is no real title available?)
- A New Approach to Probabilistic Rounding Error Analysis
- A fast algorithm for particle simulations
- A literature survey of low-rank tensor approximation techniques
- A new analysis of iterative refinement and its application to accurate solution of ill-conditioned sparse linear systems
- Accelerating Linear System Solutions Using Randomization Techniques
- Accelerating the solution of linear systems by iterative refinement in three precisions
- An Accelerated Kernel-Independent Fast Multipole Method in One Dimension
- Automated empirical optimizations of software and the ATLAS project
- Avoiding Communication in Primal and Dual Block Coordinate Descent Methods
- CALU: A communication optimal LU factorization algorithm
- Chaotic relaxation
- Communication avoiding rank revealing QR factorization with column pivoting
- Communication lower bounds for distributed-memory matrix multiplication
- Communication lower bounds of bilinear algorithms for symmetric tensor contractions
- Communication-optimal parallel and sequential QR and LU factorizations
- Distributed Orthogonal Factorization: Givens and Householder Algorithms
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Enlarged Krylov subspace conjugate gradient methods for reducing communication
- Error Analysis of Direct Methods of Matrix Inversion
- Exploiting lower precision arithmetic in solving symmetric positive definite linear systems and least squares problems
- Exploiting multiple levels of parallelism in sparse matrix-matrix multiplication
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Handbook series linear algebra. Linear least squares solutions by Householder transformations
- Hierarchical algorithms on hierarchical architectures
- Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
- Hierarchical matrices: algorithms and analysis
- Introduction to hierarchical matrices with applications.
- LAPACK Users' Guide
- Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting
- Minimizing communication in numerical linear algebra
- Mixed precision block fused multiply-add: error analysis and application to GPU tensor cores
- On the stability of some hierarchical rank structured matrix algorithms
- PLASMA: Parallel linear algebra software for multicore using OpenMP
- ScaLAPACK Users' Guide
- Scalable linear solvers based on enlarged Krylov subspaces with dynamic reduction of search directions
- Simulating Low Precision Floating-Point Arithmetic
- Sketching as a tool for numerical linear algebra
- Solution of Simultaneous Linear Equations using a Magnetic-Tape Store
- Squeezing a Matrix into Half Precision, with an Application to Solving Linear Systems
- Stochastic rounding and reduced-precision fixed-point arithmetic for solving neural ordinary differential equations
- Tensor Decompositions and Applications
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Tensor spaces and numerical tensor calculus
- The future of computing beyond Moore's law
- The physics of numerical analysis: a climate modelling case study
- Three-precision GMRES-based iterative refinement for least squares problems
Cited in
(12)- scientific article; zbMATH DE number 19001 (Why is no real title available?)
- Energy aware performance study for a class of computationally intensive Monte Carlo algorithms
- TRAVOLTA: GPU acceleration and algorithmic improvements for constructing quantum optimal control fields in photo-excited systems
- Exploiting higher computational efficiency index for computing outer generalized inverses
- scientific article; zbMATH DE number 4133410 (Why is no real title available?)
- Designing CFD methods for bandwidth -- a physical approach
- Efficient numerical methods for large-scale scientific computations: introduction
- On the use of the infinity computer architecture to set up a dynamic precision floating-point arithmetic
- Accelerating scientific computations with mixed precision algorithms
- Iterative preconditioned methods in Krylov spaces: trends of the 21st century
- Challenges of future hardware development and consequences for numerical algorithms
- High-precision numerical simulations on a CUDA GPU: Kerr black hole tails
This page was built for publication: Numerical algorithms for high-performance computational science
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4993515)
