DOCSLIB.ORG

Greatest Common Divisor from Wikipedia, the Free Encyclopedia Contents

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Greatest Common Divisor from Wikipedia, the Free Encyclopedia Contents Greatest common divisor From Wikipedia, the free encyclopedia Contents 1 Augmented matrix 1 1.1 Examples ............................................... 1 1.1.1 Matrix inverse ......................................... 1 1.1.2 Existence and number of solutions .............................. 2 1.1.3 Solution of a linear system .................................. 2 1.2 References ............................................... 3 2 Coefficient 4 2.1 Linear algebra ............................................. 4 2.2 Examples of physical coefficients ................................... 5 2.3 See also ................................................ 5 2.4 References ............................................... 5 3 Coefficient matrix 6 3.1 Example ................................................ 6 3.2 See also ................................................ 6 4 Determinant 7 4.1 Definition ............................................... 7 4.1.1 2 × 2 matrices ......................................... 8 4.1.2 3 × 3 matrices ......................................... 10 4.1.3 n × n matrices ......................................... 10 4.2 Properties of the determinant ..................................... 12 4.2.1 Multiplicativity and matrix groups .............................. 14 4.2.2 Laplace’s formula and the adjugate matrix .......................... 14 4.2.3 Sylvester’s determinant theorem ............................... 15 4.3 Properties of the determinant in relation to other notions ....................... 15 4.3.1 Relation to eigenvalues and trace ............................... 15 4.3.2 Cramer’s rule ......................................... 17 4.3.3 Block matrices ........................................ 17 4.3.4 Derivative ........................................... 18 4.4 Abstract algebraic aspects ....................................... 19 4.4.1 Determinant of an endomorphism .............................. 19 i ii CONTENTS 4.4.2 Exterior algebra ........................................ 19 4.4.3 Square matrices over commutative rings and abstract properties ............... 20 4.5 Generalizations and related notions .................................. 21 4.5.1 Infinite matrices ........................................ 21 4.5.2 Related notions for non-commutative rings .......................... 21 4.5.3 Further variants ........................................ 21 4.6 Calculation ............................................... 21 4.6.1 Decomposition methods ................................... 21 4.6.2 Further methods ....................................... 22 4.7 History ................................................. 22 4.8 Applications .............................................. 23 4.8.1 Linear independence ..................................... 23 4.8.2 Orientation of a basis ..................................... 23 4.8.3 Volume and Jacobian determinant .............................. 24 4.8.4 Vandermonde determinant (alternant) ............................ 24 4.8.5 Circulants ........................................... 25 4.9 See also ................................................ 25 4.10 Notes ................................................. 25 4.11 References ............................................... 27 4.12 External links ............................................. 27 5 Greatest common divisor 28 5.1 Overview ............................................... 28 5.1.1 Notation ........................................... 28 5.1.2 Example ........................................... 28 5.1.3 Reducing fractions ...................................... 29 5.1.4 Coprime numbers ...................................... 29 5.1.5 A geometric view ....................................... 29 5.2 Calculation .............................................. 29 5.2.1 Using prime factorizations .................................. 29 5.2.2 Using Euclid’s algorithm ................................... 30 5.2.3 Binary method ........................................ 30 5.2.4 Other methods ........................................ 31 5.3 Properties ............................................... 32 5.4 Probabilities and expected value ................................... 33 5.5 The gcd in commutative rings ..................................... 33 5.6 See also ................................................ 34 5.7 Notes ................................................. 34 5.8 References .............................................. 35 5.9 Further reading ............................................ 35 5.10 External links ............................................. 35 CONTENTS iii 6 Linear equation 38 6.1 One variable ............................................. 39 6.2 Two variables ............................................. 39 6.2.1 Forms for two-dimensional linear equations ......................... 39 6.2.2 Connection with linear functions ............................... 43 6.2.3 Examples ........................................... 44 6.3 More than two variables ........................................ 44 6.4 See also ................................................ 44 6.5 Notes ................................................. 44 6.6 References .............................................. 44 6.7 External links ............................................. 45 7 Mathematics 46 7.1 History ................................................. 47 7.1.1 Evolution ........................................... 47 7.1.2 Etymology .......................................... 49 7.2 Definitions of mathematics ...................................... 50 7.2.1 Mathematics as science .................................... 50 7.3 Inspiration, pure and applied mathematics, and aesthetics ....................... 53 7.4 Notation, language, and rigor ..................................... 54 7.5 Fields of mathematics ......................................... 54 7.5.1 Foundations and philosophy .................................. 55 7.5.2 Pure mathematics ....................................... 56 7.5.3 Applied mathematics ..................................... 58 7.6 Mathematical awards ......................................... 58 7.7 See also ................................................ 59 7.8 Notes ................................................. 59 7.9 References ............................................... 61 7.10 Further reading ............................................ 62 7.11 External links ............................................. 62 8 Matrix (mathematics) 64 8.1 Definition ............................................... 65 8.1.1 Size .............................................. 65 8.2 Notation ................................................ 66 8.3 Basic operations ............................................ 66 8.3.1 Addition, scalar multiplication and transposition ....................... 66 8.3.2 Matrix multiplication ..................................... 67 8.3.3 Row operations ........................................ 68 8.3.4 Submatrix ........................................... 68 8.4 Linear equations ............................................ 69 8.5 Linear transformations ......................................... 69 iv CONTENTS 8.6 Square matrices ............................................ 69 8.6.1 Main types .......................................... 70 8.6.2 Main operations ........................................ 72 8.7 Computational aspects ......................................... 73 8.8 Decomposition ............................................ 74 8.9 Abstract algebraic aspects and generalizations ............................. 75 8.9.1 Matrices with more general entries .............................. 75 8.9.2 Relationship to linear maps .................................. 76 8.9.3 Matrix groups ......................................... 76 8.9.4 Infinite matrices ........................................ 77 8.9.5 Empty matrices ........................................ 77 8.10 Applications .............................................. 78 8.10.1 Graph theory ......................................... 78 8.10.2 Analysis and geometry .................................... 78 8.10.3 Probability theory and statistics ................................ 79 8.10.4 Symmetries and transformations in physics .......................... 80 8.10.5 Linear combinations of quantum states ............................ 81 8.10.6 Normal modes ........................................ 81 8.10.7 Geometrical optics ...................................... 82 8.10.8 Electronics .......................................... 82 8.11 History ................................................. 82 8.11.1 Other historical usages of the word “matrix” in mathematics ................. 83 8.12 See also ................................................ 83 8.13 Notes ................................................. 84 8.14 References ............................................... 87 8.14.1 Physics references ....................................... 89 8.14.2 Historical references ..................................... 90 8.15 External links ............................................. 90 9 Numerical linear algebra 92 9.1 See also ................................................ 92 9.2 References .............................................. 92 9.3 External links ............................................. 93 10 System of linear equations 94 10.1 Elementary example .......................................... 95 10.2 General form ............................................
Load more

