zbMATH — the first resource for mathematics

Examples
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.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
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)
Numerical solution to a mixed Navier-Stokes/Darcy model by the two-grid approach. (English) Zbl 1213.76131
The authors study numerical methods for a coupled Navier-Stokes/Darcy model which describes a fluid flow filtrating through a porous medium. A mathematical model and its properties for the coupled fluid flow and porous medium equations are described. Since the numerical difficulties increase as the mesh size decreases, the authors propose an alternative decoupled and linearized two-grid algorithm. In the decoupled algorithm, one solves the coupled nonlinear problem on a coarse grid, and two decoupled and linear local problems on a fine grid. The two-grid algorithm is numerically efficient because it enables the application of the most efficient and optimized local linear solvers, and it allows for easy and efficient implementation and software reuse by plugging in the existing local solvers. The authors also show that the two-grid algorithm, with a properly chosen coarse grid, still retains the same order of accuracy as the coupled nonlinear algorithm.
MSC:
76M25Other numerical methods (fluid mechanics)
76D05Navier-Stokes equations (fluid dynamics)
76S05Flows in porous media; filtration; seepage
65N12Stability and convergence of numerical methods (BVP of PDE)
65N15Error bounds (BVP of PDE)
65N55Multigrid methods; domain decomposition (BVP of PDE)