IDEAS home Printed from https://ideas.repec.org/a/spr/eurphb/v44y2005i3p309-315.html
   My bibliography  Save this article

Efficiency of the microcanonical over-relaxation algorithm for vector spins analyzing first and second order transitions

Author

Listed:
  • K. Kanki
  • D. Loison
  • K. D. Schotte

Abstract

We simulate vectorial spin systems solely with the microcanonical over-relaxation algorithm where the temperature is calculated by a formula of Nurdin and Schotte. We show that this procedure is the most efficient local algorithm besides the nonlocal cluster algorithm not only for first order transitions but also for second order ones. A comparison is made with the Metropolis, heat bath, multicanonical and the Creutz’s demon algorithms. We study, using these algorithms, the frustrated J1-J2 model on a cubic lattice for XY, Heisenberg and O(4) spins. These models have a breakdown of symmetry Z3 ⊗SO(N)/SO(N-1) for the number N=2,3,4 of spin components leading to transitions of first order. We show that they are strongly first order. Then, to test the over-relaxation update for second order transitions, we study a ferromagnet on a cubic lattice and a frustrated antiferromagnet on a stacked triangular lattice. We finally point out the advantages and the flaws of the over-relaxation procedure. Copyright EDP Sciences/Società Italiana di Fisica/Springer-Verlag 2005

Suggested Citation

  • K. Kanki & D. Loison & K. D. Schotte, 2005. "Efficiency of the microcanonical over-relaxation algorithm for vector spins analyzing first and second order transitions," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 44(3), pages 309-315, April.
    • Handle: RePEc:spr:eurphb:v:44:y:2005:i:3:p:309-315
    DOI: 10.1140/epjb/e2005-00130-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1140/epjb/e2005-00130-7
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1140/epjb/e2005-00130-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:eurphb:v:44:y:2005:i:3:p:309-315. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.