Fast and robust algorithm for energy minimization of spin systems applied in an analysis of high temperature spin configurations in terms of skyrmion density
From MaRDI portal
Publication:6041599
DOI10.1016/J.CPC.2020.107749arXiv1904.02669OpenAlexW3106704509MaRDI QIDQ6041599FDOQ6041599
Authors:
Publication date: 31 May 2023
Published in: Computer Physics Communications (Search for Journal in Brave)
Abstract: An algorithm for the minimization of the energy of magnetic systems is presented and applied to the analysis of thermal configurations of a ferromagnet to identify inherent structures, i.e. the nearest local energy minima, as a function of temperature. Over a rather narrow temperature interval, skyrmions appear and reach a high temperature limit for the skyrmion density. In addition, the performance of the algorithm is further demonstrated in a self-consistent field calculation of a skyrmion in an itinerant magnet. The algorithm is based on a geometric approach in which the curvature of the spherical domain is taken into account and as a result the length of the magnetic moments is preserved in every iteration. In the limit of infinitesimal rotations, the minimization path coincides with that obtained using damped spin dynamics while the use of limited-memory quasi-newton minimization algorithms, such as the limited-memory Broyden-Fletcher-Goldfarb-Shanno (LBFGS) algorithm, significantly accelerates the convergence.
Full work available at URL: https://arxiv.org/abs/1904.02669
Recommendations
- Skyrmion approach to finite density and temperature
- Fast spin dynamics algorithms for classical spin systems
- Parallel Processing and Applied Mathematics
- Configurational entropy of skyrmions and half-skyrmions in planar magnetic elements
- AN EFFICIENT DENSITY FUNCTIONAL ALGORITHM IN A STRONG MAGNETIC FIELD
- Fast approximate simulation of finite long-range spin systems
- An efficient implementation of high-order coupled-cluster techniques applied to quantum magnets
- SKRYN: a fast semismooth-Krylov-Newton method for controlling Ising spin systems
Cites Work
- Fast parallel algorithms for short-range molecular dynamics
- Title not available (Why is that?)
- The Geometry of Algorithms with Orthogonality Constraints
- Title not available (Why is that?)
- Derivatives of the matrix exponential and their computation
- Title not available (Why is that?)
- Geometric integration on spheres and some interesting applications
- Conjugate gradient algorithm for optimization under unitary matrix constraint
- Preconditioned nonlinear conjugate gradient method for micromagnetic energy minimization
Cited In (2)
This page was built for publication: Fast and robust algorithm for energy minimization of spin systems applied in an analysis of high temperature spin configurations in terms of skyrmion density
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041599)