Search Results (66)

One of the main motivations of this paper is to construct generating functions for generalization of the Touchard polynomials (or generalization exponential functions) and certain special numbers. Many novel formulas and relations for these polynomials are found by using the Euler derivative operator and functional equations of these functions. Some novel relations among these polynomials, beta polynomials, Bernstein polynomials, related to Binomial distribution from discrete probability distribution classes, are given. Full article

We demonstrate a quantum processor based on a 3D linear Paul trap that uses ${}^{171}\mathrm{Yb}^{+}$ ions with eight individually controllable four-level qudits (ququarts), which is computationally equivalent to a sixteen-qubit quantum processor. The design of the developed ion trap provides high secular frequencies and a low heating rate, which, together with individual addressing and readout optical systems, allows executing quantum algorithms. In each of the eight ions, we use four electronic levels coupled by E2 optical transition at 435 nm for qudit encoding. We present the results of single- and two-qubit operations benchmarking and realizing basic quantum algorithms, including the Bernstein–Vazirani and Grover’s search algorithms as well as H₂ and LiH molecular simulations. Our results pave the way to scalable qudit-based quantum processors using trapped ions. Full article

This study presents a shifted Bernstein polynomial-based method for numerically solving the variable fractional order control equation governing a viscoelastic bar. Initially, employing a variable order fractional constitutive relation alongside the equation of motion, the control equation for the viscoelastic bar is derived. Shifted Bernstein polynomials serve as basis functions for approximating the bar’s displacement function, and the variable fractional derivative operator matrix is developed. Subsequently, the displacement control equation of the viscoelastic bar is transformed into the form of a matrix product. Substituting differential operators into the control equations, the control equations are discretized into algebraic equations by the method of matching points, which in turn allows the numerical solution of the displacement of the variable fractional viscoelastic bar control equation to be solved directly in the time domain. In addition, a convergence analysis is performed. Finally, algorithm precision and efficacy are confirmed via computation. Full article

Our goal is to prove the Euler–Maclaurin summation formula using only the Taylor formula. Furthermore, the Euler–Maclaurin summation formula will be considered for the case of functions of the class $C^{2k}\left([a,b]\right)$. A stronger version of the estimation of the rest for functions of class $C^n\left([a,b]\right)$ is given. We will also present the application of the obtained Euler–Maclaurin summation formulas to determine the asymptotics of Riemann sums for uniform partitions of intervals of integration. This paper also introduces the concepts of the asymptotic smoothing of the graph of a given function, as well as the asymptotic uniform distribution of the positive and negative values of the given function (generalizing the concept of the symmetric distribution of these values with respect to the x-axis, as in the case of the Peano–Jordan measure). Full article

In the field of Computer-Aided Geometric Design (CAGD), a proper model can be achieved depending on certain characteristics of the predefined blending basis functions. The presence of these characteristics ensures the geometric properties necessary for a decent design. The objective of this study, therefore, is to examine the generalized $\alpha$-Bernstein operator in the context of its potential classification as a novel blending type basis for the construction of Bézier-like curves and surfaces. First, a recursive definition of this basis is provided, along with its unique representation in terms of that for the classical Bernstein operator. Next, following these representations, the characteristics of the basis are discussed, and one shape parameter for $\alpha$-Bezier curves is defined. In addition, by utilizing the recursive definition of the basis, a de Casteljau-like algorithm is provided such that a subdivision schema can be applied to the construction of the new $\alpha$-Bezier curves. The parametric continuity constraints for $C^0$, $C^1$, and $C^2$ are also established to join two $\alpha$-Bezier curves. Finally, a set of cross-sectional engineering surfaces is designed to indicate that the generalized $\alpha$-Bernstein operator, as a basis, is efficient and easy to implement for forming shape-adjustable designs. Full article

