Standard

On an Approach to the Numerical Solution of Dirichlet Problems of Arbitrary Dimensions. / Semisalov, B. V.

In: Numerical Analysis and Applications, Vol. 15, No. 1, 6, 01.2022, p. 63-78.

Research output: Contribution to journalArticlepeer-review

Harvard

APA

Vancouver

Semisalov BV. On an Approach to the Numerical Solution of Dirichlet Problems of Arbitrary Dimensions. Numerical Analysis and Applications. 2022 Jan;15(1):63-78. 6. doi: 10.1134/S1995423922010062

Author

Semisalov, B. V. / On an Approach to the Numerical Solution of Dirichlet Problems of Arbitrary Dimensions. In: Numerical Analysis and Applications. 2022 ; Vol. 15, No. 1. pp. 63-78.

BibTeX

@article{2b8089fc502e4419916c46aa2e163542,
title = "On an Approach to the Numerical Solution of Dirichlet Problems of Arbitrary Dimensions",
abstract = "A method of the numerical solution of Dirichlet boundary value problems for nonlinear partial differential equations of the elliptic type and of arbitrary dimensions is proposed. It takes little memory and computer time for problems with smooth solutions. The method is based on modified interpolation polynomials with Chebyshev nodes to approximate the sought-for function and on a new approach to constructing and solving the linear algebraic problems corresponding to the initial differential equations. The spectra and condition numbers of the matrices formed by the algorithm are analyzed by using interval methods. Theorems on approximation and stability of the algorithm are proved in the linear case. It is shown that the algorithm provides a considerable decrease in computational costs as compared to the classical collocation and finite difference methods.",
keywords = "collocation method, decrease in computational costs, Dirichlet boundary value problem, pseudospectral method, relaxation method",
author = "Semisalov, {B. V.}",
note = "Funding Information: This work was supported by the Russian Science Foundation (project no. 20-71-00071). Publisher Copyright: {\textcopyright} 2022, Pleiades Publishing, Ltd.",
year = "2022",
month = jan,
doi = "10.1134/S1995423922010062",
language = "English",
volume = "15",
pages = "63--78",
journal = "Numerical Analysis and Applications",
issn = "1995-4239",
publisher = "Maik Nauka-Interperiodica Publishing",
number = "1",

}

RIS

TY - JOUR

T1 - On an Approach to the Numerical Solution of Dirichlet Problems of Arbitrary Dimensions

AU - Semisalov, B. V.

N1 - Funding Information: This work was supported by the Russian Science Foundation (project no. 20-71-00071). Publisher Copyright: © 2022, Pleiades Publishing, Ltd.

PY - 2022/1

Y1 - 2022/1

N2 - A method of the numerical solution of Dirichlet boundary value problems for nonlinear partial differential equations of the elliptic type and of arbitrary dimensions is proposed. It takes little memory and computer time for problems with smooth solutions. The method is based on modified interpolation polynomials with Chebyshev nodes to approximate the sought-for function and on a new approach to constructing and solving the linear algebraic problems corresponding to the initial differential equations. The spectra and condition numbers of the matrices formed by the algorithm are analyzed by using interval methods. Theorems on approximation and stability of the algorithm are proved in the linear case. It is shown that the algorithm provides a considerable decrease in computational costs as compared to the classical collocation and finite difference methods.

AB - A method of the numerical solution of Dirichlet boundary value problems for nonlinear partial differential equations of the elliptic type and of arbitrary dimensions is proposed. It takes little memory and computer time for problems with smooth solutions. The method is based on modified interpolation polynomials with Chebyshev nodes to approximate the sought-for function and on a new approach to constructing and solving the linear algebraic problems corresponding to the initial differential equations. The spectra and condition numbers of the matrices formed by the algorithm are analyzed by using interval methods. Theorems on approximation and stability of the algorithm are proved in the linear case. It is shown that the algorithm provides a considerable decrease in computational costs as compared to the classical collocation and finite difference methods.

KW - collocation method

KW - decrease in computational costs

KW - Dirichlet boundary value problem

KW - pseudospectral method

KW - relaxation method

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

UR - https://www.mendeley.com/catalogue/de34a3db-01c9-3e2a-b283-ab229e600a56/

U2 - 10.1134/S1995423922010062

DO - 10.1134/S1995423922010062

M3 - Article

AN - SCOPUS:85126254268

VL - 15

SP - 63

EP - 78

JO - Numerical Analysis and Applications

JF - Numerical Analysis and Applications

SN - 1995-4239

IS - 1

M1 - 6

ER -

ID: 35690468