@Article{IJNAM-2-4,
author = {},
title = {Taylor Expansion Algorithm for the Branching Solution of the Navier-Stokes Equations},
journal = {International Journal of Numerical Analysis and Modeling},
year = {2005},
volume = {2},
number = {4},
pages = {459--478},
abstract = {<p style="text-align: justify;">The aim of this paper is to present a general algorithm for
the branching solution of nonlinear operator equations in a Hilbert
space, namely the $k$-order Taylor expansion algorithm, $k \geq 1$. The
standard Galerkin method can be viewed as the 1-order Taylor expansion
algorithm; while the optimum nonlinear Galerkin method can be viewed as
the 2-order Taylor expansion algorithm. The general algorithm is then
applied to the study of the numerical approximations for the steady
Navier-Stokes equations. Finally, the theoretical analysis and numerical
experiments show that, in some situations, the optimum nonlinear
Galerkin method provides higher convergence rate than the standard
Galerkin method and the nonlinear Galerkin method.</p>},
issn = {2617-8710},
doi = {https://doi.org/2005-IJNAM-941},
url = {https://global-sci.com/article/83867/taylor-expansion-algorithm-for-the-branching-solution-of-the-navier-stokes-equations}
}