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 …

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 …

Sparse linear system of equations often arises after discretization of the partial differential
equations (PDEs) such as computational fluid dynamics, material science, and structural …

The state-of-the-art supercomputing infrastructures are equipped with accelerators, such as
graphics processing units (GPUs), that operate as coprocessors for each workstation of the …

The simulation of several physical phenomena, arising from a wide class of scientific fields,
requires solving large sparse linear systems effectively. In order to exploit appropriately the …

Solution of large sparse linear systems is frequently the most time consuming operation in
computational fluid dynamics simulations. Improving the scalability of this operation is likely …

Several scientific and real-world problems require computations with sparse ma-trices, or
more generally, sparse tensors which are multi-dimensional arrays. For sparse matrix …

Two commonly used preconditioners were evaluated for parallel solution of linear systems
of equations with high condition numbers. The test cases were derived from topology …

Solving large sparse linear systems, efficiently, on supercomputing infrastructures is a time-
consuming component for a wide variety of simulation processes. An effective parallel solver …