Defaults.h

Go to the documentation of this file.

/******************************************************************************
 * Copyright (c) 2021.                                                        *
 * The Regents of the University of Michigan and DFT-EFE developers.          *
 *                                                                            *
 * This file is part of the DFT-EFE code.                                     *
 *                                                                            *
 * DFT-EFE is free software: you can redistribute it and/or modify            *
 *   it under the terms of the Lesser GNU General Public License as           *
 *   published by the Free Software Foundation, either version 3 of           *
 *   the License, or (at your option) any later version.                      *
 *                                                                            *
 * DFT-EFE is distributed in the hope that it will be useful, but             *
 *   WITHOUT ANY WARRANTY; without even the implied warranty                  *
 *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.                     *
 *   See the Lesser GNU General Public License for more details.              *
 *                                                                            *
 * You should have received a copy of the GNU Lesser General Public           *
 *   License at the top level of DFT-EFE distribution.  If not, see           *
 *   <https://www.gnu.org/licenses/>.                                         *
 ******************************************************************************/
 
/*
 * @author Avirup Sircar
 */
 
#ifndef dftefeDFTDefaults_h
#define dftefeDFTDefaults_h
 
#include <utils/TypeConfig.h>
#include <string>
#include <utils/MathConstants.h>
#include <atoms/AtomTCIASpline.h>
#include <utils/MemorySpaceType.h>
#include <linearAlgebra/LinearAlgebraTypes.h>
 
namespace dftefe
{
  namespace ksdft
  {
    class PoissonProblemDefaults
    {
    public:
      //
      // The CG Preconditioner Type chosen for Poisson Problem
      //
      static const linearAlgebra::PreconditionerType PC_TYPE;
 
      //
      // The number of batched gemms done
      //
      static const size_type CELL_BATCH_SIZE;
 
      //
      // Maximum iteration for CG
      //
      static const size_type MAX_ITER;
 
      //
      // Absolute tolerance of the residual |AX-b|
      //
      static const double ABSOLUTE_TOL;
 
      //
      // Relative tolerance of the residual |AX-b|/|b|
      //
      static const double RELATIVE_TOL;
 
      //
      // Maximum residual tolerance for divergence
      //
      static const double DIVERGENCE_TOL;
 
    }; // end of class PoissonProblemDefaults
 
    class LinearEigenSolverDefaults
    {
    public:
      //
      // Tolerance of ill conditioning for the
      // orthogonalization step in CHFSi
      //
      static const double ILL_COND_TOL;
 
      //
      // Tolerance of ill conditioning for the
      // orthogonalization step in CHFSi
      //
      static const std::map<size_type, size_type> CHEBY_ORDER_LOOKUP;
 
      //
      // Max krylov subspace
      //
      static const size_type LANCZOS_MAX_KRYLOV_SUBSPACE;
 
      //
      // Tolerance for lanczos extreme eigenvalues
      //
      static const double LANCZOS_EXTREME_EIGENVAL_TOL;
 
      //
      // Tolerance for lanczos beta tolerance
      //
      static const double LANCZOS_BETA_TOL;
 
    }; // end of class LinearEigenSolverDefaults
 
    class NewtonRaphsonSolverDefaults
    {
    public:
      //
      // Maximum iteration for NR
      //
      static const size_type MAX_ITER;
 
      //
      // Tolerance of force to check divergence
      //
      static const double FORCE_TOL;
 
    }; // end of class NewtonRaphsonSolverDefaults
 
    class Constants
    {
    public:
      //
      // Boltzman constant in hartree units
      //
      static const double BOLTZMANN_CONST_HARTREE;
 
      //
      // LDA exchange constant C = -3/4 * (3/pi)^1/3
      //
      static const double LDA_EXCHANGE_ENERGY_CONST;
    }; // end of class Constants
 
    class LibxcDefaults
    {
    public:
      //
      // tolerance below which density is assumed zero
      //
      static const double DENSITY_ZERO_TOL;
    }; // end of class Constants
 
    template <utils::MemorySpace memorySpace>
    class KSDFTDefaults
    {
    public:
      //
      // The number of batched gemms done
      //
      static const size_type MAX_WAVEFN_BATCH_SIZE;
      static const size_type MAX_KINENG_WAVEFN_BATCH_SIZE;
      // 1 for HOST, 50 for DEVICE
      static const size_type CELL_BATCH_SIZE;
      static const size_type CELL_BATCH_SIZE_GRAD_EVAL;
      static const size_type MAX_DENSCOMP_WAVEFN_BATCH_SIZE;
      static const size_type SCALAPACK_PARAL_PROCS;
      static const size_type SCALAPACK_BLOCK_SIZE;
    };
 
    class ElectroHamiltonianDefaults
    {
    public:
      //
      // AatomPartitionTolONCV
      //
      static const double ATOM_PARTITION_TOL_BETA;
    };
 
    class TCIADataDefaults
    {
    public:
      static const atoms::TCIADataParams TCIA_PARAMS;
    }; // end of class AtomTCIADataDefaults
 
    class MaxSizeDefaults
    {
    public:
      static const size_type SIZE_TYPE_MAX;
    }; // end of class MaxSizeDefaults
 
  } // end of namespace ksdft
 
  static constexpr utils::MemorySpace memorySpaceHost =
    utils::MemorySpace::HOST;
 
} // end of namespace dftefe
#endif // dftefeDFTDefaults_h