. In this work, we tried to find the inverse coefficient in the Euler problem with over determination conditions. It showed the existence, stability of the solution by iteration method and linearization method was used for this problem in numerical part. Also two examples are presented with figures.
{"title":"Solution of Inverse Euler-Bernoulli Problem with Integral Overdetermination and Periodic Boundary Conditions","authors":"İ. Bağlan, F. Kanca, V. Mishra","doi":"10.52547/ijmsi.17.1.191","DOIUrl":"https://doi.org/10.52547/ijmsi.17.1.191","url":null,"abstract":". In this work, we tried to find the inverse coefficient in the Euler problem with over determination conditions. It showed the existence, stability of the solution by iteration method and linearization method was used for this problem in numerical part. Also two examples are presented with figures.","PeriodicalId":43670,"journal":{"name":"Iranian Journal of Mathematical Sciences and Informatics","volume":" ","pages":""},"PeriodicalIF":0.5,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46157825","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}
. An ( n,r )-arc is a set of n points of a projective plane such that some r , but no r +1 of them, are collinear. The maximum size of an ( n,r )-arc in PG(2 ,q ) is denoted by m r (2 ,q ). In this paper we present a new (184 , 12)-arc in PG(2 , 17) , a new (244 , 14)-arc and a new (267 , 15)-arc in PG(2 , 19) .
{"title":"New Large (n, r)-arcs in PG(2, q)","authors":"R. Daskalov","doi":"10.52547/ijmsi.17.1.125","DOIUrl":"https://doi.org/10.52547/ijmsi.17.1.125","url":null,"abstract":". An ( n,r )-arc is a set of n points of a projective plane such that some r , but no r +1 of them, are collinear. The maximum size of an ( n,r )-arc in PG(2 ,q ) is denoted by m r (2 ,q ). In this paper we present a new (184 , 12)-arc in PG(2 , 17) , a new (244 , 14)-arc and a new (267 , 15)-arc in PG(2 , 19) .","PeriodicalId":43670,"journal":{"name":"Iranian Journal of Mathematical Sciences and Informatics","volume":" ","pages":""},"PeriodicalIF":0.5,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46964321","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}
. In this paper, we study the decomposition of semirings with a semilattice additive reduct. For, we introduce the notion of principal left k -radicals Λ( a ) = { x ∈ S | a l −→ ∞ x } induced by the transitive closure l −→ ∞ of the relation l −→ which induce the equivalence relation λ . Again non-transitivity of l −→ yields an expanding family { l −→ n } of binary relations which associate subsets Λ n ( a ) for all a ∈ S , which again induces an equivalence relation λ n . We also define λ ( λ n )-simple semirings, and characterize the semirings which are distributive lattices of λ ( λ n )-simple semirings.
{"title":"Distributive Lattices of λ-simple Semirings","authors":"T. Mondal","doi":"10.52547/ijmsi.17.1.47","DOIUrl":"https://doi.org/10.52547/ijmsi.17.1.47","url":null,"abstract":". In this paper, we study the decomposition of semirings with a semilattice additive reduct. For, we introduce the notion of principal left k -radicals Λ( a ) = { x ∈ S | a l −→ ∞ x } induced by the transitive closure l −→ ∞ of the relation l −→ which induce the equivalence relation λ . Again non-transitivity of l −→ yields an expanding family { l −→ n } of binary relations which associate subsets Λ n ( a ) for all a ∈ S , which again induces an equivalence relation λ n . We also define λ ( λ n )-simple semirings, and characterize the semirings which are distributive lattices of λ ( λ n )-simple semirings.","PeriodicalId":43670,"journal":{"name":"Iranian Journal of Mathematical Sciences and Informatics","volume":" ","pages":""},"PeriodicalIF":0.5,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46943070","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}
. A µ -way G -trade ( µ ≥ 2) consists of µ disjoint decompositions of some simple (underlying) graph H into copies of a graph G. The number of copies of the graph G in each of the decompositions is the volume of the G -trade and denoted by s. In this paper, we determine all values s for which there exists a µ -way K 1 ,m -trade of volume s for underlying graph H = K 2 m, 2 m and H = K 2 m .
． µ—找出克贸易(µ≥2)由µ分离一些简单的(潜在)的分解图H进一个图G的多个拷贝,拷贝的数量每一个图G的分解是G贸易的体积,用s。在本文中,我们确定年代的所有值存在一个µ方法K 1 m的体积年代贸易基本图H = K 2 m, 2 m和H = K 2 m。
{"title":"On the Volume of µ-way G-trade","authors":"N. Soltankhah, N. Khademian","doi":"10.52547/ijmsi.17.1.153","DOIUrl":"https://doi.org/10.52547/ijmsi.17.1.153","url":null,"abstract":". A µ -way G -trade ( µ ≥ 2) consists of µ disjoint decompositions of some simple (underlying) graph H into copies of a graph G. The number of copies of the graph G in each of the decompositions is the volume of the G -trade and denoted by s. In this paper, we determine all values s for which there exists a µ -way K 1 ,m -trade of volume s for underlying graph H = K 2 m, 2 m and H = K 2 m .","PeriodicalId":43670,"journal":{"name":"Iranian Journal of Mathematical Sciences and Informatics","volume":" ","pages":""},"PeriodicalIF":0.5,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47558676","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}
. Let R be a commutative ring with identity. A proper submodule N of an R -module M is an n-submodule if rm ∈ N ( r ∈ R,m ∈ M ) with r / ∈ (cid:112) Ann R ( M ), then m ∈ N . A number of results concerning n-submodules are given. For example, we give other characterizations of n-submodules. Also various properties of n-submodules are considered.
． 让我们和身份一起成为一个交流的圈子。A非常之submodule N R -module M是一个n-submodule如果罗∈N (R∈R, M∈)和R / R∈(cid: 112)安(),然后M∈N。许多常见的协奏曲都被给予了。例如，我们提供其他形式的n子模块。n-子模的各种性质也被考虑在内。
{"title":"n-submodules","authors":"M. Ahmadi, J. Moghaderi","doi":"10.52547/ijmsi.17.1.177","DOIUrl":"https://doi.org/10.52547/ijmsi.17.1.177","url":null,"abstract":". Let R be a commutative ring with identity. A proper submodule N of an R -module M is an n-submodule if rm ∈ N ( r ∈ R,m ∈ M ) with r / ∈ (cid:112) Ann R ( M ), then m ∈ N . A number of results concerning n-submodules are given. For example, we give other characterizations of n-submodules. Also various properties of n-submodules are considered.","PeriodicalId":43670,"journal":{"name":"Iranian Journal of Mathematical Sciences and Informatics","volume":" ","pages":""},"PeriodicalIF":0.5,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41914463","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}
. This paper establishes a study on some important latest innovations in the uniqueness of solution for Caputo fractional Volterra-Fredholm integro-differential equations. To apply this, the study uses Banach contraction principle and Bihari’s inequality. A wider applicabil-ity of these techniques are based on their reliability and reduction in the size of the mathematical work.
{"title":"Some New Uniqueness Results of Solutions for Fractional Volterra-Fredholm Integro-Differential Equations","authors":"A. Hamoud, K. Ghadle","doi":"10.52547/ijmsi.17.1.135","DOIUrl":"https://doi.org/10.52547/ijmsi.17.1.135","url":null,"abstract":". This paper establishes a study on some important latest innovations in the uniqueness of solution for Caputo fractional Volterra-Fredholm integro-differential equations. To apply this, the study uses Banach contraction principle and Bihari’s inequality. A wider applicabil-ity of these techniques are based on their reliability and reduction in the size of the mathematical work.","PeriodicalId":43670,"journal":{"name":"Iranian Journal of Mathematical Sciences and Informatics","volume":" ","pages":""},"PeriodicalIF":0.5,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46463276","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 : 2021-12-31DOI: 10.46754/jmsi.2021.12.002
Rehana Thalib, Maharani A. Bakar, See G. BIN, Lee Y. YEE, Yong S. XIA, N. Mohamed
This study investigates the combination of finite difference method (FDM) and the stabilized Lanczos method to solve various partial differential equation (PDE) problems. This combination is wrapped in the algorithms called hybrid FDMRMEIEMLA and hybrid FDM-RLMinRes. FDM is the discretization method which converts the PDEs into algebraic formula, whereas both RMEIEMLA and RLMinRes are known as the stabilized Lanczos methods in solving largescale problems of SLEs. Their hybrids enable us to find the solutions of PDE problems accurately. There are at least three types of PDEs solved in this study, namely Helmholtz, wave, and heat equations. The convergence rate of our methods computed using the residual norms || b - Axk ||. Numerical results showed that our proposed methods performed well in solving the various PDEs with small residual norms.
{"title":"HYBRID FDM-STABILIZED LANCZOS-TYPE IN SOLVING PDE PROBLEMS","authors":"Rehana Thalib, Maharani A. Bakar, See G. BIN, Lee Y. YEE, Yong S. XIA, N. Mohamed","doi":"10.46754/jmsi.2021.12.002","DOIUrl":"https://doi.org/10.46754/jmsi.2021.12.002","url":null,"abstract":"This study investigates the combination of finite difference method (FDM) and the stabilized Lanczos method to solve various partial differential equation (PDE) problems. This combination is wrapped in the algorithms called hybrid FDMRMEIEMLA and hybrid FDM-RLMinRes. FDM is the discretization method which converts the PDEs into algebraic formula, whereas both RMEIEMLA and RLMinRes are known as the stabilized Lanczos methods in solving largescale problems of SLEs. Their hybrids enable us to find the solutions of PDE problems accurately. There are at least three types of PDEs solved in this study, namely Helmholtz, wave, and heat equations. The convergence rate of our methods computed using the residual norms || b - Axk ||. Numerical results showed that our proposed methods performed well in solving the various PDEs with small residual norms.","PeriodicalId":43670,"journal":{"name":"Iranian Journal of Mathematical Sciences and Informatics","volume":"434 1","pages":""},"PeriodicalIF":0.5,"publicationDate":"2021-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76349186","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 : 2021-12-31DOI: 10.46754/jmsi.2021.12.005
Nur Edayu Zaini, Syerrina Zakaria, Nuzlinda ABDUL RAHMAN, Wan Saliha Wan Alwi
Geographical Weighted Regression (GWR) is used to improve decisionmaking in spatial analysis. Instead of the Ordinary Least Square (OLS) regression method that gives a single estimated parameter, the GWR method can provide unique estimated parameters in each location. This study aims to conduct a formal statistical inferential framework on the violent crime rate using the GWR. This analysis discovers the geographical distribution and pattern of criminal cases in Peninsular Malaysia using the average crime rates from 2000-2009, with focus on on violent crime. The comparison of OLS regression, known as Multiple Linear Regression (MLR) with the GWR method, was done to show that GWR was the best model. The GWR output suggests that about 30% of districts showed a significant correlation between violent crime and non-citizen rates. These findings contradict the result from the MLR model, also known global model. The global model could not create any other connection to explain the lack of parameter-location correspondence. Finally, the importance of local relationships in crime studies is necessary to understand the actual crime rate.
{"title":"A STATISTICAL INFERENCE ANALYSIS ON CRIME RATES IN PENINSULAR MALAYSIA USING GEOGRAPHICAL WEIGHTED REGRESSION","authors":"Nur Edayu Zaini, Syerrina Zakaria, Nuzlinda ABDUL RAHMAN, Wan Saliha Wan Alwi","doi":"10.46754/jmsi.2021.12.005","DOIUrl":"https://doi.org/10.46754/jmsi.2021.12.005","url":null,"abstract":"Geographical Weighted Regression (GWR) is used to improve decisionmaking in spatial analysis. Instead of the Ordinary Least Square (OLS) regression method that gives a single estimated parameter, the GWR method can provide unique estimated parameters in each location. This study aims to conduct a formal statistical inferential framework on the violent crime rate using the GWR. This analysis discovers the geographical distribution and pattern of criminal cases in Peninsular Malaysia using the average crime rates from 2000-2009, with focus on on violent crime. The comparison of OLS regression, known as Multiple Linear Regression (MLR) with the GWR method, was done to show that GWR was the best model. The GWR output suggests that about 30% of districts showed a significant correlation between violent crime and non-citizen rates. These findings contradict the result from the MLR model, also known global model. The global model could not create any other connection to explain the lack of parameter-location correspondence. Finally, the importance of local relationships in crime studies is necessary to understand the actual crime rate.","PeriodicalId":43670,"journal":{"name":"Iranian Journal of Mathematical Sciences and Informatics","volume":"18 1","pages":""},"PeriodicalIF":0.5,"publicationDate":"2021-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77087917","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 : 2021-12-31DOI: 10.46754/jmsi.2021.12.006
R. Aloev, I. Abdullah, S. Juraev, A. Akbarova
This article is devoted to the construction and study of the exponential stability of an explicit upwind difference scheme for a mixed problem for the linear system of the Saint Venant equation. For the numerical solution of the mixed problem for the linear system of the Saint Venant equation, an explicit upwind difference scheme is constructed. For a numerical solution, a discrete Lyapunov function is constructed and an a priori estimate for it is obtained. On the basis of the discrete Lyapunov function, the exponential stability of the numerical solution of the initial-boundary-value difference problem of the mixed problem for the linear system of the Saint Venantequation is proved. A theorem on the exponential stability of the numerical solution of the initial-boundary-value difference problem is proved. The behavior of the discrete Lyapunov function is numerically investigated depending on the algebraic condition of exponential stability of the numerical solution of the mixed problem. The results of the theorem on the exponential stability of the numerical solution are confirmed by a specific example of an open channel flow problem.
{"title":"STABILITY OF THE NUMERICAL SOLUTION FOR THE MIXED PROBLEM OF THE SAINT-VENANT EQUATIONS","authors":"R. Aloev, I. Abdullah, S. Juraev, A. Akbarova","doi":"10.46754/jmsi.2021.12.006","DOIUrl":"https://doi.org/10.46754/jmsi.2021.12.006","url":null,"abstract":"This article is devoted to the construction and study of the exponential stability of an explicit upwind difference scheme for a mixed problem for the linear system of the Saint Venant equation. For the numerical solution of the mixed problem for the linear system of the Saint Venant equation, an explicit upwind difference scheme is constructed. For a numerical solution, a discrete Lyapunov function is constructed and an a priori estimate for it is obtained. On the basis of the discrete Lyapunov function, the exponential stability of the numerical solution of the initial-boundary-value difference problem of the mixed problem for the linear system of the Saint Venantequation is proved. A theorem on the exponential stability of the numerical solution of the initial-boundary-value difference problem is proved. The behavior of the discrete Lyapunov function is numerically investigated depending on the algebraic condition of exponential stability of the numerical solution of the mixed problem. The results of the theorem on the exponential stability of the numerical solution are confirmed by a specific example of an open channel flow problem.","PeriodicalId":43670,"journal":{"name":"Iranian Journal of Mathematical Sciences and Informatics","volume":"12 1","pages":""},"PeriodicalIF":0.5,"publicationDate":"2021-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85271710","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 : 2021-12-31DOI: 10.46754/jmsi.2021.12.004
R. Hasni, Nurul Atiqah MOHD RADZI, Mohamad Nazri Husin
In this paper, we discuss a case-study of personal sharing of information among students of two undergraduate programme, i.e., Computational Mathematics and Software Engineering (in short, CM and SE respectively) at UniversitiMalaysia Terengganu, Malaysia. The data collected is represented as a directed graph with edges between vertices representing information sharing between the focused-group of students. An analysis is carried out to identify reciprocity,binfluential individuals and community formation to understand the dynamics of these two groups. Even though the density of CM and SE students’ network are somewhat similar, but higher number of reciprocities and communities exists in CM network which indicates resource sharing can be limited in a particularnetwork. However, two isolated vertices also exist for CM which indicates these students prefer to work alone thus in need of extra attention. It is expected that with the community information derived, we can use it to sustain the dynamics of the network and further boost teaching and learning using various divide-andconquer strategies.
{"title":"PERSONAL SHARING IN SOCIAL NETWORK ANALYSIS – A CASE STUDY IN UNIVERSITI MALAYSIA TERENGGANU","authors":"R. Hasni, Nurul Atiqah MOHD RADZI, Mohamad Nazri Husin","doi":"10.46754/jmsi.2021.12.004","DOIUrl":"https://doi.org/10.46754/jmsi.2021.12.004","url":null,"abstract":"In this paper, we discuss a case-study of personal sharing of information among students of two undergraduate programme, i.e., Computational Mathematics and Software Engineering (in short, CM and SE respectively) at UniversitiMalaysia Terengganu, Malaysia. The data collected is represented as a directed graph with edges between vertices representing information sharing between the focused-group of students. An analysis is carried out to identify reciprocity,binfluential individuals and community formation to understand the dynamics of these two groups. Even though the density of CM and SE students’ network are somewhat similar, but higher number of reciprocities and communities exists in CM network which indicates resource sharing can be limited in a particularnetwork. However, two isolated vertices also exist for CM which indicates these students prefer to work alone thus in need of extra attention. It is expected that with the community information derived, we can use it to sustain the dynamics of the network and further boost teaching and learning using various divide-andconquer strategies.","PeriodicalId":43670,"journal":{"name":"Iranian Journal of Mathematical Sciences and Informatics","volume":"42 1","pages":""},"PeriodicalIF":0.5,"publicationDate":"2021-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79905649","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
扫码关注我们
求助内容：
应助结果提醒方式：