Journal of Computational and Applied Mathematics最新文献

筛选
英文 中文
Bilevel robust optimization approach for multi-period sparse portfolio selection 多周期稀疏投资组合的双层鲁棒优化方法
IF 2.1 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2025-05-03 DOI: 10.1016/j.cam.2025.116729
Serena Crisci , Valentina De Simone , Monica Pragliola , Gerardo Toraldo
{"title":"Bilevel robust optimization approach for multi-period sparse portfolio selection","authors":"Serena Crisci ,&nbsp;Valentina De Simone ,&nbsp;Monica Pragliola ,&nbsp;Gerardo Toraldo","doi":"10.1016/j.cam.2025.116729","DOIUrl":"10.1016/j.cam.2025.116729","url":null,"abstract":"<div><div>Portfolio optimization focuses on efficiently allocating investment across assets, a process often impacted by input parameter uncertainties. Robust optimization enhances traditional portfolio optimization models by accounting for these uncertainties, aiming to find solutions that perform well under a wide range of possible scenarios. We propose a robust version of the multi-period sparse mean–variance model where the uncertainty on the covariance matrix is described using a box uncertainty set. The bi-level worst-case problem is reformulated as a convex non-smooth single-level one by replacing the lower level with its Karush–Kuhn–Tucker conditions. An effective method for solving this problem is the alternating direction method of multipliers, which is characterized by theoretical solid convergence properties, even when the resulting subproblems are solved approximately. Numerical tests on real market data illustrate a good trade-off between optimality and robustness.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"470 ","pages":"Article 116729"},"PeriodicalIF":2.1,"publicationDate":"2025-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143906766","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A neural network-based method for pricing American options and assessing implied volatility under uncertainty 基于神经网络的不确定条件下美式期权定价及隐含波动率评估方法
IF 2.1 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2025-05-02 DOI: 10.1016/j.cam.2025.116719
Jinwu Gao , Haomiao Hu , Farshid Mehrdoust , Idin Noorani
{"title":"A neural network-based method for pricing American options and assessing implied volatility under uncertainty","authors":"Jinwu Gao ,&nbsp;Haomiao Hu ,&nbsp;Farshid Mehrdoust ,&nbsp;Idin Noorani","doi":"10.1016/j.cam.2025.116719","DOIUrl":"10.1016/j.cam.2025.116719","url":null,"abstract":"<div><div>American option pricing serves as a foundational concept in modern finance and investors commonly embrace this financial derivative for its advantageous flexibility in terms of exercise timing. Within the uncertainty theory literature, the calibration of the American option pricing model has not been explored to facilitate a meaningful comparison between the model-driven option prices and those observed in the market. This study aims to fill this gap by considering the asset price dynamic as some common uncertain models, such as the geometric Liu (GL) process, uncertain mean-reverting (UMR) process, and uncertain exponential mean-reverting (UEMR) process. This paper presents a novel hybrid method to calibrate the American option pricing model based on the uncertain option pricing model and artificial neural network (ANN). The proposed hybrid structure retains the unknown parameters involved in uncertain model while incorporating neural network techniques to improve accuracy in real market applications. Given that the realization of volatility smiles can help investors identify mispriced options and make more informed investment decisions, this study undertakes the first evaluation of the volatility smile for American options in the uncertain environment using an ANN. Empirical studies on the SPY market show that uncertain models equipped with the ANN, when compared to the common option pricing models, provide more accurate evaluations of American option prices and their volatility smile.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"470 ","pages":"Article 116719"},"PeriodicalIF":2.1,"publicationDate":"2025-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143904097","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Activation functions enabling the addition of neurons and layers without altering outcomes 激活功能可以在不改变结果的情况下增加神经元和层
IF 2.1 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2025-05-01 DOI: 10.1016/j.cam.2025.116730
Sergio López-Ureña
{"title":"Activation functions enabling the addition of neurons and layers without altering outcomes","authors":"Sergio López-Ureña","doi":"10.1016/j.cam.2025.116730","DOIUrl":"10.1016/j.cam.2025.116730","url":null,"abstract":"<div><div>In this work, we propose activation functions for neuronal networks that are <em>refinable</em> and <em>sum the identity</em>. This new class of activation functions allows the insertion of new layers between existing ones and/or the increase of neurons in a layer, both without altering the network outputs.</div><div>Our approach is grounded in <em>subdivision</em> theory. The proposed activation functions are constructed from basic limit functions of convergent subdivision schemes. As a showcase of our results, we introduce a family of spline activation functions and provide comprehensive details for their practical implementation.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"470 ","pages":"Article 116730"},"PeriodicalIF":2.1,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143891462","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Mesh-informed Reduced Order Models for aneurysm rupture risk prediction 用于动脉瘤破裂风险预测的网格化降阶模型
IF 2.1 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2025-04-30 DOI: 10.1016/j.cam.2025.116727
Giuseppe Alessio D’Inverno , Saeid Moradizadeh , Sajad Salavatidezfouli , Pasquale Claudio Africa , Gianluigi Rozza
{"title":"Mesh-informed Reduced Order Models for aneurysm rupture risk prediction","authors":"Giuseppe Alessio D’Inverno ,&nbsp;Saeid Moradizadeh ,&nbsp;Sajad Salavatidezfouli ,&nbsp;Pasquale Claudio Africa ,&nbsp;Gianluigi Rozza","doi":"10.1016/j.cam.2025.116727","DOIUrl":"10.1016/j.cam.2025.116727","url":null,"abstract":"<div><div>The complexity of the cardiovascular system needs to be accurately reproduced in order to promptly acknowledge health conditions; to this aim, advanced multifidelity and multiphysics numerical models are crucial. On one side, Full Order Models (FOMs) deliver accurate hemodynamic assessments, but their high computational demands hinder their real-time clinical application. In contrast, Reduced Order Models (ROMs) provide more efficient yet accurate solutions, essential for personalized healthcare and timely clinical decision-making. In this work, we explore the application of computational fluid dynamics (CFD) in cardiovascular medicine by integrating FOMs with ROMs for predicting the risk of aortic aneurysm growth and rupture. Wall Shear Stress (WSS) and the Oscillatory Shear Index (OSI), sampled at different growth stages of the thoracic aortic aneurysm, are predicted by means of Graph Neural Networks (GNNs). GNNs exploit the natural graph structure of the mesh obtained by the Finite Volume (FV) discretization, taking into account the spatial local information, regardless of the dimension of the input graph. Our experimental validation framework yields promising results, confirming our method as a valid alternative that overcomes the curse of dimensionality.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"470 ","pages":"Article 116727"},"PeriodicalIF":2.1,"publicationDate":"2025-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143894906","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An efficient numerical method for 1D singularly perturbed parabolic convection–diffusion systems with repulsive interior turning points 具有排斥性内拐点的一维奇异摄动抛物对流扩散系统的有效数值方法
IF 2.1 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2025-04-29 DOI: 10.1016/j.cam.2025.116728
Carmelo Clavero , Juan Carlos Jorge
{"title":"An efficient numerical method for 1D singularly perturbed parabolic convection–diffusion systems with repulsive interior turning points","authors":"Carmelo Clavero ,&nbsp;Juan Carlos Jorge","doi":"10.1016/j.cam.2025.116728","DOIUrl":"10.1016/j.cam.2025.116728","url":null,"abstract":"<div><div>In this work, we propose and study a numerical method to solve efficiently one-dimensional parabolic singularly perturbed systems of convection–diffusion type, for which the convection coefficient is zero at an interior point of the spatial domain. We focus our attention on the case of having the same diffusion parameter in both equations; as well we assume adequate signs on the convective coefficients in order to the interior turning point is of repulsive type. Under these conditions, if the data of the problem are composed by continuous functions, the exact evolutionary solution, in general, has regular boundary layers at the end points of the spatial domain. To solve this type of problems, we combine the fractional implicit Euler method and the classical upwind scheme, defined on a special mesh of Shishkin type. The resulting numerical method reach uniform convergence of first order in time and almost first order in space. Numerical results obtained for different test problems are shown which corroborate in practice the uniform convergence of the numerical algorithm and also their computational efficiency in comparison with classical numerical methods used for the same type of problems.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"470 ","pages":"Article 116728"},"PeriodicalIF":2.1,"publicationDate":"2025-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143894907","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Implicit Schwarz domain decomposition method for a Rayleigh–Bénard problem rayleigh - bassaard问题的隐式Schwarz域分解方法
IF 2.1 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2025-04-28 DOI: 10.1016/j.cam.2025.116718
D. Martínez, H. Herrero, F. Pla
{"title":"Implicit Schwarz domain decomposition method for a Rayleigh–Bénard problem","authors":"D. Martínez,&nbsp;H. Herrero,&nbsp;F. Pla","doi":"10.1016/j.cam.2025.116718","DOIUrl":"10.1016/j.cam.2025.116718","url":null,"abstract":"<div><div>This paper introduces an implicit Schwarz domain decomposition (SDD) method for solving the Rayleigh–Bénard convection problem. The motivation behind this work is to develop an alternative algorithm that eliminates the stagnation error observed in the alternating Schwarz domain decomposition method while enhancing information transmission across subdomain interfaces. A key question explored is whether the implicit SDD method is comparable to the alternating approach and whether it provides a real improvement in terms of efficiency and accuracy. The study focuses on establishing a theoretical proof of convergence for the implicit SDD method combined with Legendre collocation, ensuring its suitability for the Rayleigh–Bénard problem. Additionally, efforts are made to optimize computational cost, making the algorithm more practical for large-scale simulations. Numerical validation is carried out to assess its performance and confirm its advantages. Unlike the alternating approach, which requires solving multiple systems per time step, the implicit method solves a single system, potentially improving convergence speed. Theoretical analysis and numerical experiments demonstrate that this approach effectively improves the accuracy and reduces computational effort, particularly in the case of asymmetric domain decompositions.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"470 ","pages":"Article 116718"},"PeriodicalIF":2.1,"publicationDate":"2025-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143906765","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Common fixed point theorems for discontinuous mappings in M-metric space and numerical approximations m -度量空间中不连续映射的公共不动点定理及数值逼近
IF 2.1 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2025-04-28 DOI: 10.1016/j.cam.2025.116720
Kapil Yadav, Deepak Kumar
{"title":"Common fixed point theorems for discontinuous mappings in M-metric space and numerical approximations","authors":"Kapil Yadav,&nbsp;Deepak Kumar","doi":"10.1016/j.cam.2025.116720","DOIUrl":"10.1016/j.cam.2025.116720","url":null,"abstract":"<div><div>Generalized metric spaces have emerged as efficient extensions to the traditional metric space and provided novel insights into the generalized fixed point results. In this manuscript, we present a novel approach for fixed point results within the framework of <span><math><mi>M</mi></math></span>-metric space, characterized by the contraction mappings. The condition of continuity of these Banach contraction mappings is not essential in this structure, as it is in the usual metric space. We identify the scenarios in which traditional contraction mappings in metric space do not hold. But their extended versions within <span><math><mi>M</mi></math></span>-metric space establish the desired results. Additionally, we study the behavior of contraction mappings graphically in both metric space and <span><math><mi>M</mi></math></span>-metric space to highlight the difference and importance of <span><math><mi>M</mi></math></span>-metric space. Further, some results on the existence of common fixed points for pairs of self-mappings in incomplete space are established. Also, we discuss the result on the existence of a common fixed point for three self-mappings (not necessarily continuous), which is an extension of the work of Petrov (2023). To support our findings, various examples are discussed and some numerical iterations with the graphs for approximating the common fixed point are presented.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"470 ","pages":"Article 116720"},"PeriodicalIF":2.1,"publicationDate":"2025-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143899282","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A generalized complex power iteration-based algorithm for quartic–quadratic optimization problems over a spherical constraint and its applications 球面约束下四次二次优化问题的广义复幂迭代算法及其应用
IF 2.1 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2025-04-26 DOI: 10.1016/j.cam.2025.116716
Jie Tang , Zhou Sheng , Xin Li
{"title":"A generalized complex power iteration-based algorithm for quartic–quadratic optimization problems over a spherical constraint and its applications","authors":"Jie Tang ,&nbsp;Zhou Sheng ,&nbsp;Xin Li","doi":"10.1016/j.cam.2025.116716","DOIUrl":"10.1016/j.cam.2025.116716","url":null,"abstract":"<div><div>Quartic–quadratic optimization problems over the sphere have received a great attention in various real problems. Observations of three concrete applications primarily trigger our interest in this problem. This paper considers a generalized complex power method to solve the problem. Such a nonconvex optimization problem is studied by giving a suitable shift term to ensure convexity. Several convergence results are established, and we analyze the worst-case complexity in terms of the step-size and the number of iterations. We then apply our method to three tasks: (1) computing the ground state of Bose–Einstein condensation (BEC); (2) computing the quartic–quadratic optimization problems over the ellipsoid, which arises in the problem of computing the ground state of BEC by using a new discretization; and (3) approximating the desired transmit beampattern. The reported numerical results indicate that our method performs relatively quickly and effectively.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"470 ","pages":"Article 116716"},"PeriodicalIF":2.1,"publicationDate":"2025-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143879419","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Subsampling for tensor least squares: Optimization and statistical perspectives 张量最小二乘的子采样:优化和统计观点
IF 2.1 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2025-04-24 DOI: 10.1016/j.cam.2025.116694
Ling Tang , Hanyu Li
{"title":"Subsampling for tensor least squares: Optimization and statistical perspectives","authors":"Ling Tang ,&nbsp;Hanyu Li","doi":"10.1016/j.cam.2025.116694","DOIUrl":"10.1016/j.cam.2025.116694","url":null,"abstract":"<div><div>In this paper, we propose the random subsampling method for tensor least squares problem with respect to the popular t-product. From the optimization perspective, we give the error bounds in the sense of probability for the solution and residual obtained by the proposed method. This perspective only considers the randomness of sampling, and the results indicate that leverage score sampling is superior to uniform sampling. From the statistical perspective, we derive the expressions of the conditional and unconditional expectations and variances for the solution. This perspective takes into account the randomness of both sampling and model noises simultaneously, and the results show that the unconditional variances for uniform sampling and leverage score sampling are both large and neither of them is dominant. In view of this, an optimal subsampling probability distribution is obtained by minimizing the trace of the unconditional variance. Finally, the feasibility and effectiveness of the proposed method and the correctness of the theoretical results are verified by numerical experiments.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"470 ","pages":"Article 116694"},"PeriodicalIF":2.1,"publicationDate":"2025-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143877186","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A nodally bound-preserving discontinuous Galerkin method for the drift–diffusion equation 漂移扩散方程的节点保界不连续Galerkin方法
IF 2.1 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2025-04-24 DOI: 10.1016/j.cam.2025.116670
Gabriel R. Barrenechea , Tristan Pryer , Alex Trenam
{"title":"A nodally bound-preserving discontinuous Galerkin method for the drift–diffusion equation","authors":"Gabriel R. Barrenechea ,&nbsp;Tristan Pryer ,&nbsp;Alex Trenam","doi":"10.1016/j.cam.2025.116670","DOIUrl":"10.1016/j.cam.2025.116670","url":null,"abstract":"<div><div>In this work, we introduce and analyse discontinuous Galerkin (dG) methods for the drift–diffusion model. We explore two dG formulations: a classical interior penalty approach and a nodally bound-preserving method. Whilst the interior penalty method demonstrates well-posedness and convergence, it fails to guarantee non-negativity of the solution. To address this deficit, which is often important to ensure in applications, we employ a positivity-preserving method based on a convex subset formulation, ensuring the non-negativity of the solution at the Lagrange nodes. We validate our findings by summarising extensive numerical experiments, highlighting the novelty and effectiveness of our approach in handling the complexities of charge carrier transport.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"470 ","pages":"Article 116670"},"PeriodicalIF":2.1,"publicationDate":"2025-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143886253","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"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学术官方微信