Related papers: Computation of multi-degree Tchebycheffian B-splin…
The present paper provides a general formula for the dimension of spline space over T-meshes using smoothing cofactor-conformality method. And we introduce a new notion, Diagonalizable T-mesh, over which the dimension formula is only…
Summation-by-parts (SBP) operators allow us to systematically develop energy-stable and high-order accurate numerical methods for time-dependent differential equations. Until recently, the main idea behind existing SBP operators was that…
A wide range of numerical methods exists for computing polynomial approximations of solutions of ordinary differential equations based on Chebyshev series expansions or Chebyshev interpolation polynomials. We consider the application of…
We extend Bravyi and Smolin's construction for obtaining unextendible maximally entangled bases (UMEBs) from equiangular lines. We show that equiangular real projections of rank more than 1 also exhibit examples of UMEBs. These projections…
Algorithms and underlying mathematics are presented for numerical computation with periodic functions via approximations to machine precision by trigonometric polynomials, including the solution of linear and nonlinear periodic ordinary…
B\'ezier splines are widely available in various systems with the curves and surface designs. In general, the B\'ezier spline can be specified with the B\'ezier curve segments and a B\'ezier curve segment can be fitted to any number of…
We discuss the direct use of cubic-matrix splines to obtain continuous approximations to the unique solution of matrix models of the type $Y''(x) = f(x,Y(x))$. For numerical illustration, an estimation of the approximation error, an…
In this paper, we investigate some properties of Chebyshev polynomials arising from non-linear differential equations. From our investigation, we derive some new and interesting identities on Chebyshev polynomials.
Explicit formulas are obtained for the number of periodic points and maximum tail length of split polynomial maps over finite fields for affine and projective space. This work includes a detailed analysis of the structure of the directed…
Despite the success of branch-and-cut methods for solving mixed integer bilevel linear optimization problems (MIBLPs) in practice, there are still gaps in both the theory and practice surrounding these methods. In the first part of this…
Interpolation and smoothing using cubic and generalized splines are fundamental tools in data analysis and statistical modeling. Recently, fast computational algorithms were developed for natural $L$-splines of order four, which arise as…
We enumerate smooth and rationally smooth Schubert varieties in the classical finite types A, B, C, and D, extending Haiman's enumeration for type A. To do this enumeration, we introduce a notion of staircase diagrams on a graph. These…
Multiplication of polynomials is among key operations in computer algebra which plays important roles in developing techniques for other commonly used polynomial operations such as division, evaluation/interpolation, and factorization. In…
Nonlinear approximation from regular piecewise polynomials (splines) of degree $<k$ supported on rings in $\R^2$ is studied. By definition a ring is a set in $\R^2$ obtained by subtracting a compact convex set with polygonal boundary from…
In this paper Quintic Spline is defined for the numerical solutions of the fourth order linear special case Boundary Value Problems. End conditions are also derived to complete the definition of spline.The algorithm developed approximates…
A Bayesian approach to nonlinear inverse problems is considered where the unknown quantity (input) is a random spatial field. The forward model is complex and non-linear, therefore computationally expensive. An emulator-based methodology is…
Markov-switching models are powerful tools that allow capturing complex patterns from time series data driven by latent states. Recent work has highlighted the benefits of estimating components of these models nonparametrically, enhancing…
The goal of this work is threefold. First, we give an expression of the most general five point integral on M_{0,n} in terms of Chebyshev polynomials. Second, we choose a special kinematics that transforms the polynomial form of the…
Yu. I. Merzljakov developed a method of splittable coordinates which helps to verify the linearity of some groups, he established some fundamental results using this method. In this paper we use the method of splittable coordinates and find…
Probability density functions form a specific class of functional data objects with intrinsic properties of scale invariance and relative scale characterized by the unit integral constraint. The Bayes spaces methodology respects their…