Relaxed NewtonSLRA for approximate GCD
From MaRDI portal
Publication:831989
DOI10.1007/978-3-030-85165-1_16OpenAlexW3193369282MaRDI QIDQ831989
Publication date: 24 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-85165-1_16
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A quadratically convergent algorithm for structured low-rank approximation
- GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
- Affine equivalences of trigonometric curves
- Quasi-gcd computations
- Approximate GCD and its application to ill-conditioned algebraic equations
- Certified approximate univariate GCDs
- Low-rank approximation. Algorithms, implementation, applications
- Computation of approximate polynomial GCDs and an extension
- Resultant matrices and the computation of the degree of an approximate greatest common divisor of two inexact Bernstein basis polynomials
- Toward the best algorithm for approximate GCD of univariate polynomials
- The GPGCD algorithm with the Bézout matrix
- Computing nearby non-trivial Smith forms
- Variable projection methods for approximate (greatest) common divisor computations
- A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials
- An ODE-based method for computing the approximate greatest common divisor of polynomials
- Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
- Structured Matrix Based Methods for Approximate Polynomial GCD
- The numerical greatest common divisor of univariate polynomials
- Signal enhancement-a composite property mapping algorithm
- Calculation of Zeros of a Real Polynomial Through Factorization Using Euclid’s Algorithm
- Approximate GCD by bernstein basis, and its applications
- <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials
- Best approximation in inner product spaces
