Linear independence oracles and applications to rectangular and low rank linear systems

DOI10.1145/2608628.2608673zbMath1325.68300OpenAlexW2053637543MaRDI QIDQ3452420

Shiyun Yang, Arne Storjohann

Publication date: 11 November 2015

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

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

zbMATH Keywords

linear systemsparse matrixrankrank profile

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Randomized algorithms (68W20) Linear equations (linear algebraic aspects) (15A06)

Related Items (2)

Fast computation of the rank profile matrix and the generalized Bruhat decomposition ⋮ Automating algorithm selection: checking for matrix properties that can simplify computations

Uses Software

• FGb
• Jordan

Cites Work

• An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination
• Cylindrical algebraic decomposition using validated numerics
• The Jordan Curve Theorem, Formally and Informally
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Definability and decision problems in arithmetic
• Unnamed Item
• Unnamed Item

This page was built for publication: Linear independence oracles and applications to rectangular and low rank linear systems