A generalization of the fast LUP matrix decomposition algorithm and applications

DOI10.1016/0196-6774(82)90007-4zbMath0492.65024MaRDI QIDQ3954737

Oscar H. Ibarra, Shlomo Moran, Roger Hui

Publication date: 1982

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(82)90007-4

zbMATH Keywords

generalized inverse; matrix decomposition algorithm; matrix multiplication algorithm; Strassen algorithm; complexity of matrix multiplication

Mathematics Subject Classification ID

15A23: Factorization of matrices

65F20: Numerical solutions to overdetermined systems, pseudoinverses

65F05: Direct numerical methods for linear systems and matrix inversion

Related Items

Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x\)], Efficient algorithms for order basis computation, Faster least squares approximation, Generalized fraction-free \(LU\) factorization for singular systems with kernel extraction, Solving structured linear systems with large displacement rank, The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms, Efficient decomposition of separable algebras., The shifted number system for fast linear algebra on integer matrices, Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules., Some independence results in complexity theory^†