10 search results - page 2 / 2 » Conjugate gradient sparse solvers: performance-power charact... |
93
Voted
SIAMJO
2010
14 years 7 months ago
2010
We propose a Newton-CG primal proximal point algorithm for solving large scale log-determinant optimization problems. Our algorithm employs the essential ideas of the proximal poi...
137
click to vote
SC
2009
ACM
15 years 5 months ago
2009
ACM
It has been shown that the sparse grid combination technique can be a practical tool to solve high dimensional PDEs arising in multidimensional option pricing problems in finance...
135
Voted
ICCV
2011
IEEE
14 years 1 months ago
2011
IEEE
We present a generalized subgraph preconditioning (GSP) technique to solve large-scale bundle adjustment problems efficiently. In contrast with previous work which uses either di...
113
Voted
SC
1992
ACM
15 years 5 months ago
1992
ACM
In this paper, we study the communication characteristics of the CM-5 and the performance e ects of scheduling regular and irregular communication patterns on the CM-5. We conside...
100
Voted
SIAMJO
2000
15 years 26 days 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...