Matrix representation

Abstract: Publisher Summary This chapter deals with the formal problem of reducing molecular orbital calculations to expressions involving one- and two-electron integrals over the spatial coordinates, with coefficients determined by the group theoretical properties of the spin functions and the electronic permutations. This problem is encountered, for example, when one undertakes to write the expectation value of the Hamiltonian for a given anti-symmetrized spin-orbital product, and in that particular case, the answer is well-known. The focus is on wave functions, which are constructed to be eigenfunctions of the spin, and shall consider the reduction of expressions not only for the energy and other spin-free one- and two-electron operators, but also for general one- and two-electron spin-dependent operators, such as the spin density or the Fermi contact interaction. It has been shown as how a spin-projected single-determinantal wave function based on different spatial orbitals for different spins can be related to the matrix representation method, and it is shown, how to calculate expectation values of both spin-free and spin-dependent operators.

Abstract: In this introductory talk, we first revisit with proof for illustration purposes some basic properties of a specific system of orthogonal polynomials, namely the Chebyshev polynomials of the first kind. Then we define the notion of orthogonal polynomials and provide with proof some basic properties such as: The uniqueness of a family of orthogonal polynomials with respect to a weight (up to a multiplicative factor), the matrix representation, the three-term recurrence relation, the Christoffel-Darboux formula and some of its consequences such as the separation of zeros and the Gauss quadrature rules.

Abstract: The goal of the LAPACK project is to design and implement a portable linear algebra library for efficient use on a variety of high-performance computers. The library is based on the widely used LINPACK and EISPACK packages for solving linear equations, eigenvalue problems, and linear least-squares problems, but extends their functionality in a number of ways. The major methodology for making the algorithms run faster is to restructure them to perform block matrix operations (e.g., matrix-matrix multiplication) in their inner loops. These block operations may be optimized to exploit the memory hierarchy of a specific architecture. The LAPACK project is also working on new algorithms that yield higher relative accuracy for a variety of linear algebra problems. >

Abstract: This primarily tutorial paper on the use of binary matrices in system modeling also includes new material related to the initial development of such matrices. The decomposition of binary matrices into levels such that all feedback is contained within the levels is illustrated. A method for developing a binary matrix en route to a structural model of a system is outlined. The development procedure partitions the matrix on the basis of supplied data entries. Then the interconnections between subsystems are added. This procedure permits transitivity to be used in developing the matrix.