Search results for "wise"

Weakened acute type condition for tetrahedral triangulations and the discrete maximum principle

2000

We prove that a discrete maximum principle holds for continuous piecewise linear finite element approximations for the Poisson equation with the Dirichlet boundary condition also under a condition of the existence of some obtuse internal angles between faces of terahedra of triangulations of a given space domain. This result represents a weakened form of the acute type condition for the three-dimensional case.

A sharp estimate of the extinction time for the mean curvature flow

2007

We establish a pointwise comparison result for a nonlinear degenerate elliptic Dirichlet problem using an isoperimetric inequality involving the total mean curvature. In particular this result provides a sharp estimate for the extinction time of a class of compact surfaces, wider than the convex one, moving by mean curvature flow. Finally we present numerical experiments to compare our estimate with those known in literature.

Some integral type fixed point theorems in Non-Archimedean Menger PM-Spaces with common property (E.A) and application of functional equations in dyn…

2013

In this paper, we prove some integral type common fixed point theorems for weakly compatible mappings in Non-Archimedean Menger PM-spaces employing common property (E.A). Some examples are furnished which demonstrate the validity of our results. We extend our main result to four finite families of self-mappings employing the notion of pairwise commuting. Moreover, we give an application which supports the usability of our main theorem.

Absolutely continuous functions with values in a Banach space

2017

Abstract Let Ω be an open subset of R n , n > 1 , and let X be a Banach space. We prove that α-absolutely continuous functions f : Ω → X are continuous and differentiable (in some sense) almost everywhere in Ω.

Regular Minimality and Thurstonian-type modeling

2009

Abstract A Thurstonian-type model for pairwise comparisons is any model in which the response (e.g., “they are the same” or “they are different”) to two stimuli being compared depends, deterministically or probabilistically, on the realizations of two randomly varying representations (perceptual images) of these stimuli. The two perceptual images in such a model may be stochastically interdependent but each has to be selectively dependent on its stimulus. It has been previously shown that all possible discrimination probability functions for same–different comparisons can be generated by Thurstonian-type models of the simplest variety, with independent percepts and deterministic decision ru…

When can association graphs admit a causal interpretation?

1994

We discuss essentially linear structures which are adequately represented by association graphs called covariance graphs and concentration graphs. These do not explicitly indicate a process by which data could be generated in a stepwise fashion. Therefore, on their own, they do not suggest a causal interpretation. By contrast, each directed acyclic graph describes such a process and may offer a causal interpretation whenever this process is in agreement with substantive knowledge about causation among the variables under study. We derive conditions and procedures to decide for any given covariance graph or concentration graph whether all their pairwise independencies can be implied by some …

Dichotomies properties on computational complexity of S-packing coloring problems

2015

This work establishes the complexity class of several instances of the S -packing coloring problem: for a graph G , a positive integer k and a nondecreasing list of integers S = ( s 1 , ? , s k ) , G is S -colorable if its vertices can be partitioned into sets S i , i = 1 , ? , k , where each S i is an s i -packing (a set of vertices at pairwise distance greater than s i ). In particular we prove a dichotomy between NP-complete problems and polynomial-time solvable problems for lists of at most four integers.

Invariant measures for piecewise convex transformations of an interval

2002

Error analysis for a special X-spline

1979

Clenshaw and Negus [1] defined the cubic X-spline, and they applied it to an interpolation problem. In the present paper, for the same interpolation problem, an interpolating splinew is considered by combining two specialX-splines. The construction ofw is such that the computational labour for its determination, in the case of piecewise equally spaced knots, is less than that of the conventional cubic splines c . A complete error analysis ofw is done. One of the main results is that, in the case of piecewise equally spaced knots,w ands c have essentially the same error estimates.

On the solutions to 1-Laplacian equation with L1 data

2009

AbstractIn the present paper we study the behaviour, as p goes to 1, of the renormalized solutions to the problems(0.1){−div(|∇up|p−2∇up)=finΩ,up=0on∂Ω, where p>1, Ω is a bounded open set of RN (N⩾2) with Lipschitz boundary and f belongs to L1(Ω). We prove that these renormalized solutions pointwise converge, up to “subsequences,” to a function u. With a suitable definition of solution we also prove that u is a solution to a “limit problem.” Moreover we analyze the situation occurring when more regular data f are considered.