Related papers: A decomposition lemma in convex integration via cl…

Consider the scattering of a time-harmonic plane wave by a rigid obstacle embedded in a homogeneous and isotropic elastic medium in two dimensions. In this paper, a novel boundary integral formulation is proposed and its highly accurate…

A new algorithm to compute the restricted singular value decomposition of dense matrices is presented. Like Zha's method \cite{Zha92}, the new algorithm uses an implicit Kogbetliantz iteration, but with four major innovations. The first…

We propose novel less diffusive schemes for conservative one- and two-dimensional hyperbolic systems of nonlinear partial differential equations (PDEs). The main challenges in the development of accurate and robust numerical methods for the…

This paper introduces an abstract framework for randomized subspace correction methods for convex optimization, which unifies and generalizes a broad class of existing algorithms, including domain decomposition, multigrid, and block…

In this work we propose and analyze a novel Hybrid High-Order discretization of a class of (linear and) nonlinear elasticity models in the small deformation regime which are of common use in solid mechanics. The proposed method is valid in…

If a function $f:\mathbb{R}\to\mathbb{R}$ can be represented as the sum of $n$ periodic functions as $f=f_1+\dots+f_n$ with $f(x+\alpha_j)=f(x)$ ($j=1,\dots,n$), then it also satisfies a corresponding $n$-order difference equation…

It is well known that the usual mixed method for solving the biharmonic eigenvalue problem by decomposing the operator into two Laplacians may generate spurious eigenvalues on non-convex domains. To overcome this difficulty, we adopt a…

In a recent article the authors showed that the radiative Transfer equations with multiple frequencies and scattering can be formulated as a nonlinear integral system. In the present article, the formulation is extended to handle reflective…

Decomposition techniques for linear programming are difficult to extend to conic optimization problems with general non-polyhedral convex cones because the conic inequalities introduce an additional nonlinear coupling between the variables.…

A new numerical scheme to solve the Einstein field equations based upon the generalized harmonic decomposition of the Ricci tensor is introduced. The source functions driving the wave equations that define generalized harmonic coordinates…

In this paper, we study the local convergence of the standard ADMM scheme for a class of nonconvex composite problems arising from modern imaging and machine learning models. This problem is constrained by a closed convex set, while its…

I investigate contractions via Kac-Moody formalism. In particular, I show how the symmetry algebra of the standard 2-D Kepler system, which was identified by Daboul and Slodowy as an infinite-dimensional Kac-Moody loop algebra, and was…

Non-convex optimization problems have multiple local optimal solutions. Non-convex optimization problems are commonly found in numerous applications. One of the methods recently proposed to efficiently explore multiple local optimal…

Let $P$ be a set of $n$ points in general position on the plane. A set of closed convex polygons with vertices in $P$, and with pairwise disjoint interiors is called a convex decomposition of $P$ if their union is the convex hull of $P$,…

The vast majority of reduced-order models (ROMs) first obtain a low dimensional representation of the problem from high-dimensional model (HDM) training data which is afterwards used to obtain a system of reduced complexity. Unfortunately,…

When building a cylindrical algebraic decomposition (CAD) savings can be made in the presence of an equational constraint (EC): an equation logically implied by a formula. The present paper is concerned with how to use multiple ECs,…

This paper has two parts. The first part is a review and extension of the methods of integration of Leibniz algebras into Lie racks, including as new feature a new way of integrating 2-cocycles (see Lemma 3.9). In the second part, we use…

For a symmetric positive semidefinite linear system of equations $\mathcal{Q} {\bf x} = {\bf b}$, where ${\bf x} = (x_1,\ldots,x_s)$ is partitioned into $s$ blocks, with $s \geq 2$, we show that each cycle of the classical block symmetric…

Within recent years, considerable progress has been made regarding high-performance solvers for Partial Differential Equations (PDEs), yielding potential gains in efficiency compared to industry standard tools. However, the latter largely…

This paper proposes a new hybrid high-order discretization for the biharmonic problem and the corresponding eigenvalue problem. The discrete ansatz space includes degrees of freedom in $n-2$ dimensional submanifolds (e.g., nodal values in…