相关论文: Balancing domain decomposition by constraints asso…

First-order conic optimization solvers are sensitive to problem conditioning and typically perform poorly in the face of ill-conditioned problem data. To mitigate this, we propose an approach to preconditioning--the hypersphere…

We are dealing with boundary conditions for Dirac-type operators, i.e., first order differential operators with matrix-valued coefficients, including in particular physical many-body Dirac operators. We characterize (what we conjecture is)…

Coupled multiphysics problems often give rise to interface conditions naturally formulated in fractional Sobolev spaces. Here, both positive- and negative fractionality are common. When designing efficient solvers for discretizations of…

Many existing global constraints can be encoded as a conjunction of among constraints. An among constraint holds if the number of the variables in its scope whose value belongs to a prespecified set, which we call its range, is within some…

A structured preconditioned conjugate gradient (PCG) solver is developed for the Newton steps in second-order methods for a class of constrained network optimal control problems. Of specific interest are problems with discrete-time dynamics…

We consider the classical obstacle problem on bounded, connected Lipschitz domains $D \subset \mathbb{R}^n$. We derive quantitative bounds on the changes to contact sets under general perturbations to both the right hand side and the…

A framework associating quantum cosmological boundary conditions to minisuperspace hidden symmetries has been introduced in \cite{7}. The scope of the application was, notwithstanding the novelty, restrictive because it lacked a discussion…

Efficient algorithms for the solution of partial differential equations on parallel computers are often based on domain decomposition methods. Schwarz preconditioners combined with standard Krylov space solvers are widely used in this…

We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically decomposes sub-problems of a constraint satisfaction problem into…

In this paper we introduce a notion of dimension and codimension for every element of a distributive bounded lattice $L$. These notions prove to have a good behavior when $L$ is a co-Heyting algebra. In this case the codimension gives rise…

Combinatorial mechanical metamaterials are made of anisotropic, flexible blocks, such that multiple metamaterials may be constructed using a single block type, and the system's response depends on the frustration (or its absence) due to the…

We propose a preconditioner that can accelerate the rate of convergence of the Multiple Shooting Shadowing (MSS) method. This recently proposed method can be used to compute derivatives of time-averaged objectives (also known as…

In a capacitated directed graph, it is known that the set of all min-cuts forms a distributive lattice [1], [2]. Here, we describe this lattice as a regular predicate whose forbidden elements can be advanced in constant parallel time after…

We define and analyze (local) multilevel diagonal preconditioners for isogeometric boundary elements on locally refined meshes in two dimensions. Hypersingular and weakly-singular integral equations are considered. We prove that the…

This paper concerns singular value decomposition (SVD)-based computable formulas and bounds for the condition number of the Total Least Squares (TLS) problem. For the TLS problem with the coefficient matrix $A$ and the right-hand side $b$,…

We study a conservative 5-point cell-centered finite volume discretization of the high-contrast diffusion equation. We aim to construct preconditioners that are robust with respect to the magnitude of the coefficient contrast and the mesh…

We consider the minimal super-solution of a backward stochastic differential equation with constraint on the gains-process. The terminal condition is given by a function of the terminal value of a forward stochastic differential equation.…

We consider an overdetermined fourth order boundary value problem in which the boundary value of the Laplacian of the solution is prescribed, in addition to the homogeneous Dirichlet boundary condition. It is known that, in the case where…

Complex orthogonal design (COD) with parameter $[p, n, k]$ is a combinatorial design used in space-time block codes (STBCs). For STBC, $n$ is the number of antennas, $k/p$ is the rate, and $p$ is the decoding delay. A class of rate $1/2$…

Bounds consistency is usually enforced on continuous constraints by first decomposing them into binary and ternary primitives. This decomposition has long been shown to drastically slow down the computation of solutions. To tackle this,…