Accelerating scientific computations with mixed precision algorithms
From MaRDI portal
Publication:711750
DOI10.1016/j.cpc.2008.11.005zbMath1197.65240arXiv0808.2794OpenAlexW1977146902MaRDI QIDQ711750
Julien Langou, Julie Langou, Alfredo Buttari, Jakub Kurzak, Piotr Luszczek, Marc Baboulin, Stanimire Z. Tomov, Jack J. Dongarra
Publication date: 28 October 2010
Published in: Computer Physics Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0808.2794
Related Items
Mixed precision algorithms in numerical linear algebra, A hardware accelerated unstructured overset method to simulate turbulent fluid flow, Numerical integration on GPUs for higher order finite elements, An implicit symplectic solver for high-precision long-term integrations of the solar system, Measuring the performance of parallel computers with distributed memory, The Impact of Compilation Flags and Choosing Single- or Double-Precision Variables in Linear Systems Solvers, A note on solving nonlinear optimization problems in variable precision, Exploiting spatial symmetries for solving Poisson's equation, Portable CPU implementation of Wilson, Brillouin and Susskind fermions in lattice QCD, Iterative diagonalization of symmetric matrices in mixed precision and its application to electronic structure calculations, GPU implementation of a Helmholtz Krylov solver preconditioned by a shifted Laplace multigrid method, New parallel sparse direct solvers for multicore architectures, Algebraic Error Analysis for Mixed-Precision Multigrid Solvers, Mixed-precision iterative refinement using tensor cores on GPUs to accelerate solution of linear systems, Efficient implementation of symplectic implicit Runge-Kutta schemes with simplified Newton iterations, Linear algebra software for large-scale accelerated multicore computing, Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization, GPGPU-based parallel computing applied in the FEM using the conjugate gradient algorithm: a review, An Error Correction Solver for Linear Systems: Evaluation of Mixed Precision Implementations, The Impact of Data Distribution in Accuracy and Performance of Parallel Linear Algebra Subroutines, ITER-REF, Benefits from using mixed precision computations in the ELPA-AEO and ESSEX-II eigensolver projects, Algebraic Error Analysis for Mixed-Precision Multigrid Solvers, PACF: a precision-adjustable computational framework for solving singular values, Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
- Using FGMRES to obtain backward stability in mixed precision
- Multifrontal parallel distributed symmetric and unsymmetric solvers
- Relaxation strategies for nested Krylov methods
- New insights in GMRES-like methods with variable preconditioners
- Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
- Flexible Conjugate Gradients
- An Unsymmetric-Pattern Multifrontal Method for Sparse LU Factorization
- Improving the Accuracy of Computed Singular Values
- Using Mixed Precision for Sparse Matrix Computations to Enhance the Performance while Achieving 64-bit Accuracy
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- Improving the Accuracy of Computed Eigenvalues and Eigenvectors
- An extended set of FORTRAN basic linear algebra subprograms
- Algorithm 656: an extended set of basic linear algebra subprograms: model implementation and test programs
- Iterative Refinement Implies Numerical Stability for Gaussian Elimination
- A Black Box Generalized Conjugate Gradient Solver with Inner Iterations and Variable-Step Preconditioning
- Efficient High Accuracy Solutions with ${\text{GMRES}}(m)$
- Basic Linear Algebra Subprograms for Fortran Usage
- A set of level 3 basic linear algebra subprograms
- Algorithm 679: A set of level 3 basic linear algebra subprograms: model implementation and test programs
- Flexible Inner-Outer Krylov Subspace Methods
- Solving Sparse Linear Systems with Sparse Backward Error
- Accuracy and Stability of Numerical Algorithms
- GMRESR: a family of nested GMRES methods
- Historical Development of the Newton–Raphson Method
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- Algorithm 832
- Iterative Refinement in Floating Point
