请升级浏览器版本

你正在使用旧版本浏览器👭📁。请升级浏览器以获得更好的体验🧝🏻‍♂️。

学术报告

首页 >> 学术报告 >> 正文

【学术报告】An Efficient Algorithm for Computing the Approximate t-URV and its Applications

发布日期💺:2023-04-10    点击:

学术报告


 

报告题目: An Efficient Algorithm for Computing the Approximate t-URV and its Applications


时间:2023年4月13日星期四  16:00-17:30


报告人: 魏益民复旦大学)


报告地点:沙河主楼E404


腾讯会议531-118-801

 

报告摘要: This talk is devoted to the definition and computation of the tensor complete orthgonal decomposition of a third-order tensor called t-URV decompositions. We first give the definition for the t-URV decomposition of a third-order tensor and derive a deterministic algorithm for computing the t-URV. We then present a randomized algorithm to approximate t-URV, named compressed randomized t-URV (cort-URV). Note that t-URV and cort-URV are extensions of URV and compressed randomized URV from the matrix case to the tensor case, respectively. We also establish the deterministic and average-case error bounds for this algorithm. Finally, we illustrate the effectiveness of the proposed algorithm via several numerical examples, and we apply cort-URV to compress the data tensors from some image and video databases.

 

报告人简介:

魏益民🤦🏼‍♀️,复旦大学数学凯发K8教授👩‍👧‍👧,现担任国际学术期刊Computational and Applied Mathematics, Journal of Applied Mathematics and Computing, FILOMAT, Communications in Mathematical Research,《高校计算数学学报》的编委. 在国际学术期刊Math. Comput., SIAM J. Sci. Comput.,SIAM J. Numer Anal., SIAM J. Matrix Anal. Appl., J. Sci. Comput., IEEE Trans. Auto. Control, IEEE Trans.Neural Network Learn. System, Neurocomputing Neural Computation 等发表论文150余篇🤠😚;EDP Science, Elsevier, Springer, World Scientific和科学出版社等出版英语专著5🔠。6次入选爱思唯尔中国高被引学者榜单♘。Google学术引用9000余次🦶🏿,H指数48👱。他的主要研究方向是数值线性代数,多重线性代数的快速算法及其应用。

 

 

邀请人:崔春风

快速链接

版权所有 © 2021  凯发娱乐-凯发-凯发平台-北京凯发K8娱乐平台登录官方网站
地址🙂‍↔️:北京市昌平区高教园南三街9号   电话🥌:61716719

凯发娱乐专业提供:凯发娱乐👨🏻‍🦼、凯发平台凯发登录等服务,提供最新官网平台、地址、注册、登陆、登录、入口、全站、网站、网页、网址、娱乐、手机版、app、下载、欧洲杯、欧冠、nba、世界杯、英超等,界面美观优质完美,安全稳定,服务一流👨‍🏫,凯发娱乐欢迎您。 凯发娱乐官网xml地图
凯发娱乐 凯发娱乐 凯发娱乐 凯发娱乐 凯发娱乐 凯发娱乐 凯发娱乐 凯发娱乐 凯发娱乐 凯发娱乐