Indexed metadata

Relationship Between the Stiffly Weighted Pseudoinverse and Multi-Level Constrained Rseudoinverse

Musheng Wei

Source record

Source: Crossref

Published: Jun 2, 2004

DOI: 10.4208/jcm.v22.n3.p427

Open original source ↗

Source abstract

It is known that for a given matrix AA of rank rr, and a set DD of positive diagonal matrices, sup⁡W∈D∣∣(W12A)†W12∣∣2=(min⁡iσ+(A(i))−1\sup_{W\in D}||(W^{\frac{1}{2}}A)^†W^{\frac{1}{2}}||_2=(\min_i \sigma_+(A^{(i)})^{-1}, in which (A(i))(A^{(i)})is a submatrix of A formed with r=(rank(A))r = (\rm{rank}(A)) rows of AA, such that (A(i))(A^{(i)}) has full row rank rr. In many practical applications this value is too large to be used. In this paper we consider the case that both AA and W(∈D)W(\in D) are fixed with WW severely stiff. We show that in this case the weighted pseudoinverse W12A)†W12W^{\frac{1}{2}}A)^†W^{\frac{1}{2}} is close to a multi-level constrained weighted pseudoinverse therefore ∣∣(W12A)†W12∣∣2||(W^{\frac{1}{2}}A)^†W^{\frac{1}{2}}||_2 is uniformly bounded. We also prove that in this case the solution set the stiffly weighted least squares problem is close to that of corresponding multi-level constrained least squares problem.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.