Physics aware machine learning for micromagnetic energy minimization: recent algorithmic developments

• URL: http://arxiv.org/abs/2409.12877v1
• Date: Thu, 19 Sep 2024 16:22:40 GMT
• Title: Physics aware machine learning for micromagnetic energy minimization: recent algorithmic developments
• Authors: Sebastian Schaffer, Thomas Schrefl, Harald Oezelt, Norbert J Mauser, Lukas Exl,
• Abstract summary: Building on Brown's bounds for magnetostatic self-energy, we revisit their application in the context of variational formulations of the transmission problems. We reformulate these bounds on a finite domain, making the method more efficient and scalable for numerical simulation. Results highlight the potential of mesh-free Physics-Informed Neural Networks (PINNs) and Extreme Learning Machines (ELMs) when integrated with hard constraints.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this work, we explore advanced machine learning techniques for minimizing Gibbs free energy in full 3D micromagnetic simulations. Building on Brown's bounds for magnetostatic self-energy, we revisit their application in the context of variational formulations of the transmission problems for the scalar and vector potential. To overcome the computational challenges posed by whole-space integrals, we reformulate these bounds on a finite domain, making the method more efficient and scalable for numerical simulation. Our approach utilizes an alternating optimization scheme for joint minimization of Brown's energy bounds and the Gibbs free energy. The Cayley transform is employed to rigorously enforce the unit norm constraint, while R-functions are used to impose essential boundary conditions in the computation of magnetostatic fields. Our results highlight the potential of mesh-free Physics-Informed Neural Networks (PINNs) and Extreme Learning Machines (ELMs) when integrated with hard constraints, providing highly accurate approximations. These methods exhibit competitive performance compared to traditional numerical approaches, showing significant promise in computing magnetostatic fields and the application for energy minimization, such as the computation of hysteresis curves. This work opens the path for future directions of research on more complex geometries, such as grain structure models, and the application to large scale problem settings which are intractable with traditional numerical methods.

Related papers

• Neural Thermodynamic Integration: Free Energies from Energy-based Diffusion Models [19.871787625519513]
  We propose to perform thermodynamic integration (TI) along an alchemical pathway represented by a trainable neural network. In this work, we parametrize a time-dependent Hamiltonian interpolating between the interacting and non-interacting systems, and optimize its gradient. The ability of the resulting energy-based diffusion model to sample all intermediate ensembles allows us to perform TI from a single reference calculation.
  arXiv  Detail & Related papers  (2024-06-04T13:42:42Z)
• Feynman Diagrams as Computational Graphs [6.128507107025731]
  We propose a computational graph representation of high-order Feynman diagrams in Quantum Field Theory (QFT) Our approach effectively organizes these diagrams into a fractal structure of tensor operations, significantly reducing computational redundancy. Our work demonstrates the synergy between QFT and machine learning, establishing a new avenue for applying AI techniques to complex quantum many-body problems.
  arXiv  Detail & Related papers  (2024-02-28T03:45:55Z)
• D4FT: A Deep Learning Approach to Kohn-Sham Density Functional Theory [79.50644650795012]
  We propose a deep learning approach to solve Kohn-Sham Density Functional Theory (KS-DFT) We prove that such an approach has the same expressivity as the SCF method, yet reduces the computational complexity. In addition, we show that our approach enables us to explore more complex neural-based wave functions.
  arXiv  Detail & Related papers  (2023-03-01T10:38:10Z)
• NeuralStagger: Accelerating Physics-constrained Neural PDE Solver with Spatial-temporal Decomposition [67.46012350241969]
  This paper proposes a general acceleration methodology called NeuralStagger. It decomposing the original learning tasks into several coarser-resolution subtasks. We demonstrate the successful application of NeuralStagger on 2D and 3D fluid dynamics simulations.
  arXiv  Detail & Related papers  (2023-02-20T19:36:52Z)
• Sampling with Mollified Interaction Energy Descent [57.00583139477843]
  We present a new optimization-based method for sampling called mollified interaction energy descent (MIED) MIED minimizes a new class of energies on probability measures called mollified interaction energies (MIEs) We show experimentally that for unconstrained sampling problems our algorithm performs on par with existing particle-based algorithms like SVGD.
  arXiv  Detail & Related papers  (2022-10-24T16:54:18Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• Rotation Invariant Graph Neural Networks using Spin Convolutions [28.4962005849904]
  Machine learning approaches have the potential to approximate Density Functional Theory (DFT) in a computationally efficient manner. We introduce a novel approach to modeling angular information between sets of neighboring atoms in a graph neural network. Results are demonstrated on the large-scale Open Catalyst 2020 dataset.
  arXiv  Detail & Related papers  (2021-06-17T14:59:34Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Fast Gravitational Approach for Rigid Point Set Registration with Ordinary Differential Equations [79.71184760864507]
  This article introduces a new physics-based method for rigid point set alignment called Fast Gravitational Approach (FGA) In FGA, the source and target point sets are interpreted as rigid particle swarms with masses interacting in a globally multiply-linked manner while moving in a simulated gravitational force field. We show that the new method class has characteristics not found in previous alignment methods.
  arXiv  Detail & Related papers  (2020-09-28T15:05:39Z)
• Dominant Reaction Pathways by Quantum Computing [0.0]
  Characterizing thermally activated transitions in high-dimensional rugged energy surfaces is a challenging task for classical computers. We develop a quantum annealing scheme to solve this problem. We pave the way towards future biophysical applications of quantum computing based on realistic all-atom models.
  arXiv  Detail & Related papers  (2020-07-27T18:05:05Z)
• A resource efficient approach for quantum and classical simulations of gauge theories in particle physics [0.0]
  lattice gauge theory (LGT) calculations have been pivotal in our understanding of fundamental interactions. Hamiltonian-based formulations involve infinite-dimensional gauge degrees of freedom that can solely be handled by truncation. We provide a resource-efficient protocol to simulate LGTs with continuous gauge groups in the Hamiltonian formulation.
  arXiv  Detail & Related papers  (2020-06-25T04:10:11Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.