On the convergence of the implicit iterative line-by-line recurrence method for solving difference elliptical equations

In the article a theory of the implicit iterative line-by-line recurrence method for solving the systems of finite-difference equations which arise as a result of approximation of the two-dimensional elliptic differential equations on a regular grid is stated. On the one hand, the high effectiveness...

Full description

Bibliographic Details
Main Authors: Alexander Arkad'evich Fomin, Lubov Nikolaevna Fomina
Format: Article
Language:Russian
Published: Institute of Computer Science 2017-12-01
Series:Компьютерные исследования и моделирование
Subjects:
Online Access:http://crm.ics.org.ru/uploads/crmissues/crm_2017_6/2017_06_02.pdf
_version_ 1818509257045180416
author Alexander Arkad'evich Fomin
Lubov Nikolaevna Fomina
author_facet Alexander Arkad'evich Fomin
Lubov Nikolaevna Fomina
author_sort Alexander Arkad'evich Fomin
collection DOAJ
description In the article a theory of the implicit iterative line-by-line recurrence method for solving the systems of finite-difference equations which arise as a result of approximation of the two-dimensional elliptic differential equations on a regular grid is stated. On the one hand, the high effectiveness of the method has confirmed in practice. Some complex test problems, as well as several problems of fluid flow and heat transfer of a viscous incompressible liquid, have solved with its use. On the other hand, the theoretical provisions that explain the high convergence rate of the method and its stability are not yet presented in the literature. This fact is the reason for the present investigation. In the paper, the procedure of equivalent and approximate transformations of the initial system of linear algebraic equations (SLAE) is described in detail. The transformations are presented in a matrix-vector form, as well as in the form of the computational formulas of the method. The key points of the transformations are illustrated by schemes of changing of the difference stencils that correspond to the transformed equations. The canonical form of the method is the goal of the transformation procedure. The correctness of the method follows from the canonical form in the case of the solution convergence. The estimation of norms of the matrix operators is carried out on the basis of analysis of structures and element sets of the corresponding matrices. As a result, the convergence of the method is proved for arbitrary initial vectors of the solution of the problem. The norm of the transition matrix operator is estimated in the special case of weak restrictions on a desired solution. It is shown, that the value of this norm decreases proportionally to the second power (or third degree, it depends on the version of the method) of the grid step of the problem solution area in the case of transition matrix order increases. The necessary condition of the method stability is obtained by means of simple estimates of the vector of an approximate solution. Also, the estimate in order of magnitude of the optimum iterative compensation parameter is given. Theoretical conclusions are illustrated by using the solutions of the test problems. It is shown, that the number of the iterations required to achieve a given accuracy of the solution decreases if a grid size of the solution area increases. It is also demonstrated that if the weak restrictions on solution are violated in the choice of the initial approximation of the solution, then the rate of convergence of the method decreases essentially in full accordance with the deduced theoretical results.
first_indexed 2024-12-10T22:43:08Z
format Article
id doaj.art-23e33aff6ab44669bdebab961ad0416f
institution Directory Open Access Journal
issn 2076-7633
2077-6853
language Russian
last_indexed 2024-12-10T22:43:08Z
publishDate 2017-12-01
publisher Institute of Computer Science
record_format Article
series Компьютерные исследования и моделирование
spelling doaj.art-23e33aff6ab44669bdebab961ad0416f2022-12-22T01:30:40ZrusInstitute of Computer ScienceКомпьютерные исследования и моделирование2076-76332077-68532017-12-019685788010.20537/2076-7633-2017-9-6-857-8802630On the convergence of the implicit iterative line-by-line recurrence method for solving difference elliptical equationsAlexander Arkad'evich FominLubov Nikolaevna FominaIn the article a theory of the implicit iterative line-by-line recurrence method for solving the systems of finite-difference equations which arise as a result of approximation of the two-dimensional elliptic differential equations on a regular grid is stated. On the one hand, the high effectiveness of the method has confirmed in practice. Some complex test problems, as well as several problems of fluid flow and heat transfer of a viscous incompressible liquid, have solved with its use. On the other hand, the theoretical provisions that explain the high convergence rate of the method and its stability are not yet presented in the literature. This fact is the reason for the present investigation. In the paper, the procedure of equivalent and approximate transformations of the initial system of linear algebraic equations (SLAE) is described in detail. The transformations are presented in a matrix-vector form, as well as in the form of the computational formulas of the method. The key points of the transformations are illustrated by schemes of changing of the difference stencils that correspond to the transformed equations. The canonical form of the method is the goal of the transformation procedure. The correctness of the method follows from the canonical form in the case of the solution convergence. The estimation of norms of the matrix operators is carried out on the basis of analysis of structures and element sets of the corresponding matrices. As a result, the convergence of the method is proved for arbitrary initial vectors of the solution of the problem. The norm of the transition matrix operator is estimated in the special case of weak restrictions on a desired solution. It is shown, that the value of this norm decreases proportionally to the second power (or third degree, it depends on the version of the method) of the grid step of the problem solution area in the case of transition matrix order increases. The necessary condition of the method stability is obtained by means of simple estimates of the vector of an approximate solution. Also, the estimate in order of magnitude of the optimum iterative compensation parameter is given. Theoretical conclusions are illustrated by using the solutions of the test problems. It is shown, that the number of the iterations required to achieve a given accuracy of the solution decreases if a grid size of the solution area increases. It is also demonstrated that if the weak restrictions on solution are violated in the choice of the initial approximation of the solution, then the rate of convergence of the method decreases essentially in full accordance with the deduced theoretical results.http://crm.ics.org.ru/uploads/crmissues/crm_2017_6/2017_06_02.pdfsystem of linear algebraic equationsiterative methodconvergence of method
spellingShingle Alexander Arkad'evich Fomin
Lubov Nikolaevna Fomina
On the convergence of the implicit iterative line-by-line recurrence method for solving difference elliptical equations
Компьютерные исследования и моделирование
system of linear algebraic equations
iterative method
convergence of method
title On the convergence of the implicit iterative line-by-line recurrence method for solving difference elliptical equations
title_full On the convergence of the implicit iterative line-by-line recurrence method for solving difference elliptical equations
title_fullStr On the convergence of the implicit iterative line-by-line recurrence method for solving difference elliptical equations
title_full_unstemmed On the convergence of the implicit iterative line-by-line recurrence method for solving difference elliptical equations
title_short On the convergence of the implicit iterative line-by-line recurrence method for solving difference elliptical equations
title_sort on the convergence of the implicit iterative line by line recurrence method for solving difference elliptical equations
topic system of linear algebraic equations
iterative method
convergence of method
url http://crm.ics.org.ru/uploads/crmissues/crm_2017_6/2017_06_02.pdf
work_keys_str_mv AT alexanderarkadevichfomin ontheconvergenceoftheimplicititerativelinebylinerecurrencemethodforsolvingdifferenceellipticalequations
AT lubovnikolaevnafomina ontheconvergenceoftheimplicititerativelinebylinerecurrencemethodforsolvingdifferenceellipticalequations