Sciweavers

417 search results - page 5 / 84
» Fast Methods for Solving Linear Diophantine Equations
Sort
View
DAC
2009
ACM
13 years 11 months ago
GPU friendly fast Poisson solver for structured power grid network analysis
In this paper, we propose a novel simulation algorithm for large scale structured power grid networks. The new method formulates the traditional linear system as a special two-dim...
Jin Shi, Yici Cai, Wenting Hou, Liwei Ma, Sheldon ...
LSSC
2001
Springer
14 years 1 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

Tutorial
6794views
15 years 9 months ago
Fast Marching Methods
Detailed explanation of the Fast Marching Methods, which can be used to efficiently solve the Eikonal equation that models moving interfaces whose motion is either monotonically in...
M. Sabry Hassouna
NA
2011
373views Computer Vision» more  NA 2011»
13 years 3 months ago
On preconditioned MHSS iteration methods for complex symmetric linear systems
We propose a preconditioned variant of the modified HSS (MHSS) iteration method for solving a class of complex symmetric systems of linear equations. Under suitable conditions, w...
Zhong-Zhi Bai, Michele Benzi, Fang Chen
CORR
2008
Springer
149views Education» more  CORR 2008»
13 years 8 months ago
Gaussian Belief Propagation for Solving Systems of Linear Equations: Theory and Application
The canonical problem of solving a system of linear equations arises in numerous contexts in information theory, communication theory, and related fields. In this contribution, we...
Ori Shental, Danny Bickson, Paul H. Siegel, Jack K...