Journal of Computational and Applied Mathematics最新文献

筛选
英文 中文
G1 Hermite interpolation by planar quintic-like algebraic–trigonometric Pythagorean-hodograph curves 平面五次代数-三角毕达哥拉斯曲线的Hermite插值
IF 2.6 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2025-08-04 DOI: 10.1016/j.cam.2025.116972
Yong-Xia Hao, Di Wu
{"title":"G1 Hermite interpolation by planar quintic-like algebraic–trigonometric Pythagorean-hodograph curves","authors":"Yong-Xia Hao,&nbsp;Di Wu","doi":"10.1016/j.cam.2025.116972","DOIUrl":"10.1016/j.cam.2025.116972","url":null,"abstract":"<div><div>This paper discusses the construction of Algebraic–trigonometric Pythagorean-hodograph (ATPH) quintic-like curves, where the end-points, end-tangents, and a specified arc length are prescribed. Through reduction of the original data to canonical form with equal-magnitude, a comprehensive characterization of the solutions is achieved. This characterization is framed as the task of determining the real solutions to a system of quadratic equations, which incorporates a global free shape parameter <span><math><mi>α</mi></math></span>. After careful analysis, it is demonstrated that the system possesses two closed-form solutions. To facilitate practical implementation, the corresponding algorithm is presented in detail. Furthermore, several illustrative examples are provided to demonstrate the construction process and explore the impact of the shape parameter <span><math><mi>α</mi></math></span> on the ATPH quintic-like curves. These examples not only show the flexibility offered by <span><math><mi>α</mi></math></span>, but also provide valuable insights into how this parameter can be manipulated to achieve desired curve shapes.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"474 ","pages":"Article 116972"},"PeriodicalIF":2.6,"publicationDate":"2025-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144771271","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
Multiplicative fractional HH-type inequalities via multiplicative AB-fractional integral operators 乘式分数hh型不等式的乘式ab -分数积分算子
IF 2.6 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2025-07-31 DOI: 10.1016/j.cam.2025.116970
Tingsong Du , Yun Long , Jiagen Liao
{"title":"Multiplicative fractional HH-type inequalities via multiplicative AB-fractional integral operators","authors":"Tingsong Du ,&nbsp;Yun Long ,&nbsp;Jiagen Liao","doi":"10.1016/j.cam.2025.116970","DOIUrl":"10.1016/j.cam.2025.116970","url":null,"abstract":"<div><div>We introduce a novel group of integral operators, named as multiplicative Atangana–Baleanu fractional integrals. Moving in this direction, we discuss its <span><math><msup><mrow></mrow><mrow><mo>∗</mo></mrow></msup></math></span>integrability together with continuity, and establish multiplicative fractional Hermite–Hadamard inequalities. Further, an equality of trapezoid type and an inequality of midpoint type are presented here. With the assistance of these, and the fact that the function <span><math><msup><mrow><mi>F</mi></mrow><mrow><mo>∗</mo></mrow></msup></math></span> is multiplicatively convex or the function <span><math><msup><mrow><mfenced><mrow><mi>ln</mi><msup><mrow><mi>F</mi></mrow><mrow><mo>∗</mo></mrow></msup></mrow></mfenced></mrow><mrow><mi>q</mi></mrow></msup></math></span> is convex for some fixed <span><math><mrow><mi>q</mi><mo>&gt;</mo><mn>1</mn></mrow></math></span>, especially considering the case of <span><math><mrow><mn>0</mn><mo>&lt;</mo><mi>q</mi><mo>≤</mo><mn>1</mn></mrow></math></span>, we formulate a series of multiplicative fractional Hermite–Hadamard-type inequalities. At the same time, we provide certain examples along with their graphical descriptions, from which the correctness of the inequalities gained in the current paper can be examined. Some applications in special means are offered as well.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"474 ","pages":"Article 116970"},"PeriodicalIF":2.6,"publicationDate":"2025-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144764036","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
Numerical exploration of B-Fredholm spectra in unbounded block operator matrices 无界块算子矩阵中B-Fredholm谱的数值探索
IF 2.6 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2025-07-31 DOI: 10.1016/j.cam.2025.116955
Aymen Bahloul
{"title":"Numerical exploration of B-Fredholm spectra in unbounded block operator matrices","authors":"Aymen Bahloul","doi":"10.1016/j.cam.2025.116955","DOIUrl":"10.1016/j.cam.2025.116955","url":null,"abstract":"<div><div>This paper investigates the B-Fredholm spectral properties of unbounded block operator matrices defined on Banach spaces, motivated by their foundational role in spectral theory and their occurrence in physical models governed by evolution equations. Under a relaxed set of assumptions, the analysis provides a refined characterization of the B-essential spectra. The study introduces pivotal theorems that establish relationships between the spectra of the full operator matrix and its diagonal components, using Schur complement techniques. Numerical examples are included to illustrate the theoretical results, with explicit computations of resolvents and B-essential spectra for selected operator structures. The results contribute to advancing the spectral theory of unbounded operator matrices and open new directions that link abstract results to concrete applications within a numerical framework.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"474 ","pages":"Article 116955"},"PeriodicalIF":2.6,"publicationDate":"2025-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144771275","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
Galois duality of matrix product codes with applications 矩阵乘积码的伽罗瓦对偶性及其应用
IF 2.6 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2025-07-31 DOI: 10.1016/j.cam.2025.116954
Ramy Taki Eldin
{"title":"Galois duality of matrix product codes with applications","authors":"Ramy Taki Eldin","doi":"10.1016/j.cam.2025.116954","DOIUrl":"10.1016/j.cam.2025.116954","url":null,"abstract":"<div><div>In recent literature, matrix product (MP) codes and their duals have gained significant attention due to their applications in constructing quantum stabilizer codes. In this paper, we present a general formula characterizing the Galois dual of MP codes. Using this formula, we establish necessary and sufficient conditions under which MP codes are Galois self-orthogonal and dual-containing. Unlike previous results that describe the Euclidean and Hermitian duals of MP codes only under specific assumptions on the defining matrix, our characterization applies to MP codes with defining matrices that are not necessarily square nor of full row rank. Moreover, we consider the more general framework of Galois duals, with Euclidean and Hermitian duals treated as special cases. To demonstrate the theoretical results, several numerical examples of MP codes with best-known parameters are provided.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"474 ","pages":"Article 116954"},"PeriodicalIF":2.6,"publicationDate":"2025-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144749293","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
Upper bounds for eigenvalues of symmetric substochastic matrices and applications 对称次随机矩阵特征值的上界及其应用
IF 2.6 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2025-07-31 DOI: 10.1016/j.cam.2025.116965
Kongzhi Li , Xiaoping Xue
{"title":"Upper bounds for eigenvalues of symmetric substochastic matrices and applications","authors":"Kongzhi Li ,&nbsp;Xiaoping Xue","doi":"10.1016/j.cam.2025.116965","DOIUrl":"10.1016/j.cam.2025.116965","url":null,"abstract":"<div><div>This paper presents the upper bounds for eigenvalues of the symmetric substochastic matrices, which are related to the measure of irreducibility of matrices. Then three applications in different fields are presented to indicate further applications. In the first one, the bounds for eigenvalues are used to prove that a class of iteration systems could reach a consensus under certain conditions. In the second one, they are used to prove the flocking behaviors of the Cucker–Smale model under rooted leadership. In the last one, a new approach to estimate the upper bounds for eigenvalues of nonnegative matrices is provided.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"474 ","pages":"Article 116965"},"PeriodicalIF":2.6,"publicationDate":"2025-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144771272","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
Neural networks for solving least squares solution of polynomial systems with time-varying tensors 求解具有时变张量的多项式系统最小二乘解的神经网络
IF 2.6 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2025-07-31 DOI: 10.1016/j.cam.2025.116952
Jianhua Li , Xuezhong Wang , Kai Wang , Yimin Wei
{"title":"Neural networks for solving least squares solution of polynomial systems with time-varying tensors","authors":"Jianhua Li ,&nbsp;Xuezhong Wang ,&nbsp;Kai Wang ,&nbsp;Yimin Wei","doi":"10.1016/j.cam.2025.116952","DOIUrl":"10.1016/j.cam.2025.116952","url":null,"abstract":"<div><div>This study introduces a groundbreaking least squares approach tailored for solving time-varying tensor polynomial systems, where both coefficients and right-hand side vectors evolve dynamically over time. To address this challenge, we propose two innovative neural networks: HNN and MwsbpHNN.</div><div>HNN is designed to converge to a least squares solution of the time-varying tensor polynomial systems, demonstrating its efficacy in handling dynamic data. MwsbpHNN takes this a step further by achieving fixed-time convergence, a significant advancement over existing methods, while simultaneously exhibiting noise tolerance, ensuring robust performance even in noisy environments. We derive rigorous upper bounds on the convergence time for MwsbpHNN, providing a theoretical foundation for its rapid and reliable operation.</div><div>Numerical simulations validate the effectiveness and robustness of both HNN and MwsbpHNN, underscoring their potential to revolutionize the field of tensor polynomial system solving.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"474 ","pages":"Article 116952"},"PeriodicalIF":2.6,"publicationDate":"2025-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144757931","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 tensor decomposition-based approach for internet traffic data recovery and forecast 一种基于张量分解的互联网流量数据恢复与预测新方法
IF 2.6 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2025-07-30 DOI: 10.1016/j.cam.2025.116959
Chen Ling , Jinjie Liu , Wenhui Xie , Yuxuan Duan
{"title":"A novel tensor decomposition-based approach for internet traffic data recovery and forecast","authors":"Chen Ling ,&nbsp;Jinjie Liu ,&nbsp;Wenhui Xie ,&nbsp;Yuxuan Duan","doi":"10.1016/j.cam.2025.116959","DOIUrl":"10.1016/j.cam.2025.116959","url":null,"abstract":"<div><div>Recovery and forecast of network traffic data from incomplete observed data is an important issue in internet engineering and management. In this paper, by fully considering the temporal stability and periodicity features in internet traffic data, a novel optimization model for internet data recovery and forecast is proposed, which is based upon the newly introduced higher-order tensor decomposition form called tubal tensor train (TTT) decomposition. Moreover, by introducing auxiliary variables and penalty techniques, a relaxation of the proposed model is obtained. Then, an easy-to-operate and effective algorithm for solving the relaxation model is proposed. We prove that the sequence generated by the proposed algorithm converges to a stationary point of the established relaxation model. A series of numerical experiments about the recovery of structurally missing traffic data and the traffic data prediction on the widely used real-world datasets demonstrate that our approach have favorable performance than some state-of-the-art tensor/matrix based approaches.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"474 ","pages":"Article 116959"},"PeriodicalIF":2.6,"publicationDate":"2025-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144771274","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
Stability for the inverse source problem of the biharmonic wave equation 双谐波波动方程逆源问题的稳定性
IF 2.6 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2025-07-30 DOI: 10.1016/j.cam.2025.116953
Suliang Si
{"title":"Stability for the inverse source problem of the biharmonic wave equation","authors":"Suliang Si","doi":"10.1016/j.cam.2025.116953","DOIUrl":"10.1016/j.cam.2025.116953","url":null,"abstract":"<div><div>In this paper, we show the increasing stability of the inverse source problem for the biharmonic operator. Especially, we develop a new, unified approach to study the increasing stability in any dimension. The estimate consists of the Lipschitz-type data discrepancy and the high-frequency tail of the source function, where the latter decreases as the upper bound of the frequency increases. The method is based on the Fourier transform and explicit bounds for the analytic continuation.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"474 ","pages":"Article 116953"},"PeriodicalIF":2.6,"publicationDate":"2025-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144767190","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 fast generalized prediction–correction dual–primal hybrid gradient algorithm for bilinear saddle point problems with applications to total variation image processing 双线性鞍点问题的快速广义预测校正双原始混合梯度算法及其在全变分图像处理中的应用
IF 2.6 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2025-07-30 DOI: 10.1016/j.cam.2025.116956
Si Li , Shibei Xue , Lihan Zhou , Shan Ma
{"title":"A fast generalized prediction–correction dual–primal hybrid gradient algorithm for bilinear saddle point problems with applications to total variation image processing","authors":"Si Li ,&nbsp;Shibei Xue ,&nbsp;Lihan Zhou ,&nbsp;Shan Ma","doi":"10.1016/j.cam.2025.116956","DOIUrl":"10.1016/j.cam.2025.116956","url":null,"abstract":"<div><div>The primal–dual hybrid gradient (PDHG) algorithm has been extensively studied and utilized for solving bilinear saddle point problems due to its inexpensive computations. Most recently, a prediction–correction PDHG (PC-PDHG) algorithm has been proposed in literature for solving linearly constrained convex optimization problems, which improves the convergence condition of PDHG and accelerates its numerical performance. In this paper, we introduce a dual–primal version of the newly developed PC-PDHG algorithm and extend its applicability to general bilinear saddle point problems, resulting in the generalized new prediction–correction dual–primal hybrid gradient (GNPC-DPHG) algorithm. In many instances, the proposed algorithm significantly reduces the number of iterations compared to the original algorithm, while only adding a small amount of computational cost per iteration, thereby enhancing the convergence rate. Furthermore, we provide a rigorous proof of the global convergence of the proposed GNPC-DPHG algorithm. Finally, numerical experiments demonstrate that the proposed algorithm can achieve faster convergence compared to the original algorithm.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"474 ","pages":"Article 116956"},"PeriodicalIF":2.6,"publicationDate":"2025-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144757929","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 RBF-based Nyström method for Second–Kind Fredholm Integral Equations 一类Fredholm积分方程的基于rbf的Nyström方法
IF 2.6 2区 数学
Journal of Computational and Applied Mathematics Pub Date : 2025-07-30 DOI: 10.1016/j.cam.2025.116968
Roberto Cavoretto , Alessandra De Rossi , Anna Lucia Laguardia , Domenico Mezzanotte , Donatella Occorsio , Maria Grazia Russo
{"title":"An RBF-based Nyström method for Second–Kind Fredholm Integral Equations","authors":"Roberto Cavoretto ,&nbsp;Alessandra De Rossi ,&nbsp;Anna Lucia Laguardia ,&nbsp;Domenico Mezzanotte ,&nbsp;Donatella Occorsio ,&nbsp;Maria Grazia Russo","doi":"10.1016/j.cam.2025.116968","DOIUrl":"10.1016/j.cam.2025.116968","url":null,"abstract":"<div><div>The aim of this paper is to numerically solve Fredholm Integral Equations (FIEs) of the second kind, when the right-hand side term and the kernel are known only at scattered sample points. The proposed method is of the Nyström type and leverages a cubature rule based on Radial Basis Function (RBF) interpolation, with the Leave-One-Out Cross-Validation (LOOCV) technique used to select the optimal RBF shape parameter. The convergence of the method is proven in the space of continuous functions. Finally, numerical tests demonstrate the performance of the method for various RBF choices and provide direct comparisons with other RBF-based techniques for FIEs available in the literature.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"474 ","pages":"Article 116968"},"PeriodicalIF":2.6,"publicationDate":"2025-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144749294","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学术文献互助群
群 号:604180095
Book学术官方微信