- Journal Home
- Volume 22 - 2025
- Volume 21 - 2024
- Volume 20 - 2023
- Volume 19 - 2022
- Volume 18 - 2021
- Volume 17 - 2020
- Volume 16 - 2019
- Volume 15 - 2018
- Volume 14 - 2017
- Volume 13 - 2016
- Volume 12 - 2015
- Volume 11 - 2014
- Volume 10 - 2013
- Volume 9 - 2012
- Volume 8 - 2011
- Volume 7 - 2010
- Volume 6 - 2009
- Volume 5 - 2008
- Volume 4 - 2007
- Volume 3 - 2006
- Volume 2 - 2005
- Volume 1 - 2004
Cited by
- BibTex
- RIS
- TXT
In this work, a decoupled, parallel, iterative finite element method for solving the steady Boussinesq equations is proposed and analyzed. Starting from an initial guess, an iterative algorithm is designed to decouple the Naiver-Stokes equations and the heat equation based on certain explicit treatment with the solution from the previous iteration step. At each step of the iteration, the two equations can be solved in parallel by using finite element discretization. The existence and uniqueness of the solution to each step of the algorithm is proved. The stability analysis and error estimation are also carried out. Numerical tests are presented to verify the analysis results and illustrate the applicability of the proposed method.
}, issn = {2617-8710}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/ijnam/21031.html} }In this work, a decoupled, parallel, iterative finite element method for solving the steady Boussinesq equations is proposed and analyzed. Starting from an initial guess, an iterative algorithm is designed to decouple the Naiver-Stokes equations and the heat equation based on certain explicit treatment with the solution from the previous iteration step. At each step of the iteration, the two equations can be solved in parallel by using finite element discretization. The existence and uniqueness of the solution to each step of the algorithm is proved. The stability analysis and error estimation are also carried out. Numerical tests are presented to verify the analysis results and illustrate the applicability of the proposed method.