24小时热门版块排行榜

返回列表

当前主题已经存档。

【有奖交流】积极回复本帖子，参与交流，就有机会分得作者 cysqxr 的 1 个金币

当前只显示满足指定条件的回帖，点击这里查看本话题的所有回帖

cysqxr

木虫 (小有名气)

应助: 0 (幼儿园)
金币: 721.9
散金: 167
红花: 3
帖子: 177
在线: 264.9小时
虫号: 299084
注册: 2006-11-21
专业: 理论和计算化学

[交流] 【求助】有人能解释一下局部优化吗？

局部优化在高斯中有几个固定的关键字，但是有哪位高手给指点一下具体应该怎么办？

回复此楼

» 猜你喜欢

重庆文理学院2026年硕士研究生招生调剂信息化学、材料工程已经有0人回复
中南林科大化工院专硕第三批调剂已经有2人回复
物理化学论文润色/翻译怎么收费? 已经有194人回复
26年储能、电池方向博士申请已经有2人回复
大连工业大学杰青/长江团队-生物质材料-储能电池方向招收2026级博士生已经有1人回复
欢迎硕博咨询已经有24人回复
求审搞机会已经有4人回复
昆明理工大学冶能院离子液体冶金课题组招收博士生已经有2人回复
湖南大学刘巧玲课题组2026年博士研究生招生信息已经有28人回复
锂电池正极材料前驱体法制备正极材料已经有0人回复

1楼 2008-09-28 09:17:44

已阅回复此楼关注TA 给TA发消息送TA红花 TA的回帖

abbott

金虫 (著名写手)

不要用QQ问我东西

应助: 16 (小学生)
金币: 1071.6
散金: 2787
红花: 10
帖子: 1015
在线: 105.2小时
虫号: 452267
注册: 2007-11-05
性别: GG
专业: 计算机硬件技术

★ ★
gwdavid(金币+2,VIP+0):谢谢交流！欢迎再次光临模拟版！

我是一知半解，我知道的东西，贴在下面，希望对你有用。

1  关于优化的基本概念
Geometry Optimization - Basic Considerations
1。
How much output is generated during geometry optimization (and actually all other types of Gaussian calculations as well) depends on the beginning of the keyword line:

#P  will provide somewhat more detailed output
# will provide normal output
#T  will provide somewhat less output
2。
Geometry optimization can be performed in three different types of coordinate systems. Please observe that the way, the geometry is defined in the input file, is actually separate from deciding, in which coordinate system the optimization will be performed:

opt=Z-Matrix will optimize the geometry in internal coordinates (as provided in the input file)
opt or opt=Redundant will optimize the geometry in redundant internal coordinates (chosen automatically)
opt=Cartesian will optimize the geometry in Cartesian coordinates

For all three options, the optimization algorithm will vary the structure of the system until changes in the gradient and the structure on two successive iterations are smaller than prefixed values (convergence criteria). For each step of the geometry optimization, Gaussian will write to the output file a) the current structure of the system, b) the energy for this structure, c) the derivative of the energy with respect to the geometric variables (the gradients), d) a summary of the convergence criteria.

3。
For all methods used in Gaussian, the energy will be given in atomic units (au). The atomic unit of energy is called Hartree and equates to other energy units as follows:

1 Hartree = 627.15 kcal/mol
1 Hartree = 2625.5 kJ/mol
1 Hartree = 27.2116 eV
1 Hartree = 4.3597482*10-18 J/particle

The energies of molecular systems as calculated by most quantum mechanical methods called "ab initio" are calculated relative to separate electrons and nuclei. Energies for molecular systems are therefore very large and negative. In the output files the energies are prefaced by "SCF" and the UNIX command grep "SCF" output.file can therefore be used to list all energies contained in a Gaussian output file.

Some of the theoretical methods available in Gaussian such as AM1, MNDO, or PM3 produce heats of formation (that is, the energy of the system relative to its constituent elements in their standard states at 298.15K and 1 atm(101325 Pa). Heats of formation can be either positive or negative and are comparatively small. By definition the heats of formation of the elements are zero. The heats of formation contained in the output file can be listed using grep "Energy= " output.file
4。
After each iteration of the geometry optimization, the output files contain a summary of the current stage of the optimization:

      Item             value    Threshold  Converged?
Maximum Force          0.021672    0.000450    NO
RMS    Force          0.018596    0.000300    NO
Maximum Displacement    0.038954    0.001800    NO
RMS    Displacement    0.033876    0.001200    NO
Predicted change in Energy=-1.250480D-03

The first two lines contain the maximum remaining force on an atom in the system as well as the average (RMS, root mean square) force on all atoms. In any case of doubt, this information is given in atomic units (here: Hartrees/Bohr and Hartrees/Radians). Together with the actual value for the current structure appears the Threshold value. The third and fourth convergence criteria are the maximum displacement, that is, the maximum structural change of one coordinate as well as the average (RMS) change over all structural parameters in the last two iterations. Once the current values of all four criteria fall below the threshold, the optimization is complete. The convergence criteria can be changed in two different ways:

1) Using the opt keyword
opt without any additional information sets the RMS force criterion to 3*10-4
opt=tight will set the RMS force criterion to 1*10-5 and scale the other three criteria accordingly
opt=verytight will set the RMS force criterion to 1*10-6 and scale the other three criteria accordingly

2) Using the IOP keyword (Internal Option)
iop(1/7=x) will set the RMS force criterion to x*10-6 and scale the other three criteria accordingly. Thus, using iop(1/7=10) one can obtain the same final result as with opt=tight.

Choosing tighter convergence criteria will, of course, give improved results but will also need more computer time. The default settings are appropriate for small systems. Especially for large structures, however, convergence of the last two criteria can be very slow and it is sometimes advisable to stop optimizations before all four criteria are fulfilled. The maximum number of optimization cycles depends on the size of the system and is automatically adjusted by Gaussian. If a particular setting of optimization cycles is desired, however, this can be specified using

opt=(maxcycles=n) 5。
The default optimization algorithm included in Gaussian is the "Berny algorithm" developed by Bernhard Schlegel. This algorithm uses the forces acting on the atoms of a given structure together with the second derivative matrix (called the Hessian matrix) to predict energetically more favorable structures and thus optimize the molecular structure towards the next local minimum on the potential energy surface. As explicit calculation of the second derivative matrix is quite costly, the Berny algorithm constructs an approximate Hessian at the beginning of the optimization procedure through application of a simple valence force field, and then uses the energies and first derivatives calculated along the optimization pathway to update this approximate Hessian matrix. The success of the optimization procedure therefore depends to some degree on how well the approximate Hessian represents the true situation at a given point. For many "normal" systems, the approximate Hessians work quite well, but in a few cases a better Hessian has to be used. Often it is sufficient to calculate the Hessian matrix explicitly once at the beginning of the calculation and then use the standard updating scheme of the Berny algorithm. This is specified using the

opt=calcfc keyword. In some very rare cases, the Hessian changes considerably between optimization steps and must then be recomputed after each optimization step using the

opt=calcall keyword.

In case a number of different options are to be specified for geometry optimization, these options must be given in parenthesis:

opt=(Z-Matrix,calcfc,tight,maxcycles=25)

[ Last edited by abbott on 2008-9-29 at 22:05 ]