A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
A fast recursive orthogonalization scheme for the Macaulay matrix
A fast algorithm for the inversion of general Toeplitz matrices
Computing curve intersection by means of simultaneous iterations
On the computation of the null space of Toeplitz-like matrices
Displacement ranks of matrices and linear equations
Résolution des systèmes d'équations algébriques
On the existence and computation of rank-revealing LU factorizations
Symbolic and numeric methods for exploiting structure in constructing resultant matrices
A survey on signature-based algorithms for computing Gröbner bases
Matrices in elimination theory
Strong rank revealing LU factorizations
Multivariate polynomials, duality, and structured matrices
Truncated normal forms for solving polynomial systems: generalized and efficient algorithms
Rounding error analysis of the classical Gram-Schmidt orthogonalization process
On the stability of computing polynomial roots via confederate linearizations
Optimization-Based Algorithms for Tensor Decompositions: Canonical Polyadic Decomposition, Decomposition in Rank-$(L_r,L_r,1)$ Terms, and a New Generalization
On the Complexity of Some Hierarchical Structured Matrix Algorithms
Chebyshev rootfinding via computing eigenvalues of colleague matrices: when is it stable?
Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
A Stable and Efficient Algorithm for the Rank-One Modification of the Symmetric Eigenproblem
On the Use of Certain Matrix Algebras Associated with Discrete Trigonometric Transforms in Matrix Displacement Decomposition
Stable and Efficient Algorithms for Structured Systems of Linear Equations
Algorithm 795
Asymptotic acceleration of solving multivariate polynomial systems of equations
Multidimensional realisation theory and polynomial system solving
Solving Polynomial Systems via Truncated Normal Forms
Matrix eigenproblems are at the heart of polynomial system solving
Numerical Polynomial Algebra
Displacement Structure: Theory and Applications
Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
Systems of Polynomial Equations, Higher-order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part I: The Canonical Polyadic Decomposition
Systems of Polynomial Equations, Higher-Order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part II: The Block Term Decomposition
SuperDC: Superfast Divide-And-Conquer Eigenvalue Decomposition With Improved Stability for Rank-Structured Matrices
Stickelberger and the Eigenvalue Theorem
Toric eigenvalue methods for solving sparse polynomial systems
Fast Algorithms for Displacement and Low-Rank Structured Matrices
The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
A Recursive Eigenspace Computation for the Canonical Polyadic Decomposition
A fast algorithm for particle simulations