Related papers: Interpolation Polynomials and Linear Algebra
This work provides a complete characterization of the solutions of a linear interpolation problem for vector polynomials. The interpolation problem consists in finding n scalar polynomials such that an equation involving a linear…
For a division ring $\mathbb F$, the polynomials $f\in\mathbb F$ can be evaluated "on the left" and "on the right" giving rise to left and right Lagrange interpolation problems. The problems containig interpolation conditions of the same…
Starting with univariate polynomial interpolation we arrive to a natural generalization of fundamental theorem of algebra for certain systems of multivariate algebraic equations.
We present a new closed form for the interpolating polynomial of the general univariate Hermite interpolation that requires only calculation of polynomial derivatives, instead of derivatives of rational functions. This result is used to…
The question of matrix similarity is a classical one in linear algebra. For a field $\mathbb{F}$ and some positive integer $n \in \mathbb{N}$, one may consider the following problems: 1. Given two matrices $A, B \in \mathrm{GL}(n,…
A well-known characterization of Jordan vectors of a matrix polynomial $L(z)$ is generalized to a characterization of Jordan vectors of the operator-valued function $Q(z)$ at an eigenvalue $\alpha \in \mathbb{C}$. The results are then…
In contrast to the univariate case, interpolation with polynomials of a given maximal total degree is not always possible even if the number of interpolation points and the space dimension coincide. Due to that, numerous constructions for…
In recent years many efforts have been devoted to finding bidiagonal factorizations of nonsingular totally positive matrices, since their accurate computation allows to numerically solve several important algebraic problems with great…
It is known that every function with a finite support over a given field can be interpolated by means of the Lagrangian polynomial. The question is if a similar interpolation is possible if one considers a unitary ring or a Boolean algebra…
In the first part of the paper, we address an invertible matrix polynomial $L(z)$ and its inverse $\hat{L}(z) := -L(z)^{-1}$. We present a method for obtaining a canonical set of root functions and Jordan chains of $L(z)$ through elementary…
For univariate polynomials over arbitrary field the degree gives an upper bound on the number of roots (factor theorem) and as a related result for any finite point-set one can construct a polynomial of degree equal to the cardinality…
We here specialize the standard matrix-valued polynomial interpolation to the case where on the imaginary axis the interpolating polynomials admit various symmetries: Positive semidefinite, Skew-Hermitian, $J$-Hermitian, Hamiltonian and…
Let $f=\sum_{n=0}^\infty f_n x^n \in \overline{\mathbb Q}[[x]$ be a solution of an algebraic differential equation $Q(x,y(x), \ldots, y^{(k)}(x))=0$, where $Q$ is a multivariate polynomial with coefficients in $\overline{\mathbb Q}$. The…
By using some techniques of the divided difference operators, we establish an 4n-point interpolation formula. Certain polynomials, such as Jackson's _8\phi_7 terminating summation formula, are special cases of this formula. Based on…
It is possible to generalize the fruitful interaction between (real or complex) Jacobi matrices, orthogonal polynomials and Pade approximants at infinity by considering rational interpolants, (bi-)orthogonal rational functions and linear…
Let, J, be an m-by-m-signature matrix and let D be the open unit disk in the complex plane. Denote by P{J,0}(D) the class of all meromorphic m-by-m-matrix-valued functions, f, in D which are holomorphic at 0 and take J-contractive values at…
Let $\mathbb{R}=(-\infty,\infty)$, and let $Q\in C^1(\mathbb{R}): \mathbb{R}\rightarrow \mathbb{R^+}=[0,\infty)$ be an even function, which is an exponent. We consider the weight $w_\rho(x)=|x|^{\rho} e^{-Q(x)}$, $\rho\geqslant 0$, $x\in…
Here the polynomial interpolation approach is used to introduce the main results on multivariate normal algebraic systems. Next we bring a construction which shows that any standard algebraic system, with finite set of solutions, can be…
Interpolation theory for complex polynomials is well understood. In the non-commutative quaternionic setting, the polynomials can be evaluated "on the left" and "on the right". If the interpolation problem involves interpolation conditions…
We consider regular polynomial interpolation algorithms on recursively defined sets of interpolation points which approximate global solutions of arbitrary well-posed systems of linear partial differential equations. Convergence of the…