اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA Linear Scaling in Accuracy Numerical Method for Computing the Electrostatic Forces in the $N$-Body Dielectric Spheres Problem
78
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This article deals with the efficient and accurate computation of the electrostatic forces between charged, spherical dielectric particles undergoing mutual polarisation. We use the spectral Galerkin boundary integral equation framework developed by Lindgren et al. (J. Comput. Phys. 371 (2018): 712-731) and subsequently analysed in two earlier contributions of the authors to propose a linear scaling in cost algorithm for the computation of the approximate forces. We establish exponential convergence of the method and derive error estimates for the approximate forces that do not explicitly depend on the number of dielectric particles $N$. Consequently, the proposed method requires only $mathcal{O}(N)$ operations to compute the electrostatic forces acting on $N$ dielectric particles up to any given and fixed relative error.
قيم البحث
اقرأ أيضاً
This article is the second in a series of two papers concerning the mathematical study of a boundary integral equation of the second kind that describes the interaction of $N$ dielectric spherical particles undergoing mutual polarisation. The first a
rticle presented the numerical analysis of the Galerkin method used to solve this boundary integral equation and derived $N$-independent convergence rates for the induced surface charges and total electrostatic energy. The current article will focus on computational aspects of the algorithm. We provide a convergence analysis of the iterative method used to solve the underlying linear system and show that the number of liner solver iterations required to obtain a solution is independent of $N$. Additionally, we present two linear scaling solution strategies for the computation of the approximate induced surface charges. Finally, we consider a series of numerical experiments designed to validate our theoretical results and explore the dependence of the numerical errors and computational cost of solving the underlying linear system on different system parameters.
Fluid flows containing dilute or dense suspensions of thin fibers are widespread in biological and industrial processes. To describe the motion of a thin immersed fiber, or to describe the forces acting on it, it is convenient to work with one-dimens
ional fiber centerlines and force densities rather than two-dimensional surfaces and surface tractions. Slender body theories offer ways to model and simulate the motion of immersed fibers using only one-dimensional data. However, standard formulations can break down when the fiber surface comes close to intersecting itself or other fibers. In this paper we introduce a numerical method for a recently derived three-dimensional slender body boundary value problem that can be stated entirely in terms of a one-dimensional distribution of forces on the centerline. The method is based on a new completed single-layer potential formulation of fluid velocity which circumvents some of the traditional conditioning issues associated with the unmodified single layer potential. We give numerical results demonstrating the good conditioning and improved performance of the method in the presence of near-intersections.
For the first time, we develop a convergent numerical method for the llinear integral equation derived by M.M. Lavrentev in 1964 with the goal to solve a coefficient inverse problem for a wave-like equation in 3D. The data are non overdetermined. Con
vergence analysis is presented along with the numerical results. An intriguing feature of the Lavrentev equation is that, without any linearization, it reduces a highly nonlinear coefficient inverse problem to a linear integral equation of the first kind. Nevertheless, numerical results for that equation, which use the data generated for that coefficient inverse problem, show a good reconstruction accuracy. This is similar with the classical Gelfand-Levitan equation derived in 1951, which is valid in the 1D case.
The multilinear Pagerank model [Gleich, Lim and Yu, 2015] is a tensor-based generalization of the Pagerank model. Its computation requires solving a system of polynomial equations that contains a parameter $alpha in [0,1)$. For $alpha approx 1$, this
computation remains a challenging problem, especially since the solution may be non-unique. Extrapolation strategies that start from smaller values of $alpha$ and `follow the solution by slowly increasing this parameter have been suggested; however, there are known cases where these strategies fail, because a globally continuous solution curve cannot be defined as a function of $alpha$. In this paper, we improve on this idea, by employing a predictor-corrector continuation algorithm based on a more general representation of the solutions as a curve in $mathbb{R}^{n+1}$. We prove several global properties of this curve that ensure the good behavior of the algorithm, and we show in our numerical experiments that this method is significantly more reliable than the existing alternatives.
We present a novel greedy Gauss-Seidel method for solving large linear least squares problem. This method improves the greedy randomized coordinate descent (GRCD) method proposed recently by Bai and Wu [Bai ZZ, and Wu WT. On greedy randomized coordin
ate descent methods for solving large linear least-squares problems. Numer Linear Algebra Appl. 2019;26(4):1--15], which in turn improves the popular randomized Gauss-Seidel method. Convergence analysis of the new method is provided. Numerical experiments show that, for the same accuracy, our method outperforms the GRCD method in term of the computing time.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
