Sciweavers

417 search results - page 18 / 84
» Fast Methods for Solving Linear Diophantine Equations
Sort
View
SAS
2010
Springer
143views Formal Methods» more  SAS 2010»
13 years 7 months ago
Points-to Analysis as a System of Linear Equations
The efficiency of a points-to analysis is critical for several compiler optimizations and transformations, and has attracted considerable research attention. Despite several advanc...
Rupesh Nasre, Ramaswamy Govindarajan
CVPR
2006
IEEE
14 years 12 days ago
Accurate Tracking of Monotonically Advancing Fronts
A wide range of computer vision applications such as distance field computation, shape from shading, and shape representation require an accurate solution of a particular Hamilton...
M. Sabry Hassouna, Aly A. Farag
MMAS
2010
Springer
13 years 3 months ago
A Novel Method for Solving Multiscale Elliptic Problems with Randomly Perturbed Data
We propose a method for efficient solution of elliptic problems with multiscale features and randomly perturbed coefficients. We use the multiscale finite element method (MsFEM) as...
Victor Ginting, Axel Målqvist, Michael Presh...
STOC
2007
ACM
128views Algorithms» more  STOC 2007»
14 years 9 months ago
Iteratively constructing preconditioners via the conjugate gradient method
We consider the problem of solving a symmetric, positive definite system of linear equations. The most well-known and widely-used method for solving such systems is the preconditi...
John Dunagan, Nicholas J. A. Harvey
MMAS
2011
Springer
12 years 11 months ago
Sweeping Preconditioner for the Helmholtz Equation: Moving Perfectly Matched Layers
This paper introduces a new sweeping preconditioner for the iterative solution of the variable coefficient Helmholtz equation in two and three dimensions. The algorithms follow th...
Björn Engquist, Lexing Ying