Approximate factorization of multivariate polynomials using singular value decomposition (Q2482630): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: KELLEY / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CARS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2038133488 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4657306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660684 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards factoring bivariate approximate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certified approximate univariate GCDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-numerical determination of irreducible branches of a reduced space curve / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irreducible decomposition of curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring multivariate polynomials via partial differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate factorization of multivariate polynomials via differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Riemann surfaces, plane algebraic curves and their period matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic-numeric sparse interpolation of multivariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic-numeric sparse interpolation of multivariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4827953 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudofactors of multivariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast parallel absolute irreducibility testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660663 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4237537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithm for solving the Hankel/Toeplitz structured total least squares problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4827952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4531745 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Algebra in Scientific Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4422509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760974 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low rank approximation of a Hankel matrix by structured total least norm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduzibilität ebener Kurven. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility of polynomials \(f(x,y)\) modulo \(p\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-numerical absolute factorization of polynomials with integer coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate multivariate polynomial factorization based on zero-sum relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of approximate factorization algorithm. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate factorization of multivariate polynomials and absolute irreducibility testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4827950 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical factorization of multivariate complex polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660677 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The approximate GCD of inexact polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: DISPLACEMENT STRUCTURE IN COMPUTING APPROXIMATE GCD OF UNIVARIATE POLYNOMIALS / rank
 
Normal rank

Revision as of 21:05, 27 June 2024

scientific article
Language Label Description Also known as
English
Approximate factorization of multivariate polynomials using singular value decomposition
scientific article

    Statements

    Approximate factorization of multivariate polynomials using singular value decomposition (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 April 2008
    0 references
    multivariate polynomial factorization
    0 references
    approximate factorization
    0 references
    singular value decomposition
    0 references
    numerical algebra
    0 references
    Gauss-Newton optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers