Pub Date : 2018-01-01DOI: 10.4172/2168-9679.1000405
H. Dm, M. Iz, Abdulqader Aj
This paper is continues to study of a new type of closed maps which is called αrps-closed map. As well as, we give and study other types of αrps-closed maps which are (αrps-closed maps, strongly αrps-closed maps and almost αrps-closed maps) in topological spaces. Also, we will study the relation between these mappings and discussion some properties of these maps.
{"title":"On Some Types of αrps- Closed Maps","authors":"H. Dm, M. Iz, Abdulqader Aj","doi":"10.4172/2168-9679.1000405","DOIUrl":"https://doi.org/10.4172/2168-9679.1000405","url":null,"abstract":"This paper is continues to study of a new type of closed maps which is called αrps-closed map. As well as, we give and study other types of αrps-closed maps which are (αrps-closed maps, strongly αrps-closed maps and almost αrps-closed maps) in topological spaces. Also, we will study the relation between these mappings and discussion some properties of these maps.","PeriodicalId":15007,"journal":{"name":"Journal of Applied and Computational Mathematics","volume":"7 1","pages":"1-9"},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82035418","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 : 2018-01-01DOI: 10.4172/2168-9679.1000391
Abdulraheem Mz, K. Mohammad
The purpose of this work is to solve Linear Programming (LP) problems using LU factorization. LU method is based on the fact that a square matrix can be factorized into the product of unit lower triangular matrix (L) and upper triangular matrix (U), and the direct solution was obtained without iterations. Three different problem cases were considered and solved using step-by-step calculations as well as using MATLAB. Results show this method is superior than the traditional simplex method with cases of cycling.
{"title":"LU-Decomposition Computerized Method to Solve Linear Programming Problems","authors":"Abdulraheem Mz, K. Mohammad","doi":"10.4172/2168-9679.1000391","DOIUrl":"https://doi.org/10.4172/2168-9679.1000391","url":null,"abstract":"The purpose of this work is to solve Linear Programming (LP) problems using LU factorization. LU method is based on the fact that a square matrix can be factorized into the product of unit lower triangular matrix (L) and upper triangular matrix (U), and the direct solution was obtained without iterations. Three different problem cases were considered and solved using step-by-step calculations as well as using MATLAB. Results show this method is superior than the traditional simplex method with cases of cycling.","PeriodicalId":15007,"journal":{"name":"Journal of Applied and Computational Mathematics","volume":"51 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77306225","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 : 2018-01-01DOI: 10.4172/2168-9679.1000409
Nahon Yj
The purpose of my paper is to bring a method for solving polynomial equations using basic algebra and series and also using combinatorics. A series which converges to the solutions of polynomial equations. The contribution of this method is that it leads directly to precise results to find the roots of a polynomial equation of any degree starting from second degree to infinity and also for the solving of radicals since radicals are a particular type of polynomial equations for example to find the square root of 2 sends to solve the equation x2=2. A general formula for the series which converges to the solutions of polynomial equations. For complex solutions we write for a polynomial P(x), P(a+bi)=P(a-bi)=0 and to solve this separately for imaginary part and real part of the solution sends to solve for regular polynomial equations at one variable so we can use the method which is developed to find the solutions.
{"title":"Method for Solving Polynomial Equations","authors":"Nahon Yj","doi":"10.4172/2168-9679.1000409","DOIUrl":"https://doi.org/10.4172/2168-9679.1000409","url":null,"abstract":"The purpose of my paper is to bring a method for solving polynomial equations using basic algebra and series and also using combinatorics. A series which converges to the solutions of polynomial equations. The contribution of this method is that it leads directly to precise results to find the roots of a polynomial equation of any degree starting from second degree to infinity and also for the solving of radicals since radicals are a particular type of polynomial equations for example to find the square root of 2 sends to solve the equation x2=2. A general formula for the series which converges to the solutions of polynomial equations. For complex solutions we write for a polynomial P(x), P(a+bi)=P(a-bi)=0 and to solve this separately for imaginary part and real part of the solution sends to solve for regular polynomial equations at one variable so we can use the method which is developed to find the solutions.","PeriodicalId":15007,"journal":{"name":"Journal of Applied and Computational Mathematics","volume":"31 1","pages":"1-12"},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74706692","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 : 2018-01-01DOI: 10.4172/2168-9679.1000423
P. Dhere
The main aim of this paper is to understand the information to numerical computing. In this paper we solve some examples of numerical computing. The numerical computational techniques are the technique by which mathematical problems are formulated and they can be solved with arithmetic operations. Those techniques are basically numerical methods. Numerical method supports the solution of almost every type of problem. The numerical methods are classified depending upon the type of the problem.
{"title":"Introduction to Numerical Computing","authors":"P. Dhere","doi":"10.4172/2168-9679.1000423","DOIUrl":"https://doi.org/10.4172/2168-9679.1000423","url":null,"abstract":"The main aim of this paper is to understand the information to numerical computing. In this paper we solve some examples of numerical computing. The numerical computational techniques are the technique by which mathematical problems are formulated and they can be solved with arithmetic operations. Those techniques are basically numerical methods. Numerical method supports the solution of almost every type of problem. The numerical methods are classified depending upon the type of the problem.","PeriodicalId":15007,"journal":{"name":"Journal of Applied and Computational Mathematics","volume":"23 1","pages":"1-3"},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85275811","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 : 2018-01-01DOI: 10.4172/2168-9679.1000411
W. Khan, T. Gul
The main objective of this work is to study the performance of the boundary layer flow considering non-Newtonian Walter’s B fluid over the surface of an unstable cylinder to protect the surface of the cylinder from external heating and cooling. The Soret and Dufour properties with heat and mass transmission have been encountered in the flow field. Using the appropriate similarity transformations the leading PDE’s for the flow field have been altered into high ordered non-linear coupled ODE’s. Series solutions of the subsequent problem are computed by using controlling procedure homotopy analysis method. The properties of the included physical parameters in the problem, like Reynolds number, Walter’s B fluid parameter, Prandtl number, Schmidt numbers, Dufour and Soret numbers have been illustrated. The behavior of Skin friction, Sherwood number and local Nusselt number have been described numerically for the dynamic constraints of the problem and the comparison of these physical parameters have been displayed with the experimental consequences in the existent literature. The optimal convergence of the applied method has been patterned by plotting h-curves. Finally, the results, obtained from HAM, have been justified through numerical (ND-Solve) method and tabulated comparison. Citation: Khan W, Gul T (2018) The Thin Film Flow of Walter’s B Fluid over the Surface of a Stretching Cylinder with Heat and Mass Transfer Analysis. J Appl Computat Math 7: 411. doi: 10.4172/2168-9679.1000411
本工作的主要目的是研究考虑非牛顿沃尔特B流体在不稳定圆柱体表面上保护圆柱体表面免受外部加热和冷却的边界层流动的性能。在流场中遇到了传热传质的Soret和Dufour性质。通过适当的相似变换，将流场的前导偏微分方程转化为高阶非线性耦合偏微分方程。利用控制过程同伦分析法计算了后续问题的级数解。给出了问题中包含的物理参数的性质，如雷诺数、Walter’s B流体参数、普朗特数、施密特数、杜福尔数和索雷特数。本文用数值方法描述了该问题的动力学约束的Skin摩擦行为、Sherwood数和局部Nusselt数，并将这些物理参数与已有文献的实验结果进行了比较。通过绘制h曲线对所应用方法的最优收敛性进行了图示。最后，通过数值(ND-Solve)方法和制表比较验证了从HAM得到的结果。引用本文:Khan W, Gul T (2018) Walter 's B流体在拉伸圆柱体表面的薄膜流动及其传热传质分析。[J]计算机数学，第7卷第4节。doi: 10.4172 / 2168 - 9679.1000411
{"title":"The Thin Film Flow of Walter’s B Fluid over the Surface of a Stretching Cylinder with Heat and Mass Transfer Analysis","authors":"W. Khan, T. Gul","doi":"10.4172/2168-9679.1000411","DOIUrl":"https://doi.org/10.4172/2168-9679.1000411","url":null,"abstract":"The main objective of this work is to study the performance of the boundary layer flow considering non-Newtonian Walter’s B fluid over the surface of an unstable cylinder to protect the surface of the cylinder from external heating and cooling. The Soret and Dufour properties with heat and mass transmission have been encountered in the flow field. Using the appropriate similarity transformations the leading PDE’s for the flow field have been altered into high ordered non-linear coupled ODE’s. Series solutions of the subsequent problem are computed by using controlling procedure homotopy analysis method. The properties of the included physical parameters in the problem, like Reynolds number, Walter’s B fluid parameter, Prandtl number, Schmidt numbers, Dufour and Soret numbers have been illustrated. The behavior of Skin friction, Sherwood number and local Nusselt number have been described numerically for the dynamic constraints of the problem and the comparison of these physical parameters have been displayed with the experimental consequences in the existent literature. The optimal convergence of the applied method has been patterned by plotting h-curves. Finally, the results, obtained from HAM, have been justified through numerical (ND-Solve) method and tabulated comparison. Citation: Khan W, Gul T (2018) The Thin Film Flow of Walter’s B Fluid over the Surface of a Stretching Cylinder with Heat and Mass Transfer Analysis. J Appl Computat Math 7: 411. doi: 10.4172/2168-9679.1000411","PeriodicalId":15007,"journal":{"name":"Journal of Applied and Computational Mathematics","volume":"2 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82833059","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 : 2018-01-01DOI: 10.4172/2168-9679.1000378
H. Rafat
Coloring graph is a good branch in graph theory and has a lot of application in our life. So, in this paper we have defined a new type of folding. Also, we have found strong relations between this folding of graph and its chromatic number. Theorems governing the relations to be obtained. Traffic lights problem here was solved.
{"title":"The Relation between Centre Folding of Graph and its Chromatic Number","authors":"H. Rafat","doi":"10.4172/2168-9679.1000378","DOIUrl":"https://doi.org/10.4172/2168-9679.1000378","url":null,"abstract":"Coloring graph is a good branch in graph theory and has a lot of application in our life. So, in this paper we have defined a new type of folding. Also, we have found strong relations between this folding of graph and its chromatic number. Theorems governing the relations to be obtained. Traffic lights problem here was solved.","PeriodicalId":15007,"journal":{"name":"Journal of Applied and Computational Mathematics","volume":"42 1","pages":"1-3"},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90937986","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 : 2018-01-01DOI: 10.4172/2168-9679.1000375
Elkholy Em, Mohamed Ha
In this paper, we studied the very cost effective graph property for the join graph of two graphs. In general this is may or may not be a very cost effective graph. We obtained the conditions for the join graph of two graphs to be a very cost effective graph. First we proved that the join graph Pn∨Pm of path graphs is very cost effective graph if n+m is an even number and is not if n+m is an odd number. Then we proved that the join graph of any two cycle graphs Cn and Cm where n, m are both odd is very cost effective, and the join graph Pn∨Cn is a very cost effective graph if n is an odd number. Also we proved that the join graph G1∨G2 of two very cost effective graphs G1 and G2 is a very cost effective graph if n(G1) + n(G2) is even. Finally we proved that the graph folding of the join graph of two very cost effective graphs not always very cost effective but this will be the case if the sum of the numbers of the vertices in the image of the graph folding is even.
{"title":"The Very Cost Effective Graph Folding of the Join of Two Graphs","authors":"Elkholy Em, Mohamed Ha","doi":"10.4172/2168-9679.1000375","DOIUrl":"https://doi.org/10.4172/2168-9679.1000375","url":null,"abstract":"In this paper, we studied the very cost effective graph property for the join graph of two graphs. In general this is may or may not be a very cost effective graph. We obtained the conditions for the join graph of two graphs to be a very cost effective graph. First we proved that the join graph Pn∨Pm of path graphs is very cost effective graph if n+m is an even number and is not if n+m is an odd number. Then we proved that the join graph of any two cycle graphs Cn and Cm where n, m are both odd is very cost effective, and the join graph Pn∨Cn is a very cost effective graph if n is an odd number. Also we proved that the join graph G1∨G2 of two very cost effective graphs G1 and G2 is a very cost effective graph if n(G1) + n(G2) is even. Finally we proved that the graph folding of the join graph of two very cost effective graphs not always very cost effective but this will be the case if the sum of the numbers of the vertices in the image of the graph folding is even.","PeriodicalId":15007,"journal":{"name":"Journal of Applied and Computational Mathematics","volume":"220 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79473666","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 : 2018-01-01DOI: 10.4172/2168-9679.1000412
A. Rd, A. A., Rehman A, Qamar S
A weighted essentially non-oscillatory (WENO) finite volume scheme is extended to approximate the model of dusty-gas flow numerically. We use a WENO scheme of the fifth-order for the spatial reconstruction and a monotone numerical Lax-Friedrichs flux to upwind the fluxes. A 3rd-order total variation diminishing (TVD) Runge-Kutta algorithm is to be utilized to march the solution in time. In low density flows, the proposed numerical scheme effectively handles the contact discontinuities and more interestingly it sustains the positivity of flow variables. Furthermore, the proposed numerical scheme shows no spurious oscillations where shock waves and interfaces interact. Several one-dimensional Riemann problems are considered to analyse the accuracy of suggested numerical scheme. For validation, we compare the solutions generated by WENO-scheme with the solutions generated by well known central-upwind scheme and analytical solutions available for the model of dusty-gas flow. Citation: Aslam RD, Ali A, Rehman A, Qamar S (2018) Application of Weighted Essentially Non-Oscillatory Scheme to Solve the Dusty-Gas Flow Model. J Appl Computat Math 7: 412. doi: 10.4172/2168-9679.1000412
将加权非振荡(WENO)有限体积格式推广到尘埃-气体流动模型的数值近似。我们使用五阶WENO格式进行空间重建，并使用单调数值Lax-Friedrichs通量来逆风通量。采用三阶全变分递减(TVD)龙格-库塔算法，实现求解的及时推进。在低密度流动中，所提出的数值格式有效地处理了接触不连续，更有趣的是它保持了流动变量的正性。此外，所提出的数值格式显示激波和界面相互作用时没有伪振荡。考虑了几个一维黎曼问题，分析了所建议数值格式的精度。为了验证，我们将weno方案生成的解与众所周知的中心迎风方案生成的解以及粉尘-气体流动模型的解析解进行了比较。引用本文:Aslam RD, Ali A, Rehman A, Qamar S(2018)加权基本非振荡格式在尘-气流动模型中的应用。[J]计算机数学，7:412。doi: 10.4172 / 2168 - 9679.1000412
{"title":"Application of Weighted Essentially Non-Oscillatory Scheme to Solve the Dusty-Gas Flow Model","authors":"A. Rd, A. A., Rehman A, Qamar S","doi":"10.4172/2168-9679.1000412","DOIUrl":"https://doi.org/10.4172/2168-9679.1000412","url":null,"abstract":"A weighted essentially non-oscillatory (WENO) finite volume scheme is extended to approximate the model of dusty-gas flow numerically. We use a WENO scheme of the fifth-order for the spatial reconstruction and a monotone numerical Lax-Friedrichs flux to upwind the fluxes. A 3rd-order total variation diminishing (TVD) Runge-Kutta algorithm is to be utilized to march the solution in time. In low density flows, the proposed numerical scheme effectively handles the contact discontinuities and more interestingly it sustains the positivity of flow variables. Furthermore, the proposed numerical scheme shows no spurious oscillations where shock waves and interfaces interact. Several one-dimensional Riemann problems are considered to analyse the accuracy of suggested numerical scheme. For validation, we compare the solutions generated by WENO-scheme with the solutions generated by well known central-upwind scheme and analytical solutions available for the model of dusty-gas flow. Citation: Aslam RD, Ali A, Rehman A, Qamar S (2018) Application of Weighted Essentially Non-Oscillatory Scheme to Solve the Dusty-Gas Flow Model. J Appl Computat Math 7: 412. doi: 10.4172/2168-9679.1000412","PeriodicalId":15007,"journal":{"name":"Journal of Applied and Computational Mathematics","volume":"222 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91305864","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 : 2018-01-01DOI: 10.4172/2168-9679.1000397
Darwish H, Lashin Abd AM, Sowileh S
In the present investigation, we introduce a new class k-A¨C(β)(λ;γ)of analytic functions in the open unit disc U with negative coefficients. The object of the present paper is to determine coefficients estimates, neighbourhoods and partial sums for functions f(z) belonging to this class.
{"title":"On Neighbourhood and Partial Sums of a Certain Subclasses of Analytic Functions with Respect to β-Symmetric Points","authors":"Darwish H, Lashin Abd AM, Sowileh S","doi":"10.4172/2168-9679.1000397","DOIUrl":"https://doi.org/10.4172/2168-9679.1000397","url":null,"abstract":"In the present investigation, we introduce a new class k-A¨C(β)(λ;γ)of analytic functions in the open unit disc U with negative coefficients. The object of the present paper is to determine coefficients estimates, neighbourhoods and partial sums for functions f(z) belonging to this class.","PeriodicalId":15007,"journal":{"name":"Journal of Applied and Computational Mathematics","volume":"56 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88977912","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 : 2018-01-01DOI: 10.4172/2168-9679.1000413
A. Devika, R. Vani
{"title":"On πg*β-Closed Sets in Topological Spaces","authors":"A. Devika, R. Vani","doi":"10.4172/2168-9679.1000413","DOIUrl":"https://doi.org/10.4172/2168-9679.1000413","url":null,"abstract":"","PeriodicalId":15007,"journal":{"name":"Journal of Applied and Computational Mathematics","volume":"6 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90604315","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
扫码关注我们
求助内容：
应助结果提醒方式：