Metraipolis › archive › dc_fce2e0081dfc
Efficient Multigrid Methods for Semi-implicit Landau-Lifshitz Schemes in Micromagnetic Simulations — arXiv:2608.09102
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.09102
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T09:08:02.314Z
- SHA-256 of the archived text
17100a1b58ba12be0bb3e277c9b631de50877c4fc73b585067bca752d9511f89- Stable URL of this page
https://metraipolis.com/documento/dc_fce2e0081dfc
How to cite
Efficient Multigrid Methods for Semi-implicit Landau-Lifshitz Schemes in Micromagnetic Simulations — arXiv:2608.09102 — arXiv (en), https://arxiv.org/abs/2608.09102 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fce2e0081dfc (Metraipolis archive dc_fce2e0081dfc, sha256 17100a1b58ba12be0bb3e277c9b631de50877c4fc73b585067bca752d9511f89)
BibTeX
@misc{dcfce2e0081dfc,
title = {Efficient Multigrid Methods for Semi-implicit Landau-Lifshitz Schemes in Micromagnetic Simulations — arXiv:2608.09102},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.09102},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fce2e0081dfc; sha256 17100a1b58ba12be0bb3e277c9b631de50877c4fc73b585067bca752d9511f89},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.09102. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
An efficient aggregation-based multigrid approach is developed in this work to solve linear algebraic systems generated by discretizing the Landau-Lifshitz equation in micromagnetics. The discretization couples the first-order backward differentiation formula with first-order extrapolation, and the underlying equation describes magnetization dynamics within micromagnetic simulations. For these linear systems, standard iterative methods and conventional multigrid solvers intended for symmetric problems suffer from deteriorated convergence under mesh refinement and poor computational performance. Existing algorithms struggle to handle the system's intrinsic features, namely its sparse spectral properties and non-symmetric matrix structure. To overcome these limitations, a multigrid framework is constructed, where smoothing and coarse-grid correction operators are customized for the target linear system. Numerical tests confirm the robustness and mesh-independent convergence of the resulting method. Compared with well-established Krylov-subspace solvers and conventional multigrid techniques, the aggregation-based multigrid solver cuts down iteration counts and overall computational cost considerably, while producing faithful representations of magnetization dynamics. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-11 in math.NA). Categorie arXiv: Numerical Analysis (math.NA). Pagina del lavoro: https://arxiv.org/abs/2608.09102 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-19T09:05:02.968Z dalla pagina https://arxiv.org/catchup/math.NA/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).