相关论文: Effective Termination of Kohn's Algorithm for Sube…
The goal of this paper is to exhibit and analyze an algorithm that takes a given closed orientable hyperbolic surface and outputs an explicit Dirichlet domain. The input is a fundamental polygon with side pairings. While grounded in…
Submodularity is a discrete domain functional property that can be interpreted as mimicking the role of the well-known convexity/concavity properties in the continuous domain. Submodular functions exhibit strong structure that lead to…
This paper addresses a multi-scale finite element method for second order linear elliptic equations with arbitrarily rough coefficient. We propose a local oversampling method to construct basis functions that have optimal local…
We have proposed a method in the context of BFFT approach that leads to truncation of the infinite series regarded to constraints in the extended phase space, as well as other physical quantities (such as Hamiltonian). This has been done…
Hormander-Mihklin type multiplier theorem on compacts manifolds withour boundary has been obtained by using the wave kernels. We consider maximal multiplies on this setting. To obtain the result, we carefully deal with the remainder terms…
We present some results dealing with the local geometry of almost complex manifolds. We establish mainly the complete hyperbolicity of strictly pseudoconvex domains, the extension of plurisubharmonic functions through generic submanifolds…
We propose a flexible approach for computing the resolvent of the sum of weakly monotone operators in real Hilbert spaces. This relies on splitting methods where strong convergence is guaranteed. We also prove linear convergence under…
We present a formally verified global optimization framework. Given a semialgebraic or transcendental function $f$ and a compact semialgebraic domain $K$, we use the nonlinear maxplus template approximation algorithm to provide a certified…
We study numerical computation of conformal invariants of domains in the complex plane. In particular, we provide an algorithm for computing the conformal capacity of a condenser. The algorithm applies for wide kind of geometries: domains…
An algorithm for computing power conjugate presentations for finite soluble quotients of predetermined structure of finitely presented groups is described. Practical aspects of an implementation are discussed.
We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform several modular operations with machine integer or floating point…
In this short note, we extend the linear convergence result of the Cauchy algorithm, derived recently by E. Klerk, F. Glineur, and A. Taylor, from the case of smooth strongly convex functions to the case of restricted strongly convex…
We give a sharp lower bound to the largest possible Euclidean norm of signed sums of $n$ vectors in the plane. This is achieved by connecting the signed vector sum problem to the isoperimetric problem for the circumradius of polygons. In…
A new explicit construction of Cauchy-Fantappi\'e kernels is introduced for an arbitrary weakly pseudoconvex domain with smooth boundary. While not holomorphic in the parameter, the new kernel reflects the complex geometry and the Levi form…
We discuss a Nash-Moser/ KAM algorithm for the construction of invariant tori for {\em tame} vector fields. Similar algorithms have been studied widely both in finite and infinite dimensional contexts: we are particularly interested in the…
In this paper, we study ends of complete gradient non-trivial Schouten solitons. Without any additional assumptions, we show the shrinking ones have finitely many ends, and the expanding ones are connected at infinity. We also provide…
In this paper, we provide some characterizations of strong pseudoconvexity by the boundary behavior of intrinsic invariants for smoothly bounded pseudoconvex domains of finite type in $\mathbb{C}^2$. As a consequence, if such domain is…
Let $\Omega$ be a bounded, pseudoconvex domain of $\mathbb C^n$ satisfying the "$f$-Property". The $f$-Property is a consequence of the geometric "type" of the boundary; it holds for all pseudoconvex domains of finite type but may also…
We give a simple algorithm for the construction of the tight span of a finite subset of the Manhattan plane.
We consider strongly-convex-strongly-concave saddle-point problems with general non-bilinear objective and different condition numbers with respect to the primal and the dual variables. First, we consider such problems with smooth composite…