Related papers: Optimized Schwarz Methods for Maxwell equations
In the previous paper (math.CA/0609196) we defined a map, called the hyperbolic Schwarz map, from the one-dimensional projective space to the three-dimensional hyperbolic space by use of solutions of the hypergeometric differential…
In this paper, we propose new proximal Newton-type methods for convex optimization problems in composite form. The applications include model predictive control (MPC) and embedded MPC. Our new methods are computationally attractive since…
To enhance solution accuracy and training efficiency in neural network approximation to partial differential equations, partitioned neural networks can be used as a solution surrogate instead of a single large and deep neural network…
We study asymptotically constrained systems for numerical integration of the Einstein equations, which are intended to be robust against perturbative errors for the free evolution of the initial data. First, we examine the previously…
In Lattice QCD computations a substantial amount of work is spent in solving the Dirac equation. In the recent past it has been observed that conventional Krylov solvers tend to critically slow down for large lattices and small quark…
In this paper, a new method for investigating Dirichlet's divisor problem is developed. For this purpose, integer points under the graph of a hyperbola are studied. Since many investigations in this direction focus on direct estimates of…
This paper is concerned with the adaptive numerical treatment of stochastic partial differential equations. Our method of choice is Rothe's method. We use the implicit Euler scheme for the time discretization. Consequently, in each step, an…
We prove the concavity of classical solutions to a wide class of degenerate elliptic differential equations on strictly convex domains of the unit sphere. The proof employs a suitable two-point maximum principle, a technique which…
We develop a method for solving elliptic partial differential equations on surfaces described by CAD patches that may have gaps/overlaps. The method is based on hybridization using a three-dimensional mesh that covers the gap/overlap…
We propose a fast temporal decomposition procedure for solving long-horizon nonlinear dynamic programs. The core of the procedure is sequential quadratic programming (SQP) that utilizes a differentiable exact augmented Lagrangian as the…
Differential equations on spaces of operators are very little developed in Mathematics, being in general very challenging. Here, we study a novel system of such (non-linear) differential equations. We show it has a unique solution for all…
We use the local orthogonal decomposition technique to derive a generalized finite element method for linear and semilinear parabolic equations with spatial multiscale diffusion coefficient. We consider nonsmooth initial data and a backward…
An elliptic partial differential equation Lu=f with a zero Dirichlet boundary condition is converted to an equivalent elliptic equation on the unit ball. A spectral Galerkin method is applied to the reformulated problem, using multivariate…
The classical Talbot method for the computation of the inverse Laplace transform is improved for the case where the transform is analytic in the complex plane except for the negative real axis. First, by using a truncated Talbot contour…
We propose a novel universal construction of two-level overlapping Schwarz preconditioners for $2m$th-order elliptic boundary value problems, where $m$ is a positive integer. The word "universal" here signifies that the coarse space…
We present a new algorithmic paradigm for the decentralized solution of graph-structured optimization problems that arise in the estimation and control of network systems. A key and novel design concept of the proposed approach is that it…
We use Schwarzschild's orbit superposition method to build self-consistent models of elliptical galaxies with scale-free potentials. Our exhaustive study of all physical shapes and central densities for galaxies with scale-free potentials…
While solving Partial Differential Equations (PDEs) with finite element methods (FEM), serendipity elements allow us to obtain the same order of accuracy as rectangular tensor-product elements with many fewer degrees of freedom (DOFs). To…
Composite optimization problems, where the sum of a smooth and a merely lower semicontinuous function has to be minimized, are often tackled numerically by means of proximal gradient methods as soon as the lower semicontinuous part of the…
This work introduces a methodology to solve ordinary differential equations using the Schur decomposition of the linear representation of the differential equation. This is done by first transforming the system into an upper triangular…