Small degree solutions for the polynomial Bezout equation
โ Scribed by Carlos A. Berenstein; Daniele C. Struppa
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 836 KB
- Volume
- 98
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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 computatio
The cell discretization algorithm, a nonconforming extension of the finite element method, is used to obtain approximations to the velocity and pressure functions satisfying the Stokes equations. Error estimates show convergence of the method. An implementation using polynomial bases is described th
## Full paper published in this issue 001 Some Remarks on a New Characterization of Linear Controllability M. Flless, pp 8-11 A module-theoretic approach to linear controllability is shown to be equivalent to Willems' trajectory characterization. The paper also sketches a computationfree derivati
Holzer, using a deep theorem, proved that if the Legendre equation ax 2 +by 2 & cz 2 =0 is in normal form and has a nonzero solution then there is a solution with |x| -bc, |y| -ac and |z| -ab. The first elementary proof of this result was given by Mordell with a small gap filled by Williams. We give