On the null spaces of the Macaulay matrix

DOI10.1016/J.LAA.2014.07.035zbMATH Open1297.15041OpenAlexW2018005057MaRDI QIDQ405945FDOQ405945

Authors: Kim Batselier, Philippe Dreesen, B. De Moor 

Publication date: 8 September 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2014.07.035

Recommendations

• A fast recursive orthogonalization scheme for the Macaulay matrix
• On rank and null space computation of the generalized Sylvester matrix
• Multivariate polynomials, duality, and structured matrices
• The big mother of all dualities. 2: Macaulay bases
• Computing minimal nullspace bases

zbMATH Keywords

algorithmrootssyzygiesmultivariate polynomialsMacaulay matrixnull spacerow spaceStetter's eigenvalue problem

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Syzygies, resolutions, complexes and commutative rings (13D02) Syzygies, resolutions, complexes in associative algebras (16E05) Polynomials in general fields (irreducibility, etc.) (12E05) Special matrices (15B99)

Cites Work

• Algorithm 795
• Algorithm 931
• Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
• Using Algebraic Geometry
• Computing the multiplicity structure in solving polynomial systems
• Numerical Polynomial Algebra
• The geometry of multivariate polynomial division and elimination
• Numerical decomposition of the solution sets of polynomial systems into irreducible components
• A geometrical approach to finding multivariate approximate LCMs and GCDs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Witness sets of projections
• The closedness subspace method for computing the multiplicity structure of a polynomial system
• Title not available (Why is that?)
• A fast recursive orthogonalization scheme for the Macaulay matrix
• The canonical decomposition of \(\mathcal{C}^n_d\) and numerical Gröbner and border bases
• Title not available (Why is that?)
• Title not available (Why is that?)
• Matrix eigenproblems are at the heart of polynomial system solving

Cited In (14)

• A fast recursive orthogonalization scheme for the Macaulay matrix
• Rayleigh quotient methods for estimating common roots of noisy univariate polynomials
• A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems
• A proof of the two parameter \(q\)-cases of the Macdonald-Morris constant term root system conjecture for \(S(F_ 4)\) and \(S(F_ 4)^ \vee\) via Zeilberger's method
• Multidimensional realisation theory and polynomial system solving
• Systems of Polynomial Equations, Higher-Order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part II: The Block Term Decomposition
• An eigen-representation of the Navier-Stokes equations
• Systems of polynomial equations, higher-order tensor decompositions, and multidimensional harmonic retrieval: a unifying framework. Part I: the canonical polyadic decomposition
• Numerical computation of H-bases
• Computing the state difference equations for discrete overdetermined linear \(m \operatorname{D}\) systems
• Computing H-bases via minimal bases for syzygy modules
• On matrices which have signed null-spaces
• Two complementary block Macaulay matrix algorithms to solve multiparameter eigenvalue problems
• On Matrices with Signed Null-Spaces

Uses Software

• Matlab
• Octave
• PHCpack
• Algorithm 931

This page was built for publication: On the null spaces of the Macaulay matrix

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