Computing minimal nullspace bases

DOI10.1145/2442829.2442881MaRDI QIDQ5244558zbMATH OpenOpenAlexFDO

Authors Wei Zhou, Arne Storjohann, G. Labahn

Publication date 27 March 2015

Published in Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2442829.2442881

zbMATH Keywords

complexitynullspace basis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• Computing a Sparse Basis for the Null Space
• Computing minimal interpolation bases
• On computing minimal proper nullspace bases with applications in fault detection
• An algorithm to compute a sparse basis of the null space
• On minimal asymptotic bases
• On minimal asymptotic bases
• Numerical computation of minimal polynomial bases: a generalized resultant approach
• Nested Dissection for Sparse Nullspace Bases
• Ein Beitrag zur Theorie der Minimalbasen.
• Computation of Minimal Projections and Extensions

Cited in

(23)

• An improved Toeplitz algorithm for polynomial matrix null-space computation
• Algorithm for computing \(\mu\)-bases of univariate polynomials
• Deterministic computation of the characteristic polynomial in the time of matrix multiplication
• A deterministic algorithm for inverting a polynomial matrix
• Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
• Numerical computation of minimal polynomial bases: a generalized resultant approach
• Computing minimal interpolation bases
• Efficient computation of order bases
• On computing minimal proper nullspace bases with applications in fault detection
• Computing column bases of polynomial matrices
• Nested Dissection for Sparse Nullspace Bases
• On the null spaces of the Macaulay matrix
• Computing the rank and a small nullspace basis of a polynomial matrix
• On rank and null space computation of the generalized Sylvester matrix
• Recursive Algorithms to Update a Numerical Basis Matrix of the Null Space of the Block Row, (Banded) Block Toeplitz, and Block Macaulay Matrix
• A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems
• Faster modular composition
• Computing Krylov iterates in the time of matrix multiplication
• Constructing a distance sensitivity oracle in \(O(n^{2.5794}M)\) time
• Equi-affine minimal-degree moving frames for polynomial curves
• Magic pot: cryptanalysis of full AIM2 in the standard and related-/reused-key settings using new elimination framework
• Efficient rational creative telescoping
• Lagrangian constraints and differential Thomas decomposition

This page was built for publication: Computing minimal nullspace bases

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