The following pages link to (Q3806684):
Displaying 50 items.
- Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs (Q355525) (← links)
- Pseudospectra of exponential matrix polynomials (Q384997) (← links)
- On the null spaces of the Macaulay matrix (Q405945) (← links)
- Simultaneous triangularization of commuting matrices for the solution of polynomial equations (Q432249) (← links)
- Overdetermined Weierstrass iteration and the nearest consistent system (Q476879) (← links)
- Solving a sparse system using linear algebra (Q491257) (← links)
- Artificial discontinuities of single-parametric Gröbner bases (Q629351) (← links)
- Pivoting in extended rings for computing approximate Gröbner bases (Q691644) (← links)
- On the computation of an arrangement of quadrics in 3D (Q705551) (← links)
- Using symmetries in the eigenvalue method for polynomial systems (Q731929) (← links)
- Bar code: a visual representation for finite sets of terms and its applications (Q782707) (← links)
- Computing border bases (Q819794) (← links)
- On the pointwise limits of bivariate Lagrange projectors (Q927775) (← links)
- Verifying exactness of relaxations for robust semi-definite programs by solving polynomial systems (Q947643) (← links)
- Solving polynomial systems via symbolic-numeric reduction to geometric involutive form (Q1006657) (← links)
- Approximate GCD and its application to ill-conditioned algebraic equations (Q1184132) (← links)
- A new notion of reduction: Generating universal Gröbner bases of ideals in \(K[x,y]\) (Q1186721) (← links)
- Solutions of systems of algebraic equations and linear maps on residue class rings (Q1201351) (← links)
- On decomposing systems of polynomial equations with finitely many solutions (Q1311615) (← links)
- An elimination method for polynomial systems (Q1332646) (← links)
- An introduction to commutative and noncommutative Gröbner bases (Q1341746) (← links)
- Radical computations of zero-dimensional ideals and real root counting. (Q1565838) (← links)
- Complexity of Gröbner basis detection and border basis detection (Q1758159) (← links)
- Characterizations of border bases (Q1770535) (← links)
- Algorithms to compute the topology of orientable real algebraic surfaces (Q1878477) (← links)
- Multiplication matrices and ideals of projective dimension zero (Q1948611) (← links)
- The multiplicity of zeros of algebraic system in eigenvalue method (Q1966112) (← links)
- Deformation techniques for efficient polynomial equation solving. (Q1977143) (← links)
- Multivariate polynomials, duality, and structured matrices (Q1977144) (← links)
- Bar code for monomial ideals (Q1994120) (← links)
- Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one (Q2066949) (← links)
- Degröbnerization: a political manifesto (Q2100110) (← links)
- An improvement of the rational representation for high-dimensional systems (Q2121180) (← links)
- Computing coupled border bases (Q2183743) (← links)
- Computing syzygies in finite dimension using fast linear algebra (Q2192678) (← links)
- Stable normal forms for polynomial system solving (Q2378497) (← links)
- A numerical elimination method for polynomial computations (Q2378510) (← links)
- Prony's method in several variables: symbolic solutions by universal interpolation (Q2399865) (← links)
- Inverse multivariate polynomial root-finding: numerical implementations of the affine and projective Buchberger-Möller algorithm (Q2400307) (← links)
- Bezoutian and quotient ring structure (Q2456551) (← links)
- Some constructions for real algebraic curves (Q2456595) (← links)
- Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin) (Q2481474) (← links)
- Motivations for an arbitrary precision interval arithmetic and the MPFI library (Q2572919) (← links)
- An algorithm for finding all isolated zeros of polynomial systems (Q2705083) (← links)
- Macaulay style formulas for sparse resultants (Q2782655) (← links)
- Computing border bases using mutant strategies (Q2940363) (← links)
- (Q3337246) (← links)
- From Oil Fields to Hilbert Schemes (Q3576570) (← links)
- Regularization and Matrix Computation in Numerical Polynomial Algebra (Q3576574) (← links)
- An FGLM-like algorithm for computing the radical of a zero-dimensional ideal (Q4599692) (← links)
