Related papers: Fast Nonoverlapping Block Jacobi Method for the Du…
We consider a finite element discretization for the dual Rudin--Osher--Fatemi model using a Raviart--Thomas basis for $H_0 (\mathrm{div};\Omega)$. Since the proposed discretization has splitting property for the energy functional, which is…
The Frank Wolfe algorithm (FW) is a popular projection-free alternative for solving large-scale constrained optimization problems. However, the FW algorithm suffers from a sublinear convergence rate when minimizing a smooth convex function…
Solving the non-convex optimal power flow (OPF) problem for large-scale power distribution systems is computationally expensive. An alternative is to solve the relaxed convex problem or linear approximated problem, but these methods lead to…
In this paper, we revisit the nonoverlapping domain decomposition methods for solving elliptic problems with high contrast coefficients. Some interesting results are discovered. We find that the Dirichlet-Neumann algorithm and Robin-Robin…
This paper presents and evaluates an approach for coupling together subdomain-local reduced order models (ROMs) constructed via non-intrusive operator inference (OpInf) with each other and with subdomain-local full order models (FOMs),…
We present a high-order radial basis function finite difference (RBF-FD) framework for the solution of advection-diffusion equations on time-varying domains. Our framework is based on a generalization of the recently developed Overlapped…
A domain decomposition method for the solution of general variable-coefficient elliptic partial differential equations on regular domains is introduced. The method is based on tessellating the domain into overlapping thin slabs or shells,…
We present ROBO (Riemannian Overlapping Block Optimization), a distributed and parallel approach to multi-robot pose graph optimization (PGO) based on the idea of overlapping domain decomposition. ROBO offers a middle ground between…
We use the well-known observation that the solutions of Jacobi's differential equation can be represented via non-oscillatory phase and amplitude functions to develop a fast algorithm for computing multi-dimensional Jacobi polynomial…
Solving symmetric positive semidefinite linear systems is an essential task in many scientific computing problems. While Jacobi-type methods, including the classical Jacobi method and the weighted Jacobi method, exhibit simplicity in their…
We present a convergence analysis of a finite difference scheme for the time dependent partial different equation called gradient flow associated with the Rudin-Osher-Fatemi model. We devise an iterative algorithm to compute the solution of…
This paper presents a strategy for the computation of structures with repeated patterns based on domain decomposition and block Krylov solvers. It can be seen as a special variant of the FETI method. We propose using the presence of…
Optimal power flow (OPF) is an important problem in the operation of electric power systems. Due to the OPF problem's non-convexity, there may exist multiple local optima. Certifiably obtaining the global solution is important for certain…
Motivated by the increasing availability of high-performance parallel computing, we design a distributed parallel algorithm for linearly-coupled block-structured nonconvex constrained optimization problems. Our algorithm performs…
Efficiently solving large-scale optimal power flow (OPF) problems is challenging due to the high dimensionality and interconnectivity of modern power systems. Decomposition methods offer a promising solution via partitioning large problems…
The increasing complexity and scale of photonic and electromagnetic devices demand efficient and accurate numerical solvers. In this work, we develop a parallel overlapping domain decomposition method (DDM) based on the finite-difference…
We propose a novel hybrid domain decomposition method that couples sub-domain-local high-fidelity finite element (FE) models with reduced order models (ROMs) using the Schwarz alternating method. By integrating the noninstrusive Operator…
We present a meshless Schwarz-type non-overlapping domain decomposition method based on artificial neural networks for solving forward and inverse problems involving partial differential equations (PDEs). To ensure the consistency of…
We present a component-based model order reduction procedure to efficiently and accurately solve parameterized incompressible flows governed by the Navier-Stokes equations. Our approach leverages a non-overlapping optimization-based domain…
Optimal power flow (OPF) problem is a class of large-scale and non-convex optimization problem. Various algorithms are proposed to solve the challenging OPF problem. Recent studies show that semidefinite programming (SDP) can either provide…