相关论文: Sharp Estimates for Conjugate Functions with Appli…

For an infinite penny graph, we study the finite-dimensional property for the space of harmonic functions, or ancient solutions of the heat equation, of polynomial growth. We prove the asymptotically sharp dimensional estimate for the above…

In a complete metric space equipped with a doubling measure supporting a $p$-Poincar\'e inequality, we prove sharp growth and integrability results for $p$-harmonic Green functions and their minimal $p$-weak upper gradients. We show that…

Based on a quantitative version of the inverse function theorem and an appropriate saddle-point formulation we derive a quasi-optimal error estimate for the finite element approximation of harmonic maps into spheres with a nodal…

We investigate the method of conjugate gradients, exploiting inaccurate matrix-vector products, for the solution of convex quadratic optimization problems. Theoretical performance bounds are derived, and the necessary quantities occurring…

We determine the Lagrange function in Taylor polynomial approximation by solving an appropriate initial-value problem. Hence, we determine the remainder term which we then approximate by means of a natural cubic spline. This results in a…

We analyze the convergence of the Conjugate Gradient (CG) method in exact arithmetic, when the coefficient matrix $A$ is symmetric positive semidefinite and the system is consistent. To do so, we diagonalize $A$ and decompose the algorithm…

Extraction of harmonics of a given order from real trigonometric polynomials (signals) is one of the main problems in harmonic analysis. It has many applications in physics, radio and electrical engineering, in particular, in filtration of…

In this paper, we prove sharp estimates for the average cost of the optimal matching problem on the flat 2-torus, using quantitative linearization and the method of trajectories.

Most approximation methods in high dimensions exploit smoothness of the function being approximated. These methods provide poor convergence results for non-smooth functions with kinks. For example, such kinks can arise in the uncertainty…

Let $(M^n, g, e^{-f}dv)$ be a smooth metric measure space of dimensional $n$. Suppose that $v$ is a positive weighted $p$-eigenfunctions associated to the eigenvalues $\lambda_{1,p}$ on $M$, namely $$ e^{f}div(e^{-f}|\nabla v|^{p-2}\nabla…

Let G be a compact group acting in a real vector space V. We obtain a number of inequalities relating the L^infinity norm of a matrix element of the representation of G with its L^p norm for p<infinity. We apply our results to obtain…

Sparse polynomial approximation has become indispensable for approximating smooth, high- or infinite-dimensional functions from limited samples. This is a key task in computational science and engineering, e.g., surrogate modelling in…

In this paper we consider anisotropic Lorentz-Karamata space $2\pi$ of periodic functions of $m$ variables and Nikol'skii--Besov's class . In this paper, we establish order-sharp estimates of the best approximation by trigonometric…

We establish $L^p$ error estimates for monotone numerical schemes approximating Hamilton-Jacobi equations on the $d$-dimensional torus. Using the adjoint method, we first prove a $L^1$ error bound of order one for finite-difference and…

We survey and unify recent results on the existence of accurate algorithms for evaluating multivariate polynomials, and more generally for accurate numerical linear algebra with structured matrices. By "accurate" we mean that the computed…

Polyhedral Lyapunov functions can approximate any norm arbitrarily well. Because of this, they are used to study the stability of linear time varying and linear parameter varying systems without being conservative. However, the…

Computing the closed convex envelope or biconjugate is the core operation that bridges the domain of nonconvex with convex analysis. We focus here on computing the conjugate of a bivariate piecewise quadratic function defined over a…

We present a new computational method to calculate arbitrary pair correlation functions of an orthorombic system in the most efficient way. The algorithm is demonstrated by the calculation of the radial distribution function of shock…

Isotonic regression or monotone function estimation is a problem of estimating function values under monotonicity constraints, which appears naturally in many scientific fields. This paper proposes a new Bayesian method with global-local…

This paper makes three contributions to estimating the number of perfect matching in bipartite graphs. First, we prove that the popular sequential importance sampling algorithm works in polynomial time for dense bipartite graphs. More…