國立高雄大學圖資館 |

登入

回首頁

Matrix Completion Problems for the Positiveness and Contraction Through Graphs /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Matrix Completion Problems for the Positiveness and Contraction Through Graphs /Louis Christopher.
作者:	Christopher, Louis,
面頁冊數:	1 electronic resource (49 pages)
附註:	Source: Masters Abstracts International, Volume: 85-03.
附註:	Advisors: Yoon, Jasang Committee members: Bracken, Paul; Heller, William; Kim, Hyung Won.
Contained By:	Masters Abstracts International85-03.
標題:	Mathematics.
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30522808
ISBN:	9798380179775

Matrix Completion Problems for the Positiveness and Contraction Through Graphs /
Christopher, Louis,

Matrix Completion Problems for the Positiveness and Contraction Through Graphs /Louis Christopher. - 1 electronic resource (49 pages)

Source: Masters Abstracts International, Volume: 85-03.

In this work, we study contractive and positive real symmetric matrix completion problems which are motivated in part by studies on sparse (or dense) matrices for weighted sparse recovery problems and rating matrices with rating density in recommender systems. Matrix completions problems also have many applications in probability and statistics, chemistry, numerical analysis (e.g. optimization), electrical engineering, and geophysics. In this paper we seek to connect the contractive and positive completion property to a graph theoretic property. We then answer whether the graphs of real symmetric matrices having loops at every vertex have the contractive completion property if and only if the graph of said matrix is chordal. If this is not true, we characterize all graphs of real symmetric matrices having the contractive completion property.

English

ISBN: 9798380179775Subjects--Topical Terms:

184409
Mathematics.
Subjects--Index Terms:

Chordal

Matrix Completion Problems for the Positiveness and Contraction Through Graphs /
LDR:02257nmm a22004093i 4500 001 676268
005 20250420214330.5
006 m o d
007 cr|nu||||||||
008 250901s2023 miu||||||m |||||||eng d
020 $a 9798380179775
035 $a (MiAaPQD)AAI30522808
035 $a AAI30522808
040 $a MiAaPQD $b eng $c MiAaPQD $e rda
100 1 $a Christopher, Louis, $e author. $3 990005
245 1 0 $a Matrix Completion Problems for the Positiveness and Contraction Through Graphs / $c Louis Christopher.
264 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2023
300 $a 1 electronic resource (49 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Masters Abstracts International, Volume: 85-03.
500 $a Advisors: Yoon, Jasang Committee members: Bracken, Paul; Heller, William; Kim, Hyung Won.
502 $b M.S. $c The University of Texas Rio Grande Valley $d 2023.
520 $a In this work, we study contractive and positive real symmetric matrix completion problems which are motivated in part by studies on sparse (or dense) matrices for weighted sparse recovery problems and rating matrices with rating density in recommender systems. Matrix completions problems also have many applications in probability and statistics, chemistry, numerical analysis (e.g. optimization), electrical engineering, and geophysics. In this paper we seek to connect the contractive and positive completion property to a graph theoretic property. We then answer whether the graphs of real symmetric matrices having loops at every vertex have the contractive completion property if and only if the graph of said matrix is chordal. If this is not true, we characterize all graphs of real symmetric matrices having the contractive completion property.
546 $a English
590 $a School code: 1863
650 4 $a Mathematics. $3 184409
650 4 $a Applied mathematics. $3 377601
653 $a Chordal
653 $a Contraction matrix
653 $a Matrix completion
653 $a Positiveness
690 $a 0405
690 $a 0364
710 2 $a The University of Texas Rio Grande Valley. $b School of Mathematical and Statistical Sciences. $3 942368
720 1 $a Yoon, Jasang $e degree supervisor.
773 0 $t Masters Abstracts International $g 85-03.
790 $a 1863
791 $a M.S.
792 $a 2023
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30522808