Related papers: Structured inversion of the Bernstein-Vandermonde …
In this research, the Bernoulli polynomials are introduced. The properties of these polynomials are employed to construct the operational matrices of integration together with the derivative and product. These properties are then utilized…
We prove Bernstein-type matrix concentration inequalities for linear combinations with matrix coefficients of binary random variables satisfying certain $\ell_\infty$-independence assumptions, complementing recent results by Kaufman, Kyng…
We obtain strong converse inequalities for the Bernstein polynomials with explicit asymptotic constants. We give different estimation procedures in the central and non-central regions of [0,1]. The main ingredients in our approach are the…
Dual Bernstein polynomials find many applications in approximation theory, computational mathematics, numerical analysis and computer-aided geometric design. In this context, one of the main problems is fast and accurate evaluation both of…
A nonstandard application of bivariate polynomial interpolation is discussed: the implicitization of a rational algebraic curve given by its parametric equations. Three different approaches using the same interpolation space are considered,…
Many matching, tracking, sorting, and ranking problems require probabilistic reasoning about possible permutations, a set that grows factorially with dimension. Combinatorial optimization algorithms may enable efficient point estimation,…
A sum of a large-dimensional random matrix polynomial and a fixed low-rank matrix polynomial is considered. The main assumption is that the resolvent of the random polynomial converges to some deterministic limit. A formula for the limit of…
In this paper, we present a new iterative approximate method of solving boundary value problems. The idea is to compute approximate polynomial solutions in the Bernstein form using least squares approximation combined with some properties…
We present the explicit inverse of a class of symmetric tridiagonal matrices which is almost Toeplitz, except that the first and last diagonal elements are different from the rest. This class of tridiagonal matrices are of special interest…
We present a short proof of a conjecture proposed by I. Ra\c{s}a (2017), which is an inequality involving basic Bernstein polynomials and convex functions. This proof was given in the letter to I. Ra\c{s}a (2017). The methods of our proof…
We provide a computational framework for approximating a class of structured matrices; here, the term structure is very general, and may refer to a regular sparsity pattern (e.g., block-banded), or be more highly structured (e.g., symmetric…
This work concerns the distance in 2-norm from a matrix polynomial to a nearest polynomial with a specified number of its eigenvalues at specified locations in the complex plane. Perturbations are allowed only on the constant coefficient…
We introduce the notion of a confluent Vandermonde matrix with quaternion entries and discuss its connection with Lagrange-Hermite interpolation over quaternions. Further results include the formula for the rank of a confluent Vandermonde…
Matrix-valued polynomials in any finite number of freely noncommuting variables that enjoy certain canonical partial convexity properties are characterized, via an algebraic certificate, in terms of Linear Matrix Inequalities and Bilinear…
The idea of decomposing a matrix into a product of structured matrices such as triangular, orthogonal, diagonal matrices is a milestone of numerical computations. In this paper, we describe six new classes of matrix decompositions,…
When a matrix A with n columns is known to be well approximated by a linear combination of basis matrices B_1,..., B_p, we can apply A to a random vector and solve a linear system to recover this linear combination. The same technique can…
We prove a generalization to Jennrich's uniqueness theorem for tensor decompositions in the undercomplete setting. Our uniqueness theorem is based on an alternative definition of the standard tensor decomposition, which we call…
The Cayley-Hamilton problem of expressing functions of matrices in terms of only their eigenvalues is well-known to simplify to finding the inverse of the confluent Vandermonde matrix. Here, we give a highly compact formula for the inverse…
A cross matrix $X$ can have nonzero elements located only on the main diagonal and the anti-diagonal, so that the sparsity pattern has the shape of a cross. It is shown that $X$ can be factorized into products of matrices that are at most…
In this research paper, structured bi-matrix variate, matrix quadratic equations are considered. Some lemmas related to determining the eigenvalues of unknown matrices are proved. Also, a method of determining the diagonalizabe unknown…