Resolved Conflicts (i hope): src/REPLICA/neb.cpp src/REPLICA/prd.cpp src/REPLICA/tad.cpp src/REPLICA/verlet_split.cpp src/USER-CUDA/atom_vec_angle_cuda.h src/USER-CUDA/atom_vec_atomic_cuda.h src/USER-CUDA/atom_vec_charge_cuda.h src/USER-CUDA/atom_vec_full_cuda.h src/USER-CUDA/compute_pe_cuda.h src/USER-CUDA/compute_pressure_cuda.h src/USER-CUDA/compute_temp_cuda.h src/USER-CUDA/compute_temp_partial_cuda.h src/USER-CUDA/cuda.cpp src/USER-CUDA/cuda.h src/USER-CUDA/cuda_data.h src/USER-CUDA/cuda_neigh_list.h src/USER-CUDA/fft3d_cuda.h src/USER-CUDA/fft3d_wrap_cuda.h src/USER-CUDA/fix_addforce_cuda.h src/USER-CUDA/fix_aveforce_cuda.h src/USER-CUDA/fix_enforce2d_cuda.h src/USER-CUDA/fix_freeze_cuda.h src/USER-CUDA/fix_gravity_cuda.h src/USER-CUDA/fix_nve_cuda.h src/USER-CUDA/fix_set_force_cuda.h src/USER-CUDA/fix_temp_berendsen_cuda.h src/USER-CUDA/fix_temp_rescale_cuda.h src/USER-CUDA/fix_temp_rescale_limit_cuda.h src/USER-CUDA/fix_viscous_cuda.h src/USER-CUDA/pair_born_coul_long_cuda.h src/USER-CUDA/pair_buck_coul_cut_cuda.h src/USER-CUDA/pair_buck_coul_long_cuda.h src/USER-CUDA/pair_buck_cuda.h src/USER-CUDA/pair_cg_cmm_coul_cut_cuda.cpp src/USER-CUDA/pair_cg_cmm_coul_cut_cuda.h src/USER-CUDA/pair_cg_cmm_coul_debye_cuda.cpp src/USER-CUDA/pair_cg_cmm_coul_debye_cuda.h src/USER-CUDA/pair_cg_cmm_coul_long_cuda.cpp src/USER-CUDA/pair_cg_cmm_coul_long_cuda.h src/USER-CUDA/pair_cg_cmm_cuda.cpp src/USER-CUDA/pair_cg_cmm_cuda.h src/USER-CUDA/pair_eam_cuda.h src/USER-CUDA/pair_gran_hooke_cuda.h src/USER-CUDA/pair_lj96_cut_cuda.h src/USER-CUDA/pair_lj_charmm_coul_charmm_cuda.h src/USER-CUDA/pair_lj_charmm_coul_charmm_implicit_cuda.h src/USER-CUDA/pair_lj_charmm_coul_long_cuda.h src/USER-CUDA/pair_lj_class2_coul_cut_cuda.h src/USER-CUDA/pair_lj_class2_coul_long_cuda.h src/USER-CUDA/pair_lj_class2_cuda.h src/USER-CUDA/pair_lj_cut_coul_cut_cuda.h src/USER-CUDA/pair_lj_cut_coul_debye_cuda.h src/USER-CUDA/pair_lj_cut_coul_long_cuda.h src/USER-CUDA/pair_lj_cut_cuda.h src/USER-CUDA/pair_lj_cut_experimental_cuda.h src/USER-CUDA/pair_lj_expand_cuda.h src/USER-CUDA/pair_lj_gromacs_coul_gromacs_cuda.h src/USER-CUDA/pair_lj_gromacs_cuda.h src/USER-CUDA/pair_lj_sdk_coul_long_cuda.cpp src/USER-CUDA/pair_lj_sdk_coul_long_cuda.h src/USER-CUDA/pair_lj_sdk_cuda.h src/USER-CUDA/pair_lj_smooth_cuda.h src/USER-CUDA/pair_morse_cuda.h src/USER-CUDA/pair_sw_cuda.h src/USER-CUDA/pair_tersoff_cuda.h src/USER-CUDA/pair_tersoff_zbl_cuda.h src/USER-CUDA/pppm_cuda.h src/USER-CUDA/verlet_cuda.cpp src/USER-CUDA/verlet_cuda.h src/comm.cpp src/finish.cpp src/fix_rigid_nvt.h src/respa.cpp src/run.cpp
109 lines
3.0 KiB
C++
109 lines
3.0 KiB
C++
/* ----------------------------------------------------------------------
|
|
LAMMPS - Large-scale Atomic/Molecular Massively Parallel Simulator
|
|
http://lammps.sandia.gov, Sandia National Laboratories
|
|
Steve Plimpton, sjplimp@sandia.gov
|
|
|
|
Copyright (2003) Sandia Corporation. Under the terms of Contract
|
|
DE-AC04-94AL85000 with Sandia Corporation, the U.S. Government retains
|
|
certain rights in this software. This software is distributed under
|
|
the GNU General Public License.
|
|
|
|
See the README file in the top-level LAMMPS directory.
|
|
------------------------------------------------------------------------- */
|
|
|
|
#include "math.h"
|
|
#include "mpi.h"
|
|
#include "min_sd.h"
|
|
#include "atom.h"
|
|
#include "update.h"
|
|
#include "output.h"
|
|
#include "timer.h"
|
|
|
|
using namespace LAMMPS_NS;
|
|
|
|
// EPS_ENERGY = minimum normalization for energy tolerance
|
|
|
|
#define EPS_ENERGY 1.0e-8
|
|
|
|
// same as in other min classes
|
|
|
|
enum{MAXITER,MAXEVAL,ETOL,FTOL,DOWNHILL,ZEROALPHA,ZEROFORCE,ZEROQUAD};
|
|
|
|
/* ---------------------------------------------------------------------- */
|
|
|
|
MinSD::MinSD(LAMMPS *lmp) : MinLineSearch(lmp) {}
|
|
|
|
/* ----------------------------------------------------------------------
|
|
minimization via steepest descent
|
|
------------------------------------------------------------------------- */
|
|
|
|
int MinSD::iterate(int maxiter)
|
|
{
|
|
int i,m,n,fail,ntimestep;
|
|
double fdotf;
|
|
double *fatom,*hatom;
|
|
|
|
// initialize working vectors
|
|
|
|
for (i = 0; i < nvec; i++) h[i] = fvec[i];
|
|
if (nextra_atom)
|
|
for (m = 0; m < nextra_atom; m++) {
|
|
fatom = fextra_atom[m];
|
|
hatom = hextra_atom[m];
|
|
n = extra_nlen[m];
|
|
for (i = 0; i < n; i++) hatom[i] = fatom[i];
|
|
}
|
|
if (nextra_global)
|
|
for (i = 0; i < nextra_global; i++) hextra[i] = fextra[i];
|
|
|
|
for (int iter = 0; iter < maxiter; iter++) {
|
|
ntimestep = ++update->ntimestep;
|
|
niter++;
|
|
|
|
// line minimization along h from current position x
|
|
// h = downhill gradient direction
|
|
|
|
eprevious = ecurrent;
|
|
fail = (this->*linemin)(ecurrent,alpha_final);
|
|
if (fail) return fail;
|
|
|
|
// function evaluation criterion
|
|
|
|
if (neval >= update->max_eval) return MAXEVAL;
|
|
|
|
// energy tolerance criterion
|
|
|
|
if (fabs(ecurrent-eprevious) <
|
|
update->etol * 0.5*(fabs(ecurrent) + fabs(eprevious) + EPS_ENERGY))
|
|
return ETOL;
|
|
|
|
// force tolerance criterion
|
|
|
|
fdotf = fnorm_sqr();
|
|
if (fdotf < update->ftol*update->ftol) return FTOL;
|
|
|
|
// set new search direction h to f = -Grad(x)
|
|
|
|
for (i = 0; i < nvec; i++) h[i] = fvec[i];
|
|
if (nextra_atom)
|
|
for (m = 0; m < nextra_atom; m++) {
|
|
fatom = fextra_atom[m];
|
|
hatom = hextra_atom[m];
|
|
n = extra_nlen[m];
|
|
for (i = 0; i < n; i++) hatom[i] = fatom[i];
|
|
}
|
|
if (nextra_global)
|
|
for (i = 0; i < nextra_global; i++) hextra[i] = fextra[i];
|
|
|
|
// output for thermo, dump, restart files
|
|
|
|
if (output->next == ntimestep) {
|
|
timer->stamp();
|
|
output->write(ntimestep);
|
|
timer->stamp(Timer::OUTPUT);
|
|
}
|
|
}
|
|
|
|
return MAXITER;
|
|
}
|