In this article, we present a novel B-Polynomial Approach for approximating solutions to partial differential equations (PDEs), addressing the multiple initial conditions. Our method stands out by utilizing two-dimensional Bernstein polynomials (B-polynomials) in conjunction with their operational matrices to effectively manage the complexity associated with PDEs. This approach not only enhances the accuracy of solutions but also provides a structured framework for tackling various boundary conditions. The PDE is transformed into a system of algebraic equations, which are then solved to approximate the PDE solution. The process is divided into two main steps: First, the PDE is integrated to incorporate all initial and boundary conditions. Second, we express the approximate solution using B-polynomials and determine the unknown expansion coefficients via the Galerkin finite element method. The accuracy of the solution is assessed by adjusting the number of B-polynomials used in the expansion. The absolute error is estimated by comparing the exact and semi-numerical solutions. We apply this method to several examples, presenting results in tables and visualizing them with graphs. The approach demonstrates improved accuracy as the number of B-polynomials increases, with CPU time increasing linearly. Additionally, we compare our results with other methods, highlighting that our approach is both simple and effective for solving multidimensional PDEs imposed with multiple initial and boundary conditions. Full article

In the present study, we introduce the two-dimensional Chlodovsky-type Bernstein operators based on the $(p,q)$-integer. By leveraging the inherent symmetry properties of $(p,q)$-integers, we examine the approximation properties of our new operator with the help of a Korovkin-type theorem. Further, we present the local approximation properties and establish the rates of convergence utilizing the modulus of continuity and the Lipschitz-type maximal function. Additionally, a Voronovskaja-type theorem is provided for these operators. We also investigate the weighted approximation properties and estimate the rate of convergence in the same space. Finally, illustrative graphics generated with Maple demonstrate the convergence rate of these operators to certain functions. The optimization of approximation speeds by these symmetric operators during system control provides significant improvements in stability and performance. Consequently, the control and modeling of dynamic systems become more efficient and effective through these symmetry-oriented innovative methods. These advancements in the fields of modeling fractional differential equations and control theory offer substantial benefits to both modeling and optimization processes, expanding the range of applications within these areas. Full article

In this article, a novel Schurer form of $\lambda$-Bernstein operators augmented by Bézier basis functions is presented by utilizing the features of shifted knots. The shifted knots form of Bernstein operators and the Schurer form of the Bézier basis function are used in this article, then, new operators, the Schurer type $\lambda$-Bernstein shifted knots operators are constructed in terms of the Bézier basis function. First, the test functions are calculated and the central moments for these operators are obtained. Then, Korovkin’s type approximation properties are studied by the use of a modulus of continuity of orders one and two. Finally, the convergence theorems for these new operators are obtained by using Peetre’s K-functional and Lipschitz continuous functions. In the end, some direct approximation theorems are also obtained. Full article

In this study, a new kind of modified $\lambda$-Bernstein-Stancu operators is constructed. Compared with the original $\lambda$-Bézier basis function, the newly operator basis function is more concise in form and has certain symmetry beauty. The moments and central moments are computed. A Korovkin-type approximation theorem is presented, and the degree of convergence is estimated with respect to the modulus of continuity, Peetre’s K-functional, and functions of the Lipschitz-type class. Moreover, the Voronovskaja type approximation theorem is examined. Finally, some numerical examples and graphics to show convergence are presented. Full article

Short-term water demand forecasting is critical to enable optimal system operation. For practical purposes, the accuracy of the forecast and the adaptability to changing conditions are paramount. Therefore, for the Battle of Water Demand Forecasting (BWDF), we propose a precise and highly flexible forecasting methodology to allow an excellent adaptation to District Meter Areas (DMA)-specific characteristics. The proposed method consists of data cleaning and pre-processing, the training of individual forecast models and finally of combining the individual forecasts by the smoothed Bernstein Online Aggregation (BOA) algorithm. The ensemble of individual forecasting models includes simple time series, high-dimensional linear, and highly non-linear models such as neural networks. Full article

In this study, a different generalization of q-Bernstein operators with the parameter $\lambda \in [-1,1]$ is created. The moments and central moments of these operators are calculated, a statistical approximation result for this new type of $(\lambda ,q)$-Bernstein operators is obtained, and the convergence properties are analyzed using the Peetre K-functional and the modulus of continuity for this new operator. Finally, a numerical example is given to illustrate the convergence behavior of the newly defined operators. Full article

