Approximate factorization of multivariate polynomials using singular value decomposition
From MaRDI portal
Publication:2482630
Recommendations
- scientific article; zbMATH DE number 1009446
- Approximate multivariate polynomial factorization based on zero-sum relations
- scientific article; zbMATH DE number 1254251
- Approximate factorization of multidimensional polynomials depending on a parameter
- Approximate factorization of multivariate polynomials via differential equations
- scientific article; zbMATH DE number 962291
- scientific article; zbMATH DE number 966297
- Factoring sparse multivariate polynomials
- A unified method for multivariate polynomial factorizations
- scientific article; zbMATH DE number 1014744
Cites work
- Analysis of approximate factorization algorithm. I
- Approximate factorization of multivariate polynomials and absolute irreducibility testing
- Approximate factorization of multivariate polynomials via differential equations
- Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
- Approximate multivariate polynomial factorization based on zero-sum relations
- Certified approximate univariate GCDs
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
- Computer Algebra in Scientific Computing
- DISPLACEMENT STRUCTURE IN COMPUTING APPROXIMATE GCD OF UNIVARIATE POLYNOMIALS
- Factoring multivariate polynomials via partial differential equations
- Fast algorithm for solving the Hankel/Toeplitz structured total least squares problem
- Fast parallel absolute irreducibility testing
- scientific article; zbMATH DE number 1682655 (Why is no real title available?)
- scientific article; zbMATH DE number 1253987 (Why is no real title available?)
- scientific article; zbMATH DE number 1274356 (Why is no real title available?)
- scientific article; zbMATH DE number 1974605 (Why is no real title available?)
- scientific article; zbMATH DE number 1744839 (Why is no real title available?)
- scientific article; zbMATH DE number 2145002 (Why is no real title available?)
- scientific article; zbMATH DE number 2151196 (Why is no real title available?)
- scientific article; zbMATH DE number 2151210 (Why is no real title available?)
- scientific article; zbMATH DE number 2151216 (Why is no real title available?)
- scientific article; zbMATH DE number 2151235 (Why is no real title available?)
- scientific article; zbMATH DE number 2118485 (Why is no real title available?)
- scientific article; zbMATH DE number 2118487 (Why is no real title available?)
- scientific article; zbMATH DE number 2118488 (Why is no real title available?)
- Irreducible decomposition of curves
- Low rank approximation of a Hankel matrix by structured total least norm
- Numerical factorization of multivariate complex polynomials
- Pseudofactors of multivariate polynomials
- Reducibility of polynomials \(f(x,y)\) modulo \(p\)
- Reduzibilität ebener Kurven.
- Riemann surfaces, plane algebraic curves and their period matrices
- Semi-numerical absolute factorization of polynomials with integer coefficients
- Semi-numerical determination of irreducible branches of a reduced space curve
- Symbolic-numeric sparse interpolation of multivariate polynomials
- Symbolic-numeric sparse interpolation of multivariate polynomials
- The approximate GCD of inexact polynomials
- Towards factoring bivariate approximate polynomials
Cited in
(39)- Analysis of approximate factorization algorithm. I
- A geometrical approach to finding multivariate approximate LCMs and GCDs
- The computation of the degree of the greatest common divisor of three Bernstein basis polynomials
- The computation of the greatest common divisor of three bivariate Bernstein polynomials defined in a rectangular domain
- A symbolic-numeric approach for parametrizing ruled surfaces
- An approximate factorisation of three bivariate Bernstein basis polynomials defined in a triangular domain
- Approximate square-free part and decomposition
- Computing lower rank approximations of matrix polynomials
- Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots
- Approximating multidimensional subset sum and Minkowski decomposition of polygons
- An algorithm to parametrize approximately space curves
- Improved dense multivariate polynomial factorization algorithms
- Bounded-degree factors of lacunary multivariate polynomials
- A sequence of nearest polynomials with given factors
- A quadratically convergent algorithm for structured low-rank approximation
- Approximate multivariate polynomial factorization based on zero-sum relations
- Extracting numerical factors of multivariate polynomials from Taylor expansions
- Pseudofactors of multivariate polynomials
- Regularization and matrix computation in numerical polynomial algebra
- Exact certification in global polynomial optimization via rationalizing sums-of-squares
- A fast recursive orthogonalization scheme for the Macaulay matrix
- scientific article; zbMATH DE number 1254251 (Why is no real title available?)
- scientific article; zbMATH DE number 1009446 (Why is no real title available?)
- A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials
- Approximate decoupling of multivariate polynomials using weighted tensor decomposition.
- Approximate factorization of multivariate polynomials via differential equations
- scientific article; zbMATH DE number 763784 (Why is no real title available?)
- scientific article; zbMATH DE number 784435 (Why is no real title available?)
- Some control observation problems and their differential algebraic partial solutions
- Towards industrial application of approximate computer algebra
- The numerical factorization of polynomials
- Tropical algebraic geometry in Maple: a preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients
- Numerical factorization of multivariate complex polynomials
- Irreducibility of Binomials
- Approximate parametrization of plane algebraic curves by linear systems of curves
- A hybrid symbolic-numerical approach for ruled surface detection and parameterization
- Learning arithmetic formulas in the presence of noise: a general framework and applications to unsupervised learning
- Encounters in symbolic computation: ideas for the ages
- Duality of multiple root loci
This page was built for publication: Approximate factorization of multivariate polynomials using singular value decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482630)
