Skip to main content
Log in

On matrix approximation problems with Ky Fank norms

  • Published:
Numerical Algorithms Aims and scope Submit manuscript

Abstract

LetA be a realm xn matrix whose elements depend onl free parameters forming the vectorx. Then a class of approximation problems can be defined by the requirement thatx be chosen to minimize ∥A(x)∥, for a given matrix normon m ×n matrices. For example, it may be required to approximate a given matrix by a particular type of matrix, or by a linear combination of matrices. In the derivation of effective algorithms for such problems, a prerequisite is the provision of appropriate conditions satisfied by a solution, and the subdifferential of the matrix norm plays a crucial role in this. Therefore a characterization of the subdifferential is important, and this is considered for a class of orthogonally invariant norms known as Ky Fank norms, which include as special cases the spectral norm and the trace norm. The results lead to a consideration of efficient algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Ky Fan, On a theorem of Weyl concerning the eigenvalues of linear transformations, Proc. Nat. Acad. Sci. USA 35 (1949) 652–655.

    Google Scholar 

  2. R.A. Horn and C.R. Johnson,Matrix Analysis (Cambridge University Press, 1990).

  3. L. Mirsky, Symmetric gauge functions and unitarily invariant norms, Quart. J. Math. Oxford (Ser. 2) 11 (1960) 50–59.

    Google Scholar 

  4. J. von Neumann, Some matrix inequalities and metrization of metric spaces, Tomsk. Univ. Rev. 1 (1937) 286–300.

    Google Scholar 

  5. M.L. Overton, On minimizing the maximum eigenvalue of a symmetric matrix, SIAM J. Matrix. Anal. Appl. 9 (1988) 256–268.

    Google Scholar 

  6. M.L. Overton and R.S. Womersley, On the sum of the largest eigenvalues of a symmetric matrix, SIAM J. Matrix. Anal. Appl. 13 (1992) 41–45.

    Google Scholar 

  7. R.T. Rockafellar,Convex Analysis (Princeton University Press, 1970).

  8. G.A. Watson, Characterization of the subdifferential of some matrix norms, Lin. Alg. Appl. 170 (1992) 33–45.

    Google Scholar 

  9. G.A. Watson, Linear best approximation using a class of polyhedral norms, Numer. Algor. 2 (1992) 321–336.

    Google Scholar 

  10. G.A. Watson, The solution of matrix approximation problems with Ky Fank norms, Report NA/144, Department of Mathematics and Computer Science, University of Dundee (1992).

  11. K. Zietak, Subdifferentials, faces and dual matrices, Lin. Alg. Appl. 185 (1992) 125–141.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Watson, G.A. On matrix approximation problems with Ky Fank norms. Numer Algor 5, 263–272 (1993). https://doi.org/10.1007/BF02210386

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02210386

Keywords

Navigation