Hello(adsbygoogle = window.adsbygoogle || []).push({});

I'm trying to show that the following upper bound on the matrix 2-norm is true:

[itex]\left\|(AB)^+\right\|_2\leq\left\|A^+\right\|_2 \left\|B^+\right\|_2[/itex]

where + is the matrix pseudoinverse and [itex]A\in\Re^{n\times m}[/itex] and [itex]B\in\Re^{m\times p}[/itex] are full-rank matrices with [itex]n\geq m\geq p[/itex].

Any hint how I can show it?

Thanks in advance!

Bag

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# 2-norm Pseudoinverse Upper Bound

**Physics Forums | Science Articles, Homework Help, Discussion**