Scilab Website | Contribute with GitLab | Mailing list archives | ATOMS toolboxes
Scilab Online Help
6.1.1 - English

Change language to:
Français - 日本語 - Português - Русский

Please note that the recommended version of Scilab is 2024.0.0. This page might be outdated.
See the recommended documentation of this function

Scilab Help >> Polynomials > sylm

sylm

Sylvester matrix of two polynomials

Syntax

S = sylm(a, b)

Arguments

a, b

Two polynomials with real or complex coefficients.

S

matrix of real or complex numbers

Description

sylm(a,b) gives the Sylvester matrix associated to polynomials a and b, i.e. the matrix S such that:

coeff( a*x + b*y )' = S * [coeff(x)';coeff(y)'].

Dimension of S is equal to degree(a)+degree(b).

If a and b are coprime polynomials then rank(sylm(a,b))=degree(a)+degree(b)) and the instructions

u = sylm(a,b) \ eye(na+nb,1)
x = poly(u(1:nb),'z','coeff')
y = poly(u(nb+1:na+nb),'z','coeff')

compute Bezout factors x and y of minimal degree such that a*x+b*y = 1

Examples

x = poly(0,"x");
y = poly ([1, 2, 3], "x", "coeff")
sylm(x, y)
--> x = poly(0, "x");
--> y = poly([1, 2, 3], "x","coeff")
 y  =
  1 +2x +3x²

--> sylm(x, y)
 ans  =
   0.   0.   1.
   1.   0.   2.
   0.   1.   3.

See Also

  • bezout — GCD of two polynomials or two integers, by the Bezout method
  • diophant — Solves the diophantine (Bezout) equation p1*x1 + p2*x2 = b
Report an issue
<< simp_mode Polynomials varn >>

Copyright (c) 2022-2023 (Dassault Systèmes)
Copyright (c) 2017-2022 (ESI Group)
Copyright (c) 2011-2017 (Scilab Enterprises)
Copyright (c) 1989-2012 (INRIA)
Copyright (c) 1989-2007 (ENPC)
with contributors
Last updated:
Mon Jan 03 14:23:25 CET 2022