Optimization of parameters for semiempirical methods I. Method
- 1 March 1989
- journal article
- research article
- Published by Wiley in Journal of Computational Chemistry
- Vol. 10 (2) , 209-220
- https://doi.org/10.1002/jcc.540100208
Abstract
A new method for obtaining optimized parameters for semiempirical methods has been developed and applied to the modified neglect of diatomic overlap (MNDO) method. The method uses derivatives of calculated values for properties with respect to adjustable parameters to obtain the optimized values of parameters. The large increase in speed is a result of using a simple series expression for calculated values of properties rather than employing full semiempirical calculations. With this optimization procedure, the rate‐determining step for parameterizing elements changes from the mechanics of parameterization to the assembling of experimental reference data.This publication has 17 references indexed in Scilit:
- Development and use of quantum molecular models. 75. Comparative tests of theoretical procedures for studying chemical reactionsJournal of the American Chemical Society, 1985
- Development and use of quantum mechanical molecular models. 76. AM1: a new general purpose quantum mechanical molecular modelJournal of the American Chemical Society, 1985
- Applications of quantum mechanical molecular models to chemical problems. Part 70. Quantum mechanical molecular modelsThe Journal of Physical Chemistry, 1985
- Ground states of molecules. 64.MNDO Calculations for compounds containing bromineJournal of Computational Chemistry, 1983
- A semiempirical model for the two-center repulsion integrals in the NDDO approximationTheoretical Chemistry Accounts, 1977
- The Convergence of a Class of Double-rank Minimization AlgorithmsIMA Journal of Applied Mathematics, 1970
- A new approach to variable metric algorithmsThe Computer Journal, 1970
- A family of variable-metric methods derived by variational meansMathematics of Computation, 1970
- Conditioning of quasi-Newton methods for function minimizationMathematics of Computation, 1970
- Variance algorithm for minimizationThe Computer Journal, 1968