The hp-version of the least-squares collocation method with integral collocation for solving a biharmonic equation

A new algorithm for the numerical solution of the biharmonic equation is developed. It is based on the first implemented hp-version of the least-squares collocation method (hp-LSCM) with integral collocations for a fourth-order elliptic equation in combination with modern methods of accelerating ite...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Vestnik Samarskogo gosudarstvennogo tehničeskogo universiteta. Seriâ Fiziko-matematičeskie nauki Ročník 26; číslo 3; s. 556 - 572
Hlavní autori: Vasily P. Shapeev, Luka S. Bryndin, Vasily A. Belyaev
Médium: Journal Article
Jazyk:English
Russian
Vydavateľské údaje: Samara State Technical University 01.09.2022
Predmet:
acceleration of iterative processes
biharmonic equation
integral collocation equation
krylov subspaces
least-squares collocation method
multigrid algorithms
parallelization
plate bending
preconditioning
ISSN:1991-8615, 2310-7081
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:A new algorithm for the numerical solution of the biharmonic equation is developed. It is based on the first implemented hp-version of the least-squares collocation method (hp-LSCM) with integral collocations for a fourth-order elliptic equation in combination with modern methods of accelerating iterative processes for solving systems of linear algebraic equations (SLAE). The hp-LSCM provides the possibilities to refine the grid (h-version) and increase the degree of polynomials to the arbitrary order (p-approach). The convergence of approximate solutions obtained by the implemented version of the method is analyzed using an example of a numerical simulation of the bending of a hinged isotropic plate. The high accuracy and the increased order of convergence using polynomials up to the tenth order in the hp-LSCM are shown. The effectiveness of the combined application of algorithms for accelerating iterative processes to solve SLAE that are combined with LSCM is investigated. In this paper, we consider the application of the following algorithms: preconditioning of SLAE matrices; the iteration acceleration algorithm based on Krylov subspaces; the prolongation operation on a multigrid complex; parallelization using OpenMP; a modified algorithm for solving local SLAEs. The latter is implemented with iterations over subdomains (which are cells) and makes it possible to more effectively solve overdetermined SLAEs in the LSCM in the case of solving a linear differential equation. The form of the matrices does not change at each iteration. Only the elements of the vectors of their right parts corresponding to the matching conditions are modified. The calculation time on a personal computer is reduced by more than 350 times with the combined use of all acceleration techniques compared to the case when only preconditioning was used.
ISSN:1991-8615
2310-7081
DOI:10.14498/vsgtu1936