Bernstein-Bézoutian matrices
From MaRDI portal
Publication:598205
DOI10.1016/J.TCS.2004.01.016zbMATH Open1071.65014OpenAlexW1963627383MaRDI QIDQ598205FDOQ598205
Authors: L. Gemignani, Dario A. Bini 
Publication date: 6 August 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.01.016
Recommendations
- scientific article; zbMATH DE number 591284
- Loewner and Bézout matrices
- A generalized bezoutian matrix
- Bézout, Hankel, and Loewner matrices
- Bernoulli matrix and its algebraic properties
- A note on Bernstein-Vandermonde matrices
- Matrix inequalities via Bernstein functions
- A companion matrix resultant for Bernstein polynomials
- scientific article; zbMATH DE number 2149743
- Bézoutians of rational matrix functions
numerical examplesfast algorithmsBernstein polynomial basisgreatest common divisordisplacement structureBézoutian matrices
Cites Work
- Algorithms for polynomials in Bernstein form
- Fast inversion of Chebyshev-Vandermonde matrices
- A companion matrix resultant for Bernstein polynomials
- Title not available (Why is that?)
- Title not available (Why is that?)
- Displacement Structure: Theory and Applications
- Certified approximate univariate GCDs
- Computation of approximate polynomial GCDs and an extension
- A Look-Ahead Levinson Algorithm for Indefinite Toeplitz Systems
- Title not available (Why is that?)
- Subresultants and Reduced Polynomial Remainder Sequences
- On Euclid's Algorithm and the Theory of Subresultants
- Interactive Interpolation and Approximation by Bezier Polynomials
- Schur complements of Bézoutians and the inversion of block Hankel and block Toeplitz matrices
- Title not available (Why is that?)
- Generalized companion matrices and matrix representations for generalized Bézoutians
- A resultant matrix for scaled Bernstein polynomials
- Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation
- Fast and stable computation of the barycentric representation of rational interpolants
- A look-ahead algorithm for the solution of general Hankel systems
- Displacement-structure approach to polynomial Vandermonde and related matrices
- Current trends in geometric modeling and selected computational applications
- Geometric curve approximation
- A comparison of the average case numerical condition of the power and bernstein polynomial bases
- Title not available (Why is that?)
- Fast Parallel Computation of the Polynomial Remainder Sequence via Bézout and Hankel Matrices
- Title not available (Why is that?)
Cited In (37)
- The computation of the degree of the greatest common divisor of three Bernstein basis polynomials
- High-order quadrature on multi-component domains implicitly defined by multivariate polynomials
- Title not available (Why is that?)
- Linearizations of matrix polynomials in Bernstein bases
- Matrix methods for the tensorial Bernstein form
- Computing the topology of a real algebraic plane curve whose defining equations are available only ``by values
- Computing the common zeros of two bivariate functions via Bézout resultants
- Gram matrix of Bernstein basis: properties and applications
- Bernoulli matrix and its algebraic properties
- Title not available (Why is that?)
- A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems
- A unified approach to resultant matrices for Bernstein basis polynomials
- Division algorithms for Bernstein polynomials
- A resultant matrix for scaled Bernstein polynomials
- Bézout matrix with respect to Jacobson chain basis
- Computing the polynomial remainder sequence via Bézout matrices
- Bézoutians of rational matrix functions
- The computation of the greatest common divisor of three bivariate Bernstein polynomials defined in a rectangular domain
- Block \(\mathbf {LU}\) factors of generalized companion matrix pencils
- A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials
- Bernstein Bézoutians and application to intersection problems
- Bernstein-Bezoutian matrices and curve implicitization
- The Sylvester and Bézout resultant matrices for blind image deconvolution
- The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials
- The transformation of the companion matrix resultant between the power and Bernstein polynomial bases.
- A structure-preserving matrix method for the deconvolution of two Bernstein basis polynomials
- Subresultants of several univariate polynomials in Newton basis
- Computing curve intersection by means of simultaneous iterations
- The Bernstein polynomial basis: a centennial retrospective
- A fast method to compute the inertia of Bézout matrix and its application
- The numerical condition of univariate and bivariate degree elevated Bernstein polynomials
- Bezoutians, Euclidean algorithm, and orthogonal polynomials
- Structured matrix methods for CAGD: an application to computing the resultant of polynomials in the Bernstein basis
- On the Bézoutian matrix for Chebyshev polynomials
- Linearization of a specific family of Bézout matrices
- The Bézout matrix for Hermite interpolants
- A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials
This page was built for publication: Bernstein-Bézoutian matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q598205)
