Pages that link to "Item:Q3954737"
From MaRDI portal
The following pages link to A generalization of the fast LUP matrix decomposition algorithm and applications (Q3954737):
Displayed 28 items.
- Optimal algorithms of Gram-Schmidt type (Q393367) (← links)
- Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x]\) (Q412209) (← links)
- Efficient algorithms for order basis computation (Q420746) (← links)
- Efficiently hex-meshing things with topology (Q471135) (← links)
- Faster least squares approximation (Q623334) (← links)
- Generalized fraction-free \(LU\) factorization for singular systems with kernel extraction (Q648916) (← links)
- Clustered planarity testing revisited (Q895058) (← links)
- Solving structured linear systems with large displacement rank (Q954988) (← links)
- The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms (Q1121670) (← links)
- Efficient decomposition of separable algebras. (Q1432890) (← links)
- Generalized persistence algorithm for decomposing multiparameter persistence modules (Q2082448) (← links)
- On interval decomposability of \(2\)D persistence modules (Q2144457) (← links)
- Simple realizability of complete abstract topological graphs simplified (Q2189738) (← links)
- Deterministic computation of the characteristic polynomial in the time of matrix multiplication (Q2238844) (← links)
- The shifted number system for fast linear algebra on integer matrices (Q2387425) (← links)
- Rank-profile revealing Gaussian elimination and the CUP matrix decomposition (Q2437224) (← links)
- Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules. (Q2577534) (← links)
- Fast computation of the rank profile matrix and the generalized Bruhat decomposition (Q2628319) (← links)
- Computing solutions of linear Mahler equations (Q3177728) (← links)
- Some independence results in complexity theory<sup>†</sup> (Q3751002) (← links)
- Identifiability of Graphs with Small Color Classes by the Weisfeiler--Leman Algorithm (Q5009334) (← links)
- (Q5009600) (← links)
- Fast Hierarchical Solvers For Sparse Matrices Using Extended Sparsification and Low-Rank Approximation (Q5738178) (← links)
- Tree Deletion Set Has a Polynomial Kernel but No $\text{OPT}^\mathcal{O}(1)$ Approximation) (Q5741082) (← links)
- Maximum matchings in geometric intersection graphs (Q6050213) (← links)
- A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes (Q6126717) (← links)
- Controlling the spread of infectious diseases by using random walk method to remove many important links (Q6144148) (← links)
- High-order lifting for polynomial Sylvester matrices (Q6149161) (← links)