Pages that link to "Item:Q1600039"

The following pages link to Symbolic and numeric methods for exploiting structure in constructing resultant matrices (Q1600039):

Displaying 18 items.

• Implicitization of curves and (hyper)surfaces using predicted support (Q385002) (← links)
• Solving linear systems of equations with randomization, augmentation and aggregation (Q454828) (← links)
• Overdetermined Weierstrass iteration and the nearest consistent system (Q476879) (← links)
• New progress in real and complex polynomial root-finding (Q552308) (← links)
• Parametrization of approximate algebraic curves by lines (Q598227) (← links)
• Randomized preprocessing of homogeneous linear systems of equations (Q968998) (← links)
• Improved algorithms for computing determinants and resultants (Q1763424) (← links)
• Multihomogeneous resultant formulae by means of complexes (Q1878475) (← links)
• Multilinear polynomial systems: root isolation and bit complexity (Q1994888) (← links)
• Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one (Q2066949) (← links)
• Matrix formulæ for resultants and discriminants of bivariate tensor-product polynomials (Q2284950) (← links)
• Schur aggregation for linear systems and determinants (Q2378504) (← links)
• Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin) (Q2481474) (← links)
• Distance bounds of \(\varepsilon\)-points on hypersurfaces (Q2503306) (← links)
• Rational univariate reduction via toric resultants (Q2517810) (← links)
• Parametrization of approximate algebraic surfaces by lines (Q2573848) (← links)
• Numerical Instability of Resultant Methods for Multidimensional Rootfinding (Q2796860) (← links)
• A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems (Q6154944) (← links)