Structured total least norm and approximate GCDs of inexact polynomials
From MaRDI portal
Publication:2480912
Recommendations
- scientific article; zbMATH DE number 5168246
- Structured low rank approximation of a Bezout matrix
- Approximate polynomial GCD.
- Structured low rank approximations of the sylvester resultant matrix for approximate GCDS of Bernstein basis polynomials
- Structured matrix based methods for approximate polynomial GCD
Cites work
- scientific article; zbMATH DE number 3839766 (Why is no real title available?)
- scientific article; zbMATH DE number 5168246 (Why is no real title available?)
- scientific article; zbMATH DE number 1254251 (Why is no real title available?)
- scientific article; zbMATH DE number 1254271 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials
- A Note on Deferred Correction for Equality Constrained Least Squares Problems
- Computation of approximate polynomial GCDs and an extension
- Error Analysis and Implementation Aspects of Deferred Correction for Equality Constrained Least Squares Problems
- On the Method of Weighting for Equality-Constrained Least-Squares Problems
- QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients
- Total Least Norm Formulation and Solution for Structured Problems
Cited in
(21)- The computation of the degree of the greatest common divisor of three Bernstein basis polynomials
- Computationally efficient selection criterion of initial equation in STLN-based structured low-rank approximation
- Blind image deconvolution via Hankel based method for computing the GCD of polynomials
- Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach
- An improved non-linear method for the computation of a structured low rank approximation of the Sylvester resultant matrix
- The calculation of the degree of an approximate greatest common divisor of two polynomials
- Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials
- A unified approach to resultant matrices for Bernstein basis polynomials
- Structured low rank approximations of the sylvester resultant matrix for approximate GCDS of Bernstein basis polynomials
- Generalized algorithms for the approximate matrix polynomial GCD of reducing data uncertainties with application to MIMO system and control
- A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix
- Computing the polynomial remainder sequence via Bézout matrices
- Variable projection methods for approximate (greatest) common divisor computations
- An ODE-based method for computing the approximate greatest common divisor of polynomials
- Low rank approximation of the symmetric positive semidefinite matrix
- Approximate GCD of several multivariate sparse polynomials based on SLRA interpolation
- Structure preserving methods for the computation of approximate GCDs of Bernstein polynomials
- Approximate least common multiple of several polynomials using the ERES division algorithm
- SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials
- Approximate polynomial GCD.
- Nearest common root of polynomials, approximate greatest common divisor and the structured singular value
This page was built for publication: Structured total least norm and approximate GCDs of inexact polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2480912)
