In ptychography experiments, redundant scanning is usually required to guarantee the stable recovery, such that a huge amount of frames are generated, and thus it poses a great demand of parallel computing in order to solve this large-scale inverse problem. In this paper, we propose the overlapping Domain Decomposition Methods(DDMs) to solve the nonconvex optimization problem in ptychographic imaging. They decouple the problem defined on the whole domain into subproblems only defined on the subdomains with synchronizing information in the overlapping regions of these subdomains,thus leading to highly parallel algorithms with good load balance. More specifically, for the nonblind recovery (with known probe in advance), by enforcing the continuity of the overlapping regions for the image (sample), the nonlinear optimization model is established based on a novel smooth-truncated amplitude-Gaussian metric (ST-AGM). Such metric allows for fast calculation of the proximal mapping with closed form, and meanwhile provides the possibility for the convergence guarantee of the first-order nonconvex optimization algorithm due to its Lipschitz smoothness. Then the Alternating Direction Method of Multipliers (ADMM) is utilized to generate an efficient Overlapping Domain Decomposition based Ptychography algorithm(OD2P) for the two-subdomain domain decomposition (DD), where all subproblems can be computed with close-form solutions.Due to the Lipschitz continuity for the gradient of the objective function with ST-AGM, the convergence of the proposed OD2P is derived under mild conditions. Moreover, it is extended to more general case including multiple-subdomain DD and blind recovery. Numerical experiments are further conducted to show the performance of proposed algorithms, demonstrating good convergence speed and robustness to the noise.
Domain decomposition methods are widely used for the numerical solution of partial differential equations on high performance computers. We develop an adjoint-based a posteriori error analysis for both multiplicative and additive overlapping Schwarz domain decomposition methods. The numerical error in a user-specified functional of the solution (quantity of interest) is decomposed into contributions that arise as a result of the finite iteration between the subdomains and from the spatial discretization. The spatial discretization contribution is further decomposed into contributions arising f…
In this paper, we propose a novel overlapping domain decomposition method that can be applied to various problems in variational imaging such as total variation minimization. Most of recent domain decomposition methods for total variation minimization adopt the Fenchel--Rockafellar duality, whereas the proposed method is based on the primal formulation. Thus, the proposed method can be applied not only to total variation minimization but also to those with complex dual problems such as higher order models. In the proposed method, an equivalent formulation of the model problem with parallel str…
The discretization of certain integral equations, e.g., the first-kind Fredholm equation of Laplace's equation, leads to symmetric positive-definite linear systems, where the coefficient matrix is dense and often ill-conditioned. We introduce a new preconditioner based on a novel overlapping domain decomposition that can be combined efficiently with fast direct solvers. Empirically, we observe that the condition number of the preconditioned system is $O(1)$, independent of the problem size. Our domain decomposition is designed so that we can construct approximate factorizations of the subprobl…
This paper explores a family of generalized sweeping preconditionners for Helmholtz problems with non-overlapping checkerboard partition of the computational domain. The domain decomposition procedure relies on high-order transmission conditions and cross-point treatments, which cannot scale without an efficient preconditioning technique when the number of subdomains increases. With the proposed approach, existing sweeping preconditioners, such as the symmetric Gauss-Seidel and parallel double sweep preconditioners, can be applied to checkerboard partitions with different sweeping directions (…
Convergence of parallel overlapping domain decomposition methods with impedance boundary conditions for time-harmonic Maxwell equations in heterogeneous media
The Chinese University of Hong Kong, Shenzhen（香港中文大学（深圳））；Shenzhen International Center for Industrial and Applied Mathematics, Shenzhen Research Institute of Big Data（深圳工业与应用数学中心，深圳大数据研究院）；University of Bath（巴斯大学）；Shenzhen Loop Area Institute（深圳河套学院）
Comparison of substructured non-overlapping domain decomposition and overlapping additive Schwarz methods for large-scale Helmholtz problems with multiple sources
An Overlapping Domain Decomposition Preconditioner for the Helmholtz equation
State Key Laboratory of Scientific and Engineering Computing, Chinese Academy of Sciences（中国科学院计算数学与科学工程计算重点实验室）；Department of Mathematics, University of South Carolina（南卡罗来纳大学数学系）
Convergence of overlapping domain decomposition methods with PML transmission conditions applied to nontrapping Helmholtz problems
University College London（伦敦大学学院）；The Chinese University of Hong Kong, Shenzhen（香港中文大学（深圳））；Shenzhen Research Institute of Big Data（深圳大数据研究院）；University of Bath（巴斯大学）；CNRS and Institut de Mathématiques de Toulouse, UMR5219（法国国家科学研究中心与图卢兹数学研究所；图卢兹大学）；Université de Toulouse
We analyse parallel overlapping Schwarz domain decomposition methods for the Helmholtz equation, where the subdomain problems satisfy first-order absorbing (impedance) transmission conditions, and exchange of information between subdomains is achieved using a partition of unity. We provide a novel analysis of this method at the PDE level (without discretization). First, we formulate the method as a fixed point iteration, and show (in dimensions 1,2,3) that it is well-defined in a tensor product of appropriate local function spaces, each with $L^2$ impedance boundary data. Given this, we then o…
A natural medium for wave propagation comprises a coupled bounded heterogeneous region and an unbounded homogeneous free-space. Frequency-domain wave propagation models in the medium, such as the variable coefficient Helmholtz equation, include a faraway decay radiation condition (RC). It is desirable to develop algorithms that incorporate the full physics of the heterogeneous and unbounded medium wave propagation model, and avoid an approximation of the RC. In this work we first present and analyze an overlapping decomposition framework that is equivalent to the full-space heterogeneous-homog…
Overlapping Schwarz Preconditioners for Pose-Graph SLAM in Robotics
Faculty of Mathematics and Computer Science, Technische Universität Bergakademie Freiberg（弗莱贝格矿业工业大学数学与计算机科学学院）；Universitätsrechenzentrum (URZ), Technische Universität Bergakademie Freiberg（弗莱贝格矿业大学计算中心）
In this paper, we propose and test a novel diagonal sweeping domain decomposition method (DDM) with source transfer for solving the high-frequency Helmholtz equation in $\mathbb{R}^n$. In the method the computational domain is partitioned into overlapping checkerboard subdomains for source transfer with the perfectly matched layer (PML) technique, then a set of diagonal sweeps over the subdomains are specially designed to solve the system efficiently. The method improves the additive overlapping DDM (W. Leng and L. Ju, 2019) and the L-sweeps method (M. Taus, et al., 2019) by employing a more e…
In this paper we present a Fourier feature based deep domain decomposition method (F-D3M) for partial differential equations (PDEs). Currently, deep neural network based methods are actively developed for solving PDEs, but their efficiency can degenerate for problems with high frequency modes. In this new F-D3M strategy, overlapping domain decomposition is conducted for the spatial domain, such that high frequency modes can be reduced to relatively low frequency ones. In each local subdomain, multi Fourier feature networks (MFFNets) are constructed, where efficient boundary and interface treat…
We propose a component-based (CB) parametric model order reduction (pMOR) formulation for parameterized nonlinear elliptic partial differential equations (PDEs) based on overlapping subdomains. Our approach reads as a constrained optimization statement that penalizes the jump at the components' interfaces subject to the approximate satisfaction of the PDE in each local subdomain. Furthermore, the approach relies on the decomposition of the local states into a port component -- associated with the solution on interior boundaries -- and a bubble component that vanishes at ports: since the bubble…
We use the Method of Difference Potentials (MDP) to solve a non-overlapping domain decomposition formulation of the Helmholtz equation. The MDP reduces the Helmholtz equation on each subdomain to a Calderon's boundary equation with projection on its boundary. The unknowns for the Calderon's equation are the Dirichlet and Neumann data. Coupling between neighboring subdomains is rendered by applying their respective Calderon's equations to the same data at the common interface. Solutions on individual subdomains are computed concurrently using a straightforward direct solver. We provide numerica…
A local approach to the time integration of PDEs by exponential methods is proposed, motivated by theoretical estimates by A.Iserles on the decay of off-diagonal terms in the exponentials of sparse matrices. An overlapping domain decomposition technique is outlined, that allows to replace the computation of a global exponential matrix by a number of independent and easily parallelizable local problems. Advantages and potential problems of the proposed technique are discussed. Numerical experiments on simple, yet relevant model problems show that the resulting method allows to increase computat…
Operators with fractional perturbations are crucial components for robust preconditioning of interface-coupled multiphysics systems. However, in case the perturbation is strong, standard approaches can fail to provide scalable approximation of the inverse, thus compromising efficiency of the entire multiphysics solver. In this work, we develop efficient and parameter-robust algorithms for interface-perturbed operators based on the non-overlapping domain decomposition method. As preconditioners for the resulting Schur complement problems we utilize (inverses of) weighted sums of fractional powe…
