Relaxed NewtonSLRA for approximate GCD (Q831989)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Relaxed NewtonSLRA for approximate GCD	scientific article

Statements

scholarly article

0 references

Relaxed NewtonSLRA for approximate GCD (English)

0 references

Kosaku Nagasaka

0 references

publication date

24 March 2022

0 references

zbMATH Keywords

approximate GCD

0 references

structured low rank approximation

0 references

NewtonSLRA algorithm

0 references

weighted Frobenius norm

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-85165-1_16

0 references

Affine equivalences of trigonometric curves

0 references

0 references

Structured Matrix Based Methods for Approximate Polynomial GCD

0 references

A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials

0 references

Signal enhancement-a composite property mapping algorithm

0 references

The GPGCD algorithm with the Bézout matrix

0 references

&lt;tex&gt;$QR$&lt;/tex&gt;Factoring to Compute the GCD of Univariate Approximate Polynomials

0 references

Best approximation in inner product spaces

0 references

Calculation of Zeros of a Real Polynomial Through Factorization Using Euclid’s Algorithm

0 references

0 references

Certified approximate univariate GCDs

0 references

An ODE-based method for computing the approximate greatest common divisor of polynomials

0 references

Computing nearby non-trivial Smith forms

0 references

0 references

Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials

0 references

0 references

0 references

Low-rank approximation. Algorithms, implementation, applications

0 references

Approximate GCD by bernstein basis, and its applications

0 references

Toward the best algorithm for approximate GCD of univariate polynomials

0 references

Approximate GCD and its application to ill-conditioned algebraic equations

0 references

Computation of approximate polynomial GCDs and an extension

0 references

0 references

Quasi-gcd computations

0 references

A quadratically convergent algorithm for structured low-rank approximation

0 references

GPGCD: an iterative method for calculating approximate GCD of univariate polynomials

0 references

Variable projection methods for approximate (greatest) common divisor computations

0 references

0 references

Resultant matrices and the computation of the degree of an approximate greatest common divisor of two inexact Bernstein basis polynomials

0 references

The numerical greatest common divisor of univariate polynomials

0 references

Identifiers

10.1007/978-3-030-85165-1_16

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:831989

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q831989&oldid=36782978"