首页 > 最新文献

Journal of Mathematics最新文献

英文 中文
A Novel Opportunity Losses-Based Polar Coordinate Distance (OPLO-POCOD) Approach to Multiple Criteria Decision-Making 基于机会损失极坐标距离(OPLO-POCOD)的多标准决策新方法
IF 1.4 4区 数学 Q1 MATHEMATICS Pub Date : 2024-02-27 DOI: 10.1155/2024/8845886
Reza Sheikh, Soheila Senfi
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.
决策能力对于在任何领域取得成功都至关重要,尤其是在涉及管理大量信息和知识的领域。现实世界中的决策过程往往需要考虑众多因素和方面。在如此复杂的环境中做出决策是极具挑战性的。在本文中,我们提出了一种通过考虑基于机会损失的极坐标距离(OPLO-POCOD)来解决多标准决策(MCDM)问题的新技术。多标准决策(MCDM)是运筹学的一门分支学科,在这门学科中,要根据一些标准对一些备选方案进行评估,以选出最优的备选方案。机会损失是经济学和管理学中的一个基本概念,可作为确定信息相关价值的基础。作者强调,该技术包含了机会损失的概念,并使用极坐标中的距离向量,因此是一种引人注目的方法。通过考虑机会损失,决策者可以更好地理解在选择备选方案时所涉及的权衡问题,从而做出更加明智的决策。最后,通过一个数字示例展示了所建议的方法,以说明其过程。此外,还进行了比较敏感性分析,以评估 OPLO-POCOD 的结果,并将其与现有的 MCDM 方法进行比较。与其他方法相比,OPLO-POCOD 方法具有很高的可靠性,斯皮尔曼相关系数大于 0.9。该方法与 TOPSIS、COPRAS、ARAS 和 MCRAT 方法的相关性超过 98.5%,证明了其稳健性和有效性。这些分析表明了所提方法的效率,并突出了结果的稳定性。
{"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}
引用次数: 0
New Solutions of Time- and Space-Fractional Black–Scholes European Option Pricing Model via Fractional Extension of He-Aboodh Algorithm 通过 He-Aboodh 算法的分数扩展实现 Black-Scholes 欧洲期权定价模型的时空分数新解
IF 1.4 4区 数学 Q1 MATHEMATICS Pub Date : 2024-02-24 DOI: 10.1155/2024/6623636
Mubashir Qayyum, Efaza Ahmad
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.
本研究探讨了主要出现在金融市场上的空间和时间分式布莱克-斯科尔斯欧式期权定价模型。为了解决在分数环境中求解模型的复杂性,Aboodh 变换与 He 算法进行了混合。这有助于提高经典同调扰动法(HPM)的效率和适用性,确保序列形式解的快速收敛。通过图形和表格观察了三种情况,即时间-分数情况、空间-分数情况和时间-空间-分数情况。通过二维图形分析,描述了给定期权定价模型在不同时间、股票价格和分数参数下的行为。欧式期权定价模型在不同分数阶数下的解决方案也以三维图的形式呈现。通过这些图表获得的结果展现了时间和空间分数导数之间的相互关系,从而对分数动态下的期权定价进行了全面研究。建议方案的能力通过整个分数域的解和误差以表格形式加以说明。通过与现有误差的比较,展示了 He-Aboodh 结果的有效性。分析表明,所提出的方法(He-Aboodh 算法)是解决商业和经济学中出现的时空分数模型的重要方案。
{"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}
引用次数: 0
Radiative Mixed Convection Flow of Casson Nanofluid through Exponentially Permeable Stretching Sheet with Internal Heat Generation 卡松纳米流体在内部发热的幂指数渗透性拉伸片中的辐射混合对流
IF 1.4 4区 数学 Q1 MATHEMATICS Pub Date : 2024-02-24 DOI: 10.1155/2024/9038635
Mazhar Hussain, Shereen Fatima, Mubashir Qayyum
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.
本文研究了带有内部热源的卡松纳米流体在指数拉伸片上的混合对流边界层流动。Buongiorno 模型结合热泳和布朗运动描述了流体温度。使用 bvp4c 例程对建模系统进行数值求解,分析不同流体参数对速度、温度和浓度曲线的影响。分析结果表明,吸力效应、磁场和卡松参数会减小动量边界层厚度,从而减缓流体运动速度。相反,浮力会增加质量边界层厚度,从而加速流体运动。温度和浓度剖面显示出布朗运动、辐射和热泳的类似趋势。
{"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}
引用次数: 0
A Competitive Bilevel Programming Model for Green, CLSCs in Light of Government Incentives 从政府激励机制看绿色社区服务中心的竞争性双级编程模型
IF 1.4 4区 数学 Q1 MATHEMATICS Pub Date : 2024-02-23 DOI: 10.1155/2024/4866890
Arsalan Rahmani, Meysam Hosseini, Amir Sahami
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.
世界人口的增长加剧了对环境、法律和社会的担忧,使政府和公司试图减轻供应链运营对环境和社会的影响。国家环境保护局(Environmental Protection Agency)最初提供财政奖励(补贴),旨在鼓励供应链管理者使用更清洁的技术,以最大限度地减少污染。在当今竞争激烈的市场中,使用绿色技术仍然至关重要。在本项目中,我们研究了一类闭环供应链竞争性设施选址问题。根据竞争框架,其中一个参与者(称为 "领导者")首先开放其设施。第二个参与者(称为 "跟随者")在知道 "领导者 "的位置后做出决定。之后,每个客户根据一些偏好规则选择一个开放设施,然后将利益返还给两家公司中的一家。追随者在领导者决策的影响下,做出最佳反应,以最大限度地占领市场。因此,制定了一个双层混合整数线性规划模型。两个层次的目标函数都包括市场占领利润、固定成本、运营成本和经济激励。通过 Benders 分解算法开发了一种元启发式量子二元粒子群优化算法(PSO)来求解所提出的模型。为了评估收敛速度和求解质量,该方法被应用于文献中生成的一些随机测试实例。计算结果表明,所提出的方法能够高效地求解模型。
{"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}
引用次数: 0
Some Inequalities between General Randić-Type Graph Invariants 一般兰迪奇型图不变式之间的一些不等式
IF 1.4 4区 数学 Q1 MATHEMATICS Pub Date : 2024-02-20 DOI: 10.1155/2024/8204742
Imran Nadeem, Saba Siddique, Yilun Shang
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
Randić 型图不变式是被广泛研究的基于顶点度的拓扑指数,近年来备受瞩目。一般 Randić 指数和零阶一般 Randić 指数是 Randić 型图不变式,对有顶点集的图的定义分别为 和 ,其中 是任意实数,表示顶点的度数,表示顶点的邻接度,在 。建立两个拓扑指数之间的关系对研究人员来说非常重要。迄今为止,人们已经推导出了 和 之间的一些隐式不等式关系。在本文中,我们建立了 和 之间的显式不等式关系。同时,我们还确定了这些图不变式之间的线性不等式关系。此外,我们还通过对 ......的适当选择,为各种基于顶点度的拓扑指数得到了一些新的不等式。
{"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 &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;/path&gt;&lt;/g&gt;&lt;/svg&gt; with vertex set &lt;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\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,0,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;/svg&gt; as &lt;span&gt;&lt;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\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,0,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.0091,0,0,-0.0091,8.086,3.132)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,13.9,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,18.398,0)\"&gt;&lt;use xlink:href=\"#g113-72\"&gt;&lt;/use&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,27.29,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,35.42,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;/svg&gt;&lt;span&gt;&lt;/span&gt;&lt;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\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,46.683,.007)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.0091,0,0,-0.0091,56.47,3.466)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.0065,0,0,-0.0065,60.728,5.567)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.0091,0,0,-0.0091,63.099,3.466)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.0091,0,0,-0.0091,68.659,3.466)\"&gt;&lt;use xlink:href=\"#g50-242\"&gt;&lt;/use&gt;&lt;/g&gt;&lt;g transform=\"matrix(.0065,0,0,-0.0065,72.918,5.567)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,76.812,0)\"&gt;&lt;use xlink:href=\"#g113-41\"&gt;&lt;/use&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,81.31,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.0091,0,0,-0.0091,88.46,3.132)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,91.515,0)\"&gt;&lt;use xlink:href=\"#g113-101\"&gt;&lt;/use&gt;&lt;/g&gt;&lt;g transform=\"matrix(.0091,0,0,-0.0091,98.665,3.132)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,103.091,0)\"&gt;&lt;use xlink:href=\"#g113-42\"&gt;&lt;/use&gt;&lt;/g&gt;&lt;g transform=\"matrix(.0091,0,0,-0.0091,107.589,-5.741)\"&gt;&lt;use xlink:href=\"#g50-223\"&gt;&lt;/use&gt;&lt;/g&gt;&lt;/svg&gt;&lt;/span&gt; and &lt;span&gt;&lt;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\"&gt;&lt;g transform=\"matrix(.013,0,0,-0.013,0,0)\"&gt;&lt;/path&gt;&lt;/g&gt;&lt;g transform=\"matrix(.0091,0,0,-0.0091,9.321,3.132)\"&gt;&lt;use xlink:href=\"#g50-223\"&gt;&lt;/use&gt;&lt;/g&gt;&lt;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}
引用次数: 0
Characterization of a Cournot–Nash Equilibrium for a Fishery Model with Fuzzy Utilities 具有模糊效用的渔业模型的库诺-纳什均衡特征
IF 1.4 4区 数学 Q1 MATHEMATICS Pub Date : 2024-02-20 DOI: 10.1155/2024/6885051
R. Israel Ortega-Gutiérrez, Raúl Montes-de-Oca, Hugo Cruz-Suárez
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 -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.
文章论述了无限时间跨度离散时间博弈的扩展及其在渔业模型中的模糊应用。这些博弈的标准是捕鱼问题中的总贴现效用和平均效用。然而,在模糊情况下,博弈论并不是表示实际捕鱼问题的最佳方法,因为参与者并不总是有足够的信息来准确估计他们在捕鱼时的效用。因此,本文考虑将梯形模糊效用值用于捕鱼模型,并在模糊背景下给出纳什均衡的条件,即使用模糊数-切分的偏序来表示该均衡;据作者所知,目前还没有采用这种处理方法的研究。为了获得每个均衡,我们使用了一个合适的完全确定的模糊博弈,并结合在捕鱼博弈中应用的动态编程技术。主要结果有:(i) 模糊博弈的纳什均衡点与非模糊博弈的纳什均衡点重合,并在渔业模型中明确确定;(ii) 模糊博弈的值是梯形类型的,也在渔业模型中明确给出。
{"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}
引用次数: 0
A Modified Form of Inertial Viscosity Projection Methods for Variational Inequality and Fixed Point Problems 用于变量不等式和定点问题的惯性粘度投影方法的改进形式
IF 1.4 4区 数学 Q1 MATHEMATICS Pub Date : 2024-02-19 DOI: 10.1155/2024/9509788
Watanjeet Singh, Sumit Chandok
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.
本文旨在介绍一种基于惯性技术的迭代算法,该算法使用对非空、封闭和凸集的最小投影次数。我们证明,该算法生成的序列能强烈收敛到涉及反强单调映射的变分不等式的公共解,以及实希尔伯特空间背景下可数族非膨胀映射的定点问题。我们还介绍了数值实验,以讨论使用我们的算法相对于早期已有算法的优势。此外,我们还通过最小化问题解决了一个现实生活中的信号恢复问题,以证明我们算法的实用性。
{"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}
引用次数: 0
Partition Resolvability of Nanosheet and Nanotube Derived from Octagonal Grid 八边形网格衍生的纳米片和纳米管的分区可分辨性
IF 1.4 4区 数学 Q1 MATHEMATICS Pub Date : 2024-02-19 DOI: 10.1155/2024/6222086
Ali Al Khabyah, Ali N. A. Koam, Ali Ahmad
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.
化学图论是计算数学和应用数学的一个分支,涵盖了非常广泛的主题。因此,应用科学领域在很大程度上依赖于图论。分割维度的概念在化学图论领域具有重要意义。虽然某些图的分割维度是有界的,但一个图的分割维度可能是恒定的。在本研究中,我们研究了两种由八边形网格构成的化学结构:纳米片和纳米管。我们确定八角网格生成的纳米片的分割维度为 3,而纳米管的分割维度受限于 4。
{"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}
引用次数: 0
Algorithmic Complexity and Bounds for Domination Subdivision Numbers of Graphs 图的支配细分数的算法复杂性和边界
IF 1.4 4区 数学 Q1 MATHEMATICS Pub Date : 2024-02-15 DOI: 10.1155/2024/3795448
Fu-Tao Hu, Chang-Xu Zhang, Shu-Cheng Yang
Let <span><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"><g transform="matrix(.013,0,0,-0.013,0,0)"></path></g><g transform="matrix(.013,0,0,-0.013,12.524,0)"></path></g></svg><span></span><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"><g transform="matrix(.013,0,0,-0.013,23.787,0)"></path></g><g transform="matrix(.013,0,0,-0.013,28.285,0)"></path></g><g transform="matrix(.013,0,0,-0.013,35.813,0)"></path></g></svg><span></span><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"><g transform="matrix(.013,0,0,-0.013,40.956,0)"></path></g><g transform="matrix(.013,0,0,-0.013,48.964,0)"></path></g></svg></span> be a simple graph. A subset <span><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"><g transform="matrix(.013,0,0,-0.013,0,0)"></path></g><g transform="matrix(.013,0,0,-0.013,13.59,0)"></path></g></svg><span></span><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"><g transform="matrix(.013,0,0,-0.013,24.853,0)"><use xlink:href="#g113-87"></use></g></svg></span> is a dominating set if every vertex not in <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"><g transform="matrix(.013,0,0,-0.013,0,0)"><use xlink:href="#g113-69"></use></g></svg> is adjacent to a vertex in <span><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"><g transform="matrix(.013,0,0,-0.013,0,0)"><use xlink:href="#g113-69"></use></g></svg>.</span> The domination number of <span><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)"><use xlink:href="#g113-72"></use></g></svg>,</span> denoted by <span><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
假设是一个简单图。如果不在 的每个顶点都与在 的顶点相邻,那么这个子集就是一个支配集。支配数 ,表示为 ,是支配集的最小心数。 支配细分数 ,是为增加支配数而必须细分的最小边数(每条边最多可细分一次)。2000 年,Haynes 等人的研究表明,对于任何有且的边,都是阶数不小于 3 的连通图。在本文中,我们将上述约束改进为 ,并进一步证明了判断是否为 NP-hard的决策问题。此外,我们还展示了一些图的支配细分数的边界或精确值。
{"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}
引用次数: 0
Stabilization of a Rao–Nakra Sandwich Beam System by Coleman–Gurtin’s Thermal Law and Nonlinear Damping of Variable-Exponent Type 利用科尔曼-古尔丁热力定律和变指数型非线性阻尼稳定饶-纳克拉夹层梁系统
IF 1.4 4区 数学 Q1 MATHEMATICS Pub Date : 2024-02-13 DOI: 10.1155/2024/1615178
Mohammed M. Al-Gharabli, Shadi Al-Omari, Adel M. Al-Mahdi
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.
本文探讨了热塑性 Rao-Nakra(三明治梁)梁方程中具有可变指数非线性阻尼的解的渐近行为。这种情况下的热传导遵循 Coleman-Gurtin 热定律,包括线性阻尼、傅里叶和 Gurtin-Pipkin 定律作为具体实例。通过使用乘法器方法,我们建立了一般能量衰减结果,指数衰减是其中一种特殊表现形式。这些发现扩展并概括了之前有关 Rao-Nakra 夹层梁方程的衰减结果。
{"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}
引用次数: 0
期刊
Journal of Mathematics
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1