SIAM Journal on Scientific Computing最新文献

{"title":"Finite Element Approximation for the Delayed Generalized Burgers–Huxley Equation with Weakly Singular Kernel: Part II Nonconforming and DG Approximation","authors":"Sumit Mahahjan, Arbaz Khan","doi":"10.1137/23m1612196","DOIUrl":"https://doi.org/10.1137/23m1612196","url":null,"abstract":"SIAM Journal on Scientific Computing, Volume 46, Issue 5, Page A2972-A2998, October 2024. <br/> Abstract. In this paper, the numerical approximation of the generalized Burgers–Huxley equation (GBHE) with weakly singular kernels using nonconforming methods will be presented. Specifically, we discuss two new formulations. The first formulation is based on the nonconforming finite element method. The other formulation is based on discontinuous Galerkin finite element methods. The wellposedness results for both formulations are proved. Then, a priori error estimates for both the semidiscrete and fully discrete schemes are derived. Specific numerical examples, including some applications for the GBHE with a weakly singular model, are discussed to validate the theoretical results.","PeriodicalId":49526,"journal":{"name":"SIAM Journal on Scientific Computing","volume":"10 1","pages":""},"PeriodicalIF":3.1,"publicationDate":"2024-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142262881","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":"Robust Iterative Method for Symmetric Quantum Signal Processing in All Parameter Regimes","authors":"Yulong Dong, Lin Lin, Hongkang Ni, Jiasu Wang","doi":"10.1137/23m1598192","DOIUrl":"https://doi.org/10.1137/23m1598192","url":null,"abstract":"SIAM Journal on Scientific Computing, Volume 46, Issue 5, Page A2951-A2971, October 2024. <br/> Abstract. This paper addresses the problem of solving nonlinear systems in the context of symmetric quantum signal processing (QSP), a powerful technique for implementing matrix functions on quantum computers. Symmetric QSP focuses on representing target polynomials as products of matrices in SU(2) that possess symmetry properties. We present a novel Newton’s method tailored for efficiently solving the nonlinear system involved in determining the phase factors within the symmetric QSP framework. Our method demonstrates rapid and robust convergence in all parameter regimes, including the challenging scenario with ill-conditioned Jacobian matrices, using standard double precision arithmetic operations. For instance, solving symmetric QSP for a highly oscillatory target function [math] (polynomial degree [math]) takes 6 iterations to converge to machine precision when [math], and the number of iterations only increases to 18 iterations when [math] with a highly ill-conditioned Jacobian matrix. Leveraging the matrix product state structure of symmetric QSP, the computation of the Jacobian matrix incurs a computational cost comparable to a single function evaluation. Moreover, we introduce a reformulation of symmetric QSP using real-number arithmetics, further enhancing the method’s efficiency. Extensive numerical tests validate the effectiveness and robustness of our approach, which has been implemented in the QSPPACK software package.","PeriodicalId":49526,"journal":{"name":"SIAM Journal on Scientific Computing","volume":"3 1","pages":""},"PeriodicalIF":3.1,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142217589","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":"Interpolating Parametrized Quantum Circuits Using Blackbox Queries","authors":"Lars Simon, Holger Eble, Hagen-Henrik Kowalski, Manuel Radons","doi":"10.1137/23m1609543","DOIUrl":"https://doi.org/10.1137/23m1609543","url":null,"abstract":"SIAM Journal on Scientific Computing, Volume 46, Issue 5, Page B600-B620, October 2024. <br/> Abstract. This article focuses on developing classical surrogates for parametrized quantum circuits using interpolation via (trigonometric) polynomials. We develop two algorithms for the construction of such surrogates and prove performance guarantees. The constructions are based on circuit evaluations which are blackbox in the sense that no structural specifics of the circuits are exploited. While acknowledging the limitations of the blackbox approach compared to whitebox evaluations, which exploit specific circuit properties, we demonstrate scenarios in which the blackbox approach might prove beneficial. Sample applications include but are not restricted to the approximation of variational quantum eigensolvers and the alleviaton of the barren plateau problem.","PeriodicalId":49526,"journal":{"name":"SIAM Journal on Scientific Computing","volume":"10 1","pages":""},"PeriodicalIF":3.1,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142217588","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":"The Sparse-Grid-Based Adaptive Spectral Koopman Method","authors":"Bian Li, Yue Yu, Xiu Yang","doi":"10.1137/23m1578292","DOIUrl":"https://doi.org/10.1137/23m1578292","url":null,"abstract":"SIAM Journal on Scientific Computing, Volume 46, Issue 5, Page A2925-A2950, October 2024. <br/> Abstract. The adaptive spectral Koopman (ASK) method was introduced to numerically solve autonomous dynamical systems that laid the foundation for numerous applications across different fields in science and engineering. Although ASK achieves high accuracy, it is computationally more expensive for multidimensional systems compared with conventional time integration schemes like Runge–Kutta. In this work, we combine the sparse grid and ASK to accelerate the computation for multidimensional systems. This sparse-grid-based ASK (SASK) method uses the Smolyak structure to construct multidimensional collocation points as well as associated polynomials that are used to approximate eigenfunctions of the Koopman operator of the system. In this way, the number of collocation points is reduced compared with using the tensor product rule. We demonstrate that SASK can be used to solve ordinary differential equations (ODEs) and partial differential equations (PDEs) based on their semidiscrete forms. Numerical experiments are illustrated to compare the performance of SASK and state-of-the-art ODE solvers.","PeriodicalId":49526,"journal":{"name":"SIAM Journal on Scientific Computing","volume":"92 1","pages":""},"PeriodicalIF":3.1,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142217590","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":"Bound-Preserving Framework for Central-Upwind Schemes for General Hyperbolic Conservation Laws","authors":"Shumo Cui, Alexander Kurganov, Kailiang Wu","doi":"10.1137/23m1628024","DOIUrl":"https://doi.org/10.1137/23m1628024","url":null,"abstract":"SIAM Journal on Scientific Computing, Volume 46, Issue 5, Page A2899-A2924, October 2024. <br/> Abstract. Central-upwind (CU) schemes are Riemann-problem-solver-free finite-volume methods widely applied to a variety of hyperbolic systems of PDEs. Exact solutions of these systems typically satisfy certain bounds, and it is highly desirable and even crucial for the numerical schemes to preserve these bounds. In this paper, we develop and analyze bound-preserving (BP) CU schemes for general hyperbolic systems of conservation laws. Unlike many other Godunov-type methods, CU schemes cannot, in general, be recast as convex combinations of first-order BP schemes. Consequently, standard BP analysis techniques are invalidated. We address these challenges by establishing a novel framework for analyzing the BP property of CU schemes. To this end, we discover that the CU schemes can be decomposed as a convex combination of several intermediate solution states. Thanks to this key finding, the goal of designing BPCU schemes is simplified to the enforcement of four more accessible BP conditions, each of which can be achieved with the help of a minor modification of the CU schemes. We employ the proposed approach to construct provably BPCU schemes for the Euler equations of gas dynamics. The robustness and effectiveness of the BPCU schemes are validated by several demanding numerical examples, including high-speed jet problems, flow past a forward-facing step, and a shock diffraction problem.","PeriodicalId":49526,"journal":{"name":"SIAM Journal on Scientific Computing","volume":"24 1","pages":""},"PeriodicalIF":3.1,"publicationDate":"2024-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142217591","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":"Stable Backward Differentiation Formula Time Discretization of BGN-Based Parametric Finite Element Methods for Geometric Flows","authors":"Wei Jiang, Chunmei Su, Ganghui Zhang","doi":"10.1137/23m1625597","DOIUrl":"https://doi.org/10.1137/23m1625597","url":null,"abstract":"SIAM Journal on Scientific Computing, Volume 46, Issue 5, Page A2874-A2898, October 2024. <br/> Abstract. We propose a novel class of temporal high-order parametric finite element methods for solving a wide range of geometric flows of curves and surfaces. By incorporating the backward differentiation formula (BDF) for time discretization into the BGN formulation, originally proposed by Barrett, Garcke, and Nürnberg (J. Comput. Phys., 222 (2007), pp. 441–467), we successfully develop high-order BGN/BDF[math] schemes. The proposed BGN/BDF[math] schemes not only retain almost all the advantages of the classical first-order BGN scheme such as computational efficiency and good mesh quality, but also exhibit the desired [math]th-order temporal accuracy in terms of shape metrics, ranging from second-order to fourth-order accuracy. Furthermore, we validate the performance of our proposed BGN/BDF[math] schemes through extensive numerical examples, demonstrating their high-order temporal accuracy for various types of geometric flows while maintaining good mesh quality throughout the evolution.","PeriodicalId":49526,"journal":{"name":"SIAM Journal on Scientific Computing","volume":"6 1","pages":""},"PeriodicalIF":3.1,"publicationDate":"2024-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142217592","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":"Reducing Operator Complexity of Galerkin Coarse-grid Operators with Machine Learning","authors":"Ru Huang, Kai Chang, Huan He, Ruipeng Li, Yuanzhe Xi","doi":"10.1137/23m1583533","DOIUrl":"https://doi.org/10.1137/23m1583533","url":null,"abstract":"SIAM Journal on Scientific Computing, Ahead of Print. <br/> Abstract. We propose a data-driven and machine-learning-based approach to compute non-Galerkin coarse-grid operators in multigrid (MG) methods, addressing the well-known issue of increasing operator complexity. Guided by the MG theory on spectrally equivalent coarse-grid operators, we have developed novel machine learning algorithms that utilize neural networks combined with smooth test vectors from multigrid eigenvalue problems. The proposed method demonstrates promise in reducing the complexity of coarse-grid operators while maintaining overall MG convergence for solving parametric partial differential equation problems. Numerical experiments on anisotropic rotated Laplacian and linear elasticity problems are provided to showcase the performance and comparison with existing methods for computing non-Galerkin coarse-grid operators. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SISC and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://github.com/liruipeng/SparseCoarseOperator.","PeriodicalId":49526,"journal":{"name":"SIAM Journal on Scientific Computing","volume":"10 1","pages":""},"PeriodicalIF":3.1,"publicationDate":"2024-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142217599","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":"Multigrid Preconditioning for Regularized Least-Squares Problems","authors":"Matthias Bolten, Misha E. Kilmer, Scott MacLachlan","doi":"10.1137/23m1583417","DOIUrl":"https://doi.org/10.1137/23m1583417","url":null,"abstract":"SIAM Journal on Scientific Computing, Ahead of Print. <br/> Abstract. In this paper, we are concerned with efficiently solving the sequences of regularized linear least-squares problems associated with employing Tikhonov-type regularization with regularization operators designed to enforce edge recovery. An optimal regularization parameter, which balances the fidelity to the data with the edge-enforcing constraint term, is typically not known a priori. This adds to the total number of regularized linear least-squares problems that must be solved before the final image can be recovered. Therefore, in this paper, we determine effective multigrid preconditioners for these sequences of systems. We focus our approach on the sequences that arise as a result of the edge-preserving method introduced in [S. Gazzola et al., Inverse Problems, 36 (2020), 124004], where we can exploit an interpretation of the regularization term as a diffusion operator; however, our methods are also applicable in other edge-preserving settings, such as iteratively reweighted least-squares problems. Particular attention is paid to the selection of components of the multigrid preconditioner in order to achieve robustness for different ranges of the regularization parameter value. In addition, we present a parameter trimming approach that, when used with the L-curve heuristic, reduces the total number of solves required. We demonstrate our preconditioning and parameter trimming routines on examples in computed tomography and image deblurring.","PeriodicalId":49526,"journal":{"name":"SIAM Journal on Scientific Computing","volume":"181 1","pages":""},"PeriodicalIF":3.1,"publicationDate":"2024-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142217594","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 New Provably Stable Weighted State Redistribution Algorithm","authors":"Marsha Berger, Andrew Giuliani","doi":"10.1137/23m1597484","DOIUrl":"https://doi.org/10.1137/23m1597484","url":null,"abstract":"SIAM Journal on Scientific Computing, Volume 46, Issue 5, Page A2848-A2873, October 2024. <br/> Abstract. We propose a practical finite volume method on cut cells using state redistribution. Our algorithm is provably monotone, total variation diminishing, and GKS (Gustafsson, Kreiss, Sundström) stable in many situations, and shuts off continuously as the cut cell size approaches a target value. Our analysis reveals why original state redistribution works so well: it results in a monotone scheme for most configurations, though at times subject to a slightly smaller CFL condition. Our analysis also explains why a premerging step is beneficial. We show computational experiments in two and three dimensions.","PeriodicalId":49526,"journal":{"name":"SIAM Journal on Scientific Computing","volume":"36 1","pages":""},"PeriodicalIF":3.1,"publicationDate":"2024-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142217593","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 Domain Decomposition–Based CNN-DNN Architecture for Model Parallel Training Applied to Image Recognition Problems","authors":"Axel Klawonn, Martin Lanser, Janine Weber","doi":"10.1137/23m1562202","DOIUrl":"https://doi.org/10.1137/23m1562202","url":null,"abstract":"SIAM Journal on Scientific Computing, Volume 46, Issue 5, Page C557-C582, October 2024. <br/> Abstract. Deep neural networks (DNNs) and, in particular, convolutional neural networks (CNNs) have brought significant advances in a wide range of modern computer application problems. However, the increasing availability of large numbers of datasets and the increasing available computational power of modern computers have led to steady growth in the complexity and size of DNN and CNN models, respectively, and thus, to longer training times. Hence, various methods and attempts have been developed to accelerate and parallelize the training of complex network architectures. In this work, a novel CNN-DNN architecture is proposed that naturally supports a model parallel training strategy and that is loosely inspired by two-level domain decomposition methods (DDMs). First, local CNN models, that is, subnetworks, are defined that operate on overlapping or nonoverlapping parts of the input data, for example, subimages. The subnetworks can be trained completely in parallel and independently of each other. Each subnetwork then outputs a local decision for the given machine learning problem which is exclusively based on the respective local input data. Subsequently, in a second step, an additional DNN model is trained which evaluates the local decisions of the local subnetworks and generates a final, global decision. With respect to the analogy to DDMs, the DNN models can be loosely interpreted as a coarse problem and hence, the new approach can be interpreted as a two-level domain decomposition. In this paper, we apply the proposed architecture to image classification problems using CNNs. Experimental results for different two-dimensional image classification problems are provided, as well as a face recognition problem and a classification problem for three-dimensional computed tomography (CT) scans. Therefore, classical Residual Network (ResNet) and VGG architectures are considered. More modern architectures, such as, e.g., MobileNet2, are left for future work. The results show that the proposed approach can significantly accelerate the required training time compared to the global model and, additionally, can also help to improve the accuracy of the underlying classification problem.","PeriodicalId":49526,"journal":{"name":"SIAM Journal on Scientific Computing","volume":"75 1 1","pages":""},"PeriodicalIF":3.1,"publicationDate":"2024-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142217595","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}