Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,398,553 papers from all fields of science
Search
Sign In
Create Free Account
Bézout matrix
Known as:
Bezout matrix
, Bezoutian matrix
, Bezoutian
Expand
In mathematics, a Bézout matrix (or Bézoutian or Bezoutiant) is a special square matrix associated with two polynomials, introduced by Sylvester…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Control theory
Polynomial
Resultant
Stable polynomial
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
On the Bezoutian matrix for Chebyshev polynomials
ZhengHong Yang
,
BingFei Cui
Applied Mathematics and Computation
2012
Corpus ID: 205415969
2012
2012
A unified approach to structured covariances: Polynomial Vandermonde Bezoutian representations
R. Merched
European Signal Processing Conference
2012
Corpus ID: 14930469
This paper shows how the theory of recurrence related polynomials is connected to the construction of covariance displacement…
Expand
2008
2008
Toeplitz-plus-Hankel Bezoutians and inverses of Toeplitz and Toeplitz-plus-Hankel matrices
K. Rost
2008
Corpus ID: 124602743
In the present paper Bezoutian-type formulas for the inverses of Toeplitz-plus-Hankel (T+H) matrices are presented which involve…
Expand
2006
2006
Implicitization of Parametric Curves via Lagrange Interpolation
Yongli Sun
,
Jianping Yu
Computing
2006
Corpus ID: 19692264
A simple algorithm for finding the implicit equation of a parametric plane curve given by its parametric equations is presented…
Expand
2006
2006
Computing curve intersection by means of simultaneous iterations
Dario Bini
,
A. Marco
Numerical Algorithms
2006
Corpus ID: 24034673
A new algorithm is proposed for computing the intersection of two plane curves given in rational parametric form. It relies on…
Expand
2005
2005
Structured matrix methods for CAGD: an application to computing the resultant of polynomials in the Bernstein basis
Dario Bini
,
L. Gemignani
,
J. Winkler
Numerical Linear Algebra with Applications
2005
Corpus ID: 42634601
We devise a fast fraction‐free algorithm for the computation of the triangular factorization of Bernstein–Bezoutian matrices with…
Expand
2005
2005
Bezoutians, Euclidean Algorithm, and Orthogonal Polynomials
A. Lascoux
,
P. Pragacz
2005
Corpus ID: 122962464
Abstract.We prove a quadratic expression for the Bezoutian of two univariate polynomials in terms of the remainders for the…
Expand
1996
1996
Greatest common divisors of polynomials
F. Winkler
1996
Corpus ID: 115856028
If K is a field, then K[x] is a Euclidean domain, so gcd(f, g) for f, g ∈ K[x] can be computed by the Euclidean algorithm. Often…
Expand
1980
1980
Controllability, Bezoutian and relative primeness
B. Datta
1980
Corpus ID: 120223967
Let f(x) and g(x) be two polynomials of degree n. Then it is well-known that the Bezoutian matrix Bfg associated with f(x) and g…
Expand
1977
1977
Matrix fraction description of the lossless positive real property
R. Bitmead
,
B. Anderson
1977
Corpus ID: 37154119
Suppose a matrix fraction description of a real rational square transfer function matrix is known. A condition is given involving…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE