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

DOI10.1137/23M1550414WikidataQ129479446 ScholiaQ129479446MaRDI QIDQ6154944FDOQ6154944

Authors: Nithin Govindarajan, S. Chandrasekaran, Lieven De Lathauwer 

Publication date: 16 February 2024

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Recommendations

• On the null spaces of the Macaulay matrix
• Computing minimal nullspace bases
• A fast recursive orthogonalization scheme for the Macaulay matrix
• Numerical solution of bivariate and polyanalytic polynomial systems
• Multivariate polynomials, duality, and structured matrices

zbMATH Keywords

Schur algorithmpolynomials systemsMacaulay matriceslow displacement rank matricesrank-revealing Lu-factorizations

Mathematics Subject Classification ID

Factorization of matrices (15A23) Iterative numerical methods for linear systems (65F10)

Cites Work

• Algorithm 795
• Computing curve intersection by means of simultaneous iterations
• A Stable and Efficient Algorithm for the Rank-One Modification of the Symmetric Eigenproblem
• A fast algorithm for particle simulations
• Numerically solving polynomial systems with Bertini
• Title not available (Why is that?)
• Title not available (Why is that?)
• A survey on signature-based algorithms for computing Gröbner bases
• An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
• Displacement Structure: Theory and Applications
• Multivariate polynomials, duality, and structured matrices
• A fast algorithm for approximate polynomial gcd based on structured matrix computations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Numerical Polynomial Algebra
• Rounding error analysis of the classical Gram-Schmidt orthogonalization process
• Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
• Title not available (Why is that?)
• A fast algorithm for the inversion of general Toeplitz matrices
• On the existence and computation of rank-revealing LU factorizations
• Optimization-based algorithms for tensor decompositions: canonical polyadic decomposition, decomposition in rank-\((L_r,L_r,1)\) terms, and a new generalization
• Title not available (Why is that?)
• Symbolic and numeric methods for exploiting structure in constructing resultant matrices
• Title not available (Why is that?)
• Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
• A fast recursive orthogonalization scheme for the Macaulay matrix
• Matrix eigenproblems are at the heart of polynomial system solving
• Systems of polynomial equations, higher-order tensor decompositions, and multidimensional harmonic retrieval: a unifying framework. Part I: the canonical polyadic decomposition
• Résolution des systèmes d'équations algébriques
• Displacement ranks of matrices and linear equations
• On the complexity of some hierarchical structured matrix algorithms
• Stable and Efficient Algorithms for Structured Systems of Linear Equations
• Matrices in elimination theory
• On the Use of Certain Matrix Algebras Associated with Discrete Trigonometric Transforms in Matrix Displacement Decomposition
• Asymptotic acceleration of solving multivariate polynomial systems of equations
• On the stability of computing polynomial roots via confederate linearizations
• Chebyshev rootfinding via computing eigenvalues of colleague matrices: when is it stable?
• Strong rank revealing LU factorizations
• On the computation of the null space of Toeplitz-like matrices
• Solving polynomial systems via truncated normal forms
• Stickelberger and the Eigenvalue Theorem
• Multidimensional realisation theory and polynomial system solving
• Truncated normal forms for solving polynomial systems: generalized and efficient algorithms
• Toric eigenvalue methods for solving sparse polynomial systems
• Fast Algorithms for Displacement and Low-Rank Structured Matrices
• 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
• A recursive eigenspace computation for the canonical polyadic decomposition

Cited In (1)

• Recursive Algorithms to Update a Numerical Basis Matrix of the Null Space of the Block Row, (Banded) Block Toeplitz, and Block Macaulay Matrix

This page was built for publication: A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6154944)