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)
Three-dimensional boundary detection for particle methods. (English) Zbl 1173.76393
Summary: The three-dimensional exposure method for the detection of the boundary of a set of overlapping spheres is presented. Like the two-dimensional version described in a previous paper [G. A. Dilts, Int. J. Numer. Methods Eng. 48, No. 10, 1503–1524 (2000; Zbl 0960.76068)], the three-dimensional algorithm precisely detects void opening or closure, and is optimally suited to the kernel-mediated interactions of smoothed-particle hydrodynamics, although it may be used in any application involving sets of overlapping spheres. The principle idea is to apply the two-dimensional method, on the surface of each candidate boundary sphere, to the circles of intersection with neighboring spheres. As the algorithm finds the exact solution, the quality of detection is independent of particle configuration, in contrast to gradient-based techniques. The observed CPU execution times scale as O(MN ε (Porson)), where M is the number of particles, N is the average number of neighbors of a particle, and ε (Porson) is a problem-dependent constant between 1.6 and 1.7. The time required per particle is comparable to the amount of time required to evaluate a three-dimensional linear moving-least-squares interpolant at a single point.
MSC:
76M28Particle methods and lattice-gas methods (fluid mechanics)
74S30Other numerical methods in solid mechanics
65M99Numerical methods for IVP of PDE