{"title":"MODIFIED INTUITIONISTIC M-FUZZY METRIC SPACE AND SOME\u0000 COMMON FIXED-POINT THEOREMS","authors":"Sharma Pranjali, Dhar Diwan Shailesh","doi":"10.26634/jmat.8.3.16954","DOIUrl":"https://doi.org/10.26634/jmat.8.3.16954","url":null,"abstract":"","PeriodicalId":297202,"journal":{"name":"i-manager’s Journal on Mathematics","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123517974","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.26634/jmat.11.2.19206
Atsi Kaze, Adiku Lydia, Yarima Namuma, G. Kumleng
In this work, a second derivative block method derived from a family of modified backward differentiation formula (bdf) type for solving stiff ordinary differential equations has been constructed. Choosing a step number, k = 4, four discrete methods with uniform order 7 are obtained using the multistep collocation approach. The stability properties of the new method have been established. The solutions of two problems have been computed and compared with the corresponding exact and other existing solutions. Solutions are presented on graphs and the associated absolute errors are compared in tables.
{"title":"A Second Derivative Block Method Derived from a Family of Modified Backward Differentiation Formula (BDF) Type for Solving Stiff Ordinary Differential Equations","authors":"Atsi Kaze, Adiku Lydia, Yarima Namuma, G. Kumleng","doi":"10.26634/jmat.11.2.19206","DOIUrl":"https://doi.org/10.26634/jmat.11.2.19206","url":null,"abstract":"In this work, a second derivative block method derived from a family of modified backward differentiation formula (bdf) type for solving stiff ordinary differential equations has been constructed. Choosing a step number, k = 4, four discrete methods with uniform order 7 are obtained using the multistep collocation approach. The stability properties of the new method have been established. The solutions of two problems have been computed and compared with the corresponding exact and other existing solutions. Solutions are presented on graphs and the associated absolute errors are compared in tables.","PeriodicalId":297202,"journal":{"name":"i-manager’s Journal on Mathematics","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116597712","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.26634/jmat.10.1.17980
Shahzad Mohammad
{"title":"REDUCED ORDER ANTI-SYNCHRONIZATION: A COMPARISON OF\u0000SIMULATION BETWEEN MATHEMATICA AND MATLAB","authors":"Shahzad Mohammad","doi":"10.26634/jmat.10.1.17980","DOIUrl":"https://doi.org/10.26634/jmat.10.1.17980","url":null,"abstract":"","PeriodicalId":297202,"journal":{"name":"i-manager’s Journal on Mathematics","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133273332","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.26634/jmat.11.1.18452
K. Ravibabu, Rao Ch. Srinivasa, Naidu CH. Raghavendra
In this paper, we establish some results on the existence and uniqueness of common fixed point theorems in partially ordered Ab -metric spaces. Examples and application also are presented in support of the obtained results.
{"title":"Common fixed point theorems in ordered ab–metric spaces","authors":"K. Ravibabu, Rao Ch. Srinivasa, Naidu CH. Raghavendra","doi":"10.26634/jmat.11.1.18452","DOIUrl":"https://doi.org/10.26634/jmat.11.1.18452","url":null,"abstract":"In this paper, we establish some results on the existence and uniqueness of common fixed point theorems in partially ordered Ab -metric spaces. Examples and application also are presented in support of the obtained results.","PeriodicalId":297202,"journal":{"name":"i-manager’s Journal on Mathematics","volume":"35 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116615766","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.26634/jmat.10.2.18330
Rao T Srinivasa
{"title":"TOPOLOGICAL PROGRESSIVE CONES","authors":"Rao T Srinivasa","doi":"10.26634/jmat.10.2.18330","DOIUrl":"https://doi.org/10.26634/jmat.10.2.18330","url":null,"abstract":"","PeriodicalId":297202,"journal":{"name":"i-manager’s Journal on Mathematics","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121698555","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.26634/jmat.11.1.18668
Prabhavati B. S. Surya, V. Ravindranath
This paper proposes a simple method to find an optimum and efficient basic solution to bi-objective transportation problem (BOTP) using weighted goal programming approach. Preferential weights for the goals (objectives) are derived from analytic hierarchy process (AHP). Solution obtained by the proposed approach has been found to be the nearest basic feasible solution to the ideal solution in terms of Euclidean distance measure. The method is illustrated with numerical examples taken from the literature and solutions compared in terms of the number of iterations, computational complexity and proximity to the ideal solution. The modified minimum supply and demand method is used to obtain initial basic feasible solutions that are found to be optimal, and hence this method is computationally simpler compared to other linear programming methods. It has been observed that weighted objective function optimization yields optimal efficient BOTP solutions using appropriate weights for the objective functions.
{"title":"A simple method to find optimum efficient basic solutions to bi-objective transportation problems","authors":"Prabhavati B. S. Surya, V. Ravindranath","doi":"10.26634/jmat.11.1.18668","DOIUrl":"https://doi.org/10.26634/jmat.11.1.18668","url":null,"abstract":"This paper proposes a simple method to find an optimum and efficient basic solution to bi-objective transportation problem (BOTP) using weighted goal programming approach. Preferential weights for the goals (objectives) are derived from analytic hierarchy process (AHP). Solution obtained by the proposed approach has been found to be the nearest basic feasible solution to the ideal solution in terms of Euclidean distance measure. The method is illustrated with numerical examples taken from the literature and solutions compared in terms of the number of iterations, computational complexity and proximity to the ideal solution. The modified minimum supply and demand method is used to obtain initial basic feasible solutions that are found to be optimal, and hence this method is computationally simpler compared to other linear programming methods. It has been observed that weighted objective function optimization yields optimal efficient BOTP solutions using appropriate weights for the objective functions.","PeriodicalId":297202,"journal":{"name":"i-manager’s Journal on Mathematics","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130150756","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.26634/jmat.11.1.18511
E. Zill, Ul Rahman Jamshaid, S. Muhammad, Anjum Naveed
Securing data in this era of technology is the most challenging task. Cryptography is a practice of different techniques and methodologies for data confidentiality, data integrity, authentication, and non-repudiation. Many mathematical techniques are being used in cryptography from ancient times. The Laplace integral transforms and its inverse forms gain significant importance to design cryptographic methods. In this work, we propose cryptography methodology based on Natural and Elzaki transform and this study comprises a unique structure that provides Laplace-Elzaki and Sumudu-Elzaki methodologies. A generalized version of Laplace and Sumudu transform is also presented.
{"title":"Cryptographic method based on natural-elzaki transform","authors":"E. Zill, Ul Rahman Jamshaid, S. Muhammad, Anjum Naveed","doi":"10.26634/jmat.11.1.18511","DOIUrl":"https://doi.org/10.26634/jmat.11.1.18511","url":null,"abstract":"Securing data in this era of technology is the most challenging task. Cryptography is a practice of different techniques and methodologies for data confidentiality, data integrity, authentication, and non-repudiation. Many mathematical techniques are being used in cryptography from ancient times. The Laplace integral transforms and its inverse forms gain significant importance to design cryptographic methods. In this work, we propose cryptography methodology based on Natural and Elzaki transform and this study comprises a unique structure that provides Laplace-Elzaki and Sumudu-Elzaki methodologies. A generalized version of Laplace and Sumudu transform is also presented.","PeriodicalId":297202,"journal":{"name":"i-manager’s Journal on Mathematics","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131645796","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"REDUCED ORDER SYNCHRONIZATION: A COMPARISON OF\u0000 SIMULATION BETWEEN MATHEMATICA & MATLAB","authors":"Shahzad Mohammad","doi":"10.26634/jmat.8.4.17548","DOIUrl":"https://doi.org/10.26634/jmat.8.4.17548","url":null,"abstract":"","PeriodicalId":297202,"journal":{"name":"i-manager’s Journal on Mathematics","volume":"1997 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123548369","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.26634/jmat.11.2.19035
Gupta Reshu
The model of temperature profile in the flow of non-Newtonian second-order fluid, flowing in an annulus, is investigated. The boundary of annulus is considered porous. Appropriate similarity transformation is used to convert non-linear PDEs into non-linear ODEs. The obtained differential equations are solved numerically. The nature of the temperature profile is presented graphically for the various physical parameters.
{"title":"Numerical Solution of Temperature Profile in Annulus","authors":"Gupta Reshu","doi":"10.26634/jmat.11.2.19035","DOIUrl":"https://doi.org/10.26634/jmat.11.2.19035","url":null,"abstract":"The model of temperature profile in the flow of non-Newtonian second-order fluid, flowing in an annulus, is investigated. The boundary of annulus is considered porous. Appropriate similarity transformation is used to convert non-linear PDEs into non-linear ODEs. The obtained differential equations are solved numerically. The nature of the temperature profile is presented graphically for the various physical parameters.","PeriodicalId":297202,"journal":{"name":"i-manager’s Journal on Mathematics","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122047391","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
V. Venkata Kumar, M. Sambasiva Rao, S. KALESHA VALI
{"title":"ω-FILTERS OF COMMUTATIVE BE-ALGEBRAS","authors":"V. Venkata Kumar, M. Sambasiva Rao, S. KALESHA VALI","doi":"10.26634/jmat.9.2.17868","DOIUrl":"https://doi.org/10.26634/jmat.9.2.17868","url":null,"abstract":"","PeriodicalId":297202,"journal":{"name":"i-manager’s Journal on Mathematics","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132072638","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：