The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Numerical operations among rational matrices: standard techniques and interpolation”

Analytic interpolation and the degree constraint

Tryphon Georgiou (2001)

International Journal of Applied Mathematics and Computer Science

Similarity:

Analytic interpolation problems arise quite naturally in a variety of engineering applications. This is due to the fact that analyticity of a (transfer) function relates to the stability of a corresponding dynamical system, while positive realness and contractiveness relate to passivity. On the other hand, the degree of an interpolant relates to the dimension of the pertinent system, and this motivates our interest in constraining the degree of interpolants. The purpose of the present...

An introduction to hierarchical matrices

Wolfgang Hackbusch, Lars Grasedyck, Steffen Börm (2002)

Mathematica Bohemica

Similarity:

We give a short introduction to a method for the data-sparse approximation of matrices resulting from the discretisation of non-local operators occurring in boundary integral methods or as the inverses of partial differential operators. The result of the approximation will be the so-called hierarchical matrices (or short ℋ -matrices). These matrices form a subset of the set of all matrices and have a data-sparse representation. The essential operations for these matrices (matrix-vector...

Explicit rational solutions of Knizhnik-Zamolodchikov equation

Lev Sakhnovich (2008)

Open Mathematics

Similarity:

We consider the Knizhnik-Zamolodchikov system of linear differential equations. The coefficients of this system are rational functions generated by elements of the symmetric group 𝒮 n n. We assume that parameter ρ = ±1. In previous paper [5] we proved that the fundamental solution of the corresponding KZ-equation is rational. Now we construct this solution in the explicit form.

An equivalent matrix pencilfor bivariate polynomial matrices

Mohamed Boudellioua (2006)

International Journal of Applied Mathematics and Computer Science

Similarity:

In this paper, we present a simple algorithm for the reduction of a given bivariate polynomial matrix to a pencil form which is encountered in Fornasini-Marchesini's type of singular systems. It is shown that the resulting matrix pencil is related to the original polynomial matrix by the transformation of zero coprime equivalence. The exact form of both the matrix pencil and the transformation connecting it to the original matrix are established.