FPGA architecture and implementation of sparse matrix-vector multiplication for the finite element method

DOI10.1016/J.CPC.2007.11.014zbMATH Open1196.65084OpenAlexW2164261830MaRDI QIDQ710265FDOQ710265

Authors: D. Kharzeev 

Publication date: 18 October 2010

Published in: Computer Physics Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cpc.2007.11.014

Recommendations

• An efficient sparse matrix-vector multiplication on CUDA-enabled graphic processing units for finite element method simulations
• Architecture and operation of a systolic engine for finite element computations
• A new sparse matrix vector multiplication graphics processing unit algorithm designed for finite element problems
• Towards an FPGA solver for the PageRank eigenvector problem
• Architecting the finite element method pipeline for the GPU

zbMATH Keywords

FEMFPGA

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Complexity and performance of numerical algorithms (65Y20)

Cites Work

• SPAR: a new architecture for large finite element computations
• Parallel solution of linear systems with striped sparse matrices
• Processor-efficient sparse matrix-vector multiplication
• Determination of Stripe Structures for Finite Element Matrices
• Title not available (Why is that?)

Cited In (4)

• High-Performance Mixed-Precision Linear Solver for FPGAs
• FPGA computation of the 3D heat equation
• Towards an FPGA solver for the PageRank eigenvector problem
• Title not available (Why is that?)

Uses Software

• SPAR

This page was built for publication: FPGA architecture and implementation of sparse matrix-vector multiplication for the finite element method

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