Fractional-order partial differential equations have gained significant attention due to their wide range of applications in various fields. This paper employed a novel technique for solving nonlinear multidimensional fractional differential equations by means of a modified version of the Bernstein polynomials called the Bhatti-fractional polynomials basis set. The method involved approximating the desired solution and treated the resulting equation as a matrix equation. All fractional derivatives are considered in the Caputo sense. The resulting operational matrix was inverted, and the desired solution was obtained. The effectiveness of the method was demonstrated by solving two specific types of nonlinear multidimensional fractional differential equations. The results showed higher accuracy, with absolute errors ranging from ${10}^{-12}$ to ${10}^{-6}$ when compared with exact solutions. The proposed technique offered computational efficiency that could be implemented in various programming languages. The examples of two partial fractional differential equations were solved using Mathematica symbolic programming language, and the method showed potential for efficient resolution of fractional differential equations. Full article

In this paper, we introduce secure groups as a cryptographic scheme representing finite groups together with a range of operations, including the group operation, inversion, random sampling, and encoding/decoding maps. We construct secure groups from oblivious group representations combined with cryptographic protocols, implementing the operations securely. We present both generic and specific constructions, in the latter case specifically for number-theoretic groups commonly used in cryptography. These include Schnorr groups (with quadratic residues as a special case), Weierstrass and Edwards elliptic curve groups, and class groups of imaginary quadratic number fields. For concreteness, we develop our protocols in the setting of secure multiparty computation based on Shamir secret sharing over a finite field, abstracted away by formulating our solutions in terms of an arithmetic black box for secure finite field arithmetic or for secure integer arithmetic. Secure finite field arithmetic suffices for many groups, including Schnorr groups and elliptic curve groups. For class groups, we need secure integer arithmetic to implement Shanks’ classical algorithms for the composition of binary quadratic forms, which we will combine with our adaptation of a particular form reduction algorithm due to Agarwal and Frandsen. As a main result of independent interest, we also present an efficient protocol for the secure computation of the extended greatest common divisor. The protocol is based on Bernstein and Yang’s constant-time 2-adic algorithm, which we adapt to work purely over the integers. This yields a much better approach for multiparty computation but raises a new concern about the growth of the Bézout coefficients. By a careful analysis, we are able to prove that the Bézout coefficients in our protocol will never exceed $3max(a,b)$ in absolute value for inputs a and b. We have integrated secure groups in the Python package MPyC and have implemented threshold ElGamal and threshold DSA in terms of secure groups. We also mention how our results support verifiable multiparty computation, allowing parties to jointly create a publicly verifiable proof of correctness for the results accompanying the results of a secure computation. Full article

The system of ordinary differential equations has many uses in contemporary mathematics and engineering. Finding the numerical solution to a system of ordinary differential equations for any arbitrary interval is very appealing to researchers. The numerical solution of a system of fourth-order ordinary differential equations on any finite interval $[a,b]$ is found in this work using a symmetric Bernstein approximation. This technique is based on the operational matrices of Bernstein polynomials for solving the system of fourth-order ODEs. First, using Chebyshev collocation nodes, a generalised approximation of the system of ordinary differential equations is discretized into a system of linear algebraic equations that can be solved using any standard rule, such as Gaussian elimination. We obtain the numerical solution in the form of a polynomial after obtaining the unknowns. The Hyers–Ulam and Hyers–Ulam–Rassias stability analyses are provided to demonstrate that the proposed technique is stable under certain conditions. The results of numerical experiments using the proposed technique are plotted in figures to demonstrate the accuracy of the specified approach. The results show that the suggested Bernstein approximation method for any interval is quick and effective. Full article

This article describes an approximation technique based on fractional order Bernstein wavelets for the numerical simulations of fractional oscillation equations under variable order, and the fractional order Bernstein wavelets are derived by means of fractional Bernstein polynomials. The oscillation equation describes electrical circuits and exhibits a wide range of nonlinear dynamical behaviors. The proposed variable order model is of current interest in a lot of application areas in engineering and applied sciences. The purpose of this study is to analyze the behavior of the fractional force-free and forced oscillation equations under the variable-order fractional operator. The basic idea behind using the approximation technique is that it converts the proposed model into non-linear algebraic equations with the help of collocation nodes for easy computation. Different cases of the proposed model are examined under the selected variable order parameters for the first time in order to show the precision and performance of the mentioned scheme. The dynamic behavior and results are presented via tables and graphs to ensure the validity of the mentioned scheme. Further, the behavior of the obtained solutions for the variable order is also depicted. From the calculated results, it is observed that the mentioned scheme is extremely simple and efficient for examining the behavior of nonlinear random (constant or variable) order fractional models occurring in engineering and science. Full article