Sciweavers

170 search results - page 6 / 34
» Solving Sparse Integer Linear Systems
Sort
View
CADE
2010
Springer
13 years 8 months ago
MUNCH - Automated Reasoner for Sets and Multisets
This system description provides an overview of the MUNCH reasoner for sets and multisets. MUNCH takes as the input a formula in a logic that supports expressions about sets, multi...
Ruzica Piskac, Viktor Kuncak
MOC
1998
97views more  MOC 1998»
13 years 7 months ago
Euclid's algorithm and the Lanczos method over finite fields
Abstract. This paper shows that there is a close relationship between the Euclidean algorithm for polynomials and the Lanczos method for solving sparse linear systems, especially w...
Jeremy Teitelbaum
CSC
2006
13 years 9 months ago
Applying Sparse Matrix Solvers to a Glacial Ice Sheet Model
- Two software packages for solving sparse systems of linear equations, SuperLU and UMFPACK, have been integrated with the University of Maine Ice Sheet Model for predicting the fo...
Rodney Jacobs, James Fastook, Aitbala Sargent
CASES
2006
ACM
14 years 1 months ago
Memory optimization by counting points in integer transformations of parametric polytopes
Memory size reduction and memory accesses optimization are crucial issues for embedded systems. In the context of affine programs, these two challenges are classically tackled by ...
Rachid Seghir, Vincent Loechner
COR
2010
105views more  COR 2010»
13 years 7 months ago
Effective formulation reductions for the quadratic assignment problem
In this paper we study two formulation reductions for the quadratic assignment problem (QAP). In particular we apply these reductions to the well known Adams and Johnson [2] integ...
Huizhen Zhang, Cesar Beltran-Royo, Miguel Constant...