Using Gauss-Jordan elimination to compute the index, generalized nullspaces, and Drazin inverse
From MaRDI portal
Publication:1819538
DOI10.1016/0024-3795(87)90219-9zbMath0613.65028OpenAlexW1997018807MaRDI QIDQ1819538
Uriel G. Rothblum, Kurt M. Anstreicher
Publication date: 1987
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(87)90219-9
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (25)
Co-solutions of algebraic matrix equations and higher order singular regular boundary value problems ⋮ Innovation based on Gaussian elimination to compute generalized inverse \(A_{T,S}^{(2)}\) ⋮ Properties of the CMP inverse and its computation ⋮ Representations and cramer rules for the solution of a restricted Matrix Equation∗ ⋮ Methods of Gauss–Jordan elimination to compute core inverse and dual core inverse ⋮ The Core-EP, Weighted Core-EP Inverse of Matrices and Constrained Systems of Linear Equations ⋮ Computation of weighted Moore-Penrose inverse through Gauss-Jordan elimination on bordered matrices ⋮ Computing the Jordan Structure of an Eigenvalue ⋮ Constraint augmentation in pseudo-singularly perturbed linear programs ⋮ Performance and stability of direct methods for computing generalized inverses of the graph Laplacian ⋮ An algebraic-analytic approach to nonnegative bases ⋮ An implicit difference method for the numerical solution of coupled systems of partial differential equations ⋮ A closed-form solution of singular regular higher-order difference initial and boundary value problems ⋮ Higher order implicit multistep methods for matrix differential equations ⋮ The representation and computation of generalized inverse \(A^{(2)}_{T,S}\) ⋮ On optimal condition numbers for Markov chains ⋮ Analytic and numerical solution of coupled implicit semi-infinite diffusion problems ⋮ Invariant subspaces, derivative arrays, and the computation of the Drazin inverse ⋮ On rank and null space computation of the generalized Sylvester matrix ⋮ On the computation of the rank of block bidiagonal Toeplitz matrices ⋮ Two closed novel formulas for the generalized inverse \(A_{T,S}^{(2)}\) of a complex matrix with given rank ⋮ Explicit solution of higher order boundary value regular differential systems avoiding the increase of the problem dimension ⋮ The shuffle algorithm and Jordan blocks ⋮ Numerical multisteps matrix methods for \(Y=f(t,Y)\) ⋮ A matrix d'Alembert formula for coupled wave initial value problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The computation of Kronecker's canonical form of a singular pencil
- Bounds on distances between eigenvalues
- Time-invariant descriptor systems
- The Souriau-Frame algorithm and the Drazin pseudoinverse
- More on the Souriau–Frame Algorithm and the Drazin Inverse
- Applications of the Drazin Inverse to Linear Systems of Differential Equations with Singular Constant Coefficients
- Linear Programming in O([n3/ln nL) Operations]
This page was built for publication: Using Gauss-Jordan elimination to compute the index, generalized nullspaces, and Drazin inverse
