A geometrical approach to finding multivariate approximate LCMs and GCDs
type: Item
instance of: scholarly article
title: A geometrical approach to finding multivariate approximate LCMs and GCDs
zbMATH Open document ID: 1337.65033
author: Kim Batselier
author: Philippe Dreesen
author: B. De Moor
published in: Linear Algebra and its Applications
publication date: 2013-04-12T00:00:00Z
Mathematics Subject Classification ID: 65F20
Mathematics Subject Classification ID: 15A42
Mathematics Subject Classification ID: 65F35
Mathematics Subject Classification ID: 65F50
zbMATH DE Number: 6153434
zbMATH Keywords: approximate LCM
zbMATH Keywords: approximate GCD
zbMATH Keywords: multivariate polynomials
zbMATH Keywords: principal angles
zbMATH Keywords: singular values
zbMATH Keywords: Arnoldi iteration
describes a project that uses: SuiteSparseQR
MaRDI profile type: Publication
full work available at URL: j.laa.2012.12.043
OpenAlex ID: W2039073905
cites work: Q3309525
cites work: Common factor detection and estimation
cites work: On approximate GCDs of univariate polynomials
cites work: Quasi-gcd computations
cites work: Certified approximate univariate GCDs
cites work: Q4227296
cites work: Approximate GCD and its application to ill-conditioned algebraic equations
cites work: The approximate GCD of inexact polynomials
cites work: &lt;tex&gt;$QR$&lt;/tex&gt;Factoring to Compute the GCD of Univariate Approximate Polynomials
cites work: Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases
cites work: An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials
cites work: The calculation of the degree of an approximate greatest common divisor of two polynomials
cites work: Approximate factorization of multivariate polynomials using singular value decomposition
cites work: Q3413659
cites work: Numerical Methods for Computing Angles Between Linear Subspaces
cites work: Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
cites work: Algorithm 915, SuiteSparseQR
cites work: Products of polynomials in many variables
cites work: A Gershgorin-type lower bound for the smallest singular value
cites work: Q3514380
DOI: 10.1016/J.LAA.2012.12.043
description: scientific article; zbMATH DE number 6153434