Sciweavers

417 search results - page 8 / 84
» Fast Methods for Solving Linear Diophantine Equations
Sort
View
FCCM
2005
IEEE
142views VLSI» more  FCCM 2005»
14 years 3 months ago
FPGA-Based Vector Processing for Solving Sparse Sets of Equations
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...
Muhammad Z. Hasan, Sotirios G. Ziavras
AMC
2010
175views more  AMC 2010»
13 years 10 months ago
An inexact parallel splitting augmented Lagrangian method for large system of linear equations
: Parallel iterative methods are powerful tool for solving large system of linear equations (LEs). The existing parallel computing research results are focussed mainly on sparse sy...
Zheng Peng, DongHua Wu
PROCEDIA
2010
103views more  PROCEDIA 2010»
13 years 4 months ago
The Deflated Relaxed Incomplete Cholesky CG method for use in a real-time ship simulator
Ship simulators are used for training purposes and therefore have to calculate realistic wave patterns around the moving ship in real time. We consider a wave model that is based ...
E. van't Wout, M. B. van Gijzen, A. Ditzel, Auke v...

Publication
3460views
15 years 11 months ago
Multistencils Fast Marching Methods: A Highly Accurate Solution to the Eikonal Equation on Cartesian Domains
A wide range of computer vision applications require an accurate solution of a particular Hamilton-Jacobi (HJ) equation known as the Eikonal equation. In this paper, we propose an ...
M. Sabry Hassouna, Aly A. Farag
JSC
2006
147views more  JSC 2006»
13 years 9 months ago
An algorithm to solve integer linear systems exactly using numerical methods
In this paper, we present a new algorithm for the exact solutions of linear systems with integer coefficients using numerical methods. It terminates with the correct answer in wel...
Zhendong Wan