Sciweavers

170 search results - page 24 / 34
» Solving Sparse Integer Linear Systems
Sort
View
TOMS
2011
84views more  TOMS 2011»
13 years 4 months ago
A Supernodal Approach to Incomplete LU Factorization with Partial Pivoting
We present a new supernode-based incomplete LU factorization method to construct a preconditioner for solving sparse linear systems with iterative methods. The new algorithm is pr...
Xiaoye S. Li, Meiyue Shao
IPPS
1995
IEEE
14 years 1 months ago
Performance evaluation of a new parallel preconditioner
The linear systems associated with large, sparse, symmetric, positive definite matrices are often solved iteratively using the preconditioned conjugate gradient method. We have d...
Keith D. Gremban, Gary L. Miller, Marco Zagha
JSCIC
2008
43views more  JSCIC 2008»
13 years 9 months ago
A Dual-Petrov-Galerkin Method for the Kawahara-Type Equations
Abstract An efficient and accurate numerical scheme is proposed, analyzed and implemented for the Kawahara and modified Kawahara equations which model many physical phenomena such ...
Juan-Ming Yuan, Jie Shen, Jiahong Wu
CIMAGING
2009
120views Hardware» more  CIMAGING 2009»
13 years 10 months ago
Dantzig selector homotopy with dynamic measurements
The Dantzig selector is a near ideal estimator for recovery of sparse signals from linear measurements in the presence of noise. It is a convex optimization problem which can be r...
Muhammad Salman Asif, Justin K. Romberg
JNW
2006
126views more  JNW 2006»
13 years 9 months ago
Gateway Deployment optimization in Cellular Wi-Fi Mesh Networks
With the standardization of IEEE 802.11, there has been an explosive growth of wireless local area networks (WLAN). Recently, this cost effective technology is being developed aggr...
Rajesh Prasad, Hongyi Wu