A fast recursive orthogonalization scheme for the Macaulay matrix

DOI10.1016/j.cam.2014.01.035zbMath1293.65064OpenAlexW1964724053MaRDI QIDQ396030

Kim Batselier, Bart De Moor, Philippe Dreesen

Publication date: 8 August 2014

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2014.01.035

zbMATH Keywords

orthogonal basesmultivariate polynomialsMacaulay matrixrecursive orthogonalization

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Eigenvalues, singular values, and eigenvectors (15A18) Orthogonalization in numerical linear algebra (65F25)

Related Items

Recursive Algorithms to Update a Numerical Basis Matrix of the Null Space of the Block Row, (Banded) Block Toeplitz, and Block Macaulay Matrix ⋮ On the null spaces of the Macaulay matrix ⋮ A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems ⋮ Truncated normal forms for solving polynomial systems: generalized and efficient algorithms ⋮ Numerical computation of H-bases ⋮ A linear algebra method to decompose forms whose length is lower than the number of variables into weighted sum of squares

Uses Software

• Maple
• Matlab
• Octave
• PHCpack
• SparseMatrix
• Bertini
• SuiteSparseQR
• SuitSparseQR
• CSparse

Cites Work

• A geometrical approach to finding multivariate approximate LCMs and GCDs
• A numerical elimination method for polynomial computations
• Approximate factorization of multivariate polynomials using singular value decomposition
• Handbook series linear algebra. Linear least squares solutions by Householder transformations
• Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components
• Principal Angles between Subspaces in an A-Based Scalar Product: Algorithms and Perturbation Estimates
• The university of Florida sparse matrix collection
• Algorithm 915, SuiteSparseQR
• Direct Methods for Sparse Linear Systems
• Algorithm 795
• Using Algebraic Geometry
• Numerical Methods for Computing Angles Between Linear Subspaces
• Accurate solution of polynomial equations using Macaulay resultant matrices
• Numerical Polynomial Algebra
• The Canonical Decomposition of $\mathcal{C}^n_d$ and Numerical Gröbner and Border Bases
• The Geometry of Multivariate Polynomial Division and Elimination
• A Rank-Revealing Method with Updating, Downdating, and Applications
• Algebraic Statistics for Computational Biology
• Gröbner bases and systems theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item