Related papers: Summation-by-parts operators for general function …
The paper proposes, an algorithm to produce novel m-point (for any integer m>=2) binary non-stationary subdivision scheme. It has been developed using uniform trigonometric B-spline basis functions and smoothness is being analyzed using the…
This paper develops new combinatorial approaches to analyze and compute special set partitions, called complementary set partitions, which are fundamental in the study of generalized cumulants. Moving away from traditional graph-based and…
For the class of de Branges-Rovnyak spaces $\mathcal{H}(b)$ of the unit disk $\mathbb{D}$ defined by extreme points $b$ of the unit ball of $H^\infty$, we study the problem of approximation of a general function in $\mathcal{H}(b)$ by a…
State Space Models (SSMs) have emerged as a potent tool in sequence modeling tasks in recent years. These models approximate continuous systems using a set of basis functions and discretize them to handle input data, making them well-suited…
The present paper deals with a generalization of the Baskakov operators. Some direct theorems, asymptotic formula and $A$-statistical convergence are established. Our results are based on a $\rho$ function. These results include the…
Symmetries are intrinsic to many combinatorial problems including Boolean Satisfiability (SAT) and Constraint Programming (CP). In SAT, the identification of symmetry breaking predicates (SBPs) is a well-known, often effective, technique…
This paper proposes low-complexity algorithms for finding approximate second-order stationary points (SOSPs) of problems with smooth non-convex objective and linear constraints. While finding (approximate) SOSPs is computationally…
In this paper we introduce a new approach to the concept of multipolynomials and generalize several results of the homogeneous polynomials and symmetric multilinear applications. We also present an abstract approach to the concept of…
Computation of (approximate) polynomials common factors is an important problem in several fields of science, like control theory and signal processing. While the problem has been widely studied for scalar polynomials, the scientific…
The main purpose of this paper is to study the NP-complete subset-sum problem, not in the usual context of time-complexity-based classification of the algorithms (exponential/polynomial), but through a new kind of algorithmic classification…
The suitable basis functions for approximating periodic function are periodic, trigonometric functions. When the function is not periodic, a viable alternative is to consider polynomials as basis functions. In this paper we will point out…
We propose new linear combinations of compositions of a basic second-order scheme with appropriately chosen coefficients to construct higher order numerical integrators for differential equations. They can be considered as a generalization…
We investigate properties of exponential operators preserving the particle number using combinatorial methods developed in order to solve the boson normal ordering problem. In particular, we apply generalized Dobinski relations and methods…
In this paper we define generalizations of boson normal ordering. These are based on the number of contractions whose vertices are next to each other in the linear representation of the boson operator function. Our main motivation is to…
The article $-$ part of a larger thesis which aims to give a detailed description of the generalisation to the category of groups with operators of the classical theory of semisimplicity for modules $-$ presents a straightforward…
A new approach to normal operators in real Hilbert spaces is discussed, and a spectral representation is obtained, derived directly from the complex case. The results are then applied to quaternionic normal operators, regarded as a special…
In this article, we achieve some general statistical approximation results for $ \lambda $-Bernstein operators in addition to some other approximation properties. We prove a statistical Voronovskaja-type approximation theorem. We also…
This paper focuses on the study of a mathematical program with equilibrium constraints, where the objective and the constraint functions are all polynomials. We present a method for finding its global minimizers and global minimum using a…
This paper presents a comprehensive analysis of a broad range of variations of the stochastic proximal point method (SPPM). Proximal point methods have attracted considerable interest owing to their numerical stability and robustness…
The Bernstein polynomial basis sees significant use owing to its unique properties, particularly in the field of optimal control. However, the basis is known to have a slow rate of convergence to the function it approximates. With this in…