Add to ORKGThe computational complexity of partitioning sparse matrices is developed graph-theoretically. The results are used to study tearing and modification, and to show that single-element tearing of symmetric systems is rarely advantageous when the torn system is solved by elimination
AbstractWe consider systems of equations of the form AATx = b, where A is a sparse matrix having a s...
The so-called PAQ problem is concerned with the solution of sparse systems of linear equations $Ax=...
International audienceIn this paper, we present, evaluate and analyse the performance of parallel sy...
Tearing and modification obtains the ssolution of a linear system synthetically by first solving a s...
International audienceWe investigate one dimensional partitioning of sparse matrices under a given o...
Полный текст статьи можно найти по адресу: http://scitation.aip.org/content/aip/proceeding/aipcp/10...
AbstractThis paper studies a sparse configuration for a new class of decomposition derived by the au...
An over view of advanced techniques for solving large sparse linear systems of equations is presente...
Sparse matrix-vector multiplication is the kernel for many scientific computations. Parallelizing th...
A common operation in scientific computing is the multiplication of a sparse, rectangular or structu...
We propose a hybrid sparse system solver for handling linear systems using algebraic domain decompos...
The thesis is about graph partitioning and applications of graph partitioning in paral- lel algorith...
A unified theory of finite sparse matrix techniques based on a literature search and new results is ...
AbstractWe propose a hybrid sparse system solver for handling linear systems using algebraic domain ...
Graph partitioning is a fundamental problem in several scientific and engineering applications. In t...
AbstractWe consider systems of equations of the form AATx = b, where A is a sparse matrix having a s...
The so-called PAQ problem is concerned with the solution of sparse systems of linear equations $Ax=...
International audienceIn this paper, we present, evaluate and analyse the performance of parallel sy...
Tearing and modification obtains the ssolution of a linear system synthetically by first solving a s...
International audienceWe investigate one dimensional partitioning of sparse matrices under a given o...
Полный текст статьи можно найти по адресу: http://scitation.aip.org/content/aip/proceeding/aipcp/10...
AbstractThis paper studies a sparse configuration for a new class of decomposition derived by the au...
An over view of advanced techniques for solving large sparse linear systems of equations is presente...
Sparse matrix-vector multiplication is the kernel for many scientific computations. Parallelizing th...
A common operation in scientific computing is the multiplication of a sparse, rectangular or structu...
We propose a hybrid sparse system solver for handling linear systems using algebraic domain decompos...
The thesis is about graph partitioning and applications of graph partitioning in paral- lel algorith...
A unified theory of finite sparse matrix techniques based on a literature search and new results is ...
AbstractWe propose a hybrid sparse system solver for handling linear systems using algebraic domain ...
Graph partitioning is a fundamental problem in several scientific and engineering applications. In t...
AbstractWe consider systems of equations of the form AATx = b, where A is a sparse matrix having a s...
The so-called PAQ problem is concerned with the solution of sparse systems of linear equations $Ax=...
International audienceIn this paper, we present, evaluate and analyse the performance of parallel sy...