๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A robust solution of the generalized polynomial Bezout identity

โœ Scribed by J.C. Basilio; M.V. Moreira

Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
231 KB
Volume
385
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

โœฆ Synopsis

In this paper, algorithms for the computation of all matrices of the generalized polynomial Bezout identity are proposed. The algorithms are based on the computation of minimal polynomial basis for the right null spaces of certain polynomial matrices. For this reason, an algorithm for the computation of minimal polynomial bases is also proposed. Since this algorithm relies solely on singular value decompositions of certain real matrices, formed with the coefficients of the polynomial matrix whose minimal polynomial bases one is interested in finding, it can be said to be robust.

๐Ÿ“œ SIMILAR VOLUMES

Stabilization of nonlinear systems based
Stabilization of nonlinear systems based on a generalized Bรฉzout identity
โœ Alfonso Baรฑos ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 604 KB

The relationship between the BCzout and input-output approaches to right-coprimeness is investigated. We introduce a generalized BCzout identity and analyze its relationship to right-coprimeness. In terms of the generalized BCzout identity, a right factorization of a nonlinear plant is coprime acco

A Solution to the Generalized Cevian Pro
A Solution to the Generalized Cevian Problem Using Forest Polynomials
โœ Matthew Hudelson ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 156 KB

In this paper, we examine the effect of dissecting an n-dimensional simplex using cevians (cross-sections passing through n&1 of the vertices of the simplex). We describe a formula for the number of pieces the simplex is dissected into using a polynomial involving only the number of each type of cev