Related papers: On the stability of covariant BSSN formulation
We propose to use local search algorithms to produce SAT instances which are harder to solve than randomly generated k-CNF formulae. The first results, obtained with rudimentary search algorithms, show that the approach deserves further…
In this paper, we study chance constrained mixed integer program with consideration of recourse decisions and their incurred cost, developed on a finite discrete scenario set. Through studying a non-traditional bilinear mixed integer…
In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show that constraint consistency, a notion that has been developed to…
We report on our code, in which the moving puncture method is applied and an adaptive/fixed mesh refinement is implemented, and on its preliminary performance on black hole simulations. Based on the BSSN formulation, up-to-date gauge…
Combinatorial problems stated as Constraint Satisfaction Problems (CSP) are examined. It is shown by example that any algorithm designed for the original CSP, and involving the AllDifferent constraint, has at least the same level of…
We study the problem of reconstructing the Faber--Schauder coefficients of a continuous function $f$ from discrete observations of its antiderivative $F$. For instance, this question arises in financial mathematics when estimating the…
In this paper, we study the problem of fair sparse regression on a biased dataset where bias depends upon a hidden binary attribute. The presence of a hidden attribute adds an extra layer of complexity to the problem by combining sparse…
Two primary scalar auxiliary variable (SAV) approaches are widely applied for simulating gradient flow systems, i.e., the nonlinear energy-based approach and the Lagrange multiplier approach. The former guarantees unconditional energy…
Preserving stability is a central problem in data-driven model order reduction of dynamical systems. For linear systems whose dynamics depend on geometric or physical parameters, multivariate rational approximation algorithms such as the…
Extended resolution shows that auxiliary variables are very powerful in theory. However, attempts to exploit this potential in practice have had limited success. One reasonably effective method in this regard is bounded variable addition…
It is shown that the physical constraint of the Anomalous Green's function gives a natural pairing condition. The resulting self-consistency equation is directly related to the BCS gap equation. Both inhomogeneous and homogeneous systems…
In this paper exponential stability of nonlinear fractional order stochastic system with Poisson jumps is studied in finite dimensional space. Existence and uniqueness of solution, stability and exponential stability results are established…
We considerably extend our previous analysis of the implementation of an absorptive boundary condition, which mimics saturation effects, on the linear CCFM evolution. We present detailed results for the evolution of the unintegrated gluon…
Boost-invariant equations of spin hydrodynamics confined to the first-order terms in gradients are numerically solved. The spin equation of state, relating the spin density tensor to the spin chemical potential, is consistently included in…
This work introduces a stabilised finite element formulation for the Stokes flow problem with a nonlinear slip boundary condition of friction type. The boundary condition is enforced with the help of an additional Lagrange multiplier and…
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…
In many signal processing applications of Kalman filter (KF) and its variants and extensions, accurate estimation of extreme states is often of great importance. When the observations used are uncertain, however, KF suffers from conditional…
The randomized Kaczmarz method and its accelerated variants are a powerful class of iterative methods for solving large-scale linear systems, offering guaranteed convergence with low per-iteration cost. However, their numerical stability…
In Brodbeck et al 1999 it has been shown that the linearised time evolution equations of general relativity can be extended to a system whose solutions asymptotically approach solutions of the constraints. In this paper we extend the…
An effective means to approximate an analytic, nonperiodic function on a bounded interval is by using a Fourier series on a larger domain. When constructed appropriately, this so-called Fourier extension is known to converge geometrically…