1988
DOI: 10.1007/bf01395818
|View full text |Cite
|
Sign up to set email alerts
|

Spectral Tau approximation of the two-dimensional stokes problem

Abstract: Summary.We analyse the Spectral Tau method for the approximation of the Stokes system on a square with Dirichlet boundary conditions. We provide an error estimate, in the norm of the Sobolev space H ~, for the approximation of a divergence free vector field with polynomial divergence free vector fields. We apply this result to prove some convergence estimates for the solution of the discrete Stokes problem.Subject Classifications: AMS(MOS): 65N 30; C R : G 1.8. IntroductionIn this paper we study a spectral app… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
7
0

Year Published

1990
1990
2012
2012

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 15 publications
(7 citation statements)
references
References 15 publications
0
7
0
Order By: Relevance
“…However thanks to the symmetry of the Galerkin procedure, the complexity of the pre-processing stage in the Galerkin case is an order of magnitude less (in terms of N ) than in the tau (and the collocation) case. Furthermore the error estimates of the Galerkin approximation is optimal (see (2.3)) while that of the tau approximation is not (see for instance [20] and [19]). Remark 2.3.…”
Section: Multiply Ementioning
confidence: 99%
See 1 more Smart Citation
“…However thanks to the symmetry of the Galerkin procedure, the complexity of the pre-processing stage in the Galerkin case is an order of magnitude less (in terms of N ) than in the tau (and the collocation) case. Furthermore the error estimates of the Galerkin approximation is optimal (see (2.3)) while that of the tau approximation is not (see for instance [20] and [19]). Remark 2.3.…”
Section: Multiply Ementioning
confidence: 99%
“…In the collocation method, we work in the physical space -a set of collocation points; while in the Galerkin and tau methods, we work in the spectral space -the coefficients of the polynomial series. The Galerkin and collocation methods usually lead to optimal error estimates; while the tau method, being a modification of the Galerkin method, leads to non symmetric variational formulations and only sub-optimal error estimates are available (see for instance [19] and [20]). Gottlieb and Orszag in their pioneer book [11] presented an efficient Chebyshev-tau method; on the other hand, they presented a basis for the Galerkin method which leads to full matrices and its application in practice is prohibited.…”
mentioning
confidence: 99%
“…The estimate in [17], however, concerns the gradient operator ; it is therefore much closer to an (9 (p )-estimate of the &(H~ * ; L 2 )-norm of a right inverse for the « adjoint » divergence operator. We refer the reader to [26] for other estimâtes related to Proposition 1.…”
Section: «=0mentioning
confidence: 88%
“…• [17] is somewhat related to the upper bound in Proposition 1. The estimate in [17], however, concerns the gradient operator ; it is therefore much closer to an (9 (p )-estimate of the &(H~ * ; L 2 )-norm of a right inverse for the « adjoint » divergence operator.…”
Section: «=0mentioning
confidence: 99%
“…The tau method, where the test functions are always taken without any boundary condition constraints, is one of the basic forms of the spectral method [1,14,19,24]. Analysis and the error estimates of the tau method for the equations above have been discussed in [2].…”
Section: Dtu-\-a(x)d^u + B(x)u = F(xt) Xgd Te(ot]mentioning
confidence: 99%