Generalized matrix inversion is not harder than matrix multiplication

DOI10.1016/j.cam.2008.11.012zbMath1170.65020OpenAlexW2122385067MaRDI QIDQ1026453

Marko D. Petković, Predrag S. Stanimirović

Publication date: 25 June 2009

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2008.11.012

zbMATH Keywords

numerical examplesCholesky factorizationgeneralized inverseMoore-Penrose inverserecursive algorithmcomplexity analysisrapid matrix inversionrapid matrix multiplicationStrassen method

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (12)

Generalized Schultz iterative methods for the computation of outer inverses ⋮ Bounds on skyline probability for databases with uncertain preferences ⋮ Computer-Aided Verification for Iterative Matrix Inversion Problems in Systems and Control ⋮ A 5-instant finite difference formula to find discrete time-varying generalized matrix inverses, matrix inverses, and scalar reciprocals ⋮ In search of hyperpaths ⋮ Numerical aspects of computing the Moore-Penrose inverse of full column rank matrices ⋮ Representations and properties of theW-Weighted Drazin inverse ⋮ Representations and properties of the W-weighted core-EP inverse ⋮ Unnamed Item ⋮ Computing the Moore-Penrose inverse using its error bounds ⋮ Formal analysis of the Schulz matrix inversion algorithm: a paradigm towards computer aided verification of general matrix flow solvers ⋮ Two-field formulations for isogeometric Reissner-Mindlin plates and shells with global and local condensation

Uses Software

• Mathematica

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matrix multiplication via arithmetic progressions
• Generalized inverses. Theory and applications.
• Gaussian elimination is not optimal
• Computing generalized inverses using LU factorization of matrix product
• Exploiting fast matrix multiplication within the level 3 BLAS
• Locality of Reference in LU Decomposition with Partial Pivoting
• Generalized Inverse Formulas Using the Schur Complement

This page was built for publication: Generalized matrix inversion is not harder than matrix multiplication