Sciweavers

327 search results - page 2 / 66
» Some Elimination Problems for Matrices
Sort
View
PPAM
2007
Springer
14 years 3 days ago
A Supernodal Out-of-Core Sparse Gaussian-Elimination Method
Abstract. We present an out-of-core sparse direct solver for unsymmetric linear systems. The solver factors the coefficient matrix A into A = PLU using Gaussian elimination with pa...
Sivan Toledo, Anatoli Uchitel
NIPS
2007
13 years 7 months ago
What makes some POMDP problems easy to approximate?
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
David Hsu, Wee Sun Lee, Nan Rong
FCCM
2006
IEEE
195views VLSI» more  FCCM 2006»
14 years 1 days ago
A Parallel Hardware Architecture for fast Gaussian Elimination over GF(2)
This paper presents a hardware-optimized variant of the well-known Gaussian elimination over GF(2) and its highly efficient implementation. The proposed hardware architecture, we...
Andrey Bogdanov, M. C. Mertens
SARA
2009
Springer
14 years 16 days ago
Reformulating Planning Problems by Eliminating Unpromising Actions
Despite a big progress in solving planning problems, more complex problems still remain hard and challenging for existing planners. One of the most promising research directions i...
Lukás Chrpa, Roman Barták
SIAMSC
2011
151views more  SIAMSC 2011»
13 years 28 days ago
Inexact Newton Methods with Restricted Additive Schwarz Based Nonlinear Elimination for Problems with High Local Nonlinearity
The classical inexact Newton algorithm is an efficient and popular technique for solving large sparse nonlinear system of equations. When the nonlinearities in the system are wellb...
Xiao-Chuan Cai, Xuefeng Li