src/minimizers/PRCG.cpp

/*
 * Copyright (c) 2005 The University of Notre Dame. All Rights Reserved.
 *
 * The University of Notre Dame grants you ("Licensee") a
 * non-exclusive, royalty free, license to use, modify and
 * redistribute this software in source and binary code form, provided
 * that the following conditions are met:
 *
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 *
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the
 *    distribution.
 *
 * This software is provided "AS IS," without a warranty of any
 * kind. All express or implied conditions, representations and
 * warranties, including any implied warranty of merchantability,
 * fitness for a particular purpose or non-infringement, are hereby
 * excluded.  The University of Notre Dame and its licensors shall not
 * be liable for any damages suffered by licensee as a result of
 * using, modifying or distributing the software or its
 * derivatives. In no event will the University of Notre Dame or its
 * licensors be liable for any lost revenue, profit or data, or for
 * direct, indirect, special, consequential, incidental or punitive
 * damages, however caused and regardless of the theory of liability,
 * arising out of the use of or inability to use software, even if the
 * University of Notre Dame has been advised of the possibility of
 * such damages.
 *
 * SUPPORT OPEN SCIENCE!  If you use OpenMD or its source code in your
 * research, please cite the appropriate papers when you publish your
 * work.  Good starting points are:
 *                                                                      
 * [1]  Meineke, et al., J. Comp. Chem. 26, 252-271 (2005).             
 * [2]  Fennell & Gezelter, J. Chem. Phys. 124, 234104 (2006).          
 * [3]  Sun, Lin & Gezelter, J. Chem. Phys. 128, 24107 (2008).          
 * [4]  Vardeman & Gezelter, in progress (2009).                        
 */
 
#include "minimizers/PRCG.hpp"
namespace OpenMD {
        
  void PRCGMinimizer::init(){

    calcG();
  
    for(int i = 0; i < direction.size(); i++){    
      direction[i] = -curG[i];
    }

  }

  int PRCGMinimizer::step(){
    int lsStatus;
  
    prevF = curF;
    prevG = curG;
    prevX = curX;

    //optimize along the search direction and reset minimum point value
    lsStatus = doLineSearch(direction, stepSize);

    if (lsStatus < 0)
      return -1;
    else
      return 1;
  }

