報(bào)告題目：Randomized Block Kaczmarz Methods for Inner Inverses of a Matrix
報(bào)告專(zhuān)家：李維國(guó)教授，中國(guó)石油大學(xué)(華東)
報(bào)告地點(diǎn)：騰訊會(huì)議(會(huì)議號(hào)328-171-9712;密碼314159)
報(bào)告時(shí)間：2023年12月27日, 19：30 — 21：30
報(bào)告摘要：In this talk, some randomized block Kaczmarz algorithms to compute inner inverses of any rectangle matrix are presented, where A is full rank or rank deficient. Convergence results are provided to guarantee the convergence of the proposed methods theoretically. Numerical examples are given to illustrate the effectiveness. Since the proposed algorithms only require one row of A at each iteration without matrix-matrix product, it is suitable for the scenarios where the matrix A is too large to fit in memory or matrix multiplication is considerably expensive. In addition, if the MII-RABK method is implemented in parallel, the running time will be greatly reduced. Therefore, in some practical applications, the MII-RABK method is more feasible when the Moore-Penrose generalized inverse is unknown or the calculation is too expensive.
報(bào)告人簡(jiǎn)介：李維國(guó)，博士，教授，博士生導(dǎo)師。中國(guó)石油大學(xué)(華東)校學(xué)術(shù)委員會(huì)委員。1997年博士畢業(yè)于南京大學(xué)數(shù)學(xué)系，2000年被評(píng)為中國(guó)石油大學(xué)(華東)教授，至今在中國(guó)石油大學(xué)(華東)理學(xué)院工作。發(fā)表科研論文100余篇，主持、參與國(guó)家自然科學(xué)基金6項(xiàng)，教育部和山東省基金3項(xiàng)。主要從事圖像處理及分析中的數(shù)值計(jì)算問(wèn)題及其應(yīng)用、廣義逆計(jì)算、微分方程周期解的數(shù)值計(jì)算、線(xiàn)性和非線(xiàn)性方程組的數(shù)值解等方面的研究工作。講授本科生、研究生課程10余門(mén)，出版教材3部。
作者：吳念慈；編輯；劉鹍；審核：郭暉；發(fā)布：郭敏。
