Numerical Algorithms最新文献

{"title":"QR decomposition of dual quaternion matrix and blind watermarking scheme","authors":"Mingcui Zhang, Ying Li, Tao Wang, Jianhua Sun","doi":"10.1007/s11075-024-01930-9","DOIUrl":"https://doi.org/10.1007/s11075-024-01930-9","url":null,"abstract":"<p>In this paper, the algorithms and applications of the dual quaternion QR decomposition are studied. The direct algorithm and dual structure-preserving algorithm of dual quaternion QR decomposition utilizing Householder transformation of dual quaternion vector are proposed. Numerical experiments show that two algorithms are feasible, and the dual structure-preserving algorithm is superior to the direct algorithm in terms of computational efficiency. Therefore, the dual structure-preserving algorithm of dual quaternion QR decomposition is used to color image watermarking. Experiments illustrate that our method is feasible and better than the compared methods in anti-aggression.</p>","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142199657","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}

{"title":"An effective real structure-preserving algorithm for the quaternion indefinite least squares problem","authors":"Zixiang Meng, Zhihan Zhou, Ying Li, Fengxia Zhang","doi":"10.1007/s11075-024-01929-2","DOIUrl":"https://doi.org/10.1007/s11075-024-01929-2","url":null,"abstract":"<p>This paper concentrates on the quaternion indefinite least squares (QILS) problem. Firstly, we define the quaternion J-unitary matrix and the quaternion hyperbolic Givens rotation, and study their properties. Then, based on these, we investigate the quaternion hyperbolic QR factorization, and purpose its real structure-preserving (SP) algorithm by the real representation (Q-RR) matrix of the quaternion matrix. Immediately after, we explore the solution of the QILS problem, and give a real SP algorithm of solving the QILS problem. Eventually, to illustrate the effectiveness of proposed algorithms, we offer numerical examples.</p>","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142199668","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}

{"title":"A trust-region framework for iteration solution of the direct INDSCAL problem in metric multidimensional scaling","authors":"Xue-lin Zhou, Chao-qian Li","doi":"10.1007/s11075-024-01921-w","DOIUrl":"https://doi.org/10.1007/s11075-024-01921-w","url":null,"abstract":"<p>The well-known INdividual Differences SCALing (INDSCAL) model is intended for the simultaneous metric multidimensional scaling (MDS) of several doubly centered matrices of squared dissimilarities. An alternative approach, called for short DINDSCAL (direct INDSCAL), is proposed for analyzing directly the input matrices of squared dissimilarities. In the present work, the problem of fitting the DINDSCAL model to the data is formulated as a Riemannian optimization problem on a product matrix manifold comprised of the Stiefel sub-manifold of zero-sum matrices and non-negative diagonal matrices. A practical algorithm, based on the generic Riemannian trust-region method by Absil et al., is presented to address the underlying problem, which is characterized by global convergence and local superlinear convergence rate. Numerical experiments are conducted to illustrate the efficiency of the proposed method. Furthermore, comparisons with the existing projected gradient approach and some classical methods in the MATLAB toolbox Manopt are also provided to demonstrate the merits of the proposed approach.</p>","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142199670","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}

{"title":"A numerical algorithm for the computation of the noncentral beta distribution function","authors":"Vera Egorova, Amparo Gil, Javier Segura, Nico M. Temme","doi":"10.1007/s11075-024-01931-8","DOIUrl":"https://doi.org/10.1007/s11075-024-01931-8","url":null,"abstract":"<p>The noncentral beta distribution function is a generalization of the central beta distribution (the regularized incomplete beta function) that includes a noncentrality parameter. This paper describes an algorithm and provides a Matlab implementation for calculating the noncentral beta distribution function. Through a series of numerical tests, we demonstrate that the algorithm is accurate and efficient across a wide range of parameters.</p>","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2024-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142199660","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}

{"title":"Numerical algorithms for recovering a fractional Sturm-Liouville operator based on trace formulae","authors":"Xiaowen Li, Xiaoying Jiang, Xiang Xu","doi":"10.1007/s11075-024-01926-5","DOIUrl":"https://doi.org/10.1007/s11075-024-01926-5","url":null,"abstract":"<p>This paper explores numerical methods for recovering a density term in a fractional Sturm-Liouville problem using a set of spectra. By applying Lidskii’s theorem, a sequence of trace formulae are derived to elucidate the connections between the unknown coefficients and the complex eigenvalues of a fractional spectra problem. Two efficient algorithms are proposed based on these trace formulae, and their effectiveness is demonstrated through numerical experiments.</p>","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2024-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142199659","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}

{"title":"Convergence of a partially truncated Euler-Maruyama method for SDEs with super-linear piecewise continuous drift and Hölder diffusion coefficients","authors":"Amir Haghighi","doi":"10.1007/s11075-024-01928-3","DOIUrl":"https://doi.org/10.1007/s11075-024-01928-3","url":null,"abstract":"<p>The main purpose of this paper is to develop and analyze a partially truncated Euler-Maruyama method for numerically solving SDEs with super-linear piecewise continuous drift coefficients and <span>(varvec{(1/2+alpha )})</span>-Hölder diffusion coefficients (PTEMH), for <span>(varvec{alpha in [0,1/2]})</span>. We first present an analytical form for the unique solution of such problems. Then we establish the strong convergence theory of the PTEMH scheme. We show that the convergence rate of the proposed method in the case <span>(varvec{alpha in (0,1/2]})</span> reaches <span>(varvec{alpha })</span>, which is optimal compared to the explicit Euler-Maruyama method. Finally, numerical results are given to confirm the theoretical convergence rate.</p>","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2024-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142199667","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}

{"title":"The fast Euler-Maruyama method for solving multiterm Caputo fractional stochastic delay integro-differential equations","authors":"Huijiao Guo, Jin Huang, Yi Yang, Xueli Zhang","doi":"10.1007/s11075-024-01925-6","DOIUrl":"https://doi.org/10.1007/s11075-024-01925-6","url":null,"abstract":"<p>This paper studies a type of multiterm fractional stochastic delay integro-differential equations (FSDIDEs). First, the Euler-Maruyama (EM) method is developed for solving the equations, and the strong convergence order of this method is obtained, which is <span>(varvec{min left{ alpha _{l}-frac{1}{2}, alpha _{l}-alpha _{l-1}right} })</span>. Then, a fast EM method is also presented based on the exponential-sum-approximation with trapezoid rule to cut down the computational cost of the EM method. In the end, some concrete numerical experiments are used to substantiate these theoretical results and show the effectiveness of the fast method.</p>","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142199674","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}

{"title":"Analysis of a higher-order scheme for multi-term time-fractional integro-partial differential equations with multi-term weakly singular kernels","authors":"Sudarshan Santra","doi":"10.1007/s11075-024-01927-4","DOIUrl":"https://doi.org/10.1007/s11075-024-01927-4","url":null,"abstract":"<p>This work is focused on developing a hybrid numerical method that combines a higher-order finite difference method and multi-dimensional Hermite wavelets to address two-dimensional multi-term time-fractional integro-partial differential equations with multi-term weakly singular kernels having bounded and unbounded time derivatives at the initial time <span>(t=0)</span>. Specifically, the multi-term fractional operators are discretized using a higher-order approximation designed by employing different interpolation schemes based on linear, quadratic, and cubic interpolation leading to <span>(mathcal {O}(N^{-(4-alpha _1)}))</span> accuracy on a suitably chosen nonuniform mesh and <span>(mathcal {O}(N^{-alpha _1}))</span> accuracy on a uniformly distributed mesh. The weakly singular integral operators are approximated by a modified numerical quadrature, which is a combination of the composite trapezoidal approximation and the midpoint rule. The effects of the exponents of the weakly singular kernels over fractional orders are analyzed in terms of accuracy over uniform and nonuniform meshes for the solution having both bounded and unbounded time derivatives. The stability of the proposed semi-discrete scheme is derived based on <span>(L^infty )</span>-norm for uniformly distributed temporal mesh. Further, we employ the uniformly distributed collocation points in spatial directions to estimate the tensor-based wavelet coefficients. Moreover, the convergence analysis of the fully discrete scheme is carried out based on <span>(L^2)</span>-norm leading to <span>(mathcal {O}(N^{-alpha _1}))</span> accuracy on a uniform mesh. It also highlights the higher-order accuracy over nonuniform mesh. Additionally, we discuss the convergence analysis of the proposed scheme in the context of the multi-term time-fractional diffusion equations involving time singularity demonstrating a <span>(mathcal {O}(N^{-(4-alpha _1)}))</span> accuracy on a nonuniform mesh with suitably chosen grading parameter. Note that the scheme reduces to <span>(mathcal {O}(N^{-alpha _1}))</span> accuracy on a uniform mesh. Several tests are performed on numerous examples in <span>(L^infty )</span>- and <span>(L^2)</span>-norm to show the efficiency of the proposed method. Further, the solutions’ nature and accuracy in terms of absolute point-wise error are illustrated through several isosurface plots for different regularities of the exact solution. These experiments confirm the theoretical accuracy and guarantee the convergence of approximations to the functions having time singularity, and the higher-order accuracy for a suitably chosen nonuniform mesh.</p>","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142199680","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}

{"title":"VEMcomp: a Virtual Elements MATLAB package for bulk-surface PDEs in 2D and 3D","authors":"Massimo Frittelli, Anotida Madzvamuse, Ivonne Sgura","doi":"10.1007/s11075-024-01919-4","DOIUrl":"https://doi.org/10.1007/s11075-024-01919-4","url":null,"abstract":"<p>We present a Virtual Element MATLAB solver for elliptic and parabolic, linear and semilinear Partial Differential Equations (PDEs) in two and three space dimensions, which is coined VEMcomp. Such PDEs are widely applicable to describing problems in material sciences, engineering, cellular and developmental biology, among many other applications. The library covers linear and nonlinear models posed on different simple and complex geometries, involving time-dependent bulk, surface, and bulk-surface PDEs. The solver employs the Virtual Element Method (VEM) of lowest polynomial order <span>({k=1})</span> on general polygonal and polyhedral meshes, including the Finite Element Method (FEM) of order <span>({k=1})</span> as a special case when the considered mesh is simplicial. VEMcomp has three main purposes. First, VEMcomp generates polygonal and polyhedral meshes optimized for fast matrix assembly. Triangular and tetrahedral meshes are encompassed as special cases. For surface PDEs, VEMcomp is compatible with the well-known Matlab package DistMesh for mesh generation. Second, given a mesh for the considered geometry, possibly generated with an external package, VEMcomp computes all the matrices (mass and stiffness) required by the VEM or FEM method. Third, for multiple classes of stationary and time-dependent bulk, surface and bulk-surface PDEs, VEMcomp solves the considered PDE problem with the VEM or FEM in space and IMEX Euler in time, through a user-friendly interface. As an optional post-processing, VEMcomp comes with its own functions for plotting the numerical solutions and evaluating the error when possible. An extensive set of examples illustrates the usage of the library.</p>","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2024-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142199669","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}

{"title":"QMGI algorithm for solving quaternion equation and its application in color image encryption","authors":"Xinying Li, Caiqin Song, Hongjun Liu","doi":"10.1007/s11075-024-01920-x","DOIUrl":"https://doi.org/10.1007/s11075-024-01920-x","url":null,"abstract":"<p>In this present work, in order to solve the numerical solution of quaternion matrix equation <span>(EY=F)</span>, the quaternion modified gradient-based algorithm (QMGI) is proposed by applying the real presentation of quaternion matrix. The proposed method can be applied to solve the quaternion solution, pure imaginary solution, and real solution of the studied equation <span>(EY=F)</span>. If the studied equation is consistent, it is proved that the proposed algorithm converges to the exact solution for given any initial quaternion matrix under appropriate conditions. If the studied equation is not consistent, it is found that the QMGI algorithm converges to the least squares solution. And some numerical examples are examined to confirm the feasibility and efficiency of the proposed algorithms, which all indicate that the proposed QMGI algorithm is much more effective than QGI algorithm and QRGI algorithm in computational time and accuracy. Moreover, QMGl algorithm is applied to color image encryption and evaluated the encryption effectiveness from four aspects. All metrics are close to the ideal values. lt is demonstrated that the effectiveness of the encryption scheme and the accuracy of the obtained theory results in this paper.</p>","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2024-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142199671","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}