Triangular Factorization and Inversion by Fast Matrix Multiplication
From MaRDI portal
Cites work
Cited in
(60)- A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes
- Upper bounds on the complexity of solving systems of linear equations
- scientific article; zbMATH DE number 7561726 (Why is no real title available?)
- A fast algorithm to construct a representation for transversal matroids
- Fast generalized Bruhat decomposition
- A segregated approach for modeling the electrochemistry in the 3-D microstructure of li-ion batteries and its acceleration using block preconditioners
- Algebraic algorithms for linear matroid parity problems
- Some computational problems in linear algebra as hard as matrix multiplication
- Fast dynamic transitive closure with lookahead
- Reduced-order modeling of neutron transport eigenvalue problems separated in energy by proper generalized decomposition
- Faster geometric algorithms via dynamic determinant computation
- Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
- Covering a graph with minimal local sets
- Fast matrix multiplication and its algebraic neighbourhood
- Quadrant interlocking factorization algorithm of hourglass matrix from nonsingular matrix
- Low-rank traffic matrix completion with marginal information
- scientific article; zbMATH DE number 7378710 (Why is no real title available?)
- Computational methods of linear algebra
- A Gröbner free alternative for polynomial system solving
- An algebraic attack on rank metric code-based cryptosystems
- On efficient calculations for Bayesian variable selection
- Parameterized pre-coloring extension and list coloring problems
- Skew-polynomial-sparse matrix multiplication
- Distances for Markov chains, and their differentiation
- Rank-profile revealing Gaussian elimination and the CUP matrix decomposition
- Powers of low rank sparse matrices
- Efficient Kirszbraun extension with applications to regression
- Representative families for matroid intersections, with applications to location, packing, and covering problems
- Structural control of single-input rank one bilinear systems
- Deterministic computation of the characteristic polynomial in the time of matrix multiplication
- Alternating paths along axis-parallel segments
- Tensor network complexity of multilinear maps
- Computing the sign or the value of the determinant of an integer matrix, a complexity survey.
- Improving the Complexity of Block Low-Rank Factorizations with Fast Matrix Arithmetic
- Optimal fine-grained hardness of approximation of linear equations
- Constructing a distance sensitivity oracle in \(O(n^{2.5794}M)\) time
- Reverse-safe text indexing
- Efficiently hex-meshing things with topology
- Adjoint Code Design Patterns
- Fast hierarchical solvers for sparse matrices using extended sparsification and low-rank approximation
- Combinatorial and recurrent approaches for efficient matrix inversion: sub-cubic algorithms leveraging fast matrix products
- Identifiability of graphs with small color classes by the Weisfeiler-Leman algorithm
- Approximation of insurance liability contracts using radial basis functions
- Efficient decomposition of separable algebras.
- On the complexity of matrix reduction over finite fields
- Higher-degree symmetric rank-metric codes
- Maximum matchings in geometric intersection graphs
- Observability and reconstructibility of bounded cellular automata
- CryptAttackTester: high-assurance attack analysis
- Essentially optimal computation of the inverse of generic polynomial matrices
- Designing efficient dyadic operations for cryptographic applications
- On matrix multiplication and polynomial identity testing
- Fairness in temporal slot assignment
- Generalized persistence algorithm for decomposing multiparameter persistence modules
- A fast randomized geometric algorithm for computing Riemann-Roch spaces
- On the implementation of Strassen's fast multiplication algorithm
- Maximum matchings in planar graphs via Gaussian elimination
- Algorithms for weighted matching generalizations. I: Bipartite graphs, b-matching, and unweighted f-factors
- An adaptive conservative moving mesh method
- Fast algorithms for the characteristic polynomial
This page was built for publication: Triangular Factorization and Inversion by Fast Matrix Multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4402461)
