Journal of Mathematics最新文献

{"title":"A Novel Opportunity Losses-Based Polar Coordinate Distance (OPLO-POCOD) Approach to Multiple Criteria Decision-Making","authors":"Reza Sheikh, Soheila Senfi","doi":"10.1155/2024/8845886","DOIUrl":"https://doi.org/10.1155/2024/8845886","url":null,"abstract":"The ability to make decisions is crucial for achieving success in any field, particularly in areas that involve managing extensive information and knowledge. The process of decision-making in real-world scenarios often involves considering numerous factors and aspects. It can be challenging to make decisions in such complex environments. In this paper, we present a new technique that solves multicriteria decision-making (MCDM) problems by considering opportunity losses-based polar coordinate distance (OPLO-POCOD). MCDM is a subdiscipline of operations research in which some alternatives are evaluated concerning some criteria to choose the most optimal alternative(s). Opportunity loss is a fundamental concept in economics and management, which can be used as a basis for determining the value associated with information. The authors emphasize that the technique incorporates the concept of opportunity losses and uses distance vectors in polar coordinates, making it a compelling approach. By considering opportunity losses, decision-makers gain a better understanding of the trade-offs involved in selecting alternatives, enabling them to make more informed decisions. Finally, the proposed method is exhibited through the use of numerical an example to illustrate its process. Additionally, a comparative sensitivity analysis is conducted to evaluate the outcomes of OPLO-POCOD and compare them with existing MCDM methods. The OPLO-POCOD method is found to have high reliability compared to other methods, as indicated by Spearman’s correlation coefficient, which is greater than 0.9. The method shows a correlation of over 98.5% with TOPSIS, COPRAS, ARAS, and MCRAT methods, demonstrating its robustness and effectiveness. These analyses show the efficiency of the proposed method and highlight the stability of the results.","PeriodicalId":54214,"journal":{"name":"Journal of Mathematics","volume":"32 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139978761","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"New Solutions of Time- and Space-Fractional Black–Scholes European Option Pricing Model via Fractional Extension of He-Aboodh Algorithm","authors":"Mubashir Qayyum, Efaza Ahmad","doi":"10.1155/2024/6623636","DOIUrl":"https://doi.org/10.1155/2024/6623636","url":null,"abstract":"The current study explores the space and time-fractional Black–Scholes European option pricing model that primarily occurs in the financial market. To tackle the complexities associated with solving models in a fractional environment, the Aboodh transform is hybridized with He’s algorithm. This facilitates in improving the efficiency and applicability of the classical homotopy perturbation method (HPM) by ensuring the rapid convergence of the series form solution. Three cases that are time-fractional scenario, space-fractional scenario, and time-space-fractional scenario are observed through graphs and tables. 2D graphical analysis is performed to depict the behaviour of a given option pricing model for varying time, stock price, and fractional parameters. Solutions of the European option pricing model at various fractional orders are also presented as 3D plots. The results obtained through these graphs unfold the interchange between time- and space-fractional derivatives, presenting a comprehensive study of option pricing under fractional dynamics. The competency of the proposed scheme is illustrated via solutions and errors throughout the fractional domain in tabular form. The validity of the He-Aboodh results is exhibited by comparison with existing errors. Analysis shows that the proposed methodology (He-Aboodh algorithm) is a valuable scheme for solving time-space-fractional models arising in business and economics.","PeriodicalId":54214,"journal":{"name":"Journal of Mathematics","volume":"284 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139956335","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Radiative Mixed Convection Flow of Casson Nanofluid through Exponentially Permeable Stretching Sheet with Internal Heat Generation","authors":"Mazhar Hussain, Shereen Fatima, Mubashir Qayyum","doi":"10.1155/2024/9038635","DOIUrl":"https://doi.org/10.1155/2024/9038635","url":null,"abstract":"This paper investigates the mixed convection boundary-layer flow of Casson nanofluid with an internal heat source on an exponentially stretched sheet. The Buongiorno model, incorporating thermophoresis and Brownian motion, describes fluid temperature. The modeled system is solved numerically using bvp4c routine to analyze the impact of different fluid parameters on velocity, temperature, and concentration profiles. The analysis reveals that the suction effect, magnetic field, and Casson parameter reduce momentum boundary layer thickness and hence slow fluid motion. Conversely, buoyancy forces increase mass boundary layer thickness which results in accelerating fluid motion. Temperature and concentration profiles show similar trends for Brownian motion, radiation, and thermophoresis.","PeriodicalId":54214,"journal":{"name":"Journal of Mathematics","volume":"242 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139956341","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A Competitive Bilevel Programming Model for Green, CLSCs in Light of Government Incentives","authors":"Arsalan Rahmani, Meysam Hosseini, Amir Sahami","doi":"10.1155/2024/4866890","DOIUrl":"https://doi.org/10.1155/2024/4866890","url":null,"abstract":"The growth of world population has fueled environmental, legal, and social concerns, making governments and companies attempt to mitigate the environmental and social implications stemming from supply chain operations. The state-run Environmental Protection Agency has initially offered financial incentives (subsidies) meant to encourage supply chain managers to use cleaner technologies in order to minimize pollution. In today’s competitive markets, using green technologies remains vital. In the present project, we have examined a class of closed-loop supply chain competitive facility location-routing problems. According to the framework of the competition, one of the players, called the Leader, opens its facilities first. The second player, called the Follower, makes its decision when Leader’s location is known. Afterwards, each customer chooses an open facility based on some preference huff rules before returning the benefits to one of the two companies. The follower, under the influence of the leader’s decisions, performs the best reaction in order to obtain the maximum capture of the market. So, a bilevel mixed-integer linear programming model is formulated. The objective function at both levels includes market capture profit, fixed and operating costs, and financial incentives. A metaheuristic quantum binary particle swarm optimization (PSO) is developed via Benders decomposition algorithm to solve the proposed model. To evaluate the convergence rate and solution quality, the method is applied to some random test instances generated in the literature. The computational results indicate that the proposed method is capable of efficiently solving the model.","PeriodicalId":54214,"journal":{"name":"Journal of Mathematics","volume":"96 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139951308","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Some Inequalities between General Randić-Type Graph Invariants","authors":"Imran Nadeem, Saba Siddique, Yilun Shang","doi":"10.1155/2024/8204742","DOIUrl":"https://doi.org/10.1155/2024/8204742","url":null,"abstract":"The Randić-type graph invariants are extensively investigated vertex-degree-based topological indices and have gained much prominence in recent years. The general Randić and zeroth-order general Randić indices are Randić-type graph invariants and are defined for a graph <svg height=\"8.8423pt\" style=\"vertical-align:-0.2064009pt\" version=\"1.1\" viewbox=\"-0.0498162 -8.6359 9.02496 8.8423\" width=\"9.02496pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"><g transform=\"matrix(.013,0,0,-0.013,0,0)\"></path></g></svg> with vertex set <svg height=\"8.8423pt\" style=\"vertical-align:-0.2064009pt\" version=\"1.1\" viewbox=\"-0.0498162 -8.6359 9.35121 8.8423\" width=\"9.35121pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"><g transform=\"matrix(.013,0,0,-0.013,0,0)\"></path></g></svg> as <span><svg height=\"17.1973pt\" style=\"vertical-align:-7.24091pt\" version=\"1.1\" viewbox=\"-0.0498162 -9.95639 43.051 17.1973\" width=\"43.051pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"><g transform=\"matrix(.013,0,0,-0.013,0,0)\"></path></g><g transform=\"matrix(.0091,0,0,-0.0091,8.086,3.132)\"></path></g><g transform=\"matrix(.013,0,0,-0.013,13.9,0)\"></path></g><g transform=\"matrix(.013,0,0,-0.013,18.398,0)\"><use xlink:href=\"#g113-72\"></use></g><g transform=\"matrix(.013,0,0,-0.013,27.29,0)\"></path></g><g transform=\"matrix(.013,0,0,-0.013,35.42,0)\"></path></g></svg><span></span><svg height=\"17.1973pt\" style=\"vertical-align:-7.24091pt\" version=\"1.1\" viewbox=\"46.6331838 -9.95639 67.033 17.1973\" width=\"67.033pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"><g transform=\"matrix(.013,0,0,-0.013,46.683,.007)\"></path></g><g transform=\"matrix(.0091,0,0,-0.0091,56.47,3.466)\"></path></g><g transform=\"matrix(.0065,0,0,-0.0065,60.728,5.567)\"></path></g><g transform=\"matrix(.0091,0,0,-0.0091,63.099,3.466)\"></path></g><g transform=\"matrix(.0091,0,0,-0.0091,68.659,3.466)\"><use xlink:href=\"#g50-242\"></use></g><g transform=\"matrix(.0065,0,0,-0.0065,72.918,5.567)\"></path></g><g transform=\"matrix(.013,0,0,-0.013,76.812,0)\"><use xlink:href=\"#g113-41\"></use></g><g transform=\"matrix(.013,0,0,-0.013,81.31,0)\"></path></g><g transform=\"matrix(.0091,0,0,-0.0091,88.46,3.132)\"></path></g><g transform=\"matrix(.013,0,0,-0.013,91.515,0)\"><use xlink:href=\"#g113-101\"></use></g><g transform=\"matrix(.0091,0,0,-0.0091,98.665,3.132)\"></path></g><g transform=\"matrix(.013,0,0,-0.013,103.091,0)\"><use xlink:href=\"#g113-42\"></use></g><g transform=\"matrix(.0091,0,0,-0.0091,107.589,-5.741)\"><use xlink:href=\"#g50-223\"></use></g></svg></span> and <span><svg height=\"15.6315pt\" style=\"vertical-align:-5.67511pt\" version=\"1.1\" viewbox=\"-0.0498162 -9.95639 44.286 15.6315\" width=\"44.286pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"><g transform=\"matrix(.013,0,0,-0.013,0,0)\"></path></g><g transform=\"matrix(.0091,0,0,-0.0091,9.321,3.132)\"><use xlink:href=\"#g50-223\"></use></g><g trans","PeriodicalId":54214,"journal":{"name":"Journal of Mathematics","volume":"10 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139910072","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Characterization of a Cournot–Nash Equilibrium for a Fishery Model with Fuzzy Utilities","authors":"R. Israel Ortega-Gutiérrez, Raúl Montes-de-Oca, Hugo Cruz-Suárez","doi":"10.1155/2024/6885051","DOIUrl":"https://doi.org/10.1155/2024/6885051","url":null,"abstract":"The article deals with the extensions of discrete-time games with infinite time horizon and their application in a fuzzy context to fishery models. The criteria for these games are the total discounted utility and the average utility in a fishing problem. However, in the fuzzy case, game theory is not the best way to represent a real fishing problem because players do not always have enough information to accurately estimate their utility in the context of fishing. For this reason, in this paper, trapezoidal-type fuzzy utility values are considered for a fishing model, and the terms of the Nash equilibrium are given in the fuzzy context, i.e., this equilibrium is represented using the partial order of the <span><svg height=\"6.1673pt\" style=\"vertical-align:-0.2063904pt\" version=\"1.1\" viewbox=\"-0.0498162 -5.96091 7.51131 6.1673\" width=\"7.51131pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"><g transform=\"matrix(.013,0,0,-0.013,0,0)\"></path></g></svg>-</span>cuts of the fuzzy numbers; to the best of the authors’ knowledge, there is no work with this type of treatment. To obtain each equilibrium, a suitable fully determined fuzzy game is used in combination with the dynamic programming technique applied to this game in the context of fishing. The main results are (i) the Nash equilibria of the fuzzy games coincide with the Nash equilibria of the nonfuzzy games and are explicitly determined in a fishery model and (ii) the values of the fuzzy games are of trapezoidal type and are also explicitly given in the fishery model.","PeriodicalId":54214,"journal":{"name":"Journal of Mathematics","volume":"138 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139911302","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A Modified Form of Inertial Viscosity Projection Methods for Variational Inequality and Fixed Point Problems","authors":"Watanjeet Singh, Sumit Chandok","doi":"10.1155/2024/9509788","DOIUrl":"https://doi.org/10.1155/2024/9509788","url":null,"abstract":"This paper aims to introduce an iterative algorithm based on an inertial technique that uses the minimum number of projections onto a nonempty, closed, and convex set. We show that the algorithm generates a sequence that converges strongly to the common solution of a variational inequality involving inverse strongly monotone mapping and fixed point problems for a countable family of nonexpansive mappings in the setting of real Hilbert space. Numerical experiments are also presented to discuss the advantages of using our algorithm over earlier established algorithms. Moreover, we solve a real-life signal recovery problem via a minimization problem to demonstrate our algorithm’s practicality.","PeriodicalId":54214,"journal":{"name":"Journal of Mathematics","volume":"50 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139920659","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Partition Resolvability of Nanosheet and Nanotube Derived from Octagonal Grid","authors":"Ali Al Khabyah, Ali N. A. Koam, Ali Ahmad","doi":"10.1155/2024/6222086","DOIUrl":"https://doi.org/10.1155/2024/6222086","url":null,"abstract":"Chemical graph theory, a branch of computational and applied mathematics, covers a very wide range of topics. As a result, the world of applied sciences heavily relies on graph theory. The concept of partition dimension has significant importance in the field of chemical graph theory. Although certain graphs have bounded partition dimensions, a graph’s partition dimension may be constant. In this study, we look at two alternative chemical structures made of an octagonal grid: nanosheets and nanotubes. We determined the partition dimension of an octagonal grid-generated nanosheet to be 3, and the partition dimension of a nanotube to be limited from 4.","PeriodicalId":54214,"journal":{"name":"Journal of Mathematics","volume":"70 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139920663","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Algorithmic Complexity and Bounds for Domination Subdivision Numbers of Graphs","authors":"Fu-Tao Hu, Chang-Xu Zhang, Shu-Cheng Yang","doi":"10.1155/2024/3795448","DOIUrl":"https://doi.org/10.1155/2024/3795448","url":null,"abstract":"Let &lt;span&gt;&lt;svg height=\"11.5564pt\" style=\"vertical-align:-2.26807pt\" version=\"1.1\" viewbox=\"-0.0498162 -9.28833 20.155 11.5564\" width=\"20.155pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,0,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,12.524,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;/svg&gt;&lt;span&gt;&lt;/span&gt;&lt;svg height=\"11.5564pt\" style=\"vertical-align:-2.26807pt\" version=\"1.1\" viewbox=\"23.7371838 -9.28833 14.99 11.5564\" width=\"14.99pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,23.787,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,28.285,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,35.813,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;/svg&gt;&lt;span&gt;&lt;/span&gt;&lt;svg height=\"11.5564pt\" style=\"vertical-align:-2.26807pt\" version=\"1.1\" viewbox=\"40.9061838 -9.28833 12.769 11.5564\" width=\"12.769pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,40.956,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,48.964,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;/svg&gt;&lt;/span&gt; be a simple graph. A subset &lt;span&gt;&lt;svg height=\"9.75571pt\" style=\"vertical-align:-1.11981pt\" version=\"1.1\" viewbox=\"-0.0498162 -8.6359 21.221 9.75571\" width=\"21.221pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,0,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,13.59,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;/svg&gt;&lt;span&gt;&lt;/span&gt;&lt;svg height=\"9.75571pt\" style=\"vertical-align:-1.11981pt\" version=\"1.1\" viewbox=\"24.803183800000003 -8.6359 9.417 9.75571\" width=\"9.417pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,24.853,0)\"&gt;&lt;use xlink:href=\"#g113-87\"&gt;&lt;/use&gt;&lt;/g&gt;&lt;/svg&gt;&lt;/span&gt; is a dominating set if every vertex not in &lt;svg height=\"8.68572pt\" style=\"vertical-align:-0.0498209pt\" version=\"1.1\" viewbox=\"-0.0498162 -8.6359 10.095 8.68572\" width=\"10.095pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,0,0)\"&gt;&lt;use xlink:href=\"#g113-69\"&gt;&lt;/use&gt;&lt;/g&gt;&lt;/svg&gt; is adjacent to a vertex in &lt;span&gt;&lt;svg height=\"8.68572pt\" style=\"vertical-align:-0.0498209pt\" version=\"1.1\" viewbox=\"-0.0498162 -8.6359 10.095 8.68572\" width=\"10.095pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,0,0)\"&gt;&lt;use xlink:href=\"#g113-69\"&gt;&lt;/use&gt;&lt;/g&gt;&lt;/svg&gt;.&lt;/span&gt; The domination number of &lt;span&gt;&lt;svg height=\"8.8423pt\" style=\"vertical-align:-0.2064009pt\" version=\"1.1\" viewbox=\"-0.0498162 -8.6359 9.02496 8.8423\" width=\"9.02496pt\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,0,0)\"&gt;&lt;use xlink:href=\"#g113-72\"&gt;&lt;/use&gt;&lt;/g&gt;&lt;/svg&gt;,&lt;/span&gt; denoted by &lt;span&gt;&lt;svg height=\"12.7178pt\" style=\"vertical-align:-3.42947pt\" version=\"1.1\" viewbox=\"-0.0498162 -9.28833 24.5921 12.7178\" width=\"24.5921pt\" xmlns=\"http://www.w3.org/200","PeriodicalId":54214,"journal":{"name":"Journal of Mathematics","volume":"39 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139760862","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Stabilization of a Rao–Nakra Sandwich Beam System by Coleman–Gurtin’s Thermal Law and Nonlinear Damping of Variable-Exponent Type","authors":"Mohammed M. Al-Gharabli, Shadi Al-Omari, Adel M. Al-Mahdi","doi":"10.1155/2024/1615178","DOIUrl":"https://doi.org/10.1155/2024/1615178","url":null,"abstract":"In this paper, we explore the asymptotic behavior of solutions in a thermoplastic Rao–Nakra (sandwich beam) beam equation featuring nonlinear damping with a variable exponent. The heat conduction in this context adheres to Coleman–Gurtin’s thermal law, encompassing linear damping, Fourier, and Gurtin–Pipkin’s laws as specific instances. By employing the multiplier approach, we establish general energy decay results, with exponential decay as a particular manifestation. These findings extend and generalize previous decay results concerning the Rao–Nakra sandwich beam equations.","PeriodicalId":54214,"journal":{"name":"Journal of Mathematics","volume":"41 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139760856","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}