Relaxed NewtonSLRA for approximate GCD
type: Item
instance of: scholarly article
title: Relaxed NewtonSLRA for approximate GCD
DOI: 10.1007/978-3-030-85165-1_16
author: Kosaku Nagasaka
publication date: 2022-03-24T00:00:00Z
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 7497960
zbMATH Keywords: approximate GCD
zbMATH Keywords: structured low rank approximation
zbMATH Keywords: NewtonSLRA algorithm
zbMATH Keywords: weighted Frobenius norm
describes a project that uses: GPGCD
MaRDI profile type: Publication
full work available at URL: 978-3-030-85165-1 16
OpenAlex ID: W3193369282
cites work: Affine equivalences of trigonometric curves
cites work: Q5301644
cites work: Structured Matrix Based Methods for Approximate Polynomial GCD
cites work: A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials
cites work: Signal enhancement-a composite property mapping algorithm
cites work: The GPGCD algorithm with the Bézout matrix
cites work: &lt;tex&gt;$QR$&lt;/tex&gt;Factoring to Compute the GCD of Univariate Approximate Polynomials
cites work: Best approximation in inner product spaces
cites work: Calculation of Zeros of a Real Polynomial Through Factorization Using Euclid’s Algorithm
cites work: Q4717942
cites work: Certified approximate univariate GCDs
cites work: An ODE-based method for computing the approximate greatest common divisor of polynomials
cites work: Computing nearby non-trivial Smith forms
cites work: Q4917542
cites work: Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
cites work: Q3447170
cites work: Q4227320
cites work: Low-rank approximation. Algorithms, implementation, applications
cites work: Approximate GCD by bernstein basis, and its applications
cites work: Toward the best algorithm for approximate GCD of univariate polynomials
cites work: Approximate GCD and its application to ill-conditioned algebraic equations
cites work: Computation of approximate polynomial GCDs and an extension
cites work: Q4008406
cites work: Quasi-gcd computations
cites work: A quadratically convergent algorithm for structured low-rank approximation
cites work: GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
cites work: Variable projection methods for approximate (greatest) common divisor computations
cites work: Q4462008
cites work: Resultant matrices and the computation of the degree of an approximate greatest common divisor of two inexact Bernstein basis polynomials
cites work: The numerical greatest common divisor of univariate polynomials
Recommended article: Approximate GCD by relaxed NewtonSLRA algorithm
Recommended article: Q4308192
Recommended article: Approximate gcds of polynomials and sparse SOS relaxations
Recommended article: Q4456702
Recommended article: Relaxing the convergence conditions for Newton-like methods
Recommended article: Relaxation in greedy approximation
Recommended article: Q4232503
Recommended article: Structured Matrix Based Methods for Approximate Polynomial GCD
Recommended article: Certified approximate univariate GCDs
description: scientific article; zbMATH DE number 7497960