Journal of Computational and Applied Mathematics最新文献

筛选
英文 中文
A stable and high-accuracy numerical method for determining the time-dependent coefficient in the bioheat equation
IF 2.1 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2025-01-20 DOI: 10.1016/j.cam.2025.116528
Yan Qiao, Lin Sang, Hua Wu
{"title":"A stable and high-accuracy numerical method for determining the time-dependent coefficient in the bioheat equation","authors":"Yan Qiao,&nbsp;Lin Sang,&nbsp;Hua Wu","doi":"10.1016/j.cam.2025.116528","DOIUrl":"10.1016/j.cam.2025.116528","url":null,"abstract":"<div><div>In this paper, we propose a space–time spectral method for time-dependent coefficient identification of the inverse problem with the Ionkin-type nonlocal boundary and integral over-determination conditions. The Legendre–Galerkin method is applied in the spatial direction and the Legendre-tau method is applied in the time direction. And the method is also implemented by the explicit–implicit iterative method. The nonlinear term is collocated at the Chebyshev–Gauss–Lobatto points and computed explicitly by the fast Legendre transform. Tikhonov regularization is applied to employ the blood perfusion coefficient computation with the noisy perturbations. The adopted stabilization scheme presents a good performance in terms of accuracy, effectiveness and robustness on the inverse problem, especially for noisy perturbations. Numerical results are given to show the accuracy and stability of the approach and agree well with theory analysis. Optimal order convergence is also obtained through the estimates in the <span><math><msup><mrow><mi>L</mi></mrow><mrow><mn>2</mn></mrow></msup></math></span>-norm.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"464 ","pages":"Article 116528"},"PeriodicalIF":2.1,"publicationDate":"2025-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143169624","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
Blind deconvolution via a tensor adaptive non-convex total variation prior
IF 2.1 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2025-01-20 DOI: 10.1016/j.cam.2025.116511
Haobo Xu , Fang Li
{"title":"Blind deconvolution via a tensor adaptive non-convex total variation prior","authors":"Haobo Xu ,&nbsp;Fang Li","doi":"10.1016/j.cam.2025.116511","DOIUrl":"10.1016/j.cam.2025.116511","url":null,"abstract":"<div><div>Blind image deconvolution is a challenging task that aims to recover sharp images from blurry ones without knowing the blur kernel. Deblurring color images is even more difficult due to three color channels. Existing deblurring methods typically tackle each channel separately, treating them as individual grayscale images and designing priors specifically for grayscale images. However, these methods need to consider the relationships between color channels, leading to the need for a more precise estimation of blur kernels. In this paper, we have observed that the total variations of the three color channels of an image exhibit low-rank characteristics, which can be effectively captured using the tensor decomposition framework. To incorporate this observation, we propose a novel prior for color image deblurring. Specifically, we define a new tensor product using an image-adaptive transform matrix and apply a non-convex function to the tensor singular values to create a novel tensor norm. Then, we present the new tensor adaptive non-convex total variation prior for image deblurring. Numerically, we develop an efficient deblurring algorithm based on the half-quadratic splitting scheme. We provide detailed solutions for each sub-problem. Experimental results demonstrate that our method accurately estimates blur kernels and produces fewer artifacts on several benchmark datasets.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"463 ","pages":"Article 116511"},"PeriodicalIF":2.1,"publicationDate":"2025-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143155986","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
Non-convolutional general fractional operators and some of their properties
IF 2.1 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2025-01-18 DOI: 10.1016/j.cam.2025.116527
Hamza Al-Shdaifat , Rosana Rodríguez-López
{"title":"Non-convolutional general fractional operators and some of their properties","authors":"Hamza Al-Shdaifat ,&nbsp;Rosana Rodríguez-López","doi":"10.1016/j.cam.2025.116527","DOIUrl":"10.1016/j.cam.2025.116527","url":null,"abstract":"<div><div>In this work, we propose a general framework for fractional integrals without following a convolution-kernel approach, and consider the corresponding notions for fractional derivatives under different perspectives (Riemann–Liouville and Caputo-type), analyzing their main mathematical properties such as semi-group condition, and the linearity of the integral, as well as the first theorem of calculus. We study some connections between the different notions, and provide a generalized Sonin condition.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"464 ","pages":"Article 116527"},"PeriodicalIF":2.1,"publicationDate":"2025-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143168721","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
Rayleigh Quotient Iteration, cubic convergence, and second covariant derivative
IF 2.1 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2025-01-17 DOI: 10.1016/j.cam.2025.116522
Du Nguyen
{"title":"Rayleigh Quotient Iteration, cubic convergence, and second covariant derivative","authors":"Du Nguyen","doi":"10.1016/j.cam.2025.116522","DOIUrl":"10.1016/j.cam.2025.116522","url":null,"abstract":"<div><div>We generalize the Rayleigh Quotient Iteration (RQI) to the problem of solving a nonlinear equation where the variables are divided into two subsets, one satisfying additional equality constraints and the other could be considered as (generalized nonlinear Lagrange) multipliers. This framework covers several problems, including the (linear/nonlinear) eigenvalue problems, the constrained optimization problem, and the tensor eigenpair problem. Often, the RQI increment could be computed in two equivalent forms. The classical Rayleigh quotient algorithm uses the <em>Schur form</em>, while the projected Hessian method in constrained optimization uses the <em>Newton form</em>. We link the cubic convergence of these iterations with a <em>constrained Chebyshev term</em>, showing it is related to the geometric concept of <em>second covariant derivative</em>. Both the generalized Rayleigh quotient and the <em>Hessian of the retraction</em> used in the RQI appear in the Chebyshev term. We derive several cubic convergence results in application and construct new RQIs for matrix and tensor problems.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"463 ","pages":"Article 116522"},"PeriodicalIF":2.1,"publicationDate":"2025-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143155977","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
Monolithic multigrid for the marker-and-cell discretization of the Stokes–Darcy equations
IF 2.1 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2025-01-17 DOI: 10.1016/j.cam.2025.116518
Chen Greif, Yunhui He
{"title":"Monolithic multigrid for the marker-and-cell discretization of the Stokes–Darcy equations","authors":"Chen Greif,&nbsp;Yunhui He","doi":"10.1016/j.cam.2025.116518","DOIUrl":"10.1016/j.cam.2025.116518","url":null,"abstract":"<div><div>We consider the marker-and-cell scheme for numerically solving the Stokes–Darcy equations. The corresponding discrete system has a double saddle-point structure. Designing a fast solver for such a problem is challenging o the different scales of the physical parameters. We propose a monolithic multigrid solver with a block-lower-triangular smoother based on the block-LU decomposition of the coefficient matrix, which requires solving a Poisson-type equation with a scalar Laplacian and two Schur complement systems. We demonstrate the robustness of a sparse approximate inverse smoother for the Laplacian, and we handle the Schur complement systems by applying simple relaxation schemes as smoothers. The proposed scheme is economical, and yet it is robust with respect to the mesh size and the physical parameters.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"463 ","pages":"Article 116518"},"PeriodicalIF":2.1,"publicationDate":"2025-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143155985","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 direct updating method for undamped vibroacoustic FE models
IF 2.1 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2025-01-16 DOI: 10.1016/j.cam.2025.116524
Jiajie Luo , Wenting Duan , Min Zeng , Yongxin Yuan
{"title":"A direct updating method for undamped vibroacoustic FE models","authors":"Jiajie Luo ,&nbsp;Wenting Duan ,&nbsp;Min Zeng ,&nbsp;Yongxin Yuan","doi":"10.1016/j.cam.2025.116524","DOIUrl":"10.1016/j.cam.2025.116524","url":null,"abstract":"<div><div>Vibroacoustic systems involving an elastic structure enclosing an acoustic cavity are commonly found in aerospace, automobile, and other transportation equipment. This paper develops a direct method for simultaneously updating the mass and stiffness matrices of undamped vibroacoustic finite element (FE) models. The properties of updated coefficient matrices, including symmetry, characteristic equation and orthogonality, are imposed as constraints to form the matrix minimization problem. By utilizing the generalized singular value decomposition, the general solution of the constrained matrix equations is obtained. With it, the updated matrices are derived by using Kronecker product and matrix derivatives. Two numerical examples illustrate the effectiveness of the proposed method.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"463 ","pages":"Article 116524"},"PeriodicalIF":2.1,"publicationDate":"2025-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143155978","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
Alpha-maxmin mean-variance reinsurance-investment strategy under negative risk dependence between two markets
IF 2.1 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2025-01-16 DOI: 10.1016/j.cam.2025.116501
Hongping Wu , Liming Zhang , Qian Zhao
{"title":"Alpha-maxmin mean-variance reinsurance-investment strategy under negative risk dependence between two markets","authors":"Hongping Wu ,&nbsp;Liming Zhang ,&nbsp;Qian Zhao","doi":"10.1016/j.cam.2025.116501","DOIUrl":"10.1016/j.cam.2025.116501","url":null,"abstract":"<div><div>This paper investigates the optimal reinsurance-investment problem in the context of negative dependence between the insurance and financial markets, stemming from the general risk dependence between the jump–diffusion process of risky asset prices and aggregate claims process. Under the <span><math><mi>α</mi></math></span>-maxmin mean–variance (MV) criterion, the insurer is allowed to purchase per-loss reinsurance and invest in a financial market, with the generalized mean–variance premium principle employed to calculate the reinsurance premium. By solving the corresponding Extended Hamilton–Jacobi–Bellman (EHJB) equation, we derive the <span><math><mi>α</mi></math></span>-robust equilibrium reinsurance-investment strategy and then discuss the form of the optimal reinsurance strategy. Our findings indicate that, under the assumption of negative dependence, investing can serve as a more effective risk-hedging tool for claims risk, prompting the insurer to favor investing in risky asset while retaining a greater proportion of claims compared to scenarios without such dependence. Furthermore, assuming the presence of negative dependence, the variance premium principle indicates that a combined form of proportional and excess-of-loss reinsurance is optimal, rather than solely proportional reinsurance with the majority of papers recognizing. Finally, a sensitivity analysis is performed with numerical examples, and the impact of various parameters on the results is analyzed.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"463 ","pages":"Article 116501"},"PeriodicalIF":2.1,"publicationDate":"2025-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143155976","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
Inter-frame feature fusion enhanced spatio-temporal consistent video inpainting with sample-based techniques and adaptive local search
IF 2.1 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2025-01-16 DOI: 10.1016/j.cam.2025.116523
Ruyi Han , Shenghai Liao , Shujun Fu , Yuanfeng Zhou , Yuliang Li , Hongbin Han
{"title":"Inter-frame feature fusion enhanced spatio-temporal consistent video inpainting with sample-based techniques and adaptive local search","authors":"Ruyi Han ,&nbsp;Shenghai Liao ,&nbsp;Shujun Fu ,&nbsp;Yuanfeng Zhou ,&nbsp;Yuliang Li ,&nbsp;Hongbin Han","doi":"10.1016/j.cam.2025.116523","DOIUrl":"10.1016/j.cam.2025.116523","url":null,"abstract":"<div><div>Video inpainting is an ill-posed inverse problem in image processing focused on eliminating unwanted objects and restoring damaged or corrupted regions within a video sequence. During video transmission, challenges such as network bandwidth limitations and transmission errors can lead to the loss of crucial information in specific frames. To address this issue, we propose a novel and effective sample-based video inpainting method in this paper. Firstly, an extension frame search strategy is introduced, utilizing image fusion techniques to integrate information from extension frames for more effective restoration of damaged areas and ensuring temporal consistency in the repair process. Secondly, a new priority scheme is proposed to accurately measure the inpainting order of image blocks and to effectively inpaint the structure and texture of video frames. An adaptive local search window is then designed to find the optimal matching block for a target block, ensuring spatial continuity in restoration and reducing the time cost of the proposed algorithm. Additionally, to enhance matching accuracy, a Weighted Sum of Squared Differences (WSSD) matching method based on a facet model is presented in this work. Finally, the proposed method is tested on videos with various backgrounds and damaged blocks of different sizes and locations. Experimental results indicate that our method outperforms six state-of-the-art video inpainting methods both qualitatively and quantitatively.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"464 ","pages":"Article 116523"},"PeriodicalIF":2.1,"publicationDate":"2025-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143170289","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
Two-player LQ Stackelberg difference game with open-loop strategy under stochastic discrete-time dynamics in finite horizon
IF 2.1 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2025-01-15 DOI: 10.1016/j.cam.2025.116510
Yaning Lin , Shuaichen Geng , Weihai Zhang
{"title":"Two-player LQ Stackelberg difference game with open-loop strategy under stochastic discrete-time dynamics in finite horizon","authors":"Yaning Lin ,&nbsp;Shuaichen Geng ,&nbsp;Weihai Zhang","doi":"10.1016/j.cam.2025.116510","DOIUrl":"10.1016/j.cam.2025.116510","url":null,"abstract":"<div><div>This paper investigates the LQ open-loop Stackelberg game for the discrete-time stochastic systems in finite horizon. A necessary and sufficient condition for the existence and uniqueness of the open-loop Stackelberg strategy is put forward in terms of the positive definiteness of some matrices. By introducing new state and costate variables, it is shown that the open-loop Stackelberg equilibrium admits a feedback representation based on the solutions of three decoupled and symmetric Riccati equations. Finally, two examples are discussed to highlight the effectiveness of the proposed results.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"463 ","pages":"Article 116510"},"PeriodicalIF":2.1,"publicationDate":"2025-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143155973","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 novel gradient-based discrete time-delayed optimization algorithm for optimal control problems with Caputo–Fabrizio fractional derivative
IF 2.1 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2025-01-15 DOI: 10.1016/j.cam.2025.116526
Indranil Ghosh, Huey Tyng Cheong, Kok Lay Teo
{"title":"A novel gradient-based discrete time-delayed optimization algorithm for optimal control problems with Caputo–Fabrizio fractional derivative","authors":"Indranil Ghosh,&nbsp;Huey Tyng Cheong,&nbsp;Kok Lay Teo","doi":"10.1016/j.cam.2025.116526","DOIUrl":"10.1016/j.cam.2025.116526","url":null,"abstract":"<div><div>In this paper, we consider a class of fractional optimal control problems (FOCPs) involving the Caputo–Fabrizio (CF) derivative operator. The Adams–Bashforth numerical integration method is used to discretize the fractional-order system, and the trapezoidal rule is introduced to approximate the cost function. Interestingly, this leads to a discrete-time time-delay optimal control problem. On this basis, we derive the gradient formulae of the cost and constraint functions with respect to decision variables and we propose a novel normalization function for the CF derivative operator. Then, a gradient-based optimization algorithm is designed to solve this discrete-time time-delay optimal control problem. Finally, numerical simulations of three example problems are performed to illustrate the effectiveness of the developed algorithm.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"464 ","pages":"Article 116526"},"PeriodicalIF":2.1,"publicationDate":"2025-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143169622","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学术官方微信