Elimination-based certificates for triangular equivalence and rank profiles
From MaRDI portal
Publication:2284959
DOI10.1016/j.jsc.2019.07.013zbMath1445.65016arXiv1909.05692OpenAlexW2960380073WikidataQ127469575 ScholiaQ127469575MaRDI QIDQ2284959
Clément Pernet, David Lucas, Jean-Guillaume Dumas, Erich L. Kaltofen
Publication date: 15 January 2020
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.05692
Monte Carlo methods (65C05) Vector spaces, linear dependence, rank, lineability (15A03) Numerical linear algebra (65F99)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A probabilistic remark on algebraic program testing
- Symbolic and algebraic computation. EUROSAM '79, an international symposium on symbolic and algebraic manipulation, Marseille, France, June 1979
- Rank-profile revealing Gaussian elimination and the CUP matrix decomposition
- Fast computation of the rank profile matrix and the generalized Bruhat decomposition
- A Relaxed Algorithm for Online Matrix Inversion
- Simultaneous computation of the row and column rank profiles
- Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix
- Delegating Computation
- Essentially optimal interactive certificates in linear algebra
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits
- Certificates for Triangular Equivalence and Rank Profiles
- Quadratic-time certificates in linear algebra
- Constant-round interactive proofs for delegating computation
- Fast matrix rank algorithms and applications
This page was built for publication: Elimination-based certificates for triangular equivalence and rank profiles
