演講公告

演講主題：A non-gap-revealing method for determining numerical rank and its applications
主講人：李宗錂 (中山大學應用數學系助理教授)
演講日期：2011年5月3日(星期二) 下午2:30 –3:30
演講地點：(光復校區) 科學一館223室
茶會時間：當天下午3:30 (科學一館205室)
摘要內容：
The rank revealing problem arises widely in scientific computing and engineering applications, such as signal processing, information retrieval, numerical polynomial algebra, and so on. Some of those applications give rise to a large matrix whose rank or nullity is known to be small apriori. Several methods have been proposed for this purpose. In general, they compute a gap-revealing factorization for estimating the singular values. Recently we proposed two new rank-revealing methods to deal with large matrices with
low ranks and low nullities respectively. Rather than computing a gap-revealing factorization, our methods construct an orthonormal basis for the numerical subspace of the matrix directly.
相關檔案：演講1000503-2.doc

$返回$ go back