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.Have you forgotten your password?
Repository logo
  • Communities & Collections
  • All of DSpace
  • 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.Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Gyamfi Kwasi Baah"

Now showing 1 - 1 of 1
Results Per Page
Sort Options
  • Loading...
    Thumbnail Image
    Item
    Solution of Inverse Eigenvalue Problem of Certain Singular Hermitian Matrices
    (2012-12-18) Gyamfi Kwasi Baah
    We investigate solutions to the Inverse Eigenvalue Problem (IEP) of certain singular Hermitian matrices. Based on a solvability lemma, we propose an algorithm to reconstruct such matrices from their eigenvalues. That is, we develop algorithms and prove that they solve š‘›Ć—š‘›, singular Hermitian matrices of š‘Ÿš‘Žš‘›š‘˜š‘Ÿ. In the case of š‘›Ć—š‘› matrix, the number of independent matrix elements would reduce to the extent that there would be an isomorphism between the elements and the nonzero eigenvalues. We initiate a differential geometry and numerical analytic interpretation of the Inverse Eigenvalue problem for Hermitian matrices using fibre bundle with structure group š‘‚(š‘›). In particular, Newton type algorithm is developed to construct non singular symmetric matrices using certain singular symmetric matrices as the initial matrices for the iteration.

Kwame Nkrumah University of Science and Technology copyright Ā© 2002-2025