Using the recently introduced delocalized internal coordinates, in conjunction with the classical method of Lagrange multipliers, an algorithm for constrained optimization is presented in which the desired constraints do not have to be satisfied in the starting geometry. The method used is related t
Constrained optimization in cartesian coordinates
β Scribed by Jon Baker; Doreen Bergeron
- Publisher
- John Wiley and Sons
- Year
- 1993
- Tongue
- English
- Weight
- 835 KB
- Volume
- 14
- Category
- Article
- ISSN
- 0192-8651
No coin nor oath required. For personal study only.
β¦ Synopsis
Modifications are made to a previously published algorithm for constrained optimization in Cartesian coordinates (J. Comp. Chem., 13,240, 1992) to incorporate both fmed and dummy atoms. Standard distance and angle constraints can now be specified with respect to dummy atoms, greatly extending the range of constraints that can be handled. Fixed atoms can be eliminated from the optimization space and so there is no need to calculate their gradients resulting in potentially significant savings of CPU time in ab initio computations. Several examples illustrate the range and versatility of the modified algorithm. 0 1993 by John Wiley & Sons, Inc.
π SIMILAR VOLUMES
Geometry optimization directly in Cartesian coordinates using the EF and GDIIS algorithms with standard Hessian updating techniques is compared and contrasted with optimization in internal coordinates utilizing the well known 2-matrix formalism. Results on a test set of 20 molecules show that, with
## Abstract The meshfree approximation functions for shell analysis to date are formulated using parametric coordinates, and this parametric description of shell kinematics limits the applications only to shell structures with simple geometries. On the other hand, construction of moving least squar