In this work, a weighted H lder function that approximates a Jacobi polynomial which solves the second order singular Sturm-Liouville equation is discussed. This is generally equivalent to the Jacobean translations and the moduli of smoothness. This paper aims to focus on improving methods of approximation and finding the upper and lower estimates for the degree of approximation in weighted H lder spaces by modifying the modulus of continuity and smoothness. Moreover, some properties for the moduli of smoothness with direct and inverse results are considered.
In this paper, the methods of weighted residuals: Collocation Method (CM), Least Squares Method (LSM) and Galerkin Method (GM) are used to solve the thin film flow (TFF) equation. The weighted residual methods were implemented to get an approximate solution to the TFF equation. The accuracy of the obtained results is checked by calculating the maximum error remainder functions (MER). Moreover, the outcomes were examined in comparison with the 4th-order Runge-Kutta method (RK4) and good agreements have been achieved. All the evaluations have been successfully implemented by using the computer system Mathematica®10.
Through this study, the following has been proven, if is an algebraically paranormal operator acting on separable Hilbert space, then satisfies the ( ) property and is also satisfies the ( ) property for all . These results are also achieved for ( ) property. In addition, we prove that for a polaroid operator with finite ascent then after the property ( ) holds for for all.
This paper is concerned with introducing and studying the first new approximation operators using mixed degree system and second new approximation operators using mixed degree system which are the core concept in this paper. In addition, the approximations of graphs using the operators first lower and first upper are accurate then the approximations obtained by using the operators second lower and second upper sincefirst accuracy less then second accuracy. For this reason, we study in detail the properties of second lower and second upper in this paper. Furthermore, we summarize the results for the properties of approximation operators second lower and second upper when the graph G is arbitrary, serial 1, serial 2, reflexive, symmetric, tra
... Show MoreBackground: Prostatic adenocarcinoma is the most widely recognized malignancy in men and the second cause of cancer-related mortality encountered in male patients after lung cancer.
Aim of the study: To assess the diagnostic value of diffusion weighted imaging (DWI) and its quantitative measurement, apparent diffusion coefficient (ADC), in the identification and localization of prostatic cancer compared with T2 weighted image sequence (T2WI).
Type of the study: a prospective analytic study
Patients and methods: forty-one male patients with suspected prostatic cancer were examined by pelvic MRI at the MRI department of the Oncology Teaching Hospital/Medical City in Baghdad
... Show MoreBackground/Aim: Endometrial abnormalities represent a diagnostic challenge due to overlapping imaging features with normal endometrium. Aim of this study was to assess accuracy of dynamic contrast-enhanced and diffusion-weighted magnetic resonance imaging (MRI) in evaluation of endometrial lesions in comparison with T2 and to assess local staging validity and degree of myometrial invasion in malignancy. Methods: Forty patients with abnormal vaginal bleeding or sonographic thickened endometrial were recruited. MRI examination of pelvis was per-formed using 1.5 T scanner with a pelvic array coil. Conventional T1-and T2, dynamic contrast-enhanced (DCE) sequences and diffusion-weighted image (DWI) were performed. Results: Mean age of pa
... Show MoreA graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense related. The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called link or line). A directed graph is a graph in which edges have orientation. A simple graph is a graph that does not have more than one edge between any two vertices and no edge starts and ends at the same vertex. For a simple undirected graph G with order n, and let denotes its complement. Let δ(G), ∆(G) denotes the minimum degree and maximum degree of G respectively. The complement degree polynomial of G is the polynomial CD[G,x]= , where C
... Show More