“…P. A. Wedin [24] presented some perturbation bounds for the Moore-Penrose inverse of matrices under general unitarily invariant norm, the spectral norm and the Frobenius norm. L. Meng and B. Zheng [16] obtained the optimal perturbation bounds for the Moore-Penrose inverse of matrices under the Frobenius norm using singular value decomposition and these results extended the results from [24]. C. Deng and Y. Wei [6] considered the perturbation bound for the Moore-Penrose inverse of operators on Hilbert spaces while the perturbation bounds of linear operators on Banach spaces have been considered in [18,26].…”
We consider the perturbation bounds for the Moore-Penrose inverse of a given operator on Hilbert space and apply these results to the relative errors of the minimum norm least squares solution of the equation Ax = b.
“…P. A. Wedin [24] presented some perturbation bounds for the Moore-Penrose inverse of matrices under general unitarily invariant norm, the spectral norm and the Frobenius norm. L. Meng and B. Zheng [16] obtained the optimal perturbation bounds for the Moore-Penrose inverse of matrices under the Frobenius norm using singular value decomposition and these results extended the results from [24]. C. Deng and Y. Wei [6] considered the perturbation bound for the Moore-Penrose inverse of operators on Hilbert spaces while the perturbation bounds of linear operators on Banach spaces have been considered in [18,26].…”
We consider the perturbation bounds for the Moore-Penrose inverse of a given operator on Hilbert space and apply these results to the relative errors of the minimum norm least squares solution of the equation Ax = b.
“…We note that a multiplicative perturbation can also be viewed as an additive one. The example in Remark 4.1 of [3] and Example 3 in [5] have shown that the multiplicative bounds (4.11), (4.13) are better than the additive bounds (3.29) and (3.26), respectively.…”
Section: Elamentioning
confidence: 98%
“…Examples 1 and 2 in [5] show the optimality of the additive perturbation bounds in (3.15) and (3.26), respectively. The example in Remark 3.3 of [3] shows the approximate optimality of the perturbation bound in (3.14).…”
Section: Numerical Examplesmentioning
confidence: 99%
“…In Sections 3 and 4, we consider the additive and multiplicative perturbation of the weighted Moore-Penrose inverse. Some new bounds for additive and multiplicative perturbation under the norms · (M N ) , · Q(M N ) and · F (M N ) are presented, which extends the corresponding ones in [5] and [13]. In Section 5, we give some numerical examples to illustrate the optimality of our given bounds under the weighted Q-norm and F -norm, respectively.…”
Abstract. In this paper, we obtain optimal perturbation bounds of the weighted Moore-Penrose inverse under the weighted unitary invariant norm, the weighted Q-norm and the weighted F -norm, and thereby extend some recent results.
“…But in general this technique may produce unideal perturbation bounds because it overlooks the nature of the multiplicative perturbation. Various multiplicative perturbation analysis have been done to many problems, such as the polar decomposition [4], the singular value decomposition [5], and the Moore-Penrose inverse [7] when A is multiplicatively perturbed. In this paper, we will study the multiplicative perturbation bounds to the group inverse and the related oblique projection under unitarily invariant norm.…”
In this paper, the multiplicative perturbation bounds of the group inverse and related oblique projection under general unitarily invariant norm are presented by using the decompositions of B # − A # and BB # − AA # .
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.