{"title":"Invertible matrices under non-Archimedean absolute value and its inverse","authors":"Suhua Li, Chaoqian Li","doi":"10.1016/j.cam.2025.116700","DOIUrl":"10.1016/j.cam.2025.116700","url":null,"abstract":"<div><div>Invertible matrices play a crucial role in various areas of mathematics, science and engineering. Although there are many ways to determine whether a matrix is invertible or not, it is still a fundamental and an important research work in linear algebra, especially in large-scale numerical computations. Based on the non-Archimedean absolute value, we in this paper present a new class of invertible matrices called <em>doubly strictly diagonally dominant matrices under non-Archimedean absolute value</em> (<em>DSDD</em><span><math><msub><mrow></mrow><mrow><mi>n</mi><mo>.</mo><mi>A</mi><mo>.</mo></mrow></msub></math></span> <em>matrices</em>). It includes the <em>strictly diagonally dominant matrices under non-Archimedean absolute value</em> (<em>SDD</em><span><math><msub><mrow></mrow><mrow><mi>n</mi><mo>.</mo><mi>A</mi><mo>.</mo></mrow></msub></math></span> <em>matrices</em>) presented by Nica and Sprague in [The American Mathematical Monthly, 130 (2023) 267-275]. Some examples are given to show the relationships of <em>SDD</em><span><math><msub><mrow></mrow><mrow><mi>n</mi><mo>.</mo><mi>A</mi><mo>.</mo></mrow></msub></math></span> <em>matrices</em>, <em>DSDD</em><span><math><msub><mrow></mrow><mrow><mi>n</mi><mo>.</mo><mi>A</mi><mo>.</mo></mrow></msub></math></span> <em>matrices</em>, <em>SDD matrices</em> (<em>strictly diagonally dominant matrices under Archimedean absolute value</em>), <em>DSDD matrices</em> (<em>doubly strictly diagonally dominant matrices under Archimedean absolute value</em>), and <em>H-matrices</em>. Moreover, it is proved that the inverse of <em>DSDD</em><span><math><msub><mrow></mrow><mrow><mi>n</mi><mo>.</mo><mi>A</mi><mo>.</mo></mrow></msub></math></span> <em>matrices</em> is also <em>DSDD</em><span><math><msub><mrow></mrow><mrow><mi>n</mi><mo>.</mo><mi>A</mi><mo>.</mo></mrow></msub></math></span> in some cases, which displays remarkable difference with the inverse of <em>DSDD matrices</em> and <em>SDD matrices</em>.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"470 ","pages":"Article 116700"},"PeriodicalIF":2.1,"publicationDate":"2025-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143863984","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}
{"title":"Symmetric structured finite element model updating with prescribed partial eigenvalues while maintaining no spillover","authors":"H. Lalhriatpuia, Tanay Saha","doi":"10.1016/j.cam.2025.116698","DOIUrl":"10.1016/j.cam.2025.116698","url":null,"abstract":"<div><div>This paper focuses on the Finite Element Model Updating (FEMU) problem for undamped systems. We examine the challenge of updating symmetric structured models using only a few specified eigenvalues, ensuring that the models retain their fundamental structural characteristics and avoid any spillover effects. Notably, we have access to only a few eigenvalues of the updated model, with no prior knowledge of the corresponding eigenvectors. Our objective is to identify an updated model that incorporates the desired eigenvalues while keeping the unmeasured eigenvalues unchanged. To achieve this, we first establish an equivalent condition for the existence of solutions to the problem and characterize all the solutions provided they exist. Additionally, we reformulate the problem of minimizing the perturbations to the system matrices as a constrained optimization problem. We present several numerical examples to illustrate the effectiveness of our proposed method.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"470 ","pages":"Article 116698"},"PeriodicalIF":2.1,"publicationDate":"2025-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143864106","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}
{"title":"Computationally efficient selection criterion of initial equation in STLN-based structured low-rank approximation","authors":"Natsuki Yoshino , Akira Tanaka","doi":"10.1016/j.cam.2025.116703","DOIUrl":"10.1016/j.cam.2025.116703","url":null,"abstract":"<div><div>The problem of structured low-rank approximation (SLRA) of a given matrix arises in a wide range of applications. This problem can be solved by the structured total least norm (STLN) method, which formulates it as a linear equation called an “initial equation”. Because this equation directly impacts the performance of STLN-based SLRA, certain selection criteria have been proposed. However, these criteria are computationally intensive and their theoretical validity has not been sufficiently investigated. In this paper, we theoretically analyze the relationship between the original problem and an initial equation, and subsequently propose a novel selection criterion with a computational order of <span><math><mrow><mi>O</mi><mrow><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mn>3</mn></mrow></msup><mo>)</mo></mrow></mrow></math></span>, in contrast to the complexity of <span><math><mrow><mi>O</mi><mrow><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mn>4</mn></mrow></msup><mo>)</mo></mrow></mrow></math></span> incurred by conventional methods. We also demonstrate numerical experiments for Sylvester matrices to confirm that our selection criterion reduces not only the selection time of the initial equation, but also the overall calculation time of the STLN-based SLRA.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"470 ","pages":"Article 116703"},"PeriodicalIF":2.1,"publicationDate":"2025-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143860596","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}
{"title":"Dynamics analysis of a discrete diffusion predator–prey model with prey refuge","authors":"Xiongxiong Du, Xiaoling Han","doi":"10.1016/j.cam.2025.116706","DOIUrl":"10.1016/j.cam.2025.116706","url":null,"abstract":"<div><div>This paper investigates a discrete diffusion predator–prey model with periodic boundary conditions. Firstly, we analyze the existence conditions of the model’s equilibrium points, their local and global stability, and verify the uniform boundedness of its solutions. Subsequently, we establish the criteria for the occurrence of flip bifurcation and Neimark–Sacker bifurcation near the equilibrium points of the model. Additionally, we delve into chaos control theory and uncover the conditions for Turing instability in the discrete diffusion model under the effect of overall self-diffusion. Finally, through numerical simulations, we examine how temporal factors, diffusion coefficients, and the natural growth rate of prey influence the dynamic behavior of the system.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"470 ","pages":"Article 116706"},"PeriodicalIF":2.1,"publicationDate":"2025-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143870590","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}
Abdolreza Amiri , Gabriel R. Barrenechea , Tristan Pryer
{"title":"A nodally bound-preserving finite element method for time-dependent convection–diffusion equations","authors":"Abdolreza Amiri , Gabriel R. Barrenechea , Tristan Pryer","doi":"10.1016/j.cam.2025.116691","DOIUrl":"10.1016/j.cam.2025.116691","url":null,"abstract":"<div><div>This paper presents a new method to approximate the time-dependent convection–diffusion equations using conforming finite element methods, ensuring that the discrete solution respects the physical bounds imposed by the differential equation. The method is built by defining, at each time step, a convex set of admissible finite element functions (that is, the ones that satisfy the global bounds at their degrees of freedom) and seeks for a discrete solution in this admissible set. A family of <span><math><mi>θ</mi></math></span>-schemes is used as time integrators, and well-posedness of the discrete schemes is proven for the whole family, but stability and optimal-order error estimates are proven for the implicit Euler scheme. Nevertheless, our numerical experiments show that the method also provides stable and optimally-convergent solutions when the Crank–Nicolson method is used.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"470 ","pages":"Article 116691"},"PeriodicalIF":2.1,"publicationDate":"2025-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143848425","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}
{"title":"Sampling with derivatives in finitely generated shift-invariant spaces","authors":"Kumari Priyanka, A. Antony Selvan","doi":"10.1016/j.cam.2025.116692","DOIUrl":"10.1016/j.cam.2025.116692","url":null,"abstract":"<div><div>The problem of sampling with derivatives involves reconstructing functions from their derivative sample values on a suitable sequence of points via sampling expansions. In this paper, we explore the sampling and interpolation problem that deals with derivative samples in finitely generated shift-invariant spaces. We characterize the complete interpolation of periodic nonuniform samples involving derivatives. We provide a sufficient condition for a nonuniform sampling set to reconstruct functions in finitely generated shift-invariant spaces.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"470 ","pages":"Article 116692"},"PeriodicalIF":2.1,"publicationDate":"2025-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143848426","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}
{"title":"Fuzzy random multi-objective optimization using a novel mixed fuzzy random inverse DEA model in input-output production","authors":"Lizhen Huang, Lei Chen","doi":"10.1016/j.cam.2025.116717","DOIUrl":"10.1016/j.cam.2025.116717","url":null,"abstract":"<div><div>Inverse data envelopment analysis (DEA), which is an effective tool for determining inputs and outputs, is commonly applied in areas such as output prediction, resource allocation, and target setting. However, existing inverse DEA methods typically assume precise and deterministic data, which limits applicability in uncertain production environments, particularly when both random and fuzzy environments are present. This study introduces a novel inverse DEA approach for optimizing inputs and outputs in mixed uncertainty environments. The proposed model allows decision-makers to achieve target efficiency and meet various input/output targets under different production scale assumptions. First, a new optimality principle for multi-objective fuzzy random problems is presented and the necessary theoretical conditions for input/output calculations are derived. Second, an equivalent linear model is introduced to solve the inverse DEA problem with fuzzy random variables, thereby overcoming the challenges associated with nonlinear programming. Notably, the proposed model offers enhanced flexibility as it does not rely on specific fuzzy numbers or predefined assumptions regarding random distributions. Finally, the effectiveness of the model is validated through numerical examples and a case study, demonstrating its practical application in complex decision-making scenarios.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"470 ","pages":"Article 116717"},"PeriodicalIF":2.1,"publicationDate":"2025-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143851755","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}
{"title":"Longitudinal quantile-based regression models using multivariate asymmetric heavy-tailed distributions and leapfrog HMC algorithm","authors":"Maryam Sabetrasekh, Iraj Kazemi","doi":"10.1016/j.cam.2025.116690","DOIUrl":"10.1016/j.cam.2025.116690","url":null,"abstract":"<div><div>Modeling longitudinal quantile regression in a multivariate framework poses particular computational and conceptual challenges due to the inherent complexity of multivariate dependencies. While univariate quantile-based models can be extended to higher dimensions via Gram-Schmidt orthogonalization, such extensions often have practical limitations. To address these challenges, this paper introduces a flexible family of multivariate asymmetric distributions using the probabilistic Rosenblatt transformation. This framework preserves conditional coherence across longitudinal quantile processes via a sequential likelihood factorization, provides an explicit characterization of quantiles shaped by distributional asymmetry and covariate effects, controls for the influence of outliers, and improves computational efficiency in the estimation process. For Bayesian inference, we implement a leapfrog Hamiltonian Monte Carlo algorithm with the No-U-Turn Sampler to estimate longitudinal quantile-based regression parameters. Simulation studies over various quantile levels demonstrate the method’s theoretical properties, while two empirical applications highlight its practical utility and superior performance.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"470 ","pages":"Article 116690"},"PeriodicalIF":2.1,"publicationDate":"2025-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143838894","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}
{"title":"Joint group sparse coding and weighted nuclear norm for Poisson denoising","authors":"Jianguang Zhu , Wen Gao , Ying Wei , Binbin Hao","doi":"10.1016/j.cam.2025.116695","DOIUrl":"10.1016/j.cam.2025.116695","url":null,"abstract":"<div><div>It is difficult to remove Poisson noise because of its multiplicative and signal-dependent nature. In this paper, a new Poisson denoising model based on nonlocal self-similarity is introduced. It combines the weighted nuclear norm and group sparse coding as a regularization term, and makes full use of the low rank and sparse properties of similar image patches. Numerically, incorporating singular value decomposition and the variable splitting method, an alternating minimization method with an adaptive parameter selection strategy is proposed to resolve the new denoising model. Extensive experiments indicate that the proposed model outperforms the existing state-of-the-art Poisson denoising methods.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"470 ","pages":"Article 116695"},"PeriodicalIF":2.1,"publicationDate":"2025-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143838897","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}
{"title":"A fast solver for pentadiagonal Toeplitz systems with multiple right-hand sides","authors":"Hcini Fahd","doi":"10.1016/j.cam.2025.116697","DOIUrl":"10.1016/j.cam.2025.116697","url":null,"abstract":"<div><div>In this paper, we present a new method for solving pentadiagonal Toeplitz systems with multiple right-hand sides. Pentadiagonal Toeplitz matrices are widely used in various applications, including image processing, partial differential equations (PDEs), and the fast Fourier transform (FFT). The paper concludes with numerical examples that illustrate the effectiveness and accuracy of the proposed algorithm.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"470 ","pages":"Article 116697"},"PeriodicalIF":2.1,"publicationDate":"2025-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143837923","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}