部门简介 部门领导 部门职责 院长信箱

 规章制度 课程管理 调停课 教研教改 来华留学生培养 研究生人文教育与学术交流月

 实验实践 规章制度 非全日制硕士培养

 规章制度 答辩公示 学位证查询 资料下载 通知公告

 党建思政 创新创业 学术科技 队伍建设 评奖评优 规章制度 学院信息

 奖助学金 助学贷款 学籍管理 出国留学

 竞赛实践 就业网 网签系统

 教学管理 专业学位 思想教育 学生管理 学位管理 就业信息 学科建设

人：Ren-Cang Li

Abstact：

Iterative methods are widely and indispensably used in numerical approximations. Basically, any iterative method is a rule that produces a sequence of approximations and with a reasonable expectation that newer approximations in the sequence are better. The goal of a doubling algorithm is to significantly speed up the approximation process by seeking ways to  skip computing most of the approximations in the sequence but sporadically few, in fact, extremely very few: only the $2^i$-th approximations in the sequence, kind of like computing $\alpha^{2^i}$ via repeatedly squaring. However, this idea is only worthwhile if there is a much cheaper way to directly obtain the $2^i$-th approximation from the $2^{i-1}$-st one  than simply following the rule to generate every approximation between the $2^{i-1}$-st and $2^i$-th approximations in order to obtain the $2^i$-th approximation. Anderson (1978) had sought the idea to speed up the simple fixed point iteration for solving the discrete-time algebraic Riccati equation via repeatedly compositions of the fixed point iterative function. As can be imagined, under repeatedly compositions, even a simple function can usually and quickly turn into nonetheless a complicated and unworkable one. In the last 20 years or so in large part due to an extremely elegant way of formulation and analysis, the researches in doubling algorithms thrived and continues to be very active, leading to numerical effective and robust algorithms not only for the continuous-time and discrete-time algebraic Riccati equations from optimal control that motivated the researches  in the first place but also for $M$-matrix algebraic Riccati equations (MARE), structured eigenvalue problems, and other nonlinear matrix equations. But the resulting theory is somewhat fragmented and sometimes ad hoc. In this talk, we will seek to provide a general and coherent theory, discuss new highly accurate doubling algorithm for MARE, and look at several important applications.

人：Ren-Cang Li

Abstract:

Matrix joint block diagonalization problem is a particular block term decomposition of third order tensors, which  has many important applications in blind source separation and independent component analysis. In this talk, I will talk about two classes of algebraic methods for JBD problem: one is based on matrix polynomial, the other is based on matrix commutation. Existence and uniqueness conditions for JBD problem are discussed. Numerical methods are developed and validated by simulating examples.