相关论文: The Fekete problem in segmental polynomial interpo…
The idea of using fragment embedding to circumvent the high computational scaling of accurate electronic structure methods while retaining high accuracy has been a long-standing goal for quantum chemists. Traditional fragment embedding…
In this paper, the stabilized finite element method based on local projection is applied to discretize the Stokes eigenvalue problems and the corresponding convergence analysis is given. Furthermore, we also use a method to improve the…
A nonlinear generalisation of the PageRank problem involving the Moore-Penrose inverse of an incidence matrix is developed for local graph partitioning purposes. The Levenberg-Marquardt method with a full rank Jacobian variant provides a…
Finding point configurations, that yield the maximum polarization (Chebyshev constant) is gaining interest in the field of geometric optimization. In the present article, we study the problem of unconstrained maximum polarization on compact…
We revisit the approximation of nonempty compact planar sets by filled-in Julia sets of polynomials developed by Lindsey and Younsi and analyze the rate of approximation. We use slightly modified fundamental Lagrange interpolation…
The quantitative estimation for the interpolation error constants of the Fujino-Morley interpolation operator is considered. To give concrete upper bounds for the constants, which is reduced to the problem of providing lower bounds for…
In this paper, we study convergence and superconvergence theory of integer and fractional derivatives of the one-point and the two-point Hermite interpolations. When considering the integer-order derivative, exponential decay of the error…
We study monotone Hermite interpolation on an interval, where both function values and first derivatives are prescribed at the nodes. Among all $C^{1,1}$ interpolants, we seek one with optimal curvature, measured by $\|F''\|_{L^\infty}$. In…
We consider the following basic problem: given an $n$-variate degree-$d$ homogeneous polynomial $f$ with real coefficients, compute a unit vector $x \in \mathbb{R}^n$ that maximizes $|f(x)|$. Besides its fundamental nature, this problem…
Randomised arcade processes are a class of continuous stochastic processes that interpolate in a strong sense, i.e., omega by omega, between any given ordered set of random variables, at fixed pre-specified times. Utilising these processes…
Nonlinear two-point boundary value problems arise in numerous areas of application. The existence and number of solutions for various cases has been studied from a theoretical standpoint. These results generally rely upon growth conditions…
Problems involving approximation from scattered data where data is arranged quasi-uniformly have been treated by RBF methods for decades. Treating data with spatially varying density has not been investigated with the same intensity, and is…
In this paper we provide sufficient conditions that ensure the existence of the solution of some vector equilibrium problems in Hausdorff topological vector spaces ordered by a cone. The conditions that we consider are imposed not on the…
We study the problem of space and time efficient evaluation of a nonparametric estimator that approximates an unknown density. In the regime where consistent estimation is possible, we use a piecewise multivariate polynomial interpolation…
This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…
The paper deals with polynomial interpolation, least-square approximation and cubature of functions defined on the rectangular cylinder, $K=D\times [-1,1]$, with $D$ the unit disk. The nodes used for these processes are the {\it Approximate…
Optimization problems with $L^1$-control cost functional subject to an elliptic partial differential equation (PDE) are considered. However, different from the finite dimensional $l^1$-regularization optimization, the resulting discretized…
The generalization ability of kernel interpolation in large dimensions (i.e., $n \asymp d^{\gamma}$ for some $\gamma>0$) might be one of the most interesting problems in the recent renaissance of kernel regression, since it may help us…
In the space of all entire functions it is solved the problem of interpolation taking into account multiplicities by sums of the series of exponentials with the exponents from a given set. It is found a criterion of solubility of the…
In the space of holomorphic functions in a convex domain it is studied the interpolation problem by means of sums of the series of exponentials converging uniformly on all compact sets of the domain. The discrete set of the interpolation…