A geometrical approach to finding multivariate approximate LCMs and GCDs (Q1947122): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.laa.2012.12.043 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2039073905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3309525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Common factor detection and estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximate GCDs of univariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-gcd computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certified approximate univariate GCDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate GCD and its application to ill-conditioned algebraic equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The approximate GCD of inexact polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: The calculation of the degree of an approximate greatest common divisor of two polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate factorization of multivariate polynomials using singular value decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3413659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Methods for Computing Angles Between Linear Subspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deflation Techniques for an Implicitly Restarted Arnoldi Iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 915, SuiteSparseQR / rank
 
Normal rank
Property / cites work
 
Property / cites work: Products of polynomials in many variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Gershgorin-type lower bound for the smallest singular value / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3514380 / rank
 
Normal rank

Latest revision as of 09:16, 6 July 2024

scientific article
Language Label Description Also known as
English
A geometrical approach to finding multivariate approximate LCMs and GCDs
scientific article

    Statements

    A geometrical approach to finding multivariate approximate LCMs and GCDs (English)
    0 references
    0 references
    0 references
    0 references
    12 April 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    approximate LCM
    0 references
    approximate GCD
    0 references
    multivariate polynomials
    0 references
    principal angles
    0 references
    singular values
    0 references
    Arnoldi iteration
    0 references
    0 references