Solving Large Problem Sizes of Index-Digit Algorithms on GPU: FFT and Tridiagonal System Solvers

DOI10.1109/TC.2017.2723879MaRDI QIDQ4567280zbMATH OpenOpenAlexFDO

Authors Adrián Pérez Diéguez, M. Amor, Jacobo Lobeiras, R. Doallo

Publication date 27 June 2018

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.2017.2723879

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• A guide for implementing tridiagonal solvers on GPUs
• GPU optimization of large-scale eigenvalue solver
• Solving large finite element systems by GPU computation
• Accelerating the Fourier split operator method via graphics processing units
• Big prime field FFT on the GPU
• HIGH PRECISION INTEGER MULTIPLICATION WITH A GPU USING STRASSEN'S ALGORITHM WITH MULTIPLE FFT SIZES
• A FFT preconditioning technique for the solution of incompressible flow on GPUs
• Efficient implementation of total FETI solver for graphic processing units using Schur complement

Cited in

(4)

• A new theoretical derivation of NFFT and its implementation on GPU
• Tree partitioning reduction: a new parallel partition method for solving tridiagonal systems
• HIGH PRECISION INTEGER MULTIPLICATION WITH A GPU USING STRASSEN'S ALGORITHM WITH MULTIPLE FFT SIZES
• The N-shaped partition method: a novel parallel implementation of the Crank Nicolson algorithm

This page was built for publication: Solving Large Problem Sizes of Index-Digit Algorithms on GPU: FFT and Tridiagonal System Solvers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4567280)