Wan-Lun Wang , Luis M. Castro , Shi-Xiu Yu , Tsung-I Lin
{"title":"Mixtures of common factor analyzers using the restricted multivariate skew-t distribution for clustering high-dimensional data with missing values","authors":"Wan-Lun Wang , Luis M. Castro , Shi-Xiu Yu , Tsung-I Lin","doi":"10.1016/j.cam.2025.116708","DOIUrl":"10.1016/j.cam.2025.116708","url":null,"abstract":"<div><div>Mixtures of common restricted skew-<span><math><mi>t</mi></math></span> factor analyzers (MCrstFA) have emerged as a parsimonious and practical approach for the model-based clustering of high-dimensional data with asymmetric features and outlying observations in one or more heterogeneous populations. However, missing data has become a ubiquitous problem that frequently adds complexity to the analyses for practitioners. Most existing tools are not adaptable to data with missing values, which is a significant reason for this complexity. This paper proposes an extension of the MCrstFA framework that allows the analyst to parsimoniously model data with missing values, skewness, heavy tails, and multimodality simultaneously. Under the missing at random (MAR) mechanism for nonresponses, a computationally feasible expectation conditional maximization either (ECME) algorithm is developed for computing maximum likelihood (ML) estimates of model parameters. The estimation procedure enables the automatic imputation of missing values and the prediction of unobserved factor scores. To assess the precision of the ML estimators, an information matrix-based approach is employed to approximate the asymptotic covariance matrix of the estimators. Numerical results obtained from the analysis of simulated and real datasets illustrate the effectiveness of the proposed methodology.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"471 ","pages":"Article 116708"},"PeriodicalIF":2.1,"publicationDate":"2025-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144084447","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}
Chai Wah Wu, Mark S. Squillante, Vassilis Kalantzis, Lior Horesh
{"title":"Stable iterative refinement for solving linear systems with inaccurate computation","authors":"Chai Wah Wu, Mark S. Squillante, Vassilis Kalantzis, Lior Horesh","doi":"10.1016/j.cam.2025.116746","DOIUrl":"10.1016/j.cam.2025.116746","url":null,"abstract":"<div><div>Iterative refinement (IR) is a popular scheme for solving a linear system of equations based on gradually improving the accuracy of an initial approximation. Originally developed to improve upon the accuracy of Gaussian elimination, interest in IR has been revived because of its suitability for execution on fast low-precision or inaccurate hardware such as graphics processing units and analog devices. IR generally converges when the error associated with the inaccurate method is small, but it is known to diverge when this error is large. We propose and analyze a novel enhancement to the IR algorithm by adding a line search optimization step that guarantees the algorithm will not diverge. Computational experiments verify our theoretical results and illustrate the effectiveness of our proposed scheme on two important types of inaccurate computing architectures, namely stochastic analog computing and low-precision digital arithmetic.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"471 ","pages":"Article 116746"},"PeriodicalIF":2.1,"publicationDate":"2025-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144084371","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":"Existence results for generalized 2D fractional partial integro-differential equations","authors":"Maryam Moghaddamfar , Manochehr Kazemi , Reza Ezzati","doi":"10.1016/j.cam.2025.116705","DOIUrl":"10.1016/j.cam.2025.116705","url":null,"abstract":"<div><div>In this paper, we explore the existence of solutions for a Caputo fractional functional partial integro-differential equation using the techniques of measures of non-compactness and the Petryshyn fixed point theorem. We derive some new findings, which include specific results obtained from previous studies under less stringent conditions. Additionally, we also provide examples to illustrate the results we have obtained.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"471 ","pages":"Article 116705"},"PeriodicalIF":2.1,"publicationDate":"2025-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144084435","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}
Auwal Bala Abubakar , Abdulkarim Hassan Ibrahim , Yuming Feng
{"title":"Derivative-free projection CG-based algorithm with restart strategy for solving convex-constrained nonlinear monotone equations and its application to logistic regression","authors":"Auwal Bala Abubakar , Abdulkarim Hassan Ibrahim , Yuming Feng","doi":"10.1016/j.cam.2025.116676","DOIUrl":"10.1016/j.cam.2025.116676","url":null,"abstract":"<div><div>This paper proposes a class of derivative-free projection algorithms with a restart technique for solving convex-constrained nonlinear equations involving monotone mappings. The proposed method integrates properties from classical conjugate gradient methods, such as the Polak–Ribière–Polyak, Liu–Storey, Fletcher–Reeves, and Conjugate-Descent methods. Second, it applies to nonsmooth equations, extending its utility to a broader range of problems. Third, the search direction of the new method is descent and bounded. Finally, numerical experiments are carried out on some test problems with the results provided to show the efficiency of the proposed method and to support theoretical analysis.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"471 ","pages":"Article 116676"},"PeriodicalIF":2.1,"publicationDate":"2025-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144084442","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":"Optimality conditions for a class of nonsmooth semidefinite bilevel optimization problems via convexifications applied to bilevel supply chain under uncertainty","authors":"Youness El-Yahyaoui , Mohsine Jennane , El Mostafa Kalmoun , Lahoussine Lafhim","doi":"10.1016/j.cam.2025.116734","DOIUrl":"10.1016/j.cam.2025.116734","url":null,"abstract":"<div><div>This paper addresses a nonsmooth semidefinite bilevel optimization problem, where both the upper- and lower-level problems include semidefinite constraints. We derive necessary optimality conditions of Fritz–John and Karush–Kuhn–Tucker types. Our approach utilizes partial exact penalization, and employs upper semi-regular convexificators and the optimal value reformulation. Additionally, we establish sufficient optimality conditions under generalized convexity assumptions. The nonsmooth nature of the problem, along with semidefinite constraints at both levels, introduces significant technical challenges, which are addressed through the proposed tools and methods. We illustrate our findings by considering an application to a bilevel supply chain problem focused on robust production planning under demand uncertainty.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"471 ","pages":"Article 116734"},"PeriodicalIF":2.1,"publicationDate":"2025-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144084443","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":"HTL-WASI preconditioner for finite element discretization of complex ADR equation and its application","authors":"Ronghua Yang , Junxian Wang , Shi Shu","doi":"10.1016/j.cam.2025.116726","DOIUrl":"10.1016/j.cam.2025.116726","url":null,"abstract":"<div><div>The convection diffusion reaction (ADR) equation is widely used in engineering applications. In this paper, we focus on a complex ADR equation arising from Helmholtz equation with impedance boundary conditions, prove the coerceiveness and boundedness of the sesquilinear functional and discuss the fast solver of the discretization. Firstly, we design a Weighted Additive Schwarz with Impedance (WASI) preconditioner, in order to overcome the dependence of the WASI preconditioner on the number of subdomains and the overlapping width, an ideal coarse space is designed. Although it can be proved that the corresponding hybrid two-level preconditioner is the exact inverse of the ADR coefficient matrix, the dimension of this coarse space is too big. In order to overcome this deficiency, a smaller dimensional coarse space was constructed by introducing local generalized eigenvalue problems (GEP) on each subdomain, and the descent rate of the corresponding two-level preconditioned GMRES method was rigorously analyzed which does not depend on mesh size, overlapping width, wave number <span><math><mi>k</mi></math></span>, and the absorption parameter. Since the size of the coarse space is sensitive to <span><math><mi>k</mi></math></span> and the GEP on each subdomain needs to be solved, the computational cost is too high. Therefore, we design an iterative method based on an economical two-level preconditioner, and establish a heuristic convergence theory that is supported by numerical results. Numerical experiments show the robustness of GMRES with the corresponding economical two-level preconditioner(HTLE-WASI-GMRES). Finally, for the Helmholtz finite element discretization, by using the Shifted Laplace technique and ADR equation, we design a novel fast solver combining with HTLE-WASI-GMRES for ADR equation. Numerical experiments have demonstrated the effectiveness of the algorithm.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"470 ","pages":"Article 116726"},"PeriodicalIF":2.1,"publicationDate":"2025-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143906767","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":"An algorithm for the estimation of the segmental Lebesgue constant","authors":"Ludovico Bruni Bruno , Giacomo Elefante","doi":"10.1016/j.cam.2025.116745","DOIUrl":"10.1016/j.cam.2025.116745","url":null,"abstract":"<div><div>The main goal of this work is to provide an explicit algorithm for the estimation of the segmental Lebesgue constant, an extension of the nodal Lebesgue constant that arise, for instance, in histopolation problems. With the help of two simple but efficacious lemmas, we reverse the already known technology and sensibly speed up the numerical estimation of such quantities. Results are comparable with the known literature, although cpu time of the presented method is sensibly smaller. It is worth pointing out that the numerical approach is the only known for analyzing the majority of families of supports.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"471 ","pages":"Article 116745"},"PeriodicalIF":2.1,"publicationDate":"2025-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144084434","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}
Maria Vasilyeva , Aleksei Krasnikov , Kelum Gajamannage , Mehrube Mehrubeoglu
{"title":"Multiscale method for image denoising using nonlinear diffusion process: Local denoising and spectral multiscale basis functions","authors":"Maria Vasilyeva , Aleksei Krasnikov , Kelum Gajamannage , Mehrube Mehrubeoglu","doi":"10.1016/j.cam.2025.116733","DOIUrl":"10.1016/j.cam.2025.116733","url":null,"abstract":"<div><div>We consider image denoising using a nonlinear diffusion process, where we solve unsteady partial differential equations with nonlinear coefficients. The noised image is given as an initial condition, and nonlinear coefficients are used to preserve the main image features. In this paper, we present a multiscale method for the resulting nonlinear parabolic equation in order to construct an efficient solver. To both filter out noise and preserve essential image features during the denoising process, we utilize a time-dependent nonlinear diffusion model. Here, the noised image is fed as an initial condition and the denoised image is stimulated with given parameters. We numerically implement this model by constructing a discrete system for a given image resolution using a finite volume method and employing an implicit time approximation scheme to avoid time-step restriction. However, the resulting discrete system size is proportional to the number of pixels which leads to computationally expensive numerical algorithms for high-resolution images. In order to reduce the size of the system and construct efficient computational algorithms, we construct a coarse-resolution representation of the system. We incorporate local noise reduction in the coarsening process to construct an efficient algorithm with fewer denoising iterations. We propose a computational approach with two main ingredients: (1) performing local image denoising in each local domain of basis support; and (2) constructing multiscale basis functions to construct a coarse resolution representation by a Galerkin coupling. We present numerical results for several classic and high-resolution image datasets to demonstrate the effectiveness of the proposed multiscale approach with local denoising and local multiscale representation.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"470 ","pages":"Article 116733"},"PeriodicalIF":2.1,"publicationDate":"2025-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143906768","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":"Well-balanced POD-based reduced-order models for finite volume approximation of hyperbolic balance laws","authors":"I. Gómez-Bueno , E.D. Fernández-Nieto , S. Rubino","doi":"10.1016/j.cam.2025.116735","DOIUrl":"10.1016/j.cam.2025.116735","url":null,"abstract":"<div><div>This paper introduces a reduced-order modeling approach based on finite volume methods for hyperbolic systems, combining Proper Orthogonal Decomposition (POD) with the Discrete Empirical Interpolation Method (DEIM) and Proper Interval Decomposition (PID). Applied to systems such as the transport equation with source term, non-homogeneous Burgers equation, and shallow water equations with non-flat bathymetry and Manning friction, this method achieves significant improvements in computational efficiency and accuracy compared to previous time-averaging techniques. A theoretical result justifying the use of well-balanced Full-Order Models (FOMs) is presented. Numerical experiments validate the approach, demonstrating its accuracy and efficiency. Furthermore, the question of prediction of solutions for systems that depend on some physical parameters is also addressed, and a sensitivity analysis on POD parameters confirms the model’s robustness and efficiency in this case.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"471 ","pages":"Article 116735"},"PeriodicalIF":2.1,"publicationDate":"2025-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144084441","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":"Bayesian credible regions for two-parameter exponential distributions under type-II censoring","authors":"A. Saadati Nik , A. Asgharzadeh , A.J. Fernández","doi":"10.1016/j.cam.2025.116721","DOIUrl":"10.1016/j.cam.2025.116721","url":null,"abstract":"<div><div>The construction of Bayesian credible sets for two-parameter exponential models under type-II censoring is investigated in this paper. A three-step algorithm to generate samples from the posterior distribution is presented with the aim of determining the highest posterior density (HPD) credible region for the exponential parameters. A two-step procedure is also suggested to find a closed-form Bayesian credible region. Moreover, the HPD credible region for two exponential quantiles is derived using a simulation-based method. The minimum-size frequentist confidence sets for exponential parameters and quantiles numerically coincide with the corresponding Bayesian HPD credible sets when a certain diffuse prior is assumed. A real data example on leukemia remission time data is analyzed for illustration and comparison. Some applications of the proposed Bayesian credible regions are also discussed.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"470 ","pages":"Article 116721"},"PeriodicalIF":2.1,"publicationDate":"2025-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143911578","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}