A heuristic verification of the degree of the approximate GCD of two univariate polynomials
From MaRDI portal
Publication:466858
DOI10.1007/s11075-013-9793-9zbMath1302.68333OpenAlexW2031661066MaRDI QIDQ466858
Publication date: 31 October 2014
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-013-9793-9
Symbolic computation and algebraic computation (68W30) Polynomials, factorization in commutative rings (13P05) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Numerical computation of roots of polynomial equations (65H04)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- High-performance numerical algorithms and software for structured total least squares
- Verified bounds for singular values, in particular for the spectral norm of a matrix and its inverse
- A subdivision method for computing nearest gcd with certification
- Fast enclosure for solutions in underdetermined systems
- Quasi-gcd computations
- The approximation of generalized turning points by projection methods with superconvergence to the critical parameter
- Approximate GCD and its application to ill-conditioned algebraic equations
- When are two numerical polynomials relatively prime?
- Certified approximate univariate GCDs
- Detection and validation of clusters of polynomial zeros
- Photonic band structure calculations using nonlinear eigenvalue techniques
- Computation of approximate polynomial GCDs and an extension
- Improved componentwise verified error bounds for least squares problems and underdetermined linear systems
- Approximate gcds of polynomials and sparse SOS relaxations
- Structured low rank approximation of a Bezout matrix
- A structured rank-revealing method for Sylvester matrix
- Global minimization of rational functions and the nearest GCDs
- Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken
- Greatest common divisor of two polynomials
- Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases
- QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients
- An iterative method for calculating approximate GCD of univariate polynomials
- Verification methods: Rigorous results using floating-point arithmetic
- Verified Bounds for Least Squares Problems and Underdetermined Linear Systems
- Blind image deconvolution via fast approximate GCD
- Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
- Characterization and Computation of Generalized Turning Points
- Characterization and Computation of Singular Points with Maximum Rank Deficiency
- A Test for Existence of Solutions to Nonlinear Systems
- Improved Parallel Polynomial Division
- BORDERED MATRICES AND SINGULARITIES OF LARGE NONLINEAR SYSTEMS
- DISPLACEMENT STRUCTURE IN COMPUTING APPROXIMATE GCD OF UNIVARIATE POLYNOMIALS
- The approximate GCD of inexact polynomials
- The Approximate Solution of Defining Equations for Generalized Turning Points
- Accuracy and Stability of Numerical Algorithms
- <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials
- Existence of Solutions to Systems of Underdetermined Equations and Spherical Designs
- Active Vibration Control of a Modular Robot Combining a Back-Propagation Neural Network with a Genetic Algorithm
- A Note on the Bezoutian Matrix
