28.01.2013 Views

Zienkiewicz O.C., Taylor R.L. Vol. 3. The finite - tiera.ru

Zienkiewicz O.C., Taylor R.L. Vol. 3. The finite - tiera.ru

Zienkiewicz O.C., Taylor R.L. Vol. 3. The finite - tiera.ru

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

24 Convection dominated problems<br />

2.2.5 Galerkin least square approximation (GLS) in one<br />

dimension<br />

In the preceding sections we have shown that several, apparently di€erent,<br />

approaches have resulted in identical (or almost identical) approximations. Here<br />

yet another procedure is presented which again will produce similar results. In this<br />

a combination of the standard Galerkin and least square approximations is made. 15;16<br />

If Eq. (2.11) is rewritten as<br />

with<br />

L ‡ Q ˆ 0 ^ ˆ N ~ f …2:36a†<br />

L ˆ U d d<br />

ÿ<br />

dx dx<br />

k d<br />

dx<br />

the standard Galerkin approximation gives for the kth equation<br />

… L<br />

0<br />

N kL…N† ~ f dx ‡<br />

… L<br />

0<br />

…2:36b†<br />

N kQ dx ˆ 0 …2:37†<br />

with boundary conditions omitted for clarity.<br />

Similarly, a least square residual minimization (see Chapter 3 of <strong>Vol</strong>ume 1, Sec.<br />

<strong>3.</strong>14.2) results in<br />

or<br />

R ˆ L ^ ‡ Q and<br />

… L<br />

0<br />

1<br />

2<br />

U dN k<br />

dx<br />

d<br />

d ~ k<br />

ÿ d<br />

dx<br />

… L<br />

0<br />

R 2 dx ˆ<br />

… L<br />

0<br />

d…L ^ †<br />

d ~ …L<br />

k<br />

^ ‡ Q† dx ˆ 0 …2:38†<br />

k d<br />

dx N k …L ^ ‡ Q† ˆ0 …2:39†<br />

If the ®nal approximation is written as a linear combination of Eqs (2.37) and<br />

(2.39), we have<br />

… L<br />

0<br />

N k ‡ U dN k<br />

dx<br />

ÿ d<br />

dx<br />

k d<br />

dx N k …L ^ ‡ Q† dx ˆ 0 …2:40†<br />

This is of course, the same as the Petrov±Galerkin approximation with an undetermined<br />

parameter . If the second-order term is omitted (as could be done assuming<br />

linear N k and a curtailment as in Fig. 2.3) and further if we take<br />

ˆ<br />

j jh<br />

2jUj<br />

…2:41†<br />

the approximation is identical to that of the Petrov±Galerkin method with the<br />

weighting given by Eqs (2.21) and (2.22).<br />

Once again we see that a Petrov±Galerkin form written as<br />

… L<br />

0<br />

j j Uh dNk Nk ‡<br />

2 jUj dx<br />

d ^ d<br />

U ÿ<br />

dx dx<br />

k d ^<br />

dx<br />

‡ Q dx ˆ 0 …2:42†

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!