Pages that link to "Item:Q2482630"
From MaRDI portal
The following pages link to Approximate factorization of multivariate polynomials using singular value decomposition (Q2482630):
Displaying 30 items.
- A quadratically convergent algorithm for structured low-rank approximation (Q285440) (← links)
- A fast recursive orthogonalization scheme for the Macaulay matrix (Q396030) (← links)
- The numerical factorization of polynomials (Q525605) (← links)
- Tropical algebraic geometry in Maple: a preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients (Q540325) (← links)
- Numerical factorization of multivariate complex polynomials (Q598228) (← links)
- Approximate parametrization of plane algebraic curves by linear systems of curves (Q631016) (← links)
- Duality of multiple root loci (Q891671) (← links)
- Analysis of approximate factorization algorithm. I (Q1202761) (← links)
- A geometrical approach to finding multivariate approximate LCMs and GCDs (Q1947122) (← links)
- The computation of the degree of the greatest common divisor of three Bernstein basis polynomials (Q1989191) (← links)
- The computation of the greatest common divisor of three bivariate Bernstein polynomials defined in a rectangular domain (Q2029179) (← links)
- A symbolic-numeric approach for parametrizing ruled surfaces (Q2200134) (← links)
- An approximate factorisation of three bivariate Bernstein basis polynomials defined in a triangular domain (Q2226320) (← links)
- Approximate square-free part and decomposition (Q2229724) (← links)
- Computing lower rank approximations of matrix polynomials (Q2284958) (← links)
- Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots (Q2341619) (← links)
- Approximating multidimensional subset sum and Minkowski decomposition of polygons (Q2364904) (← links)
- An algorithm to parametrize approximately space curves (Q2437227) (← links)
- Improved dense multivariate polynomial factorization algorithms (Q2457431) (← links)
- Bounded-degree factors of lacunary multivariate polynomials (Q2635075) (← links)
- A Sequence of Nearest Polynomials with Given Factors (Q2799557) (← links)
- Approximate multivariate polynomial factorization based on zero-sum relations (Q2958946) (← links)
- Extracting numerical factors of multivariate polynomials from taylor expansions (Q2959016) (← links)
- Regularization and Matrix Computation in Numerical Polynomial Algebra (Q3576574) (← links)
- Exact Certification in Global Polynomial Optimization Via Rationalizing Sums-Of-Squares (Q3576578) (← links)
- (Q4336681) (← links)
- A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials (Q4610021) (← links)
- (Q4835297) (← links)
- Some Control Observation Problems and Their Differential Algebraic Partial Solutions (Q5118405) (← links)
- Irreducibility of Binomials (Q6047986) (← links)