Please use this identifier to cite or link to this item: http://prr.hec.gov.pk/jspui/handle/123456789/17304
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMehmood, Nasir-
dc.date.accessioned2021-09-02T07:58:55Z-
dc.date.available2021-09-02T07:58:55Z-
dc.date.issued2021-
dc.identifier.govdoc23505-
dc.identifier.urihttp://prr.hec.gov.pk/jspui/handle/123456789/17304-
dc.description.abstractGeneralizations of Cyclic Refinements of Jensen’s Inequalities In recent years, the concept of convex functions has been generalized extensively. Applications of convex functions are widely seen in many areas of modern analysis. Convex functions also have significant relation with the theory of inequalities and many useful inequalities are the result of the applications of convex functions. The Jensen's inequality has tremendous implications in many fields of modern analysis. It helps computing useful upper bounds for several entropic measures used in information theory. We consider discrete and continuous cyclic refinements of Jensen's inequality and extend them from convex to higher order convex function by using new Green functions introduced by us and employing different interpolating polynomials and identities. We formulate monotonicity of the linear functionals for n convex functions at a point. We calculate some new Grüss and Ostrowski type bounds. As an application of our obtained results we give new bounds for Shannon, Relative and Zipf-Mandelbrot entropies.en_US
dc.description.sponsorshipHigher Education Commission Pakistanen_US
dc.language.isoenen_US
dc.publisherCOMSATS University, Islamabaden_US
dc.subjectPhysical Sciencesen_US
dc.subjectMathematicsen_US
dc.titleGeneralization of Cycle Refinements of Jensen's Inequalitiesen_US
dc.typeThesisen_US
Appears in Collections:PhD Thesis of All Public / Private Sector Universities / DAIs.

Files in This Item:
File Description SizeFormat 
Nasir Mehmood Maths 2021 comsats isb.pdfPhd. Thesis3.2 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.