Sciweavers

170 search results - page 3 / 34
» Solving Sparse Integer Linear Systems
Sort
View
LSSC
2001
Springer
13 years 10 months ago
Solving Systems of Linear Algebraic Equations Using Quasirandom Numbers
In this paper we analyze a quasi-Monte Carlo method for solving systems of linear algebraic equations. It is well known that the convergence of Monte Carlo methods for numerical in...
Aneta Karaivanova, Rayna Georgieva
ICDAR
2009
IEEE
13 years 3 months ago
Symbol Detection Using Region Adjacency Graphs and Integer Linear Programming
In this paper, we tackle the problem of localizing graphical symbols on complex technical document images by using an original approach to solve the subgraph isomorphism problem. ...
Pierre Le Bodic, Hervé Locteau, Séba...
SC
2009
ACM
13 years 10 months ago
GPU based sparse grid technique for solving multidimensional options pricing PDEs
It has been shown that the sparse grid combination technique can be a practical tool to solve high dimensional PDEs arising in multidimensional option pricing problems in finance...
Abhijeet Gaikwad, Ioane Muni Toke
ACPC
1999
Springer
13 years 10 months ago
Non-standard Parallel Solution Strategies for Distributed Sparse Linear Systems
Abstract. A number of techniques are described for solving sparse linear systems on parallel platforms. The general approach used is a domaindecomposition type method in which a pr...
Yousef Saad, Masha Sosonkina
AAECC
2001
Springer
121views Algorithms» more  AAECC 2001»
13 years 10 months ago
Algorithms for Large Integer Matrix Problems
Abstract. New algorithms are described and analysed for solving various problems associated with a large integer matrix: computing the Hermite form, computing a kernel basis, and s...
Mark Giesbrecht, Michael J. Jacobson Jr., Arne Sto...