On the convergence rate of SOR: A worst case estimate
From MaRDI portal
Publication:1332342
DOI10.1007/BF02246506zbMath0804.65037MaRDI QIDQ1332342
Publication date: 12 September 1994
Published in: Computing (Search for Journal in Brave)
Toeplitz matricesspectral condition numberoptimal convergence ratesuccesive overrelaxationworst case estimate
Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Related Items
Properties and applications of a conjugate transform on Schatten classes, Triangular truncation and its extremal matrices, A linear algebra perspective on the random multi-block ADMM: the QP case, Kaczmarz's anomaly: a surprising feature of Kaczmarz's method, Greedy and randomized versions of the multiplicative Schwarz method, Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version, Random reordering in SOR-type methods, Schwarz iterative methods: infinite space splittings, Cascadic multigrid methods for parabolic problems, Parallel adaptive subspace correction schemes with applications to elasticity, On Paszkiewicz's example, Convergence analysis for Kaczmarz-type methods in a Hilbert space framework
Cites Work
- On the abstract theory of additive and multiplicative Schwarz algorithms
- Iterative Methods by Space Decomposition and Subspace Correction
- Schwarz Analysis of Iterative Substructuring Algorithms for Elliptic Problems in Three Dimensions
- The main triangle projection in matrix spaces and its applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item