lbfgs.h

Go to the documentation of this file.

#ifndef LBFGS_H
#define LBFGS_H
 
#include <vector>
#include <tuple> 
#include <algorithm>
#include <cmath>
#include "matrix_methods.h"
//#include "line_search.h"
#include "source_base/matrix.h"
#include "source_base/matrix3.h"
#include "source_cell/unitcell.h"
#include "source_esolver/esolver.h"
#include "source_esolver/esolver_ks.h"
 
class LBFGS
{
public:
    void allocate(const int _size);
 
    void relax_step(const ModuleBase::matrix _force,
                    UnitCell& ucell,
                    const double &etot);
 
private:
    //LineSearch l_search;
    double alpha;                           
    double maxstep;                         
    int size;                               
    int memory;                             
    double H0;                              
    int iteration;                          
    double energy;                          
    double alpha_k;                         
 
    ModuleESolver::ESolver* solver;         
    std::vector<std::vector<double>> H;     
    std::vector<double> force0;             
    std::vector<std::vector<double>> force;  
    std::vector<double> pos0;                
    std::vector<std::vector<double>> pos;   
    std::vector<double> pos_taud0;           
    std::vector<std::vector<double>> pos_taud; 
    std::vector<std::vector<double>> dpos;  
    std::vector<std::vector<double>> s;     
    std::vector<std::vector<double>> y;     
    std::vector<double> rho;                
    std::vector<double> steplength;         
 
    void prepare_step(std::vector<std::vector<double>>& force,
                      std::vector<std::vector<double>>& pos,
                      std::vector<std::vector<double>>& H,
                      std::vector<double>& pos0,
                      std::vector<double>& force0,
                      std::vector<std::vector<double>>& dpos,
                      UnitCell& ucell,
                      const double &etot);
 
    void is_restrain(std::vector<std::vector<double>>& dpos);
 
    void calculate_largest_grad(const ModuleBase::matrix& _force,
                                UnitCell& ucell);
 
    void get_pos(UnitCell& ucell,
                 std::vector<std::vector<double>>& pos);
 
    void get_pos_taud(UnitCell& ucell,
                      std::vector<std::vector<double>>& pos_taud);
 
    void update(std::vector<std::vector<double>>& pos_taud, 
                std::vector<double>& pos_taud0, 
                std::vector<double>& force,
                std::vector<double>& force0, 
                UnitCell& ucell,
                int iteration,
                int memory,
                std::vector<std::vector<double>>& s,
                std::vector<std::vector<double>>& y,
                std::vector<double>& rho);
 
    void determine_step(std::vector<double>& steplength,
                       std::vector<std::vector<double>>& dpos,
                       double& maxstep);
 
    void update_pos(UnitCell& ucell);  
};
 
#endif