On the numerical solution of high order multi-dimensional elliptic PDEs

Using the idea of differential quadrature, two new methods are constructed to approximate the solution of elliptic partial differential equations in higher dimensions. To obtain the weighting coefficients of the first method, a mixture of grid points and mid points of the uniform partition is used....

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computers & mathematics with applications (1987) 2018-09, Vol.76 (5), p.1228-1245
1. Verfasser: Ghasemi, M.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Using the idea of differential quadrature, two new methods are constructed to approximate the solution of elliptic partial differential equations in higher dimensions. To obtain the weighting coefficients of the first method, a mixture of grid points and mid points of the uniform partition is used. The order of convergence obtained by the first algorithm is non-optimal, so we mixed the idea with spline collocation to obtain higher order approximations. Using the weighting coefficients of the non-optimal algorithm, some new weighting coefficients are obtained which are used to obtain higher accuracy. For the first time, a sixth order approximation is obtained to the solution of well-known high order multi-dimensional elliptic PDEs such as biharmonic and triharmonic problems. We found a way to increase the order of convergence and the accuracy without increasing the CPU runtime. The block form of the coefficients matrix for the linear case is presented to have a better vision on the system arised from the method. Some examples of biharmonic and triharmonic problems are solved to show the good performance and applicability of the proposed algorithms.
ISSN:0898-1221
1873-7668
DOI:10.1016/j.camwa.2018.06.017