Multiplicative perturbation theory of the Moore-Penrose inverse and the least squares problem
DOI10.1016/J.LAA.2016.03.027zbMATH Open1338.15011OpenAlexW2334186410MaRDI QIDQ277121FDOQ277121
Authors: Nieves Castro-González, Froilán M. Dopico, Juan M. Molera 
Publication date: 4 May 2016
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2016.03.027
Recommendations
- A note on multiplicative perturbation bounds for the Moore-Penrose inverse
- Additive and multiplicative perturbation bounds for the Moore-Penrose inverse
- New multiplicative perturbation bounds of the Moore-Penrose inverse
- Norm estimations for the Moore-Penrose inverse of multiplicative perturbations of matrices
- Expression for the multiplicative perturbation of the Moore-Penrose inverse
- Representations and norm estimations for the Moore-Penrose inverse of multiplicative perturbations of matrices
- The optimal perturbation bounds of the Moore-Penrose inverse under the Frobenius norm
- The optimal perturbation bounds for the weighted Moore-Penrose inverse
- On the perturbation of the Moore-Penrose inverse of a matrix
- New additive perturbation bounds of the Moore-Penrose inverse
Theory of matrix inversion and generalized inverses (15A09) Numerical computation of matrix norms, conditioning, scaling (65F35) Conditioning of matrices (15A12)
Cites Work
- Computing the singular value decomposition with high relative accuracy
- Matrix Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Accuracy and Stability of Numerical Algorithms
- Title not available (Why is that?)
- Implicit standard Jacobi gives high relative accuracy
- Accurate solution of structured least squares problems via rank-revealing decompositions
- Accurate solution of structured linear systems via rank-revealing decompositions
- Title not available (Why is that?)
- New Fast and Accurate Jacobi SVD Algorithm. I
- New Fast and Accurate Jacobi SVD Algorithm. II
- Effectively Well-Conditioned Linear Systems
- Jacobi’s Method is More Accurate than QR
- Relative Perturbation Theory: I. Eigenvalue and Singular Value Variations
- Title not available (Why is that?)
- Relative Perturbation Theory: II. Eigenspace and Singular Subspace Variations
- Accurate Singular Value Decompositions of Structured Matrices
- Perturbation theory for pseudo-inverses
- Additive and multiplicative perturbation bounds for the Moore-Penrose inverse
- Inversion of extremely ill-conditioned matrices in floating-point
Cited In (14)
- Additive perturbations and multiplicative perturbations for the core inverse of bounded linear operator in Hilbert space
- Title not available (Why is that?)
- Gauss Newton method for solving variational problems of PDEs with neural network discretizaitons
- New additive perturbation bounds of the Moore-Penrose inverse
- The Whittaker smoother and the Moore-Penrose inverse in signal reconstruction
- A note on stable perturbations of Moore-Penrose inverses
- Generalization of the Sherman-Morrison-Woodbury formula involving the Schur complement
- Operator least squares problems and Moore-Penrose inverses in Krein spaces
- Mixed forward-backward stability of the two-level orthogonal Arnoldi method for quadratic problems
- Multiplicative perturbation bounds for multivariate multiple linear regression in Schatten \(p\)-norms
- Norm estimations for the Moore-Penrose inverse of the weak perturbation of matrices
- Representations and norm estimations for the Moore-Penrose inverse of multiplicative perturbations of matrices
- Accurate computation of the Moore-Penrose inverse of strictly totally positive matrices
- On the Moore–Penrose inverse in solving saddle‐point systems with singular diagonal blocks
Uses Software
This page was built for publication: Multiplicative perturbation theory of the Moore-Penrose inverse and the least squares problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q277121)
