The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “On the convergence of a modified block SOR algorithm.”

Propagation of errors in dynamic iterative schemes

Zubik-Kowal, Barbara

Similarity:

We consider iterative schemes applied to systems of linear ordinary differential equations and investigate their convergence in terms of magnitudes of the coefficients given in the systems. We address the question of whether the reordering of equations in a given system improves the convergence of an iterative scheme.

New SOR-like methods for solving the Sylvester equation

Jakub Kierzkowski (2015)

Open Mathematics

Similarity:

We present new iterative methods for solving the Sylvester equation belonging to the class of SOR-like methods, based on the SOR (Successive Over-Relaxation) method for solving linear systems. We discuss convergence characteristics of the methods. Numerical experimentation results are included, illustrating the theoretical results and some other noteworthy properties of the Methods.

Convergence and quasi-optimal complexity of a simple adaptive finite element method

Roland Becker, Shipeng Mao (2009)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

We prove convergence and quasi-optimal complexity of an adaptive finite element algorithm on triangular meshes with standard mesh refinement. Our algorithm is based on an adaptive marking strategy. In each iteration, a simple edge estimator is compared to an oscillation term and the marking of cells for refinement is done according to the dominant contribution only. In addition, we introduce an adaptive stopping criterion for iterative solution which compares an estimator for the iteration...

Multi-step-length gradient iterative method for separable nonlinear least squares problems

Hai-Rong Cui, Jing Lin, Jian-Nan Su (2024)

Kybernetika

Similarity:

Separable nonlinear least squares (SNLLS) problems are critical in various research and application fields, such as image restoration, machine learning, and system identification. Solving such problems presents a challenge due to their nonlinearity. The traditional gradient iterative algorithm often zigzags towards the optimal solution and is sensitive to the initial guesses of unknown parameters. In this paper, we improve the convergence rate of the traditional gradient method by implementing...

Fast multigrid solver

Petr Vaněk (1995)

Applications of Mathematics

Similarity:

In this paper a black-box solver based on combining the unknowns aggregation with smoothing is suggested. Convergence is improved by overcorrection. Numerical experiments demonstrate the efficiency.