3.3NAFeb 14, 2013
A parallel method for solving Laplace equations with Dirichlet data using local boundary integral equations and random walksChanhao Yan, Wei Cai, Xuan Zeng
In this paper, we will present a new approach for solving Laplace equations in general 3-D domains. The approach is based on a local computation method for the DtN mapping of the Laplace equation by combining a deterministic (local) boundary integral equation method and the probabilistic Feynman-Kac formula of PDE solutions. This hybridization produces a parallel algorithm where the bulk of the computation has no need for data communications. Given the Dirichlet data of the solution on a domain boundary, a local boundary integral equation (BIE) will be established over the boundary of a local region formed by a hemisphere superimposed on the domain boundary. By using a homogeneous Dirichlet Green's function for the whole sphere, the resulting BIE will involve only Dirichlet data (solution value) over the hemisphere surface, but over the patch of the domain boundary intersected by the hemisphere, both Dirichlet and Neumann data will be used. Then, firstly, the solution value on the hemisphere surface is computed by the Feynman-Kac formula, which will be implemented by a Monte Carlo walk on spheres (WOS) algorithm. Secondly, a boundary collocation method is applied to solve the integral equation on the aforementioned local patch of the domain boundary to yield the required Neumann data there. As a result, a local method of finding the DtN mapping is obtained, which can be used to find all the Neumann data on the whole domain boundary in a parallel manner. Finally, the potential solution in the whole space can be computed by an integral representation using both the Dirichlet and Neumann data over the domain boundary.
1.2NAFeb 15, 2019
Taylor expansion based fast Multipole Methods for 3-D Helmholtz equations in Layered MediaBo Wanga, Duan Chen, Bo Zhang et al.
In this paper, we develop fast multipole methods for 3D Helmholtz kernel in layered media. Two algorithms based on different forms of Taylor expansion of layered media Green's function are developed. A key component of the first algorithm is an efficient algorithm based on discrete complex image approximation and recurrence formula for the calculation of the layered media Green's function and its derivatives, which are given in terms of Sommerfeld integrals. The second algorithm uses symmetric derivatives in the Taylor expansion to reduce the size of precomputed tables for the derivatives of layered media Green's function. Numerical tests in layered media have validated the accuracy and O(N) complexity of the proposed algorithms.
3.3NAFeb 4, 2015
Computation of Local Time of Reflecting Brownian Motion and Probabilistic Representation of the Neumann ProblemYijing Zhou, Wei Cai, Elton Hsu
In this paper, we propose numerical methods for computing the boundary local time of reflecting Brownian motion (RBM) in R3 and its use in the probabilistic representation of the solution of the Laplace equation with the Neumann boundary condition. Approximations of the RBM based on a walk-on-spheres (WOS) and random walk on lattices are discussed and tested for sampling the RBM paths and their applicability in finding accurate approximation of the local time and discretization of the probabilistic formula. Numerical tests for several types of domains (cube, sphere, and ellipsoid) have shown the convergence of the numerical methods as the length of the RBM path and number of paths sampled increase.
1.2NAFeb 3, 2017
High Order Hierarchical Divergence-free Constrained Transport $H(div)$ Finite Element Method for Magnetic Induction EquationWei Cai, Jun Hu, Shangyou Zhang
In this paper, we will use the interior functions of an hierarchical basis for high order $BDM_p$ elements to enforce the divergence-free condition of a magnetic field $B$ approximated by the H(div) $BDM_p$ basis. The resulting constrained finite element method can be used to solve magnetic induction equation in MHD equations. The proposed procedure is based on the fact that the scalar $(p-1)$-th order polynomial space on each element can be decomposed as an orthogonal sum of the subspace defined by the divergence of the interior functions of the $p$-th order $BDM_p$ basis and the constant function. Therefore, the interior functions can be used to remove element-wise all higher order terms except the constant in the divergence error of the finite element solution of $B$-field. The constant terms from each element can be then easily corrected using a first order H(div) basis globally. Numerical results for a 3-D magnetic induction equation show the effectiveness of the proposed method in enforcing divergence-free condition of the magnetic field.
1.2NAMay 30, 2019
Exponential convergence for multipole and local expansions and their translations for sources in layered media: 2-D acoustic waveWenzhong Zhang, Bo Wang, Wei Cai
In this paper, we will first give a derivation of the multipole expansion (ME) and local expansion (LE) for the far field from sources in general 2-D layered media and the multipole-to-local translation (M2L) operator by using the generating function for Bessel functions. Then, we present a rigorous proof of the exponential convergence of the ME, LE, and M2L for 2-D Helmholtz equations in layered media. It is shown that the convergence of ME, LE, and M2L for the reaction field component of the Green's function depends on a polarized distance between the target and a polarized image of the source.
1.2NAMar 13, 2018
A hierarchical random compression method for kernel matricesDuan Chen, Wei Cai
In this paper, we propose a hierarchical random compression method (HRCM) for kernel matrices in fast kernel summations. The HRCM combines the hierarchical framework of the H-matrix and a randomized sampling technique of the column and row spaces for far-field interaction kernel matrices. We show that a uniform column/row sampling (with a given sample size) of a far-field kernel matrix, with- out the need and associated cost to pre-compute a costly sampling distribution, will give a low-rank compression of such low-rank matrices, independent of the matrix sizes and only dependent on the separation of the source and target locations. This far-field random compression technique is then implemented at each level of the hierarchical decomposition for general kernel matrices, resulting in an O(N logN) random compression method. Error and complexity analysis for the HRCM are included. Numerical results for electrostatic and Helmholtz wave kernels have vali- dated the efficiency and accuracy of the proposed method with a cross-over matrix size, in comparison of direct O(N^2) summations, in the order of thousands for a 3-4 digits relative accuracy.
25.3COMP-PHJul 22, 2020
Multi-scale Deep Neural Network (MscaleDNN) for Solving Poisson-Boltzmann Equation in Complex DomainsZiqi Liu, Wei Cai, Zhi-Qin John Xu
In this paper, we propose multi-scale deep neural networks (MscaleDNNs) using the idea of radial scaling in frequency domain and activation functions with compact support. The radial scaling converts the problem of approximation of high frequency contents of PDEs' solutions to a problem of learning about lower frequency functions, and the compact support activation functions facilitate the separation of frequency contents of the target function to be approximated by corresponding DNNs. As a result, the MscaleDNNs achieve fast uniform convergence over multiple scales. The proposed MscaleDNNs are shown to be superior to traditional fully connected DNNs and be an effective mesh-less numerical method for Poisson-Boltzmann equations with ample frequency contents over complex and singular domains.
15.1LGOct 25, 2019
Multi-scale Deep Neural Networks for Solving High Dimensional PDEsWei Cai, Zhi-Qin John Xu
In this paper, we propose the idea of radial scaling in frequency domain and activation functions with compact support to produce a multi-scale DNN (MscaleDNN), which will have the multi-scale capability in approximating high frequency and high dimensional functions and speeding up the solution of high dimensional PDEs. Numerical results on high dimensional function fitting and solutions of high dimensional PDEs, using loss functions with either Ritz energy or least squared PDE residuals, have validated the increased power of multi-scale resolution and high frequency capturing of the proposed MscaleDNN.
17.4LGSep 23, 2019
A Phase Shift Deep Neural Network for High Frequency Approximation and Wave ProblemsWei Cai, Xiaoguang Li, Lizuo Liu
In this paper, we propose a phase shift deep neural network (PhaseDNN), which provides a uniform wideband convergence in approximating high frequency functions and solutions of wave equations. The PhaseDNN makes use of the fact that common DNNs often achieve convergence in the low frequency range first, and a series of moderately-sized DNNs are constructed and trained for selected high frequency ranges. With the help of phase shifts in the frequency domain, each of the DNNs will be trained to approximate the function's higher frequency content over a specific range at the the speed of convergence as in the low frequency range. As a result, the proposed PhaseDNN is able to convert high frequency learning to low frequency one, allowing a uniform learning to wideband functions. The PhaseDNN will then be applied to find the solution of high frequency wave equations in inhomogeneous media through both differential and integral equation formulations with least square residual loss functions. Numerical results have demonstrated the capability of the PhaseDNN in learning high frequency functions and oscillatory solutions of interior and exterior Helmholtz equations.
5.1SPMay 3, 2019
PhaseDNN - A Parallel Phase Shift Deep Neural Network for Adaptive Wideband LearningWei Cai, Xiaoguang Li, Lizuo Liu
In this paper, we propose a phase shift deep neural network (PhaseDNN) which provides a wideband convergence in approximating a high dimensional function during its training of the network. The PhaseDNN utilizes the fact that many DNN achieves convergence in the low frequency range first, thus, a series of moderately-sized of DNNs are constructed and trained in parallel for ranges of higher frequencies. With the help of phase shifts in the frequency domain, implemented through a simple phase factor multiplication on the training data, each DNN in the series will be trained to approximate the target function's higher frequency content over a specific range. Due to the phase shift, each DNN achieves the speed of convergence as in the low frequency range. As a result, the proposed PhaseDNN system is able to convert wideband frequency learning to low frequency learning, thus allowing a uniform learning to wideband high dimensional functions with frequency adaptive training. Numerical results have demonstrated the capability of PhaseDNN in learning information of a target function from low to high frequency uniformly.
1.2NAJun 15, 2015
Highly Accurate Nyström Volume Integral Equation Method for the Maxwell equations for 3-D ScattersDuan Chen, Wei Cai, Brian Zinser
In this paper, we develop highly accurate Nyström methods for the volume integral equation (VIE) of the Maxwell equation for 3-D scatters. The method is based on a formulation of the VIE equation where the Cauchy principal value of the dyadic Green's function can be computed accurately for a finite size exclusion volume with some explicit corrective integrals of removable singularities. Then, an effective interpolated quadrature formula for tensor product Gauss quadrature nodes in a cube is proposed to handle the hyper-singularity of integrals of the dyadic Green's function. The proposed high order Nyström VIE method is shown to have high accuracy and demonstrates $p$-convergence for computing the electromagnetic scattering of cubes in $R^3$.
1.2NAJun 10, 2015
Numerical Solution of the Robin Problem of Laplace Equations with a Feynman-Kac Formula and Reflecting Brownian MotionsYijing Zhou, Wei Cai
In this paper, we present numerical methods to implement the probabilistic representation of third kind (Robin) boundary problem for the Laplace equations. The solution is based on a Feynman-Kac formula for the Robin problem which employs the standard reflecting Brownian motion (SRBM) and its boundary local time arising from the Skorohod problem. By simulating SRBM paths through Brownian motion using Walk on Spheres (WOS) method, approximation of the boundary local time is obtained and the Feynman-Kac formula is calculated by evaluating the average of all path integrals over the boundary under a measure defined through the local time. Numerical results demonstrate the accuracy and efficiency of the proposed method for finding a local solution of the Laplace equations with Robin boundary conditions.