27.06.2013 Views

Discontinuous Galerkin methods Lecture 1 - Brown University

Discontinuous Galerkin methods Lecture 1 - Brown University

Discontinuous Galerkin methods Lecture 1 - Brown University

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.

Finite difference <strong>methods</strong><br />

roduction<br />

neighborhood of each grid point xk 1 Introduction<br />

, the solution and the flux are as<br />

d by local polynomials<br />

• The local approximation is a 1D polynomial<br />

• The equation is satisfied in a pointwise manner<br />

t, in the neighborhood of each grid point xk , the solution and the flux are assumed to be w<br />

roximated by local polynomials<br />

1 Introduction<br />

own in space and spatial derivatives are approximated by difference metho<br />

at is, the conservation law is approximated as<br />

duh(xk ,t)<br />

+<br />

dt<br />

fh(xk+1 ,t) − fh(xk−1 ,t)<br />

hk + hk−1 = g(x k ∈ [x<br />

,t), (1<br />

k−1 ,x k+1 2<br />

]: uh(x, t) = ai(t)(x − x<br />

i=0<br />

k ) i 2<br />

, fh(x, t) = bi(t)(x −<br />

i=0<br />

efficients ai(t) and bi(t) are found by requiring that the approximat<br />

he grid points, xk x ∈ [x<br />

. Inserting these local approximations into Eq.(1.1<br />

k−1 ,x k+1 2<br />

]: uh(x, t) = ai(t)(x − x<br />

i=0<br />

k ) i 2<br />

, fh(x, t) = bi(t)(x − x<br />

i=0<br />

k ) i ,<br />

re the coefficients ai(t) and bi(t) are found by requiring that the approximate function in<br />

ates at the grid points, xk . Inserting these local approximations into Eq.(1.1), results in<br />

dual<br />

x ∈ [x k−1 ,x k+1 ]: Rh(x, t) = ∂uh + ∂fh − g(x, t).

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

Saved successfully!

Ooh no, something went wrong!