棰? ???瑙ｇ?稿?崇嚎?ф?圭?缁???????????aczmarz绠?娉?
? ?达?9??25?ワ?????涓?锛?15:00
涓昏?浜猴??ｅ阀涓?/span>
? ?癸??捐?浼?璁??浼?璁???57874553锛?
涓诲????浣?锛??板?涓?缁?璁″???/span>
涓昏?浜虹?浠?锛?
?ｅ阀涓斤?涓??芥???ぇ瀛︽????锛?涓??芥?板?浼?璁＄??板???浼???浜?锛?涓昏?浠?浜???绾挎?у????????浼?????璁哄??绠?娉???绌跺伐浣???
璁插骇绠?浠?锛?
By regarding the two-subspace Kaczmarz method as an alternated inertial randomized Kaczmarz algorithm, we present a better convergence rate estimate under a mild condition. Furthermore, we accelerate the alternated inertial randomized Kaczmarz algorithm and introduce a multi-step inertial randomized Kaczmarz algorithm which is proven to have a faster convergence rate. Numerical experiments support the theory results and illustrate that the multi-inertial randomized Kaczmarz algorithm signi铿?cantly outperforms the two-subspace Kaczmarz method in solving coherent linear systems.