Related papers: Structured matrices in the application of bivariat…
In this paper, we extend the structure-preserving interpolatory model reduction framework, originally developed for linear systems, to structured bilinear control systems. Specifically, we give explicit construction formulae for the model…
We study factorizations of rational matrix functions with simple poles on the Riemann sphere. For the quadratic case (two poles) we show, using multiplicative representations of such matrix functions, that a good coordinate system on this…
Starting with univariate polynomial interpolation we arrive to a natural generalization of fundamental theorem of algebra for certain systems of multivariate algebraic equations.
We develop an essentially algebraic method to study biharmonic curves into an implicit surface. Although our method is rather general, it is especially suitable to study curves into surfaces defined by a polynomial equation: in particular,…
Recently, a method to compute the implicit equation of a parametrized hypersurface has been developed by the authors. We address here some questions related to this method. First, we prove that the degree estimate for the stabilization of…
We show that any nonsingular (real or complex) square matrix can be factorized into a product of at most three normal matrices, one of which is unitary, another selfadjoint with eigenvalues in the open right half-plane, and the third one is…
Consider a sparse multivariate polynomial f with integer coefficients. Assume that f is represented as a "modular black box polynomial", e.g. via an algorithm to evaluate f at arbitrary integer points, modulo arbitrary positive integers.…
We present a new rational approximation algorithm based on the empirical interpolation method for interpolating a family of parametrized functions to rational polynomials with invariant poles, leading to efficient numerical algorithms for…
There are several examples of spaces of univariate functions for which we have a characterization of all sets of knots which are poised for the interpolation problem. For the standard spaces of univariate polynomials, or spline functions…
We present a method to construct induced representations of quantum algebras having the structure of bicrossproduct. We apply this procedure to some quantum kinematical algebras in (1+1)--dimensions with this kind of structure: null-plane…
The main contribution of this paper is twofold: On the one hand, a general framework for performing Hermite interpolation on Riemannian manifolds is presented. The method is applicable, if algorithms for the associated Riemannian…
A modeling methodology and matrix formalism is presented that permits analysis of arbitrarily complex interferometric waveguide systems, including polarization and backreflection effects. Considerable improvement results from separation of…
In this paper we study the consequences of overinterpolation, i.e., the situation when a function can be interpolated by polynomial, or rational, or algebraic functions in more points that normally expected. We show that in many cases such…
We present a method for computing all the symmetries of a rational ruled surface defined by a rational parametrization which works directly in parametric rational form, i.e. without computing or making use of the implicit equation of the…
In this paper, we give new sparse interpolation algorithms for black box polynomial f whose coefficients are from a finite set. In the univariate case, we recover f from one evaluation of f(a) for a sufficiently large number a. In the…
A new parametric surface representation is proposed that interpolates the vertices of a given closed mesh of arbitrary topology. Smoothly connecting quadrilateral patches are created by blending local, multi-sided quadratic interpolants. In…
This paper investigates some univariate and bivariate constrained interpolation problems using rational quartic fractal interpolation functions, which has been submitted long back in a reputed journal and revised as per the journal…
The Kronecker product is an invaluable tool for data-sparse representations of large networks and matrices with countless applications in machine learning, graph theory and numerical linear algebra. In some instances, the sparsity pattern…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
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…