Computational and Applied Mathematics最新文献

筛选
英文 中文
Identification methods for ordinal potential differential games 序数势差博弈的识别方法
IF 2.6 3区 数学
Computational and Applied Mathematics Pub Date : 2024-07-26 DOI: 10.1007/s40314-024-02861-w
Balint Varga, Da Huang, Sören Hohmann
{"title":"Identification methods for ordinal potential differential games","authors":"Balint Varga, Da Huang, Sören Hohmann","doi":"10.1007/s40314-024-02861-w","DOIUrl":"https://doi.org/10.1007/s40314-024-02861-w","url":null,"abstract":"<p>This paper introduces two new identification methods for linear quadratic (LQ) ordinal potential differential games (OPDGs). Potential games are notable for their benefits, such as the computability and guaranteed existence of Nash Equilibria. While previous research has analyzed ordinal potential static games, their applicability to various engineering applications remains limited. Despite the earlier introduction of OPDGs, a systematic method for identifying a potential game for a given LQ differential game has not yet been developed. To address this gap, we propose two identification methods to provide the quadratic potential cost function for a given LQ differential game. Both methods are based on linear matrix inequalities (LMIs). The first method aims to minimize the condition number of the potential cost function’s parameters, offering a faster and more precise technique compared to earlier solutions. In addition, we present an evaluation of the feasibility of the structural requirements of the system. The second method, with a less rigid formulation, can identify LQ OPDGs in cases where the first method fails. These novel identification methods are verified through simulations, demonstrating their advantages and potential in designing and analyzing cooperative control systems.</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"16 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141771037","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A primal-dual active set approach to the valuation of American options in regime-switching models: numerical solutions and convergence analysis 制度转换模型中美式期权估值的原始二元有源集方法:数值解与收敛分析
IF 2.6 3区 数学
Computational and Applied Mathematics Pub Date : 2024-07-26 DOI: 10.1007/s40314-024-02862-9
Xin Wen, Haiming Song, Yutian Li, Zihan Gao
{"title":"A primal-dual active set approach to the valuation of American options in regime-switching models: numerical solutions and convergence analysis","authors":"Xin Wen, Haiming Song, Yutian Li, Zihan Gao","doi":"10.1007/s40314-024-02862-9","DOIUrl":"https://doi.org/10.1007/s40314-024-02862-9","url":null,"abstract":"<p>In this study, we explore the valuation challenge posed by American options subject to regime switching, utilizing a model defined by a complex system of parabolic variational inequalities within an infinite domain. The initial pricing model is transformed into a linear complementarity problem (LCP) in a bounded rectangular domain, achieved through the application of a priori estimations and the introduction of an appropriate artificial boundary condition. To discretize the LCP, we employ a finite difference method (FDM), and address the resulting discretized system using a primal-dual active set (PDAS) strategy. The PDAS approach is particularly advantageous for its ability to concurrently determine the option’s price and the optimal exercise boundary. This paper conducts an extensive convergence analysis, evaluating both the truncation error associated with the FDM and the iteration error of the PDAS. Comprehensive numerical simulations are performed to validate the method’s accuracy and efficiency, underscoring its significant potential for application in the field of financial mathematics.</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"63 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141785128","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The $$gamma $$ -diagonally dominant degree of Schur complements and its applications 舒尔互补的对角主导度及其应用
IF 2.6 3区 数学
Computational and Applied Mathematics Pub Date : 2024-07-24 DOI: 10.1007/s40314-024-02868-3
Zhenhua Lyu, Lixin Zhou, Junye Ma
{"title":"The $$gamma $$ -diagonally dominant degree of Schur complements and its applications","authors":"Zhenhua Lyu, Lixin Zhou, Junye Ma","doi":"10.1007/s40314-024-02868-3","DOIUrl":"https://doi.org/10.1007/s40314-024-02868-3","url":null,"abstract":"<p>In this paper, we obtain a new estimate for the (product) <span>(gamma )</span>-diagonally dominant degree of the Schur complement of matrices. As applications we discuss the localization of eigenvalues of the Schur complement and present several upper and lower bounds for the determinant of strictly <span>(gamma )</span>-diagonally dominant matrices, which generalizes the corresponding results of Liu and Zhang (SIAM J. Matrix Anal. Appl. 27 (2005) 665-674).</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"25 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141785129","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Discontinuous harvesting policy in a Filippov system involving prey refuge 涉及猎物避难所的菲利波夫系统中的不连续收获政策
IF 2.6 3区 数学
Computational and Applied Mathematics Pub Date : 2024-07-23 DOI: 10.1007/s40314-024-02858-5
Rajesh Ranjan Patra, Sarit Maitra
{"title":"Discontinuous harvesting policy in a Filippov system involving prey refuge","authors":"Rajesh Ranjan Patra, Sarit Maitra","doi":"10.1007/s40314-024-02858-5","DOIUrl":"https://doi.org/10.1007/s40314-024-02858-5","url":null,"abstract":"<p>In this article, we discuss sustainable harvesting using a Filippov predator–prey system, which can produce yield and at the same time prevent over-exploitation of bioresources. The model is composed of two subsystems and the dynamics switch from one to the other with the help of a switching condition. We have derived possible equilibria, their existence and stability conditions for the respective subsystems, along with a comprehensive analysis of their phase space. The local and global stability analysis of the two subsystems, with and without harvesting, are studied. Furthermore, for the Filippov system, we have performed bifurcation analysis for several key parameters like predation rate, threshold quantity and prey refuge. Some local and global sliding bifurcations are also observed for the system. The system is shown to have multiple stable steady states or multiple stable sliding cycles for some suitable choice of parameters. Numerical simulations are presented to illustrate the dynamical behaviour of the system.</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"80 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141771042","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On some geometrical eigenvalue inverse problems involving the p-Laplacian operator 关于涉及 p 拉普拉斯算子的一些几何特征值逆问题
IF 2.6 3区 数学
Computational and Applied Mathematics Pub Date : 2024-07-23 DOI: 10.1007/s40314-024-02855-8
Abdelkrim Chakib, Ibrahim Khalil
{"title":"On some geometrical eigenvalue inverse problems involving the p-Laplacian operator","authors":"Abdelkrim Chakib, Ibrahim Khalil","doi":"10.1007/s40314-024-02855-8","DOIUrl":"https://doi.org/10.1007/s40314-024-02855-8","url":null,"abstract":"<p>In this paper, we deal with some shape optimization geometrical inverse spectral problems involving the first eigenvalue and eigenfunction of a <i>p</i>-Laplace operator, over a class of open domains with prescribed volume. We first briefly show the existence of the optimal shape design for the <span>(L^p)</span> norm of the eigenfunctions. We carried out the shape derivative calculation of this shape optimization problem using deformation of domains by vector fields. Then we propose a numerical method using lagrangian functional, Hadamard’s shape derivative and gradient method to determine the minimizers for this shape optimization problem. We investigate also numerically the problem of minimizing the first eigenvalue of the p-Laplacian-Dirichlet operator with volume-constraint on domains, using constrained and unconstrained shape optimization formulations. The resulting proposed algorithms of the optimization process are based on the inverse power algorithm (Biezuner et al. 2012) and the finite elements method performed to approximate the first eigenvalue and related eigenfunction. Numerical examples and illustrations are provided for different constrained and unconstrained shape optimization formulations and for various cost functionals to show the efficiency and practical suitability of the proposed approach.</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"39 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141771043","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Accurate approximations of classical and generalized binomial coefficients 经典二项式系数和广义二项式系数的精确近似值
IF 2.6 3区 数学
Computational and Applied Mathematics Pub Date : 2024-07-23 DOI: 10.1007/s40314-024-02851-y
Vito Lampret
{"title":"Accurate approximations of classical and generalized binomial coefficients","authors":"Vito Lampret","doi":"10.1007/s40314-024-02851-y","DOIUrl":"https://doi.org/10.1007/s40314-024-02851-y","url":null,"abstract":"<p>Several sharp approximations of the generalized-binomial-coefficient function having real arguments are presented on the basis of Stirling’s approximation formula for <span>(Gamma )</span> function.</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"122 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141771039","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Modified two-step modulus-based matrix splitting iteration methods for implicit complementarity problems 隐式互补问题的基于模数的修正两步矩阵分割迭代法
IF 2.6 3区 数学
Computational and Applied Mathematics Pub Date : 2024-07-22 DOI: 10.1007/s40314-024-02860-x
Lu-Xin Wang, Yang Cao, Qin-Qin Shen, Chen-Can Zhou
{"title":"Modified two-step modulus-based matrix splitting iteration methods for implicit complementarity problems","authors":"Lu-Xin Wang, Yang Cao, Qin-Qin Shen, Chen-Can Zhou","doi":"10.1007/s40314-024-02860-x","DOIUrl":"https://doi.org/10.1007/s40314-024-02860-x","url":null,"abstract":"<p>To further accelerate the convergence rate of the recent proposed modified modulus-based matrix splitting (MMMS) iteration method for solving the implicit complementarity problems, by using the two-step iteration methodology, a class of modified two-step modulus-based matrix splitting (MTMMS) iteration methods are studied in this paper. The convergence analyses of the MTMMS iteration method are carefully studied when the system matrix is a positive definite matrix or an <span>(H_+)</span>-matrix. Finally, two numerical experiments are presented. Numerical results show that the proposed MTMMS iteration method performs much better than the existing MMMS iteration method.</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"27 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141737816","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Piecewise Jacobi–Gauss spectral collocation simulations for a multi-particle model involving processing delay 涉及处理延迟的多粒子模型的分段雅各比-高斯谱配准模拟
IF 2.6 3区 数学
Computational and Applied Mathematics Pub Date : 2024-07-22 DOI: 10.1007/s40314-024-02843-y
Quan Zhou, Yinkun Wang, Lingling Ma, Yicheng Liu
{"title":"Piecewise Jacobi–Gauss spectral collocation simulations for a multi-particle model involving processing delay","authors":"Quan Zhou, Yinkun Wang, Lingling Ma, Yicheng Liu","doi":"10.1007/s40314-024-02843-y","DOIUrl":"https://doi.org/10.1007/s40314-024-02843-y","url":null,"abstract":"<p>In this work, we propose a piecewise Jacobi–Gauss spectral collocation (JGSC) method for simulating a multi-particle system involving processing delay. Through the use of Jacobi orthogonal approximation and simple Picard iteration, the method obtains the Jacobi series solution of the multi-particle model, allowing us to derive the numerical solution of the processing delay directly. The matrix–vector form of the method helps to obtain the solution parallelly and improves the efficiency significantly. Additionally, the eigenvalues of the iteration’s coefficient matrix are evaluated in order to analyze the convergence of the JGSC method numerically. Numerical experiments illustrate that the JGSC method can keep the high accuracy and efficiency. Furthermore, simulation results of the model indicate that the flocking behavior can only achieved with small enough processing time delays and large enough sizes of the neighborhood.</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"13 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141771041","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On regular triangle-distinct graphs 关于正三角形区分图
IF 2.6 3区 数学
Computational and Applied Mathematics Pub Date : 2024-07-19 DOI: 10.1007/s40314-024-02854-9
Dragan Stevanović, Mohammad Ghebleh, Gilles Caporossi, Ambat Vijayakumar, Sanja Stevanović
{"title":"On regular triangle-distinct graphs","authors":"Dragan Stevanović, Mohammad Ghebleh, Gilles Caporossi, Ambat Vijayakumar, Sanja Stevanović","doi":"10.1007/s40314-024-02854-9","DOIUrl":"https://doi.org/10.1007/s40314-024-02854-9","url":null,"abstract":"<p>The triangle-degree of a vertex <i>v</i> of a simple graph <i>G</i> is the number of triangles in <i>G</i> that contain <i>v</i>. A simple graph is triangle-distinct if all its vertices have distinct triangle-degrees. Berikkyzy et al. [Discrete Math. 347 (2024) 113695] recently asked whether there exists a regular graph that is triangle-distinct. Here we first showcase the examples of regular, triangle-distinct graphs, and then show that for every natural number <i>k</i> there exists a family of <span>(2^k)</span> regular triangle-distinct graphs, all having the same order and size.</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"4 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141737815","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A new approach to soft relations and soft functions 软关系和软函数的新方法
IF 2.6 3区 数学
Computational and Applied Mathematics Pub Date : 2024-07-18 DOI: 10.1007/s40314-024-02853-w
Adem Yolcu, Taha Yasin Ozturk, Sadi Bayramov
{"title":"A new approach to soft relations and soft functions","authors":"Adem Yolcu, Taha Yasin Ozturk, Sadi Bayramov","doi":"10.1007/s40314-024-02853-w","DOIUrl":"https://doi.org/10.1007/s40314-024-02853-w","url":null,"abstract":"<p>In this paper, a different approach is used to define a cartesian product on soft sets. This method processes both alternatives and parameters. The notion of the cartesian product is then used to define the idea of a soft relation. The concepts of reflexion, symmetry and transition are defined on the soft relation. Some properties are investigated. Also, the soft function notion is introduced. Various instances are provided as the key characteristics of the structures that are being presented are analyzed. Finally, an application is presented by building a decision making algorithm on the soft relation.</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"80 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141737802","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信