English
Related papers

Related papers: FFT-based solution of 2D and 3D magnetization prob…

200 papers

Classical density functional theory (DFT) of fluids is a valuable tool to analyze inhomogeneous fluids. However, few numerical solution algorithms for three-dimensional systems exist. Here we present an efficient numerical scheme for fluids…

The nonlinear Fourier transform (NFT) has recently gained significant attention in fiber optic communications and other engineering fields. Although several numerical algorithms for computing the NFT have been published, the design of…

Signal Processing · Electrical Eng. & Systems 2019-10-17 Shrinivas Chimmalgi , Peter J. Prins , Sander Wahls

We present a finite-difference method for the topology optimization of permanent magnets that is based on the FFT accelerated computation of the stray-field. The presented method employs the density approach for topology optimization and…

Computational Physics · Physics 2017-10-11 Claas Abert , Christian Huber , Florian Bruckner , Christoph Vogler , Gregor Wautischer , Dieter Suess

An FFT based method is proposed to simulate chemo-mechanical problems at the microscale including fracture, specially suited to predict crack formation during the intercalation process in batteries. The method involves three fields fully…

Materials Science · Physics 2024-11-26 Gabriel Zarzoso , Eduardo Roque , Francisco Montero-Chacón , Javier Segurado

Given a time series vector, how can we efficiently compute a specified part of Fourier coefficients? Fast Fourier transform (FFT) is a widely used algorithm that computes the discrete Fourier transform in many machine learning applications.…

Machine Learning · Computer Science 2020-08-31 Yong-chan Park , Jun-Gi Jang , U Kang

The problem of fast computation of multivariate kernel density estimation (KDE) is still an open research problem. In our view, the existing solutions do not resolve this matter in a satisfactory way. One of the most elegant and efficient…

Computation · Statistics 2016-09-08 Artur Gramacki , Jarosław Gramacki

We present direct logarithmically optimal in theory and fast in practice algorithms to implement the tensor product high order finite element method on multi-dimensional rectangular parallelepipeds for solving PDEs of the Poisson kind. They…

Numerical Analysis · Mathematics 2026-01-05 Alexander Zlotnik , Ilya Zlotnik

In this paper we explain how to use the Fast Fourier Transform (FFT) to solve partial differential equations (PDEs). We start by defining appropriate discrete domains in coordinate and frequency domains. Then describe the main limitation of…

Numerical Analysis · Mathematics 2025-07-31 Daniela Rodriguez-Lara , Ivan Alvarez-Rios , Francisco S. Guzman

We consider finite approximations of a fractal generated by an iterated function system of affine transformations on $\mathbb{R}^d$ as a discrete set of data points. Considering a signal supported on this finite approximation, we propose a…

Functional Analysis · Mathematics 2016-07-14 Calvin Hotchkiss , Eric S. Weber

Real life signals are in general non--stationary and non--linear. The development of methods able to extract their hidden features in a fast and reliable way is of high importance in many research fields. In this work we tackle the problem…

Numerical Analysis · Mathematics 2018-10-26 Antonio Cicone , Haomin Zhou

The non-linear induction problem in ferromagnetic media is solved using the fixed-point iteration method, where the linearized problem at each iteration is treated by means of a modal approach. The proposed approach does not require meshing…

Computational Physics · Physics 2017-12-13 Anastassios Skarlatos , Theodoros Theodoulidis

We present a quasi-linearly scaling, first order polynomial finite element method for the solution of the magnetostatic open boundary problem by splitting the magnetic scalar potential. The potential is determined by solving a Dirichlet…

Computational Physics · Physics 2014-04-25 Lukas Exl , Thomas Schrefl

One of the most efficient ways to produce unconditional simulations is with the kernel convolution using fast Fourier transform (FFT) [1]. However, when data is located on a surface, this approach is not efficient because data needs to be…

Computation · Statistics 2016-01-18 Alexander Gribov

This paper shows that it is possible to improve the computational cost, the memory requirements and the accuracy of Quick Fourier Transform (QFT) algorithm for power-of-two FFT (Fast Fourier Transform) just introducing a slight modification…

Data Structures and Algorithms · Computer Science 2013-01-07 Lorenzo Pasquini

Fast Fourier Transform (FFT)-based solvers for the Poisson equation are highly efficient, exhibiting $O(N\log N)$ computational complexity and excellent parallelism. However, their application is typically restricted to simple, regular…

Numerical Analysis · Mathematics 2025-09-30 Zichao Jiang , Jiacheng Lian , Zhuolin Wang

In this article we propose two novel 3D finite element models, denoted method A and B, for electron and hole Drift-Diffusion (DD) current densities. Method A is based on a primal-mixed formulation of the DD model as a function of the…

Numerical Analysis · Mathematics 2014-12-12 Aurelio Mauri , Andrea Bortolossi , Giovanni Novielli , Riccardo Sacco

We present a numerical method for the solution of linear magnetostatic problems in domains with a symmetry direction, including axial and translational symmetry. The approach uses a Fourier series decomposition of the vector potential…

Computational Physics · Physics 2020-09-01 Christopher G. Albert , Oszkár Bíró , Patrick Lainer

Multiscale finite element methods for 2D/1D problems have been studied in this work to demonstrate their excellent ability to solve real-world problems. These methods are much more efficient than conventional 3D finite element methods and…

Numerical Analysis · Mathematics 2023-04-14 Karl Hollaus , Markus Schöbinger

We present a new direct logarithmically optimal in theory and fast in practice algorithm to implement the high order finite element method on multi-dimensional rectangular parallelepipeds for solving PDEs of the Poisson kind. The key points…

Numerical Analysis · Mathematics 2026-01-05 Alexander Zlotnik , Ilya Zlotnik

The extended source effect on microlensing magnification is non-negligible and must be taken into account for in an analysis of microlensing. However, the evaluation of the extended source magnification is numerically expensive because it…

Instrumentation and Methods for Astrophysics · Physics 2022-10-05 Sunao Sugiyama