中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/63161
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 78937/78937 (100%)
造訪人次 : 39888342      線上人數 : 1144
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    NCU Institutional Repository > 理學院 > 數學系 > 研究計畫 >  Item 987654321/63161


    請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/63161


    題名: 矩陣的數值域其邊界之研究;A Study on the Boundaries of Numerical Ranges of Matrices
    作者: 高華隆
    貢獻者: 國立中央大學數學系
    關鍵詞: 數學
    日期: 2012-12-01
    上傳時間: 2014-03-17 14:20:28 (UTC+8)
    出版者: 行政院國家科學委員會
    摘要: 研究期間:10108~10207;In this project, we study the existence and number of line segments on the boundaries of numerical ranges of various matrix classes. where the aj's, called the weights of A, are complex numbers. Let A[j] denote the (n — 1)-by-(n — 1) principal submatrix of A obtained by deleting its j th row and j th column. We want to show that dW (A) has a line segment if and only if the aj's are nonzero and W(A[k]) = W(A[/]) = W(A[m]) for some k, I and m, 1 < k <1 < m < n. In this case, W(A[j]) is the circular disc centered at the origin for all 1 < j < n, and there are exactly n line segments on dW (A). This will refine and extend the result of Tsai and Wu. Moreover, we conjecture that A and B are two n-by-n (n > 3) weighted shift matrices. Assume that the weights of A are nonzero and periodic with period k. If W(A) = W(B), then the weights of B are also nonzero and periodic with period k. Recall that, for any complex polynomial p(z) = zn + aizn-1 + ••• + an_iz + a,n, there is associated an n-by-n matrix called the companion matrix of p and denoted by C(p). We had shown that an n-by-n companion matrix can have at most n line segments on the boundary of its numerical range. In this case, this companion matrix is unitarily reducible. In this project, we want to show that if A is an n x n companion matrix, then dW (A) has n — 1 line segments if and only if n is odd and a(A) = {a,au2,... ,aun~1} U {u/a, ^3/a,... ,un~2/a} for some a G C with |a| nearing 1. In this case, A is unitarily reducible. Consequently, if A is an n x n unitarily irreducible companion matrix, then dW (A) has at most n — 2 line segments.
    關聯: 財團法人國家實驗研究院科技政策研究與資訊中心
    顯示於類別:[數學系] 研究計畫

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML306檢視/開啟


    在NCUIR中所有的資料項目都受到原著作權保護.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明