  void PRCGMinimizer::prepareStep(){
    std::vector<RealType> deltaGrad;
    RealType beta;
    size_t i;

    deltaGrad.resize(ndim);
    
    //calculate the new direction using Polak-Ribiere Conjugate Gradient
  
    for(i = 0; i < curG.size(); i++)
      deltaGrad[i] = curG[i] - prevG[i];

#ifndef IS_MPI
    beta = dotProduct(deltaGrad, curG) / dotProduct(prevG, prevG);
#else
    RealType localDP1;
    RealType localDP2;
    RealType globalDP1;
    RealType globalDP2;

    localDP1 =  dotProduct(deltaGrad, curG);
    localDP2 = dotProduct(prevG, prevG);

    MPI_Allreduce(&localDP1, &globalDP1, 1, MPI_REALTYPE,MPI_SUM, MPI_COMM_WORLD);
    MPI_Allreduce(&localDP2, &globalDP2, 1, MPI_REALTYPE,MPI_SUM, MPI_COMM_WORLD);
  
    beta = globalDP1 / globalDP2;
#endif

    for(i = 0; i < direction.size(); i++)  
      direction[i] = -curG[i] + beta * direction[i];

  }

}
Revision:	1390
Committed:	Wed Nov 25 20:02:06 2009 UTC (15 years, 5 months ago) by gezelter
Original Path:	*trunk/src/minimizers/PRCG.cpp*
File size:	3489 byte(s)
Log Message:	Almost all of the changes necessary to create OpenMD out of our old project (OOPSE-4)
#	User	Rev	Content
1	gezelter	507	/*
2	gezelter	246	* Copyright (c) 2005 The University of Notre Dame. All Rights Reserved.
3			*
4			* The University of Notre Dame grants you ("Licensee") a
5			* non-exclusive, royalty free, license to use, modify and
6			* redistribute this software in source and binary code form, provided
7			* that the following conditions are met:
8			*
9	gezelter	1390	* 1. Redistributions of source code must retain the above copyright
10	gezelter	246	* notice, this list of conditions and the following disclaimer.
11			*
12	gezelter	1390	* 2. Redistributions in binary form must reproduce the above copyright
13	gezelter	246	* notice, this list of conditions and the following disclaimer in the
14			* documentation and/or other materials provided with the
15			* distribution.
16			*
17			* This software is provided "AS IS," without a warranty of any
18			* kind. All express or implied conditions, representations and
19			* warranties, including any implied warranty of merchantability,
20			* fitness for a particular purpose or non-infringement, are hereby
21			* excluded. The University of Notre Dame and its licensors shall not
22			* be liable for any damages suffered by licensee as a result of
23			* using, modifying or distributing the software or its
24			* derivatives. In no event will the University of Notre Dame or its
25			* licensors be liable for any lost revenue, profit or data, or for
26			* direct, indirect, special, consequential, incidental or punitive
27			* damages, however caused and regardless of the theory of liability,
28			* arising out of the use of or inability to use software, even if the
29			* University of Notre Dame has been advised of the possibility of
30			* such damages.
31	gezelter	1390	*
32			* SUPPORT OPEN SCIENCE! If you use OpenMD or its source code in your
33			* research, please cite the appropriate papers when you publish your
34			* work. Good starting points are:
35			*
36			* [1] Meineke, et al., J. Comp. Chem. 26, 252-271 (2005).
37			* [2] Fennell & Gezelter, J. Chem. Phys. 124, 234104 (2006).
38			* [3] Sun, Lin & Gezelter, J. Chem. Phys. 128, 24107 (2008).
39			* [4] Vardeman & Gezelter, in progress (2009).
40	gezelter	246	*/
41
42			#include "minimizers/PRCG.hpp"
43	gezelter	1390	namespace OpenMD {
44	tim	324
45	gezelter	507	void PRCGMinimizer::init(){
46	gezelter	2
47	gezelter	507	calcG();
48	gezelter	2
49	gezelter	507	for(int i = 0; i < direction.size(); i++){
50			direction[i] = -curG[i];
51			}
52
53	gezelter	2	}
54
55	gezelter	507	int PRCGMinimizer::step(){
56			int lsStatus;
57	gezelter	2
58	gezelter	507	prevF = curF;
59			prevG = curG;
60			prevX = curX;
61	gezelter	2
62	gezelter	507	//optimize along the search direction and reset minimum point value
63	gezelter	2	lsStatus = doLineSearch(direction, stepSize);
64
65	gezelter	507	if (lsStatus < 0)
66			return -1;
67			else
68			return 1;
69			}
70	gezelter	2
71	gezelter	507	void PRCGMinimizer::prepareStep(){
72	tim	963	std::vector<RealType> deltaGrad;
73			RealType beta;
74	gezelter	507	size_t i;
75	gezelter	2
76	gezelter	507	deltaGrad.resize(ndim);
77	gezelter	2
78	gezelter	507	//calculate the new direction using Polak-Ribiere Conjugate Gradient
79	gezelter	2
80	gezelter	507	for(i = 0; i < curG.size(); i++)
81			deltaGrad[i] = curG[i] - prevG[i];
82	gezelter	2
83			#ifndef IS_MPI
84	gezelter	507	beta = dotProduct(deltaGrad, curG) / dotProduct(prevG, prevG);
85	gezelter	2	#else
86	tim	963	RealType localDP1;
87			RealType localDP2;
88			RealType globalDP1;
89			RealType globalDP2;
90	gezelter	2
91	gezelter	507	localDP1 = dotProduct(deltaGrad, curG);
92			localDP2 = dotProduct(prevG, prevG);
93	gezelter	2
94	tim	963	MPI_Allreduce(&localDP1, &globalDP1, 1, MPI_REALTYPE,MPI_SUM, MPI_COMM_WORLD);
95			MPI_Allreduce(&localDP2, &globalDP2, 1, MPI_REALTYPE,MPI_SUM, MPI_COMM_WORLD);
96	gezelter	2
97	gezelter	507	beta = globalDP1 / globalDP2;
98	gezelter	2	#endif
99
100	gezelter	507	for(i = 0; i < direction.size(); i++)
101			direction[i] = -curG[i] + beta * direction[i];
102	gezelter	2
103	gezelter	507	}
104	tim	324
105			}