TY - JOUR

T1 - Development and analysis of the fast pseudo spectral method for solving nonlinear dirichlet problems

AU - Semisalov, B. V.

N1 - Publisher Copyright: © 2018 South Ural State University. All rights reserved.

PY - 2018/5/1

Y1 - 2018/5/1

N2 - Numerical method for solving one-, two- and three-dimensional Dirichlet problems for the nonlinear elliptic equations has been designed. The method is based on the application of Chebyshev approximations without saturation and on a new way of forming and solving the systems of linear equations after discretization of the original differential problem. Wherein the differential operators are approximated by means of matrices and the equation itself is approximated by the Sylvester equation (2D case) or by its tensor generalization (3D case). While solving test problems with the solutions of different regularity we have shown a rigid correspondence between the rate of convergence of the proposed method and the order of smoothness (or regularity) of the sought-for function. The observed rates of convergence strictly correspond to the error estimates of the best polynomial approximations and show the absence of saturation of the designed algorithm. This results in the essential reduction of memory costs and number of operations for cases of the problems with solutions of a high order of smoothness.

AB - Numerical method for solving one-, two- and three-dimensional Dirichlet problems for the nonlinear elliptic equations has been designed. The method is based on the application of Chebyshev approximations without saturation and on a new way of forming and solving the systems of linear equations after discretization of the original differential problem. Wherein the differential operators are approximated by means of matrices and the equation itself is approximated by the Sylvester equation (2D case) or by its tensor generalization (3D case). While solving test problems with the solutions of different regularity we have shown a rigid correspondence between the rate of convergence of the proposed method and the order of smoothness (or regularity) of the sought-for function. The observed rates of convergence strictly correspond to the error estimates of the best polynomial approximations and show the absence of saturation of the designed algorithm. This results in the essential reduction of memory costs and number of operations for cases of the problems with solutions of a high order of smoothness.

KW - Boundary-value problem

KW - Chebyshev approximation

KW - Nonlocal method without saturation

KW - Stabilization method

UR - http://www.scopus.com/inward/record.url?scp=85048576899&partnerID=8YFLogxK

U2 - 10.14529/mmp180210

DO - 10.14529/mmp180210

M3 - Article

AN - SCOPUS:85048576899

VL - 11

SP - 123

EP - 138

JO - Вестник ЮУрГУ. Серия "Математическое моделирование и программирование"

JF - Вестник ЮУрГУ. Серия "Математическое моделирование и программирование"

SN - 2071-0216

IS - 2

ER -