SPIKE is a parallel algorithm to solve block tridiagonal matrices. In this work, two useful improvements to the algorithm are proposed. A flexible threading strategy is developed, to overcome limitations of the recursive reduced system method. Allo- cating multiple threads to some tasks created by the SPIKE algorithm removes the previous restriction that recursive SPIKE may only use a number of threads equal to a power of two. Additionally, a method of solving transpose problems is shown. This method matches the performance of the non-transpose solve while reusing the original factorization
This thesis contributes to the field of sparse linear algebra, graph applications, and preconditione...
This contribution outlines an approach that draws on general purpose graphics processing unit (GPGPU...
40 pages, 18 figures. LaTeX source file prepared with LyX. To be published as a chapter of the book ...
A new parallel solver based on SPIKE-TA algorithm has been developed using OpenMP API for solving d...
The explicit Spike algorithm applies to narrow banded linear systems which are strictly diagonally d...
Tridiagonal diagonally dominant linear systems arise in many scientific and engineering applications...
The SPIKE algorithm [1, 2] is an efficient generic divide-and-conquer algorithm for solving banded s...
The truncated SPIKE algorithm is a parallel solver for linear systems which are banded and strictly ...
We propose a parallel sparse triangular linear system solver based on the Spike algorithm. Sparse tr...
Tridiagonal solvers are important building blocks for a wide range of scientific applications that a...
his paper addresses the problem of minimizing the number of columns with superdiagonal nonzeroes (vi...
This thesis attempts to design the building blocks for TRIT algorithm. PSPICE was used for simulatio...
ii This paper describes the SPIKE algorithm for solving large banded linear systems using a divide-a...
Solving linear systems is an important problem for scientific computing. Exploiting parallelism is e...
A spiking neurons network encodes information in the timing of individual spike times. A novel super...
This thesis contributes to the field of sparse linear algebra, graph applications, and preconditione...
This contribution outlines an approach that draws on general purpose graphics processing unit (GPGPU...
40 pages, 18 figures. LaTeX source file prepared with LyX. To be published as a chapter of the book ...
A new parallel solver based on SPIKE-TA algorithm has been developed using OpenMP API for solving d...
The explicit Spike algorithm applies to narrow banded linear systems which are strictly diagonally d...
Tridiagonal diagonally dominant linear systems arise in many scientific and engineering applications...
The SPIKE algorithm [1, 2] is an efficient generic divide-and-conquer algorithm for solving banded s...
The truncated SPIKE algorithm is a parallel solver for linear systems which are banded and strictly ...
We propose a parallel sparse triangular linear system solver based on the Spike algorithm. Sparse tr...
Tridiagonal solvers are important building blocks for a wide range of scientific applications that a...
his paper addresses the problem of minimizing the number of columns with superdiagonal nonzeroes (vi...
This thesis attempts to design the building blocks for TRIT algorithm. PSPICE was used for simulatio...
ii This paper describes the SPIKE algorithm for solving large banded linear systems using a divide-a...
Solving linear systems is an important problem for scientific computing. Exploiting parallelism is e...
A spiking neurons network encodes information in the timing of individual spike times. A novel super...
This thesis contributes to the field of sparse linear algebra, graph applications, and preconditione...
This contribution outlines an approach that draws on general purpose graphics processing unit (GPGPU...
40 pages, 18 figures. LaTeX source file prepared with LyX. To be published as a chapter of the book ...