Repository logo
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    New user? Click here to register using a personal email and password.Have you forgotten your password?
Repository logo
    Info Pages
    Content PolicyCopyright & Access InfoDepositing to MRODeposit LicenseDeposit License SummaryFile FormatsTheses FAQDoctoral Thesis Deposit
  • Communities & Collections
  • All of MRO
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    New user? Click here to register using a personal email and password.Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Rao, Radhakrishna"

Now showing 1 - 1 of 1
Results Per Page
Sort Options
  • Loading...
    Thumbnail Image
    Item
    Antieigenvalues and antisingularvalues of a matrix and applications to problems in statistics
    (Massey University, 2005) Rao, Radhakrishna
    Let A be p × p positive definite matrix. A p-vector x such that Ax = x is called an eigenvector with the associated with eigenvalue . Equivalent characterizations are: (i) cos = 1, where is the angle between x and Ax. (ii) (x0Ax)−1 = xA−1x. (iii) cos = 1, where is the angle between A1/2x and A−1/2x. We ask the question what is x such that cos as defined in (i) is a minimum or the angle of separation between x and Ax is a maximum. Such a vector is called an anti-eigenvector and cos an anti-eigenvalue of A. This is the basis of operator trigonometry developed by K. Gustafson and P.D.K.M. Rao (1997), Numerical Range: The Field of Values of Linear Operators and Matrices, Springer. We may define a measure of departure from condition (ii) as min[(x0Ax)(x0A−1x)]−1 which gives the same anti-eigenvalue. The same result holds if the maximum of the angle between A1/2x and A−1/2x as in condition (iii) is sought. We define a hierarchical series of anti-eigenvalues, and also consider optimization problems associated with measures of separation between an r(< p) dimensional subspace S and its transform AS. Similar problems are considered for a general matrix A and its singular values leading to anti-singular values. Other possible definitions of anti-eigen and anti-singular values, and applications to problems in statistics will be presented.

Copyright © Massey University  |  DSpace software copyright © 2002-2025 LYRASIS

  • Contact Us
  • Copyright Take Down Request
  • Massey University Privacy Statement
  • Cookie settings