A generalization of the fast LUP matrix decomposition algorithm and applications
From MaRDI portal
Cited in
(36)- The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented algorithms
- Efficient decomposition of separable algebras.
- Generalized persistence algorithm for decomposing multiparameter persistence modules
- On interval decomposability of 2D persistence modules
- Simple realizability of complete abstract topological graphs simplified
- Deterministic computation of the characteristic polynomial in the time of matrix multiplication
- The shifted number system for fast linear algebra on integer matrices
- Rank-profile revealing Gaussian elimination and the CUP matrix decomposition
- Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules.
- Fast computation of the rank profile matrix and the generalized Bruhat decomposition
- Computing solutions of linear Mahler equations
- Some independence results in complexity theory†
- Optimal algorithms of Gram-Schmidt type
- Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x]\)
- Efficient algorithms for order basis computation
- Efficiently hex-meshing things with topology
- Identifiability of graphs with small color classes by the Weisfeiler-Leman algorithm
- Dynamic effective resistances and approximate Schur complement on separable graphs
- Fast hierarchical solvers for sparse matrices using extended sparsification and low-rank approximation
- Tree deletion set has a polynomial kernel but no \(\mathrm{OPT}^\mathcal{O}(1)\) approximation)
- Maximum matchings in geometric intersection graphs
- A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes
- Controlling the spread of infectious diseases by using random walk method to remove many important links
- High-order lifting for polynomial Sylvester matrices
- Faster least squares approximation
- Generalized fraction-free \(LU\) factorization for singular systems with kernel extraction
- Solving systems of linear equations through zero forcing set
- On approximation of 2D persistence modules by interval-decomposables
- Covering a graph with minimal local sets
- First-order factors of linear Mahler operators
- Powers of low rank sparse matrices
- An enumerative perspective on connectivity
- Optimal fine-grained hardness of approximation of linear equations
- A parallel algorithm for Gaussian elimination over finite fields
- Clustered planarity testing revisited
- Solving structured linear systems with large displacement rank
This page was built for publication: A generalization of the fast LUP matrix decomposition algorithm and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3954737)
