On the computation of weighted Moore-Penrose inverse using a high-order matrix method
DOI10.1016/J.CAMWA.2013.09.007zbMATH Open1350.65033OpenAlexW2128654942MaRDI QIDQ316397FDOQ316397
Authors: Ali R. Soheili, Fazlollah Soleymani, Marko D. Petković
Publication date: 27 September 2016
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2013.09.007
Recommendations
numerical exampleinitial valuematrix methodweighted Moore-Penrose inverseweighted singular value decomposition
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Theory of matrix inversion and generalized inverses (15A09)
Cites Work
- Generalized inverses. Theory and applications.
- A Note on an Iterative Method for Generalized Inversion of Matrices
- Optimal portfolio selection with singular covariance matrix
- Analogs of the adjoint matrix for generalized inverses and corresponding Cramer rules
- Generalizing the Singular Value Decomposition
- Recurrent neural networks for computing weighted Moore-Penrose inverse
- Iterative method for computing the Moore-Penrose inverse based on Penrose equations
- Determinantal representation of weighted generalized inverses
- Recurrent neural networks for solving linear matrix equations
- Condition numbers and perturbation of the weighted Moore--Penrose inverse and weighted linear least squares problem.
- The representation and approximation for the weighted Moore-Penrose inverse
- The representation and approximation for the weighted Minkowski inverse in Minkowski space
- An improved Newton iteration for the weighted Moore-Penrose inverse
- Inversion of Displacement Operators
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Iterative Method for Computing the Generalized Inverse of an Arbitrary Matrix
- The least squares problem and pseudo-inverses
- On the Numerical Properties of an Iterative Method for Computing the Moore–Penrose Generalized Inverse
- Successive matrix squaring algorithm for parallel computing the weighted generalized inverse \(A^+_{MN}\)
Cited In (16)
- Generalized Schultz iterative methods for the computation of outer inverses
- Further efficient hyperpower iterative methods for the computation of generalized inverses \(A_{T,S}^{(2)}\)
- An interval extension of SMS method for computing weighted Moore-Penrose inverse
- Rapid generalized Schultz iterative methods for the computation of outer inverses
- Two inverse-of-\(N\)-free methods for \(A_{M,N}^\dagger\)
- Title not available (Why is that?)
- On the extension of Householder's method for weighted Moore-Penrose inverse
- Computation of generalized inverses using PHP/MySQL environment
- Error bounds in the computation of outer inverses with generalized schultz iterative methods and its use in computing of Moore-Penrose inverse
- An efficient hyperpower iterative method for computing weighted Moore-Penrose inverse
- Computation of weighted Moore-Penrose inverse through Gauss-Jordan elimination on bordered matrices
- Symbolic computation of weighted Moore-Penrose inverse using partitioning method
- Constructing two-step iterative methods with and without memory
- An efficient matrix iteration for computing weighted Moore-Penrose inverse
- Numerical solution of nonlinear systems by a general class of iterative methods with application to nonlinear PDEs
- An improved Newton iteration for the weighted Moore-Penrose inverse
This page was built for publication: On the computation of weighted Moore-Penrose inverse using a high-order matrix method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q316397)