Sciweavers

498 search results - page 58 / 100
» An algorithm to solve integer linear systems exactly using n...
Sort
View
ISCA
2002
IEEE
174views Hardware» more  ISCA 2002»
13 years 7 months ago
Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
Sibabrata Ray, Hong Jiang
SENSYS
2003
ACM
14 years 27 days ago
Minimal and maximal exposure path algorithms for wireless embedded sensor networks
Sensor networks not only have the potential to change the way we use, interact with, and view computers, but also the way we use, interact with, and view the world around us. In o...
Giacomino Veltri, Qingfeng Huang, Gang Qu, Miodrag...
NAA
2004
Springer
117views Mathematics» more  NAA 2004»
14 years 1 months ago
Parallel Performance of a 3D Elliptic Solver
It was recently shown that block-circulant preconditioners applied to a conjugate gradient method used to solve structured sparse linear systems arising from 2D or 3D elliptic prob...
Ivan Lirkov
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 7 months ago
MINRES-QLP: a Krylov subspace method for indefinite or singular symmetric systems
Abstract. CG, SYMMLQ, and MINRES are Krylov subspace methods for solving large symmetric systems of linear equations. CG (the conjugate-gradient method) is reliable on positive-def...
Sou-Cheng T. Choi, Christopher C. Paige, Michael A...
SIAMSC
2011
151views more  SIAMSC 2011»
13 years 2 months 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