Related papers: A Modified Coefficient Ideal for Use with the Stri…
The Hamiltonian treatment of constrained systems in $G\ddot{u}ler's$ formalism leads us to the total differential equations in many variables. These equations are integrable if the corresponding system of partial differential equations is a…
In this article a unified approach to iterative soft-thresholding algorithms for the solution of linear operator equations in infinite dimensional Hilbert spaces is presented. We formulate the algorithm in the framework of generalized…
Several new properties of weighted Hilbert transform are obtained. If mu is zero, two Plancherel-like equations and the isotropic properties are derived. For mu is real number, a coerciveness is derived and two iterative sequences are…
Applied to the master equation, the usual numerical integration methods, such as Runge-Kutta, become inefficient when the rates associated with various transitions differ by several orders of magnitude. We introduce an integration scheme…
A new coupling argument is introduced to establish Driver's integration by parts formula and shift Harnack inequality. Unlike known coupling methods where two marginal processes with different starting points are constructed to move…
We present a new approach to singularity confinement which makes it an efficient and reliable discrete integrability detector. Our method is based on the full-deautonomisation procedure, which consists in analysing non-autonomous extensions…
A number of regularization methods for discrete inverse problems consist in considering weighted versions of the usual least square solution. However, these so-called filter methods are generally restricted to monotonic transformations,…
We investigate an inertial viscosity-type Tseng's extragradient algorithm with a new step size to solve pseudomonotone variational inequality problems in real Hilbert spaces. A strong convergence theorem of the algorithm is obtained without…
When described through a plane-wave basis set, the inclusion of exact nonlocal exchange in hybrid functionals gives rise to a singularity, which slows down the convergence with the density of sampled $k$ points in reciprocal space. In this…
Hirota's bilinear method ("direct method") has been very effective in constructing soliton solutions to many integrable equations. The construction of one- and two-soliton solutions is possible even for non-integrable bilinear equations,…
Fidelity is a fundamental measure for the closeness of two quantum states, which is important both from a theoretical and a practical point of view. Yet, in general, it is difficult to give good estimates of fidelity, especially when one…
We prove that for any singular integral affine variety $X$ of finite presentation over a perfect field defined over $\mathbb Z$, there exists a smooth morphism from $Y$ onto $X$ such that $Y$ admits a resolution. That is, there exists a…
Two features desired in a three-dimensional (3D) optical tomographic image reconstruction algorithm are the ability to reduce imaging artifacts and to do fast processing of large data volumes. Traditional iterative inversion algorithms are…
After briefly recalling some computational aspects of blowing up and of representation of resolution data common to a wide range of desingularization algorithms (in the general case as well as in special cases like surfaces or binomial…
Variational inequalities can in general support distinct solutions. In this paper we study an algorithm for computing distinct solutions of a variational inequality, without varying the initial guess supplied to the solver. The central idea…
Coordinate formalism on Hilbert manifolds developed in Kryukov is reviewed. The results of Kryukov are applied to the simpliest case of a Hilbert manifold: the abstract Hilbert space. In particular, functional transformations preserving…
In this paper, we develop a new deflation technique for refining or verifying the isolated singular zeros of polynomial systems. Starting from a polynomial system with an isolated singular zero, by computing the derivatives of the input…
Instance-specific algorithm configuration and algorithm portfolios have been shown to offer significant improvements over single algorithm approaches in a variety of application domains. In the SAT and CSP domains algorithm portfolios have…
A broad range of inverse problems can be abstracted into the problem of minimizing the sum of several convex functions in a Hilbert space. We propose a proximal decomposition algorithm for solving this problem with an arbitrary number of…
Stratified sampling is a fast and simple method to generate point sets with uniform distribution in hypercubes. However, for the most common paraxial stratfication it has the prominent drawback that the number of sampled points in n…