Bernstein-Bézoutian matrices

DOI10.1016/j.tcs.2004.01.016zbMath1071.65014OpenAlexW1963627383MaRDI QIDQ598205

Luca Gemignani, Dario Andrea 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

zbMATH Keywords

numerical examplesgreatest common divisorfast algorithmsdisplacement structureBernstein polynomial basisBézoutian matrices

Mathematics Subject Classification ID

Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items (16)

High-order quadrature on multi-component domains implicitly defined by multivariate polynomials ⋮ The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials ⋮ Computing curve intersection by means of simultaneous iterations ⋮ A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials ⋮ A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems ⋮ Bernstein-Bezoutian matrices and curve implicitization ⋮ Bernstein Bézoutians and application to intersection problems ⋮ A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials ⋮ The Bernstein polynomial basis: a centennial retrospective ⋮ Computing the topology of a real algebraic plane curve whose defining equations are available only ``by values ⋮ The numerical condition of univariate and bivariate degree elevated Bernstein polynomials ⋮ Block \(\mathbf {LU}\) factors of generalized companion matrix pencils ⋮ Computing the common zeros of two bivariate functions via Bézout resultants ⋮ A unified approach to resultant matrices for Bernstein basis polynomials ⋮ The Sylvester and Bézout resultant matrices for blind image deconvolution ⋮ The Bézout matrix for Hermite interpolants

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Schur complements of Bézoutians and the inversion of block Hankel and block Toeplitz matrices
• Algorithms for polynomials in Bernstein form
• 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
• Generalized companion matrices and matrix representations for generalized Bézoutians
• A look-ahead algorithm for the solution of general Hankel systems
• Fast inversion of Chebyshev-Vandermonde matrices
• Certified approximate univariate GCDs
• Displacement-structure approach to polynomial Vandermonde and related matrices
• Current trends in geometric modeling and selected computational applications
• Geometric curve approximation
• Computation of approximate polynomial GCDs and an extension
• A companion matrix resultant for Bernstein polynomials
• A comparison of the average case numerical condition of the power and bernstein polynomial bases
• A Look-Ahead Levinson Algorithm for Indefinite Toeplitz Systems
• Fast Parallel Computation of the Polynomial Remainder Sequence via Bézout and Hankel Matrices
• Displacement Structure: Theory and Applications
• Subresultants and Reduced Polynomial Remainder Sequences
• On Euclid's Algorithm and the Theory of Subresultants
• Interactive Interpolation and Approximation by Bezier Polynomials
• A resultant matrix for scaled Bernstein polynomials

This page was built for publication: Bernstein-Bézoutian matrices