Improved constraint satisfaction in a simple generalized gradient approximation exchange functional.

نویسندگان

  • Alberto Vela
  • Juan C Pacheco-Kato
  • José L Gázquez
  • Jorge M del Campo
  • S B Trickey
چکیده

Though there is fevered effort on orbital-dependent approximate exchange-correlation functionals, generalized gradient approximations, especially the Perdew-Burke-Ernzerhof (PBE) form, remain the overwhelming choice in calculations. A simple generalized gradient approximation (GGA) exchange functional [A. Vela, V. Medel, and S. B. Trickey, J. Chem. Phys. 130, 244103 (2009)] was developed that improves substantially over PBE in energetics (on a typical test set) while being almost as simple in form. The improvement came from constraining the exchange enhancement factor to be below the Lieb-Oxford bound for all but one value of the exchange dimensionless gradient, s, and to go to the uniform electron gas limit at both s = 0 and s → ∞. Here we discuss the issue of asymptotic constraints for GGAs and show that imposition of the large s constraint, lim(s→∞)s(1/2)F(xc)(n,s)<∞, where F(xc)(n, s) is the enhancement factor and n is the electron density, upon the Vela-Medel-Trickey (VMT) exchange functional yields modest further improvement. The resulting exchange functional, denoted VT{8,4}, is only slightly more complicated than VMT and easy to program. Additional improvement is obtained by combining VT{8,4} or VMT exchange with the Lee-Yang-Parr correlation functional. Extensive computational results on several datasets are provided as verification of the overall performance gains of both versions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Communication: A global hybrid generalized gradient approximation to the exchange-correlation functional that satisfies the second-order density-gradient constraint and has broad applicability in chemistry.

We extend our recent SOGGA11 approximation to the exchange-correlation functional to include a percentage of Hartree-Fock exchange. The new functional, called SOGGA11-X, has better overall performance for a broad chemical database than any previously available global hybrid generalized gradient approximation, and in addition it satisfies an extra physical constraint in that it is correct to sec...

متن کامل

بررسی خواص ساختاری و الکترونی بلورCaS

  The electronic and structural properties of CaS are calculated using full potential linearized augmented plane wave (FP-LAPW) method within the local density approximation (LDA) and generalized gradient approximation (GGA) for the exchange-correlation energy. For both structures, NaCl structure (B1) and CsCl structure (B2), the obtained values for lattice parameters, Bulk modulus and its pres...

متن کامل

Variable Lieb-Oxford bound satisfaction in a generalized gradient exchange-correlation functional.

We propose a different way to satisfy both gradient expansion limiting behavior and the Lieb-Oxford bound in a generalized gradient approximation exchange functional by extension of the Perdew-Burke-Ernzerhof (PBE) form. Motivation includes early and recent exploration of modified values for the gradient expansion coefficient in the PBE exchange-correlation functional (cf. the PBEsol functional...

متن کامل

Semilocal density functional obeying a strongly tightened bound for exchange.

Because of its useful accuracy and efficiency, density functional theory (DFT) is one of the most widely used electronic structure theories in physics, materials science, and chemistry. Only the exchange-correlation energy is unknown, and needs to be approximated in practice. Exact constraints provide useful information about this functional. The local spin-density approximation (LSDA) was the ...

متن کامل

SIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD

In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • The Journal of chemical physics

دوره 136 14  شماره 

صفحات  -

تاریخ انتشار 2012