Related papers: Bilinear quadratures for inner products
We provide a mathematical framework for studying different versions of discontinuous Galerkin (DG) approaches for solving 2D Riemann-Liouville fractional elliptic problems on a finite domain. The boundedness and stability analysis of the…
In this paper polynomial maps are represented by the use of matrices whose entries are numbered by pair of multiindices and a new product of such matrices is introduced. A matrix representation of composition of polynomial maps is given. In…
Traditional formulations of geometric problems from the Schubert calculus, either in Plucker coordinates or in local coordinates provided by Schubert cells, yield systems of polynomials that are typically far from complete intersections and…
A locally integrable function $m(\xi,\eta)$ defined on $\mathbb R^n\times \mathbb R^n$ is said to be a bilinear multiplier on $\mathbb R^n$ of type $(p_1,p_2, p_3)$ if $$ B_m(f,g)(x)=\int_{\mathbb R^n} \int_{\mathbb R^n}\hat f(\xi)\hat…
We apply polynomial techniques (linear programming) to obtain lower and upper bounds on the covering radius of spherical designs as function of their dimension, strength, and cardinality. In terms of inner products we improve the lower…
We introduce Gaussian quadrature rules for spline spaces that are frequently used in Galerkin discretizations to build mass and stiffness matrices. By definition, these spaces are of even degrees. The optimal quadrature rules we recently…
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…
Louis W. Shapiro gave a combinatorial proof of a bilinear generating function for Chebyshev polynomials equivalent to the formula 1/(1-ax-x^2) * 1/(1-bx-x^2) = (1-x^2)/(1-abx-(2+a^2+b^2)x^2 -abx^3+x^4), where * denotes the Hadamard product.…
An algebraic investigation on bicomplex numbers is carried out here. Particularly matrices and linear maps defined on them are discussed. A new kind of cartesian product, referred to as an idempotent product, is introduced and studied. The…
We consider tilings of a rectangle which is n units wide and m units long by non-overlapping 1 X 1 squares and s X s squares. Bivariate generating functions are computed with the Transfer Matrix Method for moderately large but fixed widths…
Double circulant matrices are introduced and studied. A formula to compute the rank r of a double circulant matrix is exhibited; and it is shown that any consecutive r rows of the double circulant matrix are linearly independent. As a…
A criterion for the existence of a birational embedding of an algebraic curve into a projective plane with two Galois points is presented. Several novel examples of plane curves with two inner Galois points as an application are described.
The image of a polynomial map is a constructible set. While computing its closure is standard in computer algebra systems, a procedure for computing the constructible set itself is not. We provide a new algorithm, based on algebro-geometric…
In this paper, we study the formulae for a product of two product Euler polynomials. From this study, we derive some formulae for the integral of the product of two or more Ruler polynomials.
We give a geometric method for determining the cohomology groups of a polyhedral product under suitable freeness conditions or with coefficients taken in a field. This is done by considering first the special case for which the pairs of…
An interior penalty discontinuous Galerkin method is devised to approximate minimizers of a linear folding model by discontinuous isoparametric finite element functions that account for an approximation of a folding arc. The numerical…
The double-direction orthogonalization algorithm is applied to construct sequences of polynomials, which are orthogonal over the interval [0,1]with the weighting function 1. Functional and recurrent relations are derived for the sequences…
We study the bilinear Hilbert transform and bilinear maximal functions associated to polynomial curves and obtain uniform $L^r$ estimates for $r>\frac{d-1}{d}$ and this index is sharp up to the end point.
In this paper, we study a class of Leibniz conformal algebras called quadratic Leibniz conformal algebras. An equivalent characterization of a Leibniz conformal algebra $R=\mathbb{C}[\partial]V$ through three algebraic operations on $V$ are…
A fundamental problem in computational algebraic geometry is the computation of the resultant. A central question is when and how to compute it as the determinant of a matrix. whose elements are the coefficients of the input polynomials…