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

DOI10.1137/23M1550414MaRDI QIDQ6154944zbMATH OpenWikidataFDO

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)

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)

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

Cites work

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

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)