52 search results - page 6 / 11 » pARMS: A Package for Solving General Sparse Linear Systems o... |
SIAMJO
2000
13 years 7 months ago
2000
Abstract. Despite the efficiency shown by interior-point methods in large-scale linear programming, they usually perform poorly when applied to multicommodity flow problems. The ne...
SC
1994
ACM
13 years 11 months ago
1994
ACM
In recent years, interior point algorithms have been used successfully for solving mediumto large-size linear programming LP problems. In this paper we describe a highly parallel ...
VALUETOOLS
2006
ACM
14 years 1 months ago
2006
ACM
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
CPHYSICS
2010
13 years 7 months ago
2010
We investigate fully parallel Newton-Krylov-Schwarz (NKS) algorithms for solving the large sparse nonlinear systems of equations arising from the finite element discretization of ...
HIPC
2004
Springer
14 years 25 days ago
2004
Springer
Parasitic extraction techniques are used to estimate signal delay in VLSI chips. Inductance extraction is a critical component of the parasitic extraction process in which on-chip ...