Related papers: Summation-by-parts operators for general function …
This paper considers optimization problems where the objective is the sum of a function given by an expectation and a closed convex composite function, and proposes stochastic composite proximal bundle (SCPB) methods for solving it.…
We discuss finite difference techniques for hyperbolic equations in non-trivial domains, as those that arise when simulating black hole spacetimes. In particular, we construct dissipative and difference operators that satisfy the {\it…
Multidimensional diagonal-norm summation-by-parts (SBP) operators with collocated volume and facet nodes, known as diagonal-$ \mathsf{E} $ operators, are attractive for entropy-stable discretizations from an efficiency standpoint. However,…
We demonstrate that we can carry over the strategy of Finite Element Exterior Calculus (FEEC) to Summation-by-Parts (SBP) Finite Difference (FD) methods to achieve divergence- and curl-free discretizations. This is not obvious at first…
Because of the high approximation power and simplicity of computation of smooth radial basis functions (RBFs), in recent decades they have received much attention for function approximation. These RBFs contain a shape parameter that…
The purpose of this article is to develop a technique to estimate certain bounds for entropy numbers of diagonal operator on spaces of p-summable sequences for finite p greater than 1. The approximation method we develop in this direction…
In this paper an asymmetrical operator of generalised translation is introduced, the generalised modulus of smoothness is defined by its means and the direct and inverse theorems in approximation theory are proved for that modulus. ----- V…
In terms of the derivative operator and three hypergeometric series identities, several interesting summation formulas involving generalized harmonic numbers are established.
Supersymmetric quantum mechanics has many applications, and typically uses a raising and lowering operator formalism. For one dimensional problems, we show how such raising and lowering operators may be generalized to include an arbitrary…
Based on Colombeau's theory of algebras of generalized functions we introduce the concepts of generalized functions taking values in differentiable manifolds as well as of generalized vector bundle homomorphisms. We study their basic…
We consider space-saving versions of several important operations on univariate polynomials, namely power series inversion and division, division with remainder, multi-point evaluation, and interpolation. Now-classical results show that…
We collect and organise known results and add some new ones of the following nature: if A is a bounded operator in a Hilbert or Banach space, does there exist a nonconstant polynomial p(z) such that p(A) is "simpler", "nicer" than A. The…
We study how to solve semidefinite programming relaxations for large scale polynomial optimization. When interior-point methods are used, typically only small or moderately large problems could be solved. This paper studies regularization…
Function approximation is a generic process in a variety of computational problems, from data interpolation to the solution of differential equations and inverse problems. In this work, a unified approach for such techniques is…
A new general and unified method of summation, which is both regular and consistent, is invented. It is based on the idea concerning a way of integers reordering. The resulting theory includes a number of explicit and closed form summation…
Schmidt's subspace theorem in terms of Seshadri constants for closed subschemes in subgeneral position has been already developed sharply. We derive our theorem for numerically equivalent ample divisors by dint of the above theory step by…
We propose an extension of Thompson sampling to optimization problems over function spaces where the objective is a known functional of an unknown operator's output. We assume that queries to the operator (such as running a high-fidelity…
We construct explicit easily implementable polynomial approximations of sufficiently high accuracy for locally constant functions on the union of disjoint segments. This problem has important applications in several areas of numerical…
We study the class of subdifferentially polynomially bounded (SPB) functions, which is a rich class of locally Lipschitz functions that encompasses all Lipschitz functions, all gradient- or Hessian-Lipschitz functions, and even some…
A well-established method to deal with highly correlated systems is based on the expansion of the Green's function in terms of spectral moments. In the context of the Composite Operator Method one approximation is proposed: a set of n…