The multiplication of a sparse matrix by a dense vector (SpMV) is a centerpiece of scientific
computing applications: it is the essential kernel for the solution of sparse linear systems and …

Black-box topology optimization (BBTO) uses evolutionary algorithms and other soft
computing techniques to generate near-optimal topologies of mechanical structures …

This paper proposes a new level set-based topology optimization (TO) method using a
parallel strategy of Graphics Processing Units (GPUs) and the isogeometric analysis (IGA) …

A complete suite of algorithms to implement parallel assembly of sparse finite element
matrices on multicore computers is presented. The approach is broken down into six …

Matrix-free solvers for finite element method (FEM) avoid assembly of elemental matrices
and replace sparse matrix-vector multiplication required in iterative solution method by an …

Sparse matrix-vector multiplication (SpMV) is a fundamental building block for various
numerical computing applications. However, most existing GPU-SpMV approaches may …

Sparse matrix-vector (SpMV) multiplication is a vital building block for numerous scientific
and engineering applications. This paper proposes SURAA (translates to speed in arabic), a …

Exploiting matrix symmetry to halve memory footprint offers an opportunity for accelerating
memory-bound computations like Sparse Matrix-Vector Multiplication (SpMV). However …

As the presence of finite element implementations on General Purpose Graphics Processing
Units (GPGPUs) is the literature increases, detailed and in-breadth testing of the hardware is …

High computational cost in elastoplastic analysis is often handled by the use of high
performance parallel computers. However, the presence of both elastic and plastic states …