Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1510.04727

Random Reordering in SOR-Type Methods

Peter Oswald·Weiqi Zhou
View original source ↗Read source document ↗Export metadata ↓

Abstract

When iteratively solving linear systems By=b with Hermitian positive semi-definite $B$, and in particular when solving least-squares problems for $Ax=b$ by reformulating them as $AA^\ast y=b$, it is often observed that SOR-type methods (Gauss-Seidel, Kaczmarz) perform suboptimally for the given equation ordering, and that random reordering improves the situation on average.This paper is an attempt to provide some additional theoretical support for this phenomenon. We show eerror bounds for two randomized versions, called shuffled and preshuffled SOR, that improve asymptotically upon the best known bounds fro SOR with cyclic ordering. Our results are based on studying the behavior of the triangular truncation of Hermitian matrices with respect to their permutations.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Peter Oswald, Weiqi Zhou. 2016-07-20. Random Reordering in SOR-Type Methods. https://arxiv.org/abs/1510.04727

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Sparsely connected neural network representation of Lagrange finite element function

We construct a mesh-induced sparsely connected neural network framework that exactly reproduces arbitrary-order Lagrange finite element spaces over simplicial meshes. Unlike conventional black-box neural surrogates, the proposed network architecture is fully dictated by finite element discretization rules: local computations stem from simplex geometry and barycentric coordinate transformations, while global consistency is enforced through shared degrees of freedom. For linear Lagrange elements, local basis functions are directly implemented via affine barycentric layers, and high-order polynomial bases are explicitly decomposed into barycentric product compositions realized by specially designed $\mathrm{ReLU}^p$ modules. Equipped with element indicator branches and multiplication units, these modular local components are globally assembled into a sparsely connected neural network whose function space coincides exactly with the target finite element space, thereby inheriting the complete classical finite element approximation theory. By prescribing customized backward differentiation rules for piecewise activations, function values and their spatial gradients can be simultaneously extracted via automatic differentiation within a unified computational graph, eliminating the separate gradient calculation subroutines required in standard finite element implementations. Numerical experiments verify the accuracy of the neural network representation of Lagrange finite elements. Furthermore, by virtue of the intrinsic mesh-free nature of this neural network representation, finite element functions can be interpolated between non-matching meshes, and the proposed scheme can be applied to adaptive finite element methods for solving parabolic partial differential equations. An open-source code implementation of the proposed architecture is made publicly available.

math.NA↗
arXiv2026

The Stability of Block Eliminations and Additive Modifications

The block elimination with additive modifications (BEAM) method was recently proposed as a alternative to LU with partial pivoting requiring less communication. Because of the novelty of BEAM, the existing theoretical analysis is lacking. To that end, we analyze both the numerical stability of the underlying block LU factorization and the effects of additive modifications. For the block LU factorization, we are able to improve the previous results of Demmel et al. from being cubic in the element growth to merely quadratic. Furthermore, we propose an alternative measure of element growth that is better aligned with block LU; this new measure of growth allows our analysis to apply to matrices that cannot be factored with pointwise LU. In the second part, we analyzed the modifications produced by BEAM and the effect they have on the condition number and growth factor. Finally, we show that BEAM will not apply any modifications in some cases that regular block LU can safely factor.

math.NA↗
arXiv2026

Approximation for stochastic time-space fractional cable equations driven by rough noise

The time-space fractional cable equation arises from extending the generalized fractional Ohm's law to model anomalous diffusion processes. In this paper, we develop and analyze a numerical approximation for stochastic nonlinear time-space fractional cable equation driven by rough noise. The model features both two nonlocal terms in time and one in space. By an operator theoretic approach, we establish the existence, uniqueness and regularity of solutions. To regularize the rough noise, we introduce a spectral Wong-Zakai approximation and derive its convergence rate. For the fully discrete scheme, we employ the spectral Galerkin method for spatial discretization and the backward Euler convolution quadrature for temporal discretization, and we derive error estimates under explicit parameter conditions. Finally, numerical experiments are presented to validate the theoretical convergence rates.

math.NA↗