Add to ORKGAbstract. This paper presents a parallel version of a Generalized Conjugate Gradient algorithm proposed by Liu and Story in which the search direction considers the effect of the inexact line search. We describe the implementation of this algorithm on a parallel architecture and analyze the related speedup ratios. Numerical results are given for a shared memory computer (Cray C92). Key words: parallel algorithms, unconstrained high-dimensional optimization, conjugate gradient methods, parallelism, shared memory computer. 1
Consiglio Nazionale delle Ricerche - Biblioteca Centrale - P.le Aldo Moro, 7, Rome / CNR - Consiglio...
This paper examines four different strategies, each one with its own data distribution, for im-pleme...
This paper examines four different strategies, each one with its own data distribution, for im-pleme...
-Abstract. We consider few different implementations of classical itertive methods on parallel proce...
The conjugate gradient method is an iterative technique used to solve systems of linear equations. T...
For the solution of discretized ordinary or partial differential equations it is necessary to solve ...
Solving Partial Differential Equations (PDEs) is an important problem in many fields of science and ...
It is well known that Conjugate--Gradients algorithms are wildly used for the solution of large--sca...
This paper develops the original conjugate gradient method and the idea of preconditioning a system....
SIGLEAvailable from British Library Document Supply Centre- DSC:0678.231F(AD-A--193940)(microfiche) ...
Abstract—A new sparse high performance conjugate gradient benchmark (HPCG) has been recently release...
The Conjugate Gradient (CG) algorithm is perhaps the best-known iterative technique to solve sparse...
The Conjugate Gradient (CG) algorithm is perhaps the best-known iterative technique to solve sparse ...
Whereas most parallel High Performance Computing (HPC) numerical libaries havebeen written as highly...
International audienceWhereas most parallel High Performance Computing (HPC) numerical libaries hav...
Consiglio Nazionale delle Ricerche - Biblioteca Centrale - P.le Aldo Moro, 7, Rome / CNR - Consiglio...
This paper examines four different strategies, each one with its own data distribution, for im-pleme...
This paper examines four different strategies, each one with its own data distribution, for im-pleme...
-Abstract. We consider few different implementations of classical itertive methods on parallel proce...
The conjugate gradient method is an iterative technique used to solve systems of linear equations. T...
For the solution of discretized ordinary or partial differential equations it is necessary to solve ...
Solving Partial Differential Equations (PDEs) is an important problem in many fields of science and ...
It is well known that Conjugate--Gradients algorithms are wildly used for the solution of large--sca...
This paper develops the original conjugate gradient method and the idea of preconditioning a system....
SIGLEAvailable from British Library Document Supply Centre- DSC:0678.231F(AD-A--193940)(microfiche) ...
Abstract—A new sparse high performance conjugate gradient benchmark (HPCG) has been recently release...
The Conjugate Gradient (CG) algorithm is perhaps the best-known iterative technique to solve sparse...
The Conjugate Gradient (CG) algorithm is perhaps the best-known iterative technique to solve sparse ...
Whereas most parallel High Performance Computing (HPC) numerical libaries havebeen written as highly...
International audienceWhereas most parallel High Performance Computing (HPC) numerical libaries hav...
Consiglio Nazionale delle Ricerche - Biblioteca Centrale - P.le Aldo Moro, 7, Rome / CNR - Consiglio...
This paper examines four different strategies, each one with its own data distribution, for im-pleme...
This paper examines four different strategies, each one with its own data distribution, for im-pleme...