1.1. t-norms. A triangular norm (shortly t-norm) is a binary operationT : [0,1]×[0,1]→ [0,1] := I which is commutative, associative, monotone in each place, and has 1 as the unit element. Basic examples are TL : I × I → I , TL(a,b) =Max(a+ b− 1,0) (Łukasiewicz t-norm), TP(a,b) = ab, and TM(a,b) = Min{a,b}. We also mention the following families of tnorms: (i) Sugeno-Weber family (T λ )λ∈(−1,∞),...

In this paper we present a thorough set of numerical experiments to confirm the robustness of several Discontinuous Galerkin (DG) methods proposed for the approximation of Darcy law. We perform fairly twoand three-dimensional tests involving both low and high order approximations. Convergence tests carried out on Cartesian grids as well as on structured and unstructured triangular grids confirm...

We introduce a covolume or MAC-like method for approximating the generalized Stokes problem. Two grids are needed in the discretization; a triangular one for the continuity equation and a quadrilateral one for the momentum equation. The velocity is approximated using nonconforming piecewise linears and the pressure piecewise constants. Error in the L2 norm for the pressure and error in a mesh d...

We present a new method for computing an optimal deformation between two arbitrary surfaces embedded in Euclidean 3-dimensional space. Our main contribution is in building a norm on the space of surfaces via representation by currents of geometric measure theory. Currents are an appropriate choice for representations because they inherit natural transformation properties from differential forms...

In this letter, a new notion of stability is introduced, which called triangular stability. A system triangularly stable if the norm its state vector bounded by decreasing linear function time such that intersection point with axis can be arbitrarily commanded user. Triangular implies prescribed-time stability, means nonlinear converged to zero equilibrium at an arbitrary finite time. controlle...

An algorithm for the automatic reconstruction of triangular mesh surface model from range images is presented. The optimal piecewise linear surface approximation problem is defined as: Given a set S of points uniformly sampled from a bivariate function ƒ(x,y) on a rectangular grid of dimension W×H, find a minimum triangular mesh approximating the surface with vertices anchored at a subset S’ of...

We show that the only possible isolated points in the spectrum of a conservative triangular matrix are its diagonal elements, and that any Hausdorff method corresponding to an absolutely continuous mass function is in the norm closure of the analytic methods. Let oj represent the space of all real and complex sequences and let c (cQ or m) represent the subspace of all convergent sequences (null...

We propose a simple technique that, if combined with algorithms for computing functions of triangular matrices, can make them more efficient. Basically, such consists in specific scaling similarity transformation that reduces the departure from normality matrix, thus decreasing its norm and general function condition number. It easily be extended to non-triangular provided it is involving prior...