相关论文: Decreasing equisingular approximations with analyt…

There is proved the sufficiency of several conditions for the removability of singularities of complex-analytic sets in domains of $\mathbb C^n$.

The constrained mock-Chebyshev least squares operator is a linear approximation operator based on an equispaced grid of points. Like other polynomial or rational approximation methods, it was recently introduced in order to defeat the Runge…

The problem of the approximation of convolutions by accompanying laws in the scheme of series satisfying the infinitesimality condition is considered. It is shown that the quality of approximation depends essentially on the choice of…

We show that a necessary and sufficient condition for the sum of iid random vectors to converge (under appropriate shifting and scaling) to a multivariate Gaussian distribution is that the truncated second moment matrix is slowly varying at…

In this paper we establish a Nadel-type vanishing theorem and a Kawamata--Viehweg-type vanishing theorem concerning the asymptotic multiplier ideal sheaf on a compact K\"{a}hler manifold $X$. After that, we provide a relative variant.

We establish the existence of weak solutions of coupled systems of elliptic partial differential equations with quasimonotone nonlinearities in the domain interior and on the boundary. When the nonlinearities satisfy some monotonicity…

In this paper, we obtain two new lower bounds for the smallest singular value of nonsingular matrices which is better than the bound presented by zou \cite{zou2012lower}, Lin, Minghua and Xie, Mengyan \cite{lin2021some} under certain…

We give two criteria for a divisor on complex smooth projective variety to be ample using the multiplier ideal sheaf and the model category.

We identify a new sufficient condition for the finite convergence of moment relaxations of polynomial optimization problems with correlative sparsity. This condition, which follows from a solution to a correlatively sparse version of the…

Some monotone increasing sequences of the lower bounds for the minimum eigenvalue of $M$-matrices are given. It is proved that these sequences are convergent and improve some existing results. Numerical examples show that these sequences…

Using the techniques of J.-P. Demailly and Th. Peternell in math.AG/0208021 a weak version of Kawamata-Viehweg vanishing is proven for pseudo-effective line bundles on compact Kaehler manifolds. It is a weak version, since one has to adjust…

We consider multicriteria problems of evaluating absolute ratings (scores, priorities, weights) of given alternatives for making decisions, which are compared in pairs under several criteria. Given matrices of pairwise comparisons of…

We consider a recursive algorithm to construct an aggregated estimator from a finite number of base decision rules in the classification problem. The estimator approximately minimizes a convex risk functional under the l1-constraint. It is…

The main goal of this paper is to construct an algebraic analogue of quasi-plurisubharmonic function (qpsh for short) from complex analysis and geometry. We define a notion of qpsh function on a valuation space associated to a quite general…

Chebyshev interpolation polynomials exhibit the exponential approximation property to analytic functions on a cube. Based on the Chebyshev interpolation polynomial approximation, we propose iterative polynomial approximation algorithms to…

We develop a theory of nearby and vanishing cycles in the context of finite-coefficient Zariski-constructible sheaves over a non-archimedean field which is non-trivially valued, complete, algebraically closed, and of mixed characteristic or…

Variational inference (VI) is a widely used framework in Bayesian estimation. For most of the non-Gaussian statistical models, it is infeasible to find an analytically tractable solution to estimate the posterior distributions of the…

In this paper we introduce a notion of rational singularities associated to pairs $(X, \ba^t)$ where $X$ is a variety, $\ba$ is an ideal sheaf and $t$ is a nonnegative real number. We prove that most standard results about rational…

Numerical solutions of differential equations are usually not smooth functions. However, they should resemble the smoothness of the corresponding real solutions in one way or another. In two of our recent papers, a kind of spacial…

Uniform polynomial approximation, also called minimax approximation or Chebyshev approximation, consists in searching polynomial approximation that minimizes the worst case error. Optimality conditions for the uniform approximation of…