In this paper, we analyze the convergence %semi-convergence properties of projected non-stationary block iterative methods (P-BIM) aiming to find a constrained solution to large linear, usually both noisy and ill-conditioned, systems of equations. We split the error of the $k$th iterate into noise error and iteration error, and consider each error separately. The iteration error is treated for a more general algorithm, also suited for solving split feasibility problems in Hilbert space. The results for P-BIM come out as a special case. The algorithmic step involves projecting onto closed convex sets. When these sets are polyhedral, and of finite dimension, it is shown that the algorithm converges linearly. We further derive an upper bound for the noise error of P-BIM. Based on this bound, we suggest a new strategy for choosing relaxation parameters, which assist in speeding up the reconstruction process and improving the quality of obtained images. The relaxation parameters may depend on the noise. The performance of the suggested strategy is shown by examples taken from the field of image reconstruction from projections.
A Novel Block-Alternating Iterative Algorithm for Retrieving Top-$k$ Elements from Factorized Tensors
the School of Mathematics and Computational Science, Xiangtan University(湘潭大学数学与计算科学学院);the Department of Broadband Communications, Pengcheng Laboratory(鹏城实验室宽带通信研究所)
Block preconditioning methods for asymptotic preserving scheme arising in anisotropic elliptic problems
强各向异性椭圆型方程的高效、鲁棒迭代求解是一个极具挑战性的问题。本文提出了一种块预处理方法来求解一类微宏保渐近(MMAP)格式的线性代数系统。MMAP方法由Degond { \it et al.}其中离散矩阵具有$2\times2$块结构。利用近似Schur补构造了一系列块预条件子。我们首先分析一个自然的近似舒尔补,它是原始非AP离散化的系数矩阵。然而,它往往是奇异的非常小的各向异性参数。然后,我们改进它通过使用更合适的近似边界行的确切舒尔补。利用这些块预条件子,建立了求解离散方程组的预条件GMRES迭代法。一些数值试验表明,块预处理方法可以是一个强大的战略方面的网格细化和各向异性的强度。
Algebraic Temporal Blocking for Sparse Iterative Solvers on Multi-Core CPUs
Erlangen National High Performance Computing Center, Friedrich-Alexander-Universität Erlangen-Nürnberg(埃尔朗根国家高性能计算中心,埃尔朗根-纽伦堡弗里德里希-亚历山大大学);Institute of Applied Mathematics, Delft University of Technology, Delft, The Netherlands(代尔夫特理工大学应用数学研究所);Department of Computer Science, Friedrich-Alexander-Universität Erlangen-Nürnberg(埃尔朗根-纽伦堡弗里德里希-亚历山大大学计算机科学系)
Fast iterative solution of the Bethe-Salpeter eigenvalue problem using low-rank and QTT tensor approximation
Max Planck Institute for Dynamics of Complex Technical Systems(马克斯·普朗克复杂技术系统动力学研究所);University of Bath(巴斯大学);Max Planck Institute for Mathematics in the Sciences(马克斯·普朗克科学数学研究所)
Parameter-robust Uzawa-type iterative methods for double saddle point problems arising in Biot's consolidation and multiple-network poroelasticity models