International audienceThe bottleneck of micromagnetic simulations is the computation of the long-ranged magnetostatic fields. This can be tackled on regular N-node grids with Fast Fourier Transforms in time N logN, whereas the geometrically more versatile finite element methods (FEM) are bounded to N^4/3 in the best case. We report the implementation of a Non-uniform Fast Fourier Transform algorithm which brings a N logN convergence to FEM, with no loss of accuracy in the results
In this paper a fast multigrid solution method for edge-based finite element magnetostatic field com...
The so-called non-uniform fast Fourier transform (NFFT) is a family of algorithms for efficiently co...
We provide a sufficient condition to select the parameters of Type 3 Non-Uniform Fast Fourier Transf...
International audienceThe bottleneck of micromagnetic simulations is the computation of the long-ran...
Abstract. In this paper, an efficient method is developed for computing the magnetostatic field for ...
A Non-uniform Grid (NG) algorithm for rapidly computing magnetostatic field for micromagnetic simula...
We present a linear in-time P1 finite element method for the computation of the micromagnetic scalar...
A fast Newton-Raphson technique (FNR) for the determination of nonlinear three dimensional finite el...
A method for the computation of magnetostatic fields in presence of magnetic materials using closed ...
3-D controlled-source electromagnetic data are often computed directly in the domain of interest, ei...
AbstractA group of algorithms generalizing the fast Fourier transform to the case of noninteger freq...
A group of algorithms is presented generalizing the Fast Fourier Transform to the case of non-intege...
With the continued growth of computational power, computational modelling has become an increasingly...
Recent graphic processing units (GPUs) have remarkable raw computing power, which can be used for ve...
Computer based simulation software having a basis in numerical methods play a major role in research...
In this paper a fast multigrid solution method for edge-based finite element magnetostatic field com...
The so-called non-uniform fast Fourier transform (NFFT) is a family of algorithms for efficiently co...
We provide a sufficient condition to select the parameters of Type 3 Non-Uniform Fast Fourier Transf...
International audienceThe bottleneck of micromagnetic simulations is the computation of the long-ran...
Abstract. In this paper, an efficient method is developed for computing the magnetostatic field for ...
A Non-uniform Grid (NG) algorithm for rapidly computing magnetostatic field for micromagnetic simula...
We present a linear in-time P1 finite element method for the computation of the micromagnetic scalar...
A fast Newton-Raphson technique (FNR) for the determination of nonlinear three dimensional finite el...
A method for the computation of magnetostatic fields in presence of magnetic materials using closed ...
3-D controlled-source electromagnetic data are often computed directly in the domain of interest, ei...
AbstractA group of algorithms generalizing the fast Fourier transform to the case of noninteger freq...
A group of algorithms is presented generalizing the Fast Fourier Transform to the case of non-intege...
With the continued growth of computational power, computational modelling has become an increasingly...
Recent graphic processing units (GPUs) have remarkable raw computing power, which can be used for ve...
Computer based simulation software having a basis in numerical methods play a major role in research...
In this paper a fast multigrid solution method for edge-based finite element magnetostatic field com...
The so-called non-uniform fast Fourier transform (NFFT) is a family of algorithms for efficiently co...
We provide a sufficient condition to select the parameters of Type 3 Non-Uniform Fast Fourier Transf...