1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 A Discrete Calculus Analysis of the Keller Box Scheme and a Generalization of the Method to Arbitrary Meshes. V. Subramanian and J. B. Perot

and Applied Analysis 3 for λ 2 cos z, where z ∈ : {z : z ∈ , Im z ≥ 0} and αn, Anm are expressed in terms of an and bn as

SEAWAT is a finite-difference computer code designed to simulate coupled variable-density ground water flow and solute transport. This paper describes a new version of SEAWAT that adds the ability to simultaneously model energy and solute transport. This is necessary for simulating the transport of heat and salinity in coastal aquifers for example. This work extends the equation of state for fl...

Let ∆(α) denote the fractional difference operator. In this paper, we define new difference sequence spaces c0(Γ, ∆(α), u) and c(Γ, ∆(α), u). Also, the β−dual of the spaces c0(Γ, ∆(α), u) and c(Γ, ∆(α), u) are determined and calculated their Schauder basis. Furthermore, we characterize the classes (μ(Γ, ∆(α), u) : λ) for μ ∈ {c0, c} and λ ∈ {c0, c, l ∞, l1} .

In the high frequency regime, the geometrical-optics approximation for the Helmholtz equation with a point source results in an eikonal equation for traveltime and a transport equation for amplitude. Because the point-source traveltime field has an upwind singularity at the source point, all formally high-order finite-difference eikonal solvers exhibit first-order convergence and relatively lar...

AD-field is a field with a derivation or a difference-operator, called D. In a suitable language, the theory of D-fields has a modelcompanion, whose axioms need not distinguish the two cases in which D can fall. The geometric concepts involved in describing these axioms can be used to characterize the existentially closed fields with a derivation and a difference-operator; but the class of thes...

We say that a class of finite structures for a finite signature is r-compressible if each structure G in the class has a first-order description of size at most O(r(|G|)). We show that the class of finite simple groups is log-compressible, and the class of all finite groups is log-compressible. The result relies on the classification of finite simple groups, the bi-interpretability of the small...

In this paper, a new algorithm for edge detection based on fuzzyconcept is suggested. The proposed approach defines dynamic membershipfunctions for different groups of pixels in a 3 by 3 neighborhood of the centralpixel. Then, fuzzy distance and -cut theory are applied to detect the edgemap by following a simple heuristic thresholding rule to produce a thin edgeimage. A large number of experime...