相关论文: Quantifier Elimination for Normal Cone Computation…
In this paper, we extend and investigate the properties of the semi-smooth Newton method when applied to a general projection equation in finite dimensional spaces. We first present results concerning Clarke's generalized Jacobian of the…
The problem of checking satisfiability of linear real arithmetic (LRA) and non-linear real arithmetic (NRA) formulas has broad applications, in particular, they are at the heart of logic-related applications such as logic for artificial…
The usual mathematical formalism of quantum field theory is non-rigorous because it contains divergences that can only be renormalized by non-rigorous mathematical methods. The purpose of this paper is to present a method of subtraction of…
We introduce a commutator method with multipliers to prove averaging lemmas, the regularizing effect for the velocity average of solutions for kinetic equations. This method requires only elementary techniques in Fourier analysis and shows…
A quantization procedure, which has recently been introduced for the analysis of Painlev\'e equations, is applied to a general time-independent potential of a Newton equation. This analysis shows that the quantization procedure preserves…
The L-curve method is a well-known heuristic method for choosing the regularization parameter for ill-posed problems by selecting it according to the maximal curvature of the L-curve. In this article, we propose a simplified version that…
We solve the normal ordering problem for (A* A)^n where A* (resp. A) are one mode deformed bosonic creation (resp. annihilation) operators satisfying [A,A*]=[N+1]-[N]. The solution generalizes results known for canonical and q-bosons. It…
An algorithm is given to compute a normal form for hyperelliptic curves. The elliptic case has been treated in a previous paper. In this paper the hyperelliptic case is treated.
We analyze critically the renormalization of quantum fields in cosmological spacetimes, using non covariant ultraviolet cutoffs. We compute explicitly the counterterms necessary to renormalize the semiclassical Einstein equations, using…
Convolutional neural networks are capable of learning powerful representational spaces, which are necessary for tackling complex learning tasks. However, due to the model capacity required to capture such representations, they are often…
We construct a normal form for the walled Brauer algebra, together with the reduction algorithm. We apply normal form to calculate the numbers of monomials in generators with minimal length. We further utilize normal form to give explicit…
For a wide variety of regularization methods, algorithms computing the entire solution path have been developed recently. Solution path algorithms do not only compute the solution for one particular value of the regularization parameter but…
Quantum computing has been increasingly applied in nuclear physics. In this work, we combine quantum computing with the complex scaling method to address the resonance problem. Due to the non-Hermiticity introduced by complex scaling,…
The paper conducts a second-order variational analysis for an important class of nonpolyhedral conic programs generated by the so-called second-order/Lorentz/ice-cream cone $Q$. From one hand, we prove that the indicator function of $Q$ is…
The paper starts with a concise description of the recently developed semismooth* Newton method for the solution of general inclusions. This method is then applied to a class of variational inequalities of the second kind. As a result, one…
A quantization over a manifold can be seen as a way to construct a differential operator with prescribed principal symbol. The quantization map is moreover required to be a linear bijection. It is known that there is in general no natural…
The Lie linearizability criteria are extended to complex functions for complex ordinary differential equations. The linearizability of complex ordinary differential equations is used to study the linearizability of corresponding systems of…
We present a general method to compute canonical averages for physical models sampled via quantum or classical quadratic unconstrained binary optimization (QUBO). First, we introduce a histogram reweighting scheme applicable to QUBO-based…
Given a convex function $f\colon\mathbb{R}^{d}\to\mathbb{R}$, the problem of sampling from a distribution $\propto e^{-f(x)}$ is called log-concave sampling. This task has wide applications in machine learning, physics, statistics, etc. In…
We discuss the cone and contraction theorem in a suitable complex analytic setting. More precisely, we establish the cone and contraction theorem of normal pairs for projective morphisms between complex analytic spaces. This result is a…