Computational matrix diagonalization

An older method of obtaining the coefficients and energy levels from the secular equations (Eqs. 4.49 for a two-basis-function system) utilizes determinants rather than matrices. The method is much more cumbersome than the matrix diagonaliza-tion approach of Section 4.3.4, but in the absence of cheap, readily-available computers (matrix diagonalization is easily handled by a personal computer) its erstwhile employment may be forgiven. It is outlined here because traditional presentations of the SHM [21] use it. 

Iterative approaches, including time-dependent methods, are especially successfiil for very large-scale calculations because they generally involve the action of a very localized operator (the Hamiltonian) on a fiinction defined on a grid. The effort increases relatively mildly with the problem size, since it is proportional to the number of points used to describe the wavefiinction (and not to the cube of the number of basis sets, as is the case for methods involving matrix diagonalization). Present computational power allows calculations... 

The second step determines the LCAO coefficients by standard methods for matrix diagonalization. In an Extended Hiickel calculation, this results in molecular orbital coefficients and orbital energies. Ab initio and NDO calculations repeat these two steps iteratively because, in addition to the integrals over atomic orbitals, the elements of the energy matrix depend upon the coefficients of the occupied orbitals. HyperChem ends the iterations when the coefficients or the computed energy no longer change the solution is then self-consistent. The method is known as Self-Consistent Field (SCF) calculation. 

SCF, see Self-consistent field treatment (SCF) Schroedinger equation, 2,4,74 Secular equations, 6,10, 52 solution by matrix diagonalization, 11 computer program for, 31-33 Self-consistent field treatment (SCF), of molecular orbitals, 28 Serine, structure of, 110 Serine proteases, 170-188. See also Subtilisin Trypsin enzyme family comparison of mechanisms for, 182-184, 183... 

In general, no simple, consistent set of analytical expressions for the resonance condition of all intradoublet transitions and all possible rhombicities can be derived with the perturbation theory for these systems. Therefore, the rather different approach is taken to numerically compute all effective g-values using quantum mechanics and matrix diagonalization techniques (Chapters 7-9) and to tabulate the results in the form of graphs of geff,s versus the rhombicity r = E/D. This is a useful approach because it turns out that if the zero-field interaction is sufficiently dominant over... 

Write a computer program that finds the principal moments and principal axes of inertia for a molecule. Do not use matrix diagonalization instead, solve the secular equation by using the formula for the roots of a cubic equation. The input to the program is the set of atomic masses and coordinates in an arbitrary system with axes not necessarily at the center of mass. 

In this regime, where the levels are discrete, it is possible to calculate the intensities of the transitions by matrix diagonalization, just as the energies are calculated. It is simply a matter of computing the eigenvectors of the Hamiltonian as well as its eigenvalues. For example, to calculate the intensities in the spectra shown in Fig. 8.12 we calculate the rcp amplitude in each of the Stark states and multiply it by the matrix element connecting the 3s state to the n p state,... 

Likewise, the three columns of the matrix A2 above represent three mutually perpendicular, normalized vectors in 3D space. A better name for an orthogonal matrix would be an orthonormal matrix. Orthogonal matrices are important in computational chemistry because molecular orbitals can be regarded as orthonormal vectors in a generalized -dimensional space (Hilbert space, after the mathematician David Hilbert). We extract information about molecular orbitals from matrices with the aid of matrix diagonalization. 

Check it out. Linear algebra texts describe an analytical procedure using determinants, but computational chemistry employs a numerical iterative procedure called Jacobi matrix diagonalization, or some related method, in which the off-diagonal elements are made to approach zero. 

---