Concise row-pruning algorithm to invert a matrix

DOI10.1016/0096-3003(94)90143-0zbMATH Open0801.65020OpenAlexW2171089822MaRDI QIDQ1320118FDOQ1320118

Authors: V. Lakshmikantham, Syamal K. Sen, Seenith Sivasundaram 

Publication date: 6 June 1994

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

Full work available at URL: https://doi.org/10.1016/0096-3003(94)90143-0

Recommendations

• scientific article; zbMATH DE number 1894936
• scientific article; zbMATH DE number 2051076
• Gauss-Jordan elimination methods for the Moore-Penrose inverse of a matrix
• A New Algorithm for Computing the Rank of a Matrix
• Generalised matrix inversion and rank computation by successive matrix powering

zbMATH Keywords

rankerror boundsmatrix inversionprojection operatorparallel implementationminimum norm least squares solutiondirect concise algorithmerror free computation

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Parallel numerical computation (65Y05)

Cites Work

• Title not available (Why is that?)
• Calculating the Singular Values and Pseudo-Inverse of a Matrix
• A Note on an Iterative Method for Generalized Inversion of Matrices
• Title not available (Why is that?)
• Title not available (Why is that?)
• Pseudo-Inverses in Associative Rings and Semigroups
• On the Continuity of the Generalized Inverse
• Title not available (Why is that?)
• Title not available (Why is that?)
• Representations for the Generalized Inverse of a Partitioned Matrix
• An Iterative Method for Computing the Generalized Inverse of an Arbitrary Matrix
• The least squares problem and pseudo-inverses
• Title not available (Why is that?)
• Regression and the Moore-Penrose pseudoinverse
• Title not available (Why is that?)
• The Pseudoinverse of a Rectangular or Singular Matrix and Its Application to the Solution of Systems of Linear Equations
• Title not available (Why is that?)
• Optimal iterative schemes for computing the Moore-Penrose matrix inverse
• The reverse order law \((AB)^-\) = \(B^-A^-\)
• Title not available (Why is that?)
• An Explicit Solution of a Special Class of Linear Programming Problems
• An Alternate Definition of a Pseudoinverse of a Matrix
• Error estimates for the solution of linear algebraic systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On continuity of the Moore-Penrose and Drazin generalized inverses
• Rank-Augmented LU-Algorithm for Computing Generalized Matrix Inverses
• An Elimination Method for Computing the Generalized Inverse of an Arbitrary Complex Matrix
• Generalized Inverse Computations Using the Gradient Projection Method
• Title not available (Why is that?)
• The Computation of the Generalized Inverse of singular or Rectangular Matrices
• Fast Computational Techniques for Pseudoinverse and Wiener Image Restoration
• Title not available (Why is that?)
• An Optimum Iterative Method for the Computation of Matrix Rank

Cited In (5)

• Should pruning be a pre-processor of any linear system?
• A Note on The Row-Reduction Algorithm
• Can fractional calculus be generalized? Problems and efforts
• A brief biography and survey of collected works of V. Lakshmikantham
• Special issue: Lakshmikantham's legacy: a tribute on his 75th birthday

This page was built for publication: Concise row-pruning algorithm to invert a matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1320118)