Conjugate gradient (CG) and biconjugate gradient stabilized (BiCGSTAB) are effective
methods used for solving sparse linear systems. We in this paper propose Mille-feuille, a …

This paper proposes a strategy for the efficient implementation of Fixed Grid Finite Element
Analysis (FGFEA) method on Graphics Processing Units (GPUs). Such a strategy makes use …

Isogeometric collocation methods have been introduced as an alternative to isogeometric
Galerkin formulations, aiming at improving the computational cost of simulation by reducing …

Sparse Matrix-Vector Multiplication (SpMV) is the most important sparse linear algebra
kernel in both scientific and engineering applications. Due to its irregular control flow and …

Sparse matrices arising from the solution of systems of partial differential equations often
exhibit a perfect block structure, meaning that the nonzero blocks in the sparsity pattern are …

Kaczmarz algorithm is an iterative projection method for solving system of linear equations
that arise in science and engineering problems in various application domains. In addition to …

Many simulations in science and engineering give rise to sparse linear systems of
equations. It is a well known fact that the cost of the simulation process is almost always …

We propose a parallel sparse triangular linear system solver based on the Spike algorithm.
Sparse triangular systems are required to be solved in many applications. Often, they are a …

Gauss--Seidel (GS) is a widely used iterative method for solving sparse linear systems of
equations and also known to be effective as a smoother in algebraic multigrid methods …

Large sparse linear systems arise in many areas of scientific computing, and the solution of
these systems is the most time‐consuming part in many large‐scale problems. We present a …