719 search results - page 3 / 144 » Solving Sparse Linear Constraints |
PPAM
2001
Springer
13 years 10 months ago
2001
Springer
This paper presents an overview of pARMS, a package for solving sparse linear systems on parallel platforms. Preconditioners constitute the most important ingredient in the solutio...
FCCM
2005
IEEE
13 years 11 months ago
2005
IEEE
The solution to a set of sparse linear equations Ax = b, where A is an n×n sparse matrix and b is an n-element vector, can be obtained using the W-matrix method. An enhanced vect...
IPPS
2010
IEEE
13 years 3 months ago
2010
IEEE
AAECC
1991
Springer
13 years 9 months ago
1991
Springer
IPCO
2008
13 years 7 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...