Related papers: A comparative analysis of Bernstein type estimates…
The Birch and Swinnerton-Dyer conjecture predicts that the parity of the algebraic rank of an abelian variety over a global field should be controlled by the expected sign of the functional equation of its $L$-function, known as the global…
Formulas to calculate multivector exponentials in a base-free representation and in a orthonormal basis are presented for an arbitrary Clifford geometric algebra Cl(p,q). The formulas are based on the analysis of roots of characteristic…
Multivariate functions encountered in high-dimensional uncertainty quantification problems often vary most strongly along a few dominant directions in the input parameter space. We propose a gradient-based method for detecting these…
Green's function plays a significant role in both theoretical analysis and numerical computing of partial differential equations (PDEs). However, in most cases, Green's function is difficult to compute. The troubles arise in the following…
Multipoint evaluation is the computational task of evaluating a polynomial given as a list of coefficients at a given set of inputs. And while \emph{nearly linear time} algorithms have been known for the univariate instance of multipoint…
Following ideas introduced by Beardon-Minda and by Baribeau-Rivard-Wegert in the context of the Schwarz-Pick lemma, we use the iterated hyperbolic difference quotients to prove a multipoint Julia lemma. As applications, we give a sharp…
In Mergelyan type approximation we uniformly approximate functions on compact sets K by polynomials or rational functions or holomorphic functions on varying open sets containing K. In the present paper we consider analogous approximation,…
The purpose of this paper is to study the Schwarz-Pick type inequalities for harmonic or pluriharmonic functions. By analogy with the generalized Khavinson conjecture, we first give some sharp estimates of the norm of harmonic functions…
The adjoint method is an efficient way to numerically compute gradients in optimization problems with constraints, but is only formulated to differentiable cost and constraint functions on real variables. With the introduction of complex…
We derive estimates of the Hessian of two smooth functions defined on Grassmannian manifold. Based on it, we can derive curvature estimates for minimal submanifolds in Euclidean space via Gauss map. In this way, the result for Bernstein…
We establish the existence of the Bernstein polynomial in one indeterminate $t$, and provide a method for its explicit computation. The Bernstein polynomial is associated with finitely generated modules over the Weyl algebra, known as…
In some cases, computational benefit can be gained by exploring the hyper parameter space using a deterministic set of grid points instead of a Markov chain. We view this as a numerical integration problem and make three unique…
We consider a scalar-valued implicit function of many variables, and provide two closed formulae for all of its partial derivatives. One formula is based on products of partial derivatives of the defining function, the other one involves…
We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…
We show that the Woronowicz prescription using a bimodule constructed out of a tensorial product of a bimodule and its conjugate and a bi-coinvariant singlet leads to a trivial differential calculus.
The goal of the paper is development of an optimization method with the superlinear convergence rate for a nonsmooth convex function. For optimization an approximation is used that is similar to the Steklov integral averaging. The…
This article proposes a bivariate Simplex distribution for modeling continuous outcomes constrained to the interval $(0,1)$, which can represent proportions, rates, or indices. We derive analytical expressions to calculate the dependence…
In this paper methods for simultaneous finding all roots of generalized polynomials are developed. These methods are related to the case when the roots are multiple. They possess cubic rate of convergence and they are as labour-consuming as…
The semi-discrete convolution with the Box Spline is an important tool in approximation theory. We give a formula for the difference between semi-discrete convolution and convolution with the Box Spline. This formula involves multiple…
We characterize the generalized Chebyshev polynomials of the second kind (Chebyshev-II), and then we provide a closed form of the generalized Chebyshev-II polynomials using the Bernstein basis. These polynomials can be used to describe the…