Skip to search formSkip to main contentSemantic Scholar

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

This paper proposes a parallel hybrid heuristic aiming the reduction of the bandwidth of sparse matrices. Mainly based on the… Expand

Is this relevant?

2014

2014

A graph matching is used to construct aggregation-based coarsening for an algebraic two-grid method. Effects of inexact coarse… Expand

Is this relevant?

2014

2014

Sparse matrices are entailed in many linear algebra problems such as linear systems resolution, matrix eigen-values/vectors… Expand

Is this relevant?

2013

2013

In this paper, we introduce a new method, called the Lattice Projection Method (LPM), for solving eigenvalue complementarity… Expand

Is this relevant?

2013

2013

The Matrix Bandwidth Minimization Problem (MBMP) seeks for a simultaneous reordering of the rows and the columns of a square… Expand

Is this relevant?

2011

2011

ML(n)BiCGStab is a Krylov subspace method for the solution of large, sparse and non-symmetric linear systems. In theory, it is a… Expand

Is this relevant?

2009

2009

In [Erlangga and Nabben, SIAM J. Sci. Comput., 30 (2008), pp. 1572–1595], we developed a new type of multilevel method, called… Expand

Is this relevant?

Highly Cited

2009

Highly Cited

2009

Fine-grained dataflow processing of sparse matrix-solve computation (Ax¿ = b¿) in the SPICE circuit simulator can provide an… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

Large, high density FPGAs with high local distributed memory bandwidth surpass the peak floating-point performance of high-end… Expand

Is this relevant?

Highly Cited

1996

Highly Cited

1996

We describe a repository of data for the testing of numerical algorithms and mathematical software for matrix computations. The… Expand

Is this relevant?