zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Godunov-mixed methods for advection-diffusion equations in multidimensions. (English) Zbl 0791.65062

The author considers time-split methods for multidimensional advection-diffusion equations. The advection is approximated by a Godunov-type procedure while diffusion is approximated by a low-order mixed finite element method.

Section 2 states the problem of interest and develops the basic algorithm. The set-up is confined to 2 , however the analysis can be easily extended to 3 . The main problem reads as follows: let s(𝐱,t) satisfy (1) s t +f(𝐱,t,s) x +g(𝐱,t,s) y -(D(𝐱,t)s)=0 on Ω×(0,T], (2) s=b on Ω×(0,T], (3) s=s 0 on Ω×{0}, where 𝐱=(x,y) and Ω is a convex bounded polygon in 2 . Then the basic method is described and an error estimate is proved (Theorem 2.1). The proof relies on Gronwall’s Lemma and a standard inequality of type abε 2a 2 +2 εb 2 . It is worthy to underline that Theorem 2.1 does not explicitly require any assumptions on the relative sizes of Δt and h (time and spatial step, respectively), what in many applications may be advantageous.

In the next three sections three special cases are discussed and dealt with using this basic theorem. In the first approach (§3) advective fluxes are approximated by an unsplit higher order Godunov procedure. A rectangular triangulation of Ω ¯ is assumed. The method turns out to be first-order accurate in time and second-order accurate in space. In §4 there is a modification of this approach which is of second-order in time. The modification consists of using Crank-Nicolson time-stepping, and adding a term to the left and right states at each element edge.

The last method, described in §5, is based on calculation of fluxes by characteristic tracing over, potentially more than one element. Here triangular elements are assumed. Using this method first-order accuracy in time and space is gained for linear problems, i.e. f(𝐱,s)=u(𝐱)s and g(𝐱,s)=v(𝐱)s in the problem (1), (2), (3).

65M06Finite difference methods (IVP of PDE)
65M60Finite elements, Rayleigh-Ritz and Galerkin methods, finite methods (IVP of PDE)
65M15Error bounds (IVP of PDE)
35K55Nonlinear parabolic equations