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

Various notions of condition numbers are used to study some sensitivity aspects of scalar optimization problems. The aim of this paper is to introduce a notion of condition number to study the case of a multiobjective optimization problem…

This paper concerns non-overlapping codes, block codes motivated by synchronisation and DNA-based storage applications. Most existing constructions of these codes do not account for the restrictions posed by the physical properties of…

This paper introduces a new boundary element formulation for transient electromagnetic scattering by homogeneous dielectric objects based on the time-domain PMCHWT equation. To address dense-mesh breakdown, a multiplicative Calderon…

In this paper we study a partially overdetermined mixed boundary value problem for domains $\Omega$ contained in an unbounded set $\mathcal C$. We introduce the notion of Cheeger set relative to $\mathcal C$ and show that if a domain…

The paper is an attempt to generalize a methodology, which is similar to the bounded-input bounded-output method currently widely used for the system stability studies. The presented earlier methodology allows decomposition of input space…

Immersed finite element methods generally suffer from conditioning problems when cut elements intersect the physical domain only on a small fraction of their volume. De Prenter et al. [Computer Methods in Applied Mechanics and Engineering,…

The eigenvalue problem for the Laplacian on bounded, planar, convex domains with mixed boundary conditions is considered, where a Dirichlet boundary condition is imposed on a part of the boundary and a Neumann boundary condition on its…

This work contributes to an understanding of the domain size's effect on the existence and uniqueness of the linear convection--diffusion equation with integral-type boundary conditions, where boundary conditions depend non-locally on…

Preconditioning is a technique from numerical linear algebra that can accelerate algorithms to solve systems of equations. In this paper, we demonstrate how preconditioning can circumvent a stringent assumption for sign consistency in…

We address the slow convergence and poor stability of quasi-newton sequential quadratic programming (SQP) methods that is observed when solving experimental design problems, in particular when they are large. Our findings suggest that this…

BDDC and FETI-DP algorithms are developed for three-dimensional elliptic problems with adaptively enriched coarse components. It is known that these enriched components are necessary in the development of robust preconditioners. To form the…

We show that the mass matrix derived from finite elements can be effectively used as a preconditioner for iteratively solving the linear system arising from finite-difference discretization of the Poisson equation, using the conjugate…

This paper addresses the problem of mapping high-dimensional data to a low-dimensional space, in the presence of other known features. This problem is ubiquitous in science and engineering as there are often controllable/measurable features…

Using oblique projections and angles between subspaces we write condition number estimates for abstract nonsymmetric domain decomposition methods. In particular, we consider a restricted additive method for the Poisson equation and write a…

Two major considerations when encoding pseudo-Boolean (PB) constraints into SAT are the size of the encoding and its propagation strength, that is, the guarantee that it has a good behaviour under unit propagation. Several encodings with…

The cardinality constrained optimization problem (CCOP) is an optimization problem where the maximum number of nonzero components of any feasible point is bounded. In this paper, we consider CCOP as a mathematical program with disjunctive…

Contexts are terms with one `hole', i.e. a place in which we can substitute an argument. In context unification we are given an equation over terms with variables representing contexts and ask about the satisfiability of this equation.…

Concrete domains, especially those that allow to compare features with numeric values, have long been recognized as a very desirable extension of description logics (DLs), and significant efforts have been invested into adding them to usual…

We present a characterisation of a blender based on the topological alignment of certain sets in phase space in combination with cone conditions. Importantly, the required conditions can be verified by checking properties of a single…

LECTURE GIVEN AT TH2002. Given a set of Boolean variables, and some constraints between them, is it possible to find a configuration of the variables which satisfies all constraints? This problem, which is at the heart of combinatorial…