報(bào)告題目：Accelerated greedy randomized augmented Kaczmarz algorithm for inconsistent linear systems
報(bào)告專(zhuān)家：劉永博士，常熟理工學(xué)院
報(bào)告地點(diǎn)：騰訊會(huì)議(會(huì)議號(hào)328-171-9712;密碼314159)
報(bào)告時(shí)間：2024年1月4日晚7:30-9:30
報(bào)告摘要：For solving inconsistent linear systems of equations iteratively, we further generalize the greedy randomized augmented Kaczmarz (GRAK) algorithm by introducing a nonzero parameter in the involved augmented linear system of the above inconsistent linear system, obtaining a class of accelerated greedy randomized augmented Kaczmarz algorithms.These algorithms involve one iteration parameter whose special choice can recover the GRAK algorithm, as well as yield new ones. Theoretical analyses show that the new algorithms converge to the unique solution of the augmented linear system. Moreover, the optimal choice of the parameter involved and the corresponding convergence rates of the new algorithms are computed exactly. Numerical results show that our algorithms can be much more effective than the GRAK algorithm in terms of both iteration counts and computing times.
報(bào)告人簡(jiǎn)介：劉永博士，常熟理工學(xué)院數(shù)學(xué)與統(tǒng)計(jì)學(xué)院講師，2020年畢業(yè)于上海大學(xué)計(jì)算數(shù)學(xué)專(zhuān)業(yè)，主要研究方向?yàn)殡S機(jī)數(shù)值代數(shù)，現(xiàn)主持江蘇省高等學(xué)校面上項(xiàng)目一項(xiàng)，發(fā)表論文10余篇
作者：吳念慈；編輯：劉鹍；審核：郭暉；發(fā)布：郭敏
