An improved Greub–Rheinboldt inequality
AbstractIn this paper, by using linear programming under weak conditions, we improve the Greub–Rheinboldt inequality and obtain the best known bound. An application is also given
Publisher: Elsevier Inc.
DOI identifier: 10.1016/j.laa.2011.06.029
Sorry, we are unable to provide the full text but you may find it at the