The efficiency of implicit methods in comparison with the classical Runge-Kutta method is investigated when the former are applied to the Landau-Lifshitz-Gilbert equation. The Crank-Nicolson and the two-stage fourth-order implicit Runge-Kutta methods were chosen and implemented by means of Newton's method. Implicit solutions using Newton's method call for the solution of large-scale simultaneous algebraic equations. To decrease the computing time, only the nearest-neighbor interaction was taken into consideration in the coefficient matrix of the simultaneous algebraic equations, which were solved by using the preconditioned Bi-CGSTAB method. Through calculations of three-dimensional magnetization reversal in a Þne magnetic particle, it was conÞrmed that the examined methods yield a much larger maximum usable time step than the classical Runge-Kutta method. It was found that the CrankNicolson method takes about a quarter of the computing time required by the classical Runge-Kutta method when a dissipation constant α of 0.01 and a cell size of 8 nm are used. The maximum usable time step yielded by the twostage fourth-order Runge-Kutta method was found to be almost four times as large as that yielded by the CrankNicolson method, though the former method required a longer computing time than the latter in the present calculation.Keywords : Landau-Lifshitz-Gilbert equation, two-and three-dimensional calculations, computing time, CrankNicolson method, implicit Runge-Kutta method
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.