发布求助
文献互助 智能选刊 最新文献

Numerical Algorithms最新文献

筛选
英文 中文
A least-change secant algorithm for solving generalized complementarity problem 求解广义互补问题的最小变化正割算法
IF 2.1 3区 数学
Numerical Algorithms Pub Date : 2024-08-28 DOI: 10.1007/s11075-024-01870-4
H. Vivas, R. Pérez, C. Arias
{"title":"A least-change secant algorithm for solving generalized complementarity problem","authors":"H. Vivas, R. Pérez, C. Arias","doi":"10.1007/s11075-024-01870-4","DOIUrl":"https://doi.org/10.1007/s11075-024-01870-4","url":null,"abstract":"<p>In this paper, we propose a least-change secant algorithm to solve the generalized complementarity problem indirectly trough its reformulation as a nonsmooth system of nonlinear equations using a one-parametric family of complementarity functions. We present local and superlinear convergence results of new algorithm and analyze its numerical performance.</p>","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2024-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142199706","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
Spatially adapted parameters selection based on the local constraints for Gaussian plus impulse image deblurring 基于高斯加脉冲图像去模糊局部约束的空间适应性参数选择
IF 2.1 3区 数学
Numerical Algorithms Pub Date : 2024-08-24 DOI: 10.1007/s11075-024-01924-7
Rong Li, Bing Zheng
{"title":"Spatially adapted parameters selection based on the local constraints for Gaussian plus impulse image deblurring","authors":"Rong Li, Bing Zheng","doi":"10.1007/s11075-024-01924-7","DOIUrl":"https://doi.org/10.1007/s11075-024-01924-7","url":null,"abstract":"<p>In this paper, we present a novel <span>(L^{1})</span>-<span>(L^{2})</span>-TV model for image deblurring that incorporates spatially varying regularization parameters, addressing the challenge of mixed Gaussian and impulse noise. The traditional Total Variation (TV) model with <span>(L^{1})</span> and <span>(L^{2})</span> fidelity terms is well-recognized for its effectiveness in such scenarios, but our proposed approach enhances this by allowing the regularization parameters to adapt based on local image characteristics. This ensures that fine details are better preserved while maintaining smoothness in homogeneous areas. The spatially dependent regularization parameters are automatically determined using local discrepancy functions. The discrete minimization problem that arises from this model is efficiently solved using the inexact alternating direction method (IADM). Our numerical experiments show that the proposed algorithm significantly improves the peak signal-to-noise ratio (PSNR) and structural similarity index (SSIM) by enhancing detailed regions and effectively removing both types of noise.</p>","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2024-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142199672","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 finite difference method for elliptic equations with the variable-order fractional derivative 带变阶分数导数的椭圆方程有限差分法
IF 2.1 3区 数学
Numerical Algorithms Pub Date : 2024-08-23 DOI: 10.1007/s11075-024-01922-9
Siyuan Shi, Zhaopeng Hao, Rui Du
{"title":"A finite difference method for elliptic equations with the variable-order fractional derivative","authors":"Siyuan Shi, Zhaopeng Hao, Rui Du","doi":"10.1007/s11075-024-01922-9","DOIUrl":"https://doi.org/10.1007/s11075-024-01922-9","url":null,"abstract":"<p>An efficient finite difference method for the multi-dimensional differential equation with variable-order Riemann-Liouville derivative is studied. Firstly, we construct an efficient discrete approximation for the multi-dimensional variable-order Riemann-Liouville derivative by the generating functions approximation theory. The convergence of the discrete operator in the Barron space is analyzed. Based on it, we present the finite difference method for the elliptic equation with variable-order Riemann-Liouville derivative. The stability and convergence of the method are proven by the maximum principle. Moreover, a fast solver is presented in the computation based on the fast Fourier transform and the multigrid algorithm in order to reduce the storage and speed up the BiCGSTAB method, respectively. We extend this method to time-dependent problems and several numerical examples show that the proposed schemes and the fast solver are efficient.</p>","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2024-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142199673","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
Efficient quaternion CUR method for low-rank approximation to quaternion matrix 用于低阶逼近四元数矩阵的高效四元数 CUR 方法
IF 2.1 3区 数学
Numerical Algorithms Pub Date : 2024-08-22 DOI: 10.1007/s11075-024-01923-8
Pengling Wu, Kit Ian Kou, Hongmin Cai, Zhaoyuan Yu
{"title":"Efficient quaternion CUR method for low-rank approximation to quaternion matrix","authors":"Pengling Wu, Kit Ian Kou, Hongmin Cai, Zhaoyuan Yu","doi":"10.1007/s11075-024-01923-8","DOIUrl":"https://doi.org/10.1007/s11075-024-01923-8","url":null,"abstract":"<p>The low-rank quaternion matrix approximation has been successfully applied in many applications involving signal processing and color image processing. However, the cost of quaternion models for generating low-rank quaternion matrix approximation is sometimes considerable due to the computation of the quaternion singular value decomposition (QSVD), which limits their application to real large-scale data. To address this deficiency, an efficient quaternion matrix CUR (QMCUR) method for low-rank approximation is suggested, which provides significant acceleration in color image processing. We first explore the QMCUR approximation method, which uses actual columns and rows of the given quaternion matrix, instead of the costly QSVD. Additionally, two different sampling strategies are used to sample the above-selected columns and rows. Then, the perturbation analysis is performed on the QMCUR approximation of noisy versions of low-rank quaternion matrices. And we also employ the proposed QMCUR method to color image recovery problem. Extensive experiments on both synthetic and real data further reveal the superiority of the proposed algorithm compared with other algorithms for getting low-rank approximation, in terms of both efficiency and accuracy.</p>","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142199700","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
Second-order a priori and a posteriori error estimations for integral boundary value problems of nonlinear singularly perturbed parameterized form 非线性奇异扰动参数化形式积分边界值问题的二阶先验和后验误差估计
IF 2.1 3区 数学
Numerical Algorithms Pub Date : 2024-08-21 DOI: 10.1007/s11075-024-01918-5
Shashikant Kumar, Sunil Kumar, Pratibhamoy Das
{"title":"Second-order a priori and a posteriori error estimations for integral boundary value problems of nonlinear singularly perturbed parameterized form","authors":"Shashikant Kumar, Sunil Kumar, Pratibhamoy Das","doi":"10.1007/s11075-024-01918-5","DOIUrl":"https://doi.org/10.1007/s11075-024-01918-5","url":null,"abstract":"<p>In this work, we present the <i>a priori</i> and <i>a posteriori</i> error analysis of a hybrid difference scheme for integral boundary value problems of nonlinear singularly perturbed parameterized form. The discretization for the nonlinear parameterized equation constitutes a hybrid difference scheme which is based on a suitable combination of the trapezoidal scheme and the backward difference scheme. Further, we employ the composite trapezoidal scheme for the discretization of the nonlocal boundary condition. <i>A priori</i> error estimation is provided for the proposed hybrid scheme, which leads to second-order uniform convergence on various <i>a priori</i> defined meshes. Moreover, a detailed <i>a posteriori</i> error analysis is carried out for the present hybrid scheme which provides a proper discretization of the error equidistribution at each partition. Numerical results strongly validate the theoretical findings for nonlinear problems with integral boundary conditions.</p>","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2024-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142199699","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
An efficient hybrid numerical approach for solving two-dimensional fractional cable model involving time-fractional operator of distributed order with error analysis 一种高效的混合数值方法，用于求解涉及分布阶时间分数算子的二维分数电缆模型并进行误差分析
IF 2.1 3区 数学
Numerical Algorithms Pub Date : 2024-08-17 DOI: 10.1007/s11075-024-01913-w
Saeed Kosari, Peng Xu, Jana Shafi, MohammadHossein Derakhshan
{"title":"An efficient hybrid numerical approach for solving two-dimensional fractional cable model involving time-fractional operator of distributed order with error analysis","authors":"Saeed Kosari, Peng Xu, Jana Shafi, MohammadHossein Derakhshan","doi":"10.1007/s11075-024-01913-w","DOIUrl":"https://doi.org/10.1007/s11075-024-01913-w","url":null,"abstract":"<p>In this article, we study and examine an efficient numerical approach to obtain approximate solutions of the two-dimensional fractional cable model involving the time-fractional operator of distributed order. A hybrid numerical approach is used to approximate the proposed fractional model. For approximating the integral part of the distributed order including Caputo fractional derivative, the combination of Gauss quadrature rule and finite difference are used. As well as, for the integral part of the distributed order including Riemann Liouville fractional derivatives, from the mid-point quadrature rule and shifted Grünwald estimation are applied. Also, to approximate the proposed model in the space direction, the Legendre spectral numerical approach is used in order to calculate the full-discrete numerical approach. In this work, error analysis and convergence are studied. In the end, to show the effectiveness of the proposed approach, two numerical examples are stated and checked.</p>","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2024-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142199679","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
Solving semi-discrete optimal transport problems: star shapedeness and Newton’s method 解决半离散最优传输问题：星形整形和牛顿法
IF 2.1 3区 数学
Numerical Algorithms Pub Date : 2024-08-15 DOI: 10.1007/s11075-024-01903-y
Luca Dieci, Daniyar Omarov
{"title":"Solving semi-discrete optimal transport problems: star shapedeness and Newton’s method","authors":"Luca Dieci, Daniyar Omarov","doi":"10.1007/s11075-024-01903-y","DOIUrl":"https://doi.org/10.1007/s11075-024-01903-y","url":null,"abstract":"<p>In this work, we propose a novel implementation of Newton’s method for solving semi-discrete optimal transport (OT) problems for cost functions which are a positive combination of <i>p</i>-norms, <span>(1&lt;p&lt;infty )</span>. It is well understood that the solution of a semi-discrete OT problem is equivalent to finding a partition of a bounded region in Laguerre cells, and we prove that the Laguerre cells are star-shaped with respect to the target points. By exploiting the geometry of the Laguerre cells, we obtain an efficient and reliable implementation of Newton’s method to find the sought network structure. We provide implementation details and extensive results in support of our technique in 2-d problems, as well as comparison with other approaches used in the literature.</p>","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2024-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142199675","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
An Edge-based cascadic multigrid method for $$H(textbf{curl})$$ problems 针对 $$H(textbf{curl})$$问题的基于边缘的级联多网格方法
IF 2.1 3区 数学
Numerical Algorithms Pub Date : 2024-08-15 DOI: 10.1007/s11075-024-01917-6
Jinxuan Wang, Kejia Pan, Xiaoxin Wu
{"title":"An Edge-based cascadic multigrid method for $$H(textbf{curl})$$ problems","authors":"Jinxuan Wang, Kejia Pan, Xiaoxin Wu","doi":"10.1007/s11075-024-01917-6","DOIUrl":"https://doi.org/10.1007/s11075-024-01917-6","url":null,"abstract":"<p>An efficient extrapolation cascadic multigird (EXCMG) method is developed to solve large linear systems resulting from edge element discretizations of 3D <span>(H(textbf{curl}))</span> problems on rectangular meshes. By treating edge unknowns as defined on the midpoints of edges, following the similar idea of the nodal EXCMG method, we design a new prolongation operator for 3D edge-based discretizations, which is used to construct a high-order approximation to the finite element solution on the refined grid. This good initial guess greatly reduces the number of iterations required by the multigrid smoother. Furthermore, the divergence correction technique is employed to further speed up the convergence of the multigrid method. Numerical examples including problems with high-contrast discontinuous coefficients are presented to validate the effectiveness of the proposed EXCMG method. The edge-based EXCMG method is more efficient than the auxiliary-space Maxwell solver (AMS) for definite problems in the considered geometrical configuration, and it can also efficiently solve large-scale indefinite problems encountered in engineering and scientific fields.</p>","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2024-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142199676","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
Unconditionally energy stable IEQ-FEMs for the Cahn-Hilliard equation and Allen-Cahn equation 卡恩-希利亚德方程和艾伦-卡恩方程的无条件能量稳定 IEQ-FEMs
IF 2.1 3区 数学
Numerical Algorithms Pub Date : 2024-08-13 DOI: 10.1007/s11075-024-01910-z
Yaoyao Chen, Hailiang Liu, Nianyu Yi, Peimeng Yin
{"title":"Unconditionally energy stable IEQ-FEMs for the Cahn-Hilliard equation and Allen-Cahn equation","authors":"Yaoyao Chen, Hailiang Liu, Nianyu Yi, Peimeng Yin","doi":"10.1007/s11075-024-01910-z","DOIUrl":"https://doi.org/10.1007/s11075-024-01910-z","url":null,"abstract":"<p>In this paper, we present several unconditionally energy-stable invariant energy quadratization (IEQ) finite element methods (FEMs) with linear, first- and second-order accuracy for solving both the Cahn-Hilliard equation and the Allen-Cahn equation. For time discretization, we compare three distinct IEQ-FEM schemes that position the intermediate function introduced by the IEQ approach in different function spaces: finite element space, continuous function space, or a combination of these spaces. Rigorous proofs establishing the existence and uniqueness of the numerical solution, along with analyses of energy dissipation for both equations and mass conservation for the Cahn-Hilliard equation, are provided. The proposed schemes’ accuracy, efficiency, and solution properties are demonstrated through numerical experiments.</p>","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2024-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142199677","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 fast numerical algorithm for finding all real solutions to a system of N nonlinear equations in a finite domain 在有限域中寻找 N 个非线性方程组所有实解的快速数值算法
IF 2.1 3区 数学
Numerical Algorithms Pub Date : 2024-08-12 DOI: 10.1007/s11075-024-01908-7
Fernando Chueca-Díez, Alfonso M. Gañán-Calvo
{"title":"A fast numerical algorithm for finding all real solutions to a system of N nonlinear equations in a finite domain","authors":"Fernando Chueca-Díez, Alfonso M. Gañán-Calvo","doi":"10.1007/s11075-024-01908-7","DOIUrl":"https://doi.org/10.1007/s11075-024-01908-7","url":null,"abstract":"<p>A highly recurrent traditional bottleneck in applied mathematics, for which the most popular codes (Mathematica, Matlab, and Python as examples) do not offer a solution, is to find all the real solutions of a system of <i>n</i> nonlinear equations in a certain finite domain of the <i>n</i>-dimensional space of variables. We present two similar algorithms of minimum length and computational weight to solve this problem, in which one resembles a graphical tool of edge detection in an image extended to <i>n</i> dimensions. To do this, we discretize the <i>n</i>-dimensional space sector in which the solutions are sought. Once the discretized hypersurfaces (edges) defined by each nonlinear equation of the <i>n</i>-dimensional system have been identified in a single, simultaneous step, the coincidence of the hypersurfaces in each <i>n</i>-dimensional tile or cell containing at least one solution marks the approximate locations of all the hyperpoints that constitute the solutions. This makes the final Newton-Raphson step rapidly convergent to all the existent solutions in the predefined space sector with the desired degree of accuracy.</p>","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2024-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141935623","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学术官方微信