Recommended publications
  • Arxiv:1809.04476V2 [Physics.Chem-Ph] 18 Oct 2018 (Sub)States
    Quantum System Partitioning at the Single-Particle Level Quantum System Partitioning at the Single-Particle Level Adrian H. M¨uhlbach and Markus Reihera) ETH Z¨urich, Laboratorium f¨ur Physikalische Chemie, Vladimir-Prelog-Weg 2, CH-8093 Z¨urich,Switzerland (Dated: 17 October 2018) We discuss the partitioning of a quantum system by subsystem separation through unitary block- diagonalization (SSUB) applied to a Fock operator. For a one-particle Hilbert space, this separation can be formulated in a very general way. Therefore, it can be applied to very different partitionings ranging from those driven by features in the molecular structure (such as a solute surrounded by solvent molecules or an active site in an enzyme) to those that aim at an orbital separation (such as core-valence separation). Our framework embraces recent developments of Manby and Miller as well as older ones of Huzinaga and Cantu. Projector-based embedding is simplified and accelerated by SSUB. Moreover, it directly relates to decoupling approaches for relativistic four-component many-electron theory. For a Fock operator based on the Dirac one-electron Hamiltonian, one would like to separate the so-called positronic (negative-energy) states from the electronic bound and continuum states. The exact two-component (X2C) approach developed for this purpose becomes a special case of the general SSUB framework and may therefore be viewed as a system- environment decoupling approach. Moreover, for SSUB there exists no restriction with respect to the number of subsystems that are generated | in the limit, decoupling of all single-particle states is recovered, which represents exact diagonalization of the problem.
    [Show full text]
  • A New Scalable Parallel Algorithm for Fock Matrix Construction
    A New Scalable Parallel Algorithm for Fock Matrix Construction Xing Liu Aftab Patel Edmond Chow School of Computational Science and Engineering College of Computing, Georgia Institute of Technology Atlanta, Georgia, 30332, USA [email protected], [email protected], [email protected] Abstract—Hartree-Fock (HF) or self-consistent field (SCF) ber of independent tasks and using a centralized dynamic calculations are widely used in quantum chemistry, and are scheduler for scheduling them on the available processes. the starting point for accurate electronic correlation methods. Communication costs are reduced by defining tasks that Existing algorithms and software, however, may fail to scale for large numbers of cores of a distributed machine, particularly in increase data reuse, which reduces communication volume, the simulation of moderately-sized molecules. In existing codes, and consequently communication cost. This approach suffers HF calculations are divided into tasks. Fine-grained tasks are from a few problems. First, because scheduling is completely better for load balance, but coarse-grained tasks require less dynamic, the mapping of tasks to processes is not known communication. In this paper, we present a new parallelization in advance, and data reuse suffers. Second, the centralized of HF calculations that addresses this trade-off: we use fine- grained tasks to balance the computation among large numbers dynamic scheduler itself could become a bottleneck when of cores, but we also use a scheme to assign tasks to processes to scaling up to a large system [14]. Third, coarse tasks reduce communication. We specifically focus on the distributed which reduce communication volume may lead to poor load construction of the Fock matrix arising in the HF algorithm, balance when the ratio of tasks to processes is close to one.
    [Show full text]
  • Domain Decomposition and Electronic Structure Computations: a Promising Approach
    Domain Decomposition and Electronic Structure Computations: A Promising Approach G. Bencteux1,4, M. Barrault1, E. Canc`es2,4, W. W. Hager3, and C. Le Bris2,4 1 EDF R&D, 1 avenue du G´en´eral de Gaulle, 92141 Clamart Cedex, France {guy.bencteux,maxime.barrault}@edf.fr 2 CERMICS, Ecole´ Nationale des Ponts et Chauss´ees, 6 & 8, avenue Blaise Pascal, Cit´eDescartes, 77455 Marne-La-Vall´ee Cedex 2, France, {cances,lebris}@cermics.enpc.fr 3 Department of Mathematics, University of Florida, Gainesville, FL 32611-8105, USA, [email protected] 4 INRIA Rocquencourt, MICMAC project, Domaine de Voluceau, B.P. 105, 78153 Le Chesnay Cedex, FRANCE Summary. We describe a domain decomposition approach applied to the spe- cific context of electronic structure calculations. The approach has been introduced in [BCH06]. We survey here the computational context, and explain the peculiari- ties of the approach as compared to problems of seemingly the same type in other engineering sciences. Improvements of the original approach presented in [BCH06], including algorithmic refinements and effective parallel implementation, are included here. Test cases supporting the interest of the method are also reported. It is our pleasure and an honor to dedicate this contribution to Olivier Pironneau, on the occasion of his sixtieth birthday. With admiration, respect and friendship. 1 Introduction and Motivation 1.1 General Context Numerical simulation is nowadays an ubiquituous tool in materials science, chemistry and biology. Design of new materials, irradiation induced damage, drug design, protein folding are instances of applications of numerical sim- ulation. For convenience we now briefly present the context of the specific computational problem under consideration in the present article.
    [Show full text]
  • Matrix Algebra for Quantum Chemistry
    Matrix Algebra for Quantum Chemistry EMANUEL H. RUBENSSON Doctoral Thesis in Theoretical Chemistry Stockholm, Sweden 2008 Matrix Algebra for Quantum Chemistry Doctoral Thesis c Emanuel Härold Rubensson, 2008 TRITA-BIO-Report 2008:23 ISBN 978-91-7415-160-2 ISSN 1654-2312 Printed by Universitetsservice US AB, Stockholm, Sweden 2008 Typeset in LATEX by the author. Abstract This thesis concerns methods of reduced complexity for electronic structure calculations. When quantum chemistry methods are applied to large systems, it is important to optimally use computer resources and only store data and perform operations that contribute to the overall accuracy. At the same time, precarious approximations could jeopardize the reliability of the whole calcu- lation. In this thesis, the selfconsistent eld method is seen as a sequence of rotations of the occupied subspace. Errors coming from computational ap- proximations are characterized as erroneous rotations of this subspace. This viewpoint is optimal in the sense that the occupied subspace uniquely denes the electron density. Errors should be measured by their impact on the over- all accuracy instead of by their constituent parts. With this point of view, a mathematical framework for control of errors in HartreeFock/KohnSham calculations is proposed. A unifying framework is of particular importance when computational approximations are introduced to eciently handle large systems. An important operation in HartreeFock/KohnSham calculations is the calculation of the density matrix for a given Fock/KohnSham matrix. In this thesis, density matrix purication is used to compute the density matrix with time and memory usage increasing only linearly with system size. The forward error of purication is analyzed and schemes to control the forward error are proposed.
    [Show full text]
  • Problem Set #1 Solutions
    PROBLEM SET #2 SOLUTIONS by Robert A. DiStasio Jr. Q1. 1-particle density matrices and idempotency. (a) A matrix M is said to be idempotent if M 2 = M . Show from the basic definition that the HF density matrix is idempotent when expressed in an orthonormal basis. An element of the HF density matrix is given as (neglecting the factor of two for the restricted closed-shell HF density matrix): * PCCμν = ∑ μi ν i . (1) i In matrix form, (1) is simply equivalent to † PCC= occ occ (2) where Cocc is the occupied block of the MO coefficient matrix. To reformulate the nonorthogonal Roothaan-Hall equations FC= SCε (3) into the preferred eigenvalue problem ~~ ~ FC= Cε (4) the AO basis must be orthogonalized. There are several ways to orthogonalize the AO basis, but I will only discuss symmetric orthogonalization, as this is arguably the most often used procedure in computational quantum chemistry. In the symmetric orthogonalization procedure, the MO coefficient matrix in (3) is recast as ~ + 1 − 1 ~ CSCCSC=2 ⇔ = 2 (5) which can be substituted into (3) yielding the eigenvalue form of the Roothaan-Hall equations in (4) after the following algebraic manipulation: FC = SCε − 1 ~ − 1 ~ FSCSSC( 2 )(= 2 )ε − 1 − 1 ~ −1 − 1 ~ SFSCSSSC2 ( 2 )(= 2 2 )ε . (6) −1 − 1 ~ −1 − 1 ~ ()S2 FS2 C= () S2 SS2 Cε ~~ ~ FC = Cε ~ ~ −1 − 1 −1 − 1 In (6), the dressed Fock matrix, F , was clearly defined as F≡ S2 FS 2 and S2 SS2 = S 0 =1 was used. In an orthonormal basis, therefore, the density matrix of (2) takes on the following form: ~ ~† PCC= occ occ .
    [Show full text]
  • Relativistic Cholesky-Decomposed Density Matrix
    Relativistic Cholesky-decomposed density matrix MP2 Benjamin Helmich-Paris,1, 2, a) Michal Repisky,3 and Lucas Visscher2 1)Max-Planck-Institut f¨urKohlenforschung, Kaiser-Wilhelm-Platz 1, D-45470 M¨ulheiman der Ruhr 2)Section of Theoretical Chemistry, Vrije Universiteit Amsterdam, De Boelelaan 1083, 1081 HV Amsterdam, The Netherlands 3)Hylleraas Centre for Quantum Molecular Sciences, Department of Chemistry, UiT The Arctic University of Norway, N-9037 Tromø Norway (Dated: 15 October 2018) In the present article, we introduce the relativistic Cholesky-decomposed density (CDD) matrix second-order Møller–Plesset perturbation theory (MP2) energies. The working equations are formulated in terms of the usual intermediates of MP2 when employing the resolution-of-the-identity approximation (RI) for two-electron inte- grals. Those intermediates are obtained by substituting the occupied and vir- tual quaternion pseudo-density matrices of our previously proposed two-component atomic orbital-based MP2 (J. Chem. Phys. 145, 014107 (2016)) by the corresponding pivoted quaternion Cholesky factors. While working within the Kramers-restricted formalism, we obtain a formal spin-orbit overhead of 16 and 28 for the Coulomb and exchange contribution to the 2C MP2 correlation energy, respectively, compared to a non-relativistic (NR) spin-free CDD-MP2 implementation. This compact quaternion formulation could also be easily explored in any other algorithm to compute the 2C MP2 energy. The quaternion Cholesky factors become sparse for large molecules and, with a block-wise screening, block sparse-matrix multiplication algorithm, we observed an effective quadratic scaling of the total wall time for heavy-element con- taining linear molecules with increasing system size.
    [Show full text]
  • Lecture 16 Hartree Fock Implementation
    Quantum Chemistry Lecture 16 Implementation of Hartree-Fock Theory NC State University The linear combination of atomic orbitals (LCAO) Calculations of the energy and properties of molecules requires hydrogen-like wave functions on each of the nuclei. The Hartree-Fock method begins with assumption That molecular orbitals can be formed as a linear combination of atomic orbitals. The basis functions fm are hydrogen-like atomic orbitals that have been optimized by a variational procedure. The HF procedure is a variational procedure to minimize the coefficients Cmi. Note that we use the index m for atomic orbitals and i or j for molecular orbitals. Common types of atomic orbitals Slater-type orbitals (STOs) The STOs are like hydrogen atom wave functions. The problem with STOs arises in multicenter integrals. The Coulomb and exchange integrals involve electrons on different nuclei and so the distance r has a different origin. Gaussian-type orbitals (GTOs) Gaussian orbitals can be used to mimic the shape of exponentials, i.e. the form of the solutions for the hydrogen atom. Multicenter Gaussian integrals can be solved analytically. STOs vs GTOs GTOs are mathematically easy to work with STOs vs GTOs GTOs are mathematically easy to work with, but the shape of a Gaussian is not that similar to that of an exponential. STOs vs GTOs Therefore, linear combinations of Gaussians are used to imitate the shape of an exponential. Shown is a representation of the 3-Gaussian model of a STO. Double-zeta basis sets Since the remaining atoms have a different exponential dependence than hydrogen it is often convenient to include more parameters.
    [Show full text]
  • Fock Matrix Construction for Large Systems
    Fock Matrix Construction for Large Systems Elias Rudberg Theoretical Chemistry Royal Institute of Technology Stockholm 2006 Fock Matrix Construction for Large Systems Licentiate thesis c Elias Rudberg, 2006 ISBN 91-7178-535-3 ISBN 978-91-7178-535-0 Printed by Universitetsservice US AB, Stockholm, Sweden, 2006 Typeset in LATEX by the author Abstract This licentiate thesis deals with quantum chemistry methods for large systems. In particu- lar, the thesis focuses on the efficient construction of the Coulomb and exchange matrices which are important parts of the Fock matrix in Hartree–Fock calculations. The meth- ods described are also applicable in Kohn–Sham Density Functional Theory calculations, where the Coulomb and exchange matrices are parts of the Kohn–Sham matrix. Screening techniques for reducing the computational complexity of both Coulomb and exchange com- putations are discussed, as well as the fast multipole method, used for efficient computation of the Coulomb matrix. The thesis also discusses how sparsity in the matrices occurring in Hartree–Fock and Kohn– Sham Density Functional Theory calculations can be used to achieve more efficient storage of matrices as well as more efficient operations on them. As an example of a possible type of application, the thesis includes a theoretical study of Heisenberg exchange constants, using unrestricted Kohn–Sham Density Functional Theory calculations. iii Preface The work presented in this thesis has been carried out at the Department of Theoretical Chemistry, Royal Institute of Technology, Stockholm, Sweden. List of papers included in the thesis Paper 1 Efficient implementation of the fast multipole method, Elias Rudberg and Pawe l Sa lek,J.
    [Show full text]
  • Theoretical Studies of Charge Recombination Reactions
    Theoretical studies of charge recombination reactions Sifiso Musa Nkambule Akademisk avhandling f¨oravl¨aggandeav licentiatexamen vid Stockholms universitet, Fysikum. January, 2015. Abstract This thesis is based on theoretical studies that have been done for low-energy reactions involving small molecular systems. It is mainly focusing on mutual neutralization of oppositely charged ions and dissociative recombination of molecular ions. Both reactions involve highly excited electronic states that are coupled to each other. Employing electronic structure meth- ods, the electronic states relevant to the reactions are computed. It is necessary to go beyond the Born-Oppenheimer approximation and include non-adiabatic effects. This non-adiabatic behaviour plays a crucial role in driving the reactions. Schemes on how to go about and include these coupling elements are discussed in the thesis, which include computations of non-adiabatic and electronic couplings of the resonant states to the ionisation continuum. The nuclear dynamics are studied either semi-classically, using the Landau-Zener method or quantum mechanically, employing the time-independent and time-dependant Schr¨odinger + equations. Reactions studied here are mutual neutralization in collision of H + H−, where both the semi-classical and quantum mechanical methods are employed. Total and differential cross sections are computed for all hydrogen isotopes. We also perform quantum mechanical + studies of mutual neutralization in the collision of He + H−. For this system not only the non-adiabatic couplings among the neutral states have to be considered, but also the electronic coupling to the ionization continuum. Worth noting in the two systems is that reactants and the final products belong to different electronic states, which a coupled together, hence for the reaction to take place there must be non-adiabatic transition.
    [Show full text]
  • Quaternion Symmetry in Relativistic Molecular Calculations: the Dirac–Hartree–Fock Method T
    Quaternion symmetry in relativistic molecular calculations: The Dirac–Hartree–Fock method T. Saue, H. Jensen To cite this version: T. Saue, H. Jensen. Quaternion symmetry in relativistic molecular calculations: The Dirac–Hartree– Fock method. Journal of Chemical Physics, American Institute of Physics, 1999, 111 (14), pp.6211- 6222. 10.1063/1.479958. hal-03327446 HAL Id: hal-03327446 https://hal.archives-ouvertes.fr/hal-03327446 Submitted on 27 Aug 2021 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. JOURNAL OF CHEMICAL PHYSICS VOLUME 111, NUMBER 14 8 OCTOBER 1999 Quaternion symmetry in relativistic molecular calculations: The Dirac–Hartree–Fock method T. Sauea) and H. J. Aa Jensen Department of Chemistry, University of Southern Denmark—Main campus: Odense University, DK-5230 Odense M, Denmark ͑Received 5 April 1999; accepted 9 July 1999͒ A symmetry scheme based on the irreducible corepresentations of the full symmetry group of a molecular system is presented for use in relativistic calculations. Consideration of time-reversal symmetry leads to a reformulation of the Dirac–Hartree–Fock equations in terms of quaternion algebra. Further symmetry reductions due to molecular point group symmetry are then manifested by a descent to complex or real algebra.
    [Show full text]
  • Hartree-Fock Theory
    Hartree-Fock theory Morten Hjorth-Jensen1 National Superconducting Cyclotron Laboratory and Department of Physics and Astronomy, Michigan State University, East Lansing, MI 48824, USA1 May 16-20 2016 c 2013-2016, Morten Hjorth-Jensen. Released under CC Attribution-NonCommercial 4.0 license Why Hartree-Fock? Hartree-Fock (HF) theory is an algorithm for finding an approximative expression for the ground state of a given Hamiltonian. The basic ingredients are I Define a single-particle basis f αg so that HF h^ α = "α α with the Hartree-Fock Hamiltonian defined as HF HF h^ = t^+u ^ext +u ^ HF I The term u^ is a single-particle potential to be determined by the HF algorithm. HF I The HF algorithm means to choose u^ in order to have HF hH^i = E = hΦ0jH^jΦ0i that is to find a local minimum with a Slater determinant Φ0 being the ansatz for the ground state. HF I The variational principle ensures that E ≥ E0, with E0 the exact ground state energy. Why Hartree-Fock? We will show that the Hartree-Fock Hamiltonian h^HF equals our definition of the operator f^ discussed in connection with the new definition of the normal-ordered Hamiltonian (see later lectures), that is we have, for a specific matrix element HF X hpjh^ jqi = hpjf^jqi = hpjt^+u ^extjqi + hpijV^jqiiAS ; i≤F meaning that HF X hpju^ jqi = hpijV^jqiiAS : i≤F The so-called Hartree-Fock potential u^HF brings an explicit medium dependence due to the summation over all single-particle states below the Fermi level F .
    [Show full text]
  • Restricted Closed Shell Hartree Fock Roothaan Matrix Method Applied to Helium Atom Using Mathematica Introduction the Hartree Fo
    European J of Physics Education Volume 5 Issue 1 2014 Acosta, Tapia, Cab Restricted Closed Shell Hartree Fock Roothaan Matrix Method Applied to Helium Atom using Mathematica César R. Acosta*1 J. Alejandro Tapia1 César Cab1 1Av. Industrias no Contaminantes por anillo periférico Norte S/N Apdo Postal 150 Cordemex Physics Engineering Department Universidad Autónoma de Yucatán *[email protected] (Received: 20.12. 2013, Accepted: 13.02.2014) Abstract Slater type orbitals were used to construct the overlap and the Hamiltonian core matrices; we also found the values of the bi-electron repulsion integrals. The Hartree Fock Roothaan approximation process starts with setting an initial guess value for the elements of the density matrix; with these matrices we constructed the initial Fock matrix. The Mathematica software was used to program the matrix diagonalization process from the overlap and Hamiltonian core matrices and to make the recursion loop of the density matrix. Finally we obtained a value for the ground state energy of helium. Keywords: STO, Hartree Fock Roothaan approximation, spin orbital, ground state energy. Introduction The Hartree Fock method (Hartree, 1957) also known as Self Consistent Field (SCF) could be made with two types of spin orbital functions, the Slater Type Orbitals (STO) and the Gaussian Type Orbital (GTO), the election is made in function of the integrals of spin orbitals implicated. We used the STO to construct the wave function associated to the helium atom electrons. The application of the quantum mechanical theory was performed using a numerical method known as the finite element method, this gives the possibility to use the computer for programming the calculations quickly and efficiently (Becker, 1988; Brenner, 2008; Thomee, 2003; Reddy, 2004).
    [Show full text]