A non-polynomial spline (NPS) is an approximation method that relies on the triangular and polynomial parts, so the method has infinite derivatives of the triangular part of the NPS to compensate for the loss of smoothness inherited by the polynomial. In this paper, we propose polynomial-free linear and quadratic spline types to solve fuzzy Volterra integral equations (FVIE) of the 2nd kind with the weakly singular kernel (FVIEWSK) and Abel's type kernel. The linear type algorithm gives four parameters to form a linear spline. In comparison, the quadratic type algorithm gives five parameters to create a quadratic spline, which is more of a credit for the exact solution. These algorithms process kernel singularities with a simple technique. Illustrative examples use MathCad software to deal with upper and lower-bound solutions to fuzzy problems. The method provides a reliable way to ensure that an exact solution is approximated. Also, figures and tables show the potential of the method.
Let R be a commutative ring with identity. A proper ideal I of R is called semimaximal if I is a finite intersection of maximal ideals of R. In this paper we fuzzify this concept to fuzzy ideals of R, where a fuzzy ideal A of R is called semimaximal if A is a finite intersection of fuzzy maximal ideals. Various basic properties are given. Moreover some examples are given to illustrate this concept.
Let R be a commutative ring with unity. In this paper we introduce the notion of chained fuzzy modules as a generalization of chained modules. We investigate several characterizations and properties of this concept
Let R be a commutative ring with unity. In this paper we introduce and study fuzzy distributive modules and fuzzy arithmetical rings as generalizations of (ordinary) distributive modules and arithmetical ring. We give some basic properties about these concepts.
Let R be a commutative ring with unity and an R-submodule N is called semimaximal if and only if
the sufficient conditions of F-submodules to be semimaximal .Also the concepts of (simple , semisimple) F- submodules and quotient F- modules are introduced and given some properties .
Image compression is a serious issue in computer storage and transmission, that simply makes efficient use of redundancy embedded within an image itself; in addition, it may exploit human vision or perception limitations to reduce the imperceivable information Polynomial coding is a modern image compression technique based on modelling concept to remove the spatial redundancy embedded within the image effectively that composed of two parts, the mathematical model and the residual. In this paper, two stages proposed technqies adopted, that starts by utilizing the lossy predictor model along with multiresolution base and thresholding techniques corresponding to first stage. Latter by incorporating the near lossless com
... Show MoreThis paper is concerned with introducing and studying the o-space by using out degree system (resp. i-space by using in degree system) which are the core concept in this paper. In addition, the m-lower approximations, the m-upper approximations and ospace and i-space. Furthermore, we introduce near supraopen (near supraclosed) d. g.'s. Finally, the supra-lower approximation, supraupper approximation, supra-accuracy are defined and some of its properties are investigated.