Journal of Scientific Computing最新文献

筛选
英文 中文
A Mass-Conservative Reduced-Order Algorithm in Solving Optimal Control of Convection-Diffusion Equation 解决对流扩散方程优化控制的质量守恒降序算法
IF 2.5 2区 数学
Journal of Scientific Computing Pub Date : 2024-07-14 DOI: 10.1007/s10915-024-02620-3
Junpeng Song, Qiuqin Wu, Yi Shi
{"title":"A Mass-Conservative Reduced-Order Algorithm in Solving Optimal Control of Convection-Diffusion Equation","authors":"Junpeng Song, Qiuqin Wu, Yi Shi","doi":"10.1007/s10915-024-02620-3","DOIUrl":"https://doi.org/10.1007/s10915-024-02620-3","url":null,"abstract":"<p>This paper introduces a novel approach, the mass-conservative reduced-order characteristic finite element (MCROCFE) method, designed for optimal control problem governed by convection-diffusion equation. The study delves into scenarios where the original state equation exhibits mass-conservation, yet the velocity field is non-divergence-free. The key points of emphasis are: (1) The method effectively addresses convection-dominated diffusion systems through the application of the characteristic technique; (2) Its efficiency is underscored by leveraging the proper orthogonal decomposition (POD) technique, significantly reducing the scale of solving algebraic equation systems; (3) The proposed scheme, based on the mass-conservative characteristic finite element (MCCFE) method framework and the classical POD technique with a slight adjustment to reduce-order space, maintains mass-conservation for the state variable. A priori error estimates are derived for the mass-conservative reduced-order scheme. Theoretical results are validated through numerical comparisons with the MCCFE method, emphasizing the mass-conservation, accuracy and efficiency of the MCROCFE method.</p>","PeriodicalId":50055,"journal":{"name":"Journal of Scientific Computing","volume":"108 1","pages":""},"PeriodicalIF":2.5,"publicationDate":"2024-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141609467","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}
引用次数: 0
A Preconditioned MINRES Method for Block Lower Triangular Toeplitz Systems 块下三角托普利兹系统的预处理 MINRES 方法
IF 2.5 2区 数学
Journal of Scientific Computing Pub Date : 2024-07-13 DOI: 10.1007/s10915-024-02611-4
Congcong Li, Xuelei Lin, Sean Hon, Shu-Lin Wu
{"title":"A Preconditioned MINRES Method for Block Lower Triangular Toeplitz Systems","authors":"Congcong Li, Xuelei Lin, Sean Hon, Shu-Lin Wu","doi":"10.1007/s10915-024-02611-4","DOIUrl":"https://doi.org/10.1007/s10915-024-02611-4","url":null,"abstract":"<p>In this study, a novel preconditioner based on the absolute-value block <span>(alpha )</span>-circulant matrix approximation is developed, specifically designed for nonsymmetric dense block lower triangular Toeplitz (BLTT) systems that emerge from the numerical discretization of evolutionary equations. Our preconditioner is constructed by taking an absolute-value of a block <span>(alpha )</span>-circulant matrix approximation to the BLTT matrix. To apply our preconditioner, the original BLTT linear system is converted into a symmetric form by applying a time-reversing permutation transformation. Then, with our preconditioner, the preconditioned minimal residual method (MINRES) solver is employed to solve the symmetrized linear system. With properly chosen <span>(alpha )</span>, the eigenvalues of the preconditioned matrix are proven to be clustered around <span>(pm 1)</span> without any significant outliers. With the clustered spectrum, we show that the preconditioned MINRES solver for the preconditioned system has a convergence rate independent of system size. The efficacy of the proposed preconditioner is corroborated by our numerical experiments, which reveal that it attains optimal convergence.</p>","PeriodicalId":50055,"journal":{"name":"Journal of Scientific Computing","volume":"23 1","pages":""},"PeriodicalIF":2.5,"publicationDate":"2024-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141614425","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}
引用次数: 0
Stability Analysis and Error Estimate of the Explicit Single-Step Time-Marching Discontinuous Galerkin Methods with Stage-Dependent Numerical Flux Parameters for a Linear Hyperbolic Equation in One Dimension 一维线性双曲方程的显式单步时间行进非连续伽勒金方法与阶段性数值通量参数的稳定性分析和误差估计
IF 2.5 2区 数学
Journal of Scientific Computing Pub Date : 2024-07-13 DOI: 10.1007/s10915-024-02621-2
Yuan Xu, Chi-Wang Shu, Qiang Zhang
{"title":"Stability Analysis and Error Estimate of the Explicit Single-Step Time-Marching Discontinuous Galerkin Methods with Stage-Dependent Numerical Flux Parameters for a Linear Hyperbolic Equation in One Dimension","authors":"Yuan Xu, Chi-Wang Shu, Qiang Zhang","doi":"10.1007/s10915-024-02621-2","DOIUrl":"https://doi.org/10.1007/s10915-024-02621-2","url":null,"abstract":"<p>In this paper, we present the <span>(hbox {L}^2)</span>-norm stability analysis and error estimate for the explicit single-step time-marching discontinuous Galerkin (DG) methods with stage-dependent numerical flux parameters, when solving a linear constant-coefficient hyperbolic equation in one dimension. Two well-known examples of this method include the Runge–Kutta DG method with the downwind treatment for the negative time marching coefficients, as well as the Lax–Wendroff DG method with arbitrary numerical flux parameters to deal with the auxiliary variables. The stability analysis framework is an extension and an application of the matrix transferring process based on the temporal differences of stage solutions, and a new concept, named as the averaged numerical flux parameter, is proposed to reveal the essential upwind mechanism in the fully discrete status. Distinguished from the traditional analysis, we have to present a novel way to obtain the optimal error estimate in both space and time. The main tool is a series of space–time approximation functions for a given spatial function, which preserve the local structure of the fully discrete schemes and the balance of exact evolution under the control of the partial differential equation. Finally some numerical experiments are given to validate the theoretical results proposed in this paper.</p>","PeriodicalId":50055,"journal":{"name":"Journal of Scientific Computing","volume":"36 1","pages":""},"PeriodicalIF":2.5,"publicationDate":"2024-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141614426","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}
引用次数: 0
Superconvergence Analysis of a Robust Orthogonal Gauss Collocation Method for 2D Fourth-Order Subdiffusion Equations 二维四阶次扩散方程的鲁棒正交高斯配位法的超收敛性分析
IF 2.5 2区 数学
Journal of Scientific Computing Pub Date : 2024-07-12 DOI: 10.1007/s10915-024-02616-z
Xuehua Yang, Zhimin Zhang
{"title":"Superconvergence Analysis of a Robust Orthogonal Gauss Collocation Method for 2D Fourth-Order Subdiffusion Equations","authors":"Xuehua Yang, Zhimin Zhang","doi":"10.1007/s10915-024-02616-z","DOIUrl":"https://doi.org/10.1007/s10915-024-02616-z","url":null,"abstract":"<p>In this paper, we study the orthogonal Gauss collocation method (OGCM) with an arbitrary polynomial degree for the numerical solution of a two-dimensional (2D) fourth-order subdiffusion model. This numerical method involves solving a coupled system of partial differential equations by using OGCM in space together with the L1 scheme in time on a graded mesh. The approximations <span>(w^n_h)</span> and <span>(v^n_h)</span> of <span>(w(cdot , t_n))</span> and <span>(varDelta w(cdot , t_n))</span> are constructed. The stability of <span>(w^n_h)</span> and <span>(v^n_h)</span> are proved, and the a priori bounds of <span>(Vert w^n_hVert )</span> and <span>(Vert v^n_hVert )</span> are established, remaining <span>(alpha )</span>-robust as <span>(alpha rightarrow 1^{-})</span>. Then, the error <span>(Vert w(cdot , t_n)- w^n_hVert )</span> and <span>(Vert varDelta w(cdot , t_n)-v^n_hVert )</span> are estimated with <span>(alpha )</span>-robust at each time level. In addition, superconvergence results of the first-order and second-order derivative approximations are proved. These new error bounds are desirable and natural, as that they are optimal in both temporal and spatial mesh parameters for each fixed <span>(alpha )</span>. Finally some numerical results are provided to support our theoretical findings.</p>","PeriodicalId":50055,"journal":{"name":"Journal of Scientific Computing","volume":"57 1","pages":""},"PeriodicalIF":2.5,"publicationDate":"2024-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141609468","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}
引用次数: 0
Gradient-Based Monte Carlo Methods for Relaxation Approximations of Hyperbolic Conservation Laws 基于梯度的蒙特卡罗方法用于双曲守恒定律的松弛逼近
IF 2.5 2区 数学
Journal of Scientific Computing Pub Date : 2024-07-11 DOI: 10.1007/s10915-024-02614-1
Giulia Bertaglia, Lorenzo Pareschi, Russel E. Caflisch
{"title":"Gradient-Based Monte Carlo Methods for Relaxation Approximations of Hyperbolic Conservation Laws","authors":"Giulia Bertaglia, Lorenzo Pareschi, Russel E. Caflisch","doi":"10.1007/s10915-024-02614-1","DOIUrl":"https://doi.org/10.1007/s10915-024-02614-1","url":null,"abstract":"<p>Particle methods based on evolving the spatial derivatives of the solution were originally introduced to simulate reaction-diffusion processes, inspired by vortex methods for the Navier–Stokes equations. Such methods, referred to as gradient random walk methods, were extensively studied in the ’90s and have several interesting features, such as being grid-free, automatically adapting to the solution by concentrating elements where the gradient is large, and significantly reducing the variance of the standard random walk approach. In this work, we revive these ideas by showing how to generalize the approach to a larger class of partial differential equations, including hyperbolic systems of conservation laws. To achieve this goal, we first extend the classical Monte Carlo method to relaxation approximation of systems of conservation laws, and subsequently consider a novel particle dynamics based on the spatial derivatives of the solution. The methodology, combined with asymptotic-preserving splitting discretization, yields a way to construct a new class of gradient-based Monte Carlo methods for hyperbolic systems of conservation laws. Several results in one spatial dimension for scalar equations and systems of conservation laws show that the new methods are very promising and yield remarkable improvements compared to standard Monte Carlo approaches, either in terms of variance reduction as well as in describing the shock structure.</p>","PeriodicalId":50055,"journal":{"name":"Journal of Scientific Computing","volume":"45 1","pages":""},"PeriodicalIF":2.5,"publicationDate":"2024-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141587806","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}
引用次数: 0
Weakly Compressible Two-Layer Shallow-Water Flows Along Channels 弱可压缩两层浅水水道流
IF 2.5 2区 数学
Journal of Scientific Computing Pub Date : 2024-07-11 DOI: 10.1007/s10915-024-02608-z
Sarswati Shah, Gerardo Hernández-Dueñas
{"title":"Weakly Compressible Two-Layer Shallow-Water Flows Along Channels","authors":"Sarswati Shah, Gerardo Hernández-Dueñas","doi":"10.1007/s10915-024-02608-z","DOIUrl":"https://doi.org/10.1007/s10915-024-02608-z","url":null,"abstract":"<p>In this paper, we formulate a model for weakly compressible two-layer shallow water flows with friction in general channels. The formulated model is non-conservative, and in contrast to the incompressible limit, our system is strictly hyperbolic. The generalized Rankine–Hugoniot conditions are provided for the present system with non-conservative products to define weak solutions. We write the Riemann invariants along each characteristic field for channels with constant width in an appendix. A robust well-balanced path-conservative semi-discrete central-upwind scheme is proposed and implemented to validate exact solutions to the Riemann problem. We also present numerical tests in general channels to show the merits of the scheme.</p>","PeriodicalId":50055,"journal":{"name":"Journal of Scientific Computing","volume":"1 1","pages":""},"PeriodicalIF":2.5,"publicationDate":"2024-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141587807","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}
引用次数: 0
A Penalty-Free and Essentially Stabilization-Free DG Method for Convection-Dominated Second-Order Elliptic Problems 针对对流主导的二阶椭圆问题的无罚金且基本无稳定的 DG 方法
IF 2.5 2区 数学
Journal of Scientific Computing Pub Date : 2024-07-09 DOI: 10.1007/s10915-024-02615-0
Huoyuan Duan, Junhua Ma
{"title":"A Penalty-Free and Essentially Stabilization-Free DG Method for Convection-Dominated Second-Order Elliptic Problems","authors":"Huoyuan Duan, Junhua Ma","doi":"10.1007/s10915-024-02615-0","DOIUrl":"https://doi.org/10.1007/s10915-024-02615-0","url":null,"abstract":"<p>A new discontinuous Galerkin (DG) method is proposed and analyzed for general second-order elliptic problems. It features that local <span>(L^2)</span> projections are used to reconstruct the diffusion term and the convection term and that it does not need any penalty and even does not need any stabilization in the formulation. The Babus̆ka inf-sup stability is proven. The error estimates are established. More importantly, the new DG method can hold the SUPG-type stability for the convection; the SUPG-type optimal error estimates <span>({{mathcal {O}}}(h^{ell +1/2}))</span> is obtained for the problem with a dominating convection for the <span>(ell )</span>-th order (<span>(ell ge 0)</span>) discontinuous element. Numerical results are provided.</p>","PeriodicalId":50055,"journal":{"name":"Journal of Scientific Computing","volume":"87 1","pages":""},"PeriodicalIF":2.5,"publicationDate":"2024-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141567120","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}
引用次数: 0
Inexact Fixed-Point Proximity Algorithm for the $$ell _0$$ Sparse Regularization Problem $$ell _0$$ 稀疏正则化问题的非精确定点邻近算法
IF 2.5 2区 数学
Journal of Scientific Computing Pub Date : 2024-07-08 DOI: 10.1007/s10915-024-02600-7
Ronglong Fang, Yuesheng Xu, Mingsong Yan
{"title":"Inexact Fixed-Point Proximity Algorithm for the $$ell _0$$ Sparse Regularization Problem","authors":"Ronglong Fang, Yuesheng Xu, Mingsong Yan","doi":"10.1007/s10915-024-02600-7","DOIUrl":"https://doi.org/10.1007/s10915-024-02600-7","url":null,"abstract":"<p>We study <i>inexact</i> fixed-point proximity algorithms for solving a class of sparse regularization problems involving the <span>(ell _0)</span> norm. Specifically, the <span>(ell _0)</span> model has an objective function that is the sum of a convex fidelity term and a Moreau envelope of the <span>(ell _0)</span> norm regularization term. Such an <span>(ell _0)</span> model is non-convex. Existing exact algorithms for solving the problems require the availability of closed-form formulas for the proximity operator of convex functions involved in the objective function. When such formulas are not available, numerical computation of the proximity operator becomes inevitable. This leads to inexact iteration algorithms. We investigate in this paper how the numerical error for every step of the iteration should be controlled to ensure global convergence of the inexact algorithms. We establish a theoretical result that guarantees the sequence generated by the proposed inexact algorithm converges to a local minimizer of the optimization problem. We implement the proposed algorithms for three applications of practical importance in machine learning and image science, which include regression, classification, and image deblurring. The numerical results demonstrate the convergence of the proposed algorithm and confirm that local minimizers of the <span>(ell _0)</span> models found by the proposed inexact algorithm outperform global minimizers of the corresponding <span>(ell _1)</span> models, in terms of approximation accuracy and sparsity of the solutions.</p>","PeriodicalId":50055,"journal":{"name":"Journal of Scientific Computing","volume":"141 1","pages":""},"PeriodicalIF":2.5,"publicationDate":"2024-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141566994","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}
引用次数: 0
A Combined Mixed Hybrid and Hybridizable Discontinuous Galerkin Method for Darcy Flow and Transport 达西流与传输的混合可混合非连续伽勒金方法
IF 2.5 2区 数学
Journal of Scientific Computing Pub Date : 2024-07-08 DOI: 10.1007/s10915-024-02607-0
Keegan L. A. Kirk, Beatrice Riviere
{"title":"A Combined Mixed Hybrid and Hybridizable Discontinuous Galerkin Method for Darcy Flow and Transport","authors":"Keegan L. A. Kirk, Beatrice Riviere","doi":"10.1007/s10915-024-02607-0","DOIUrl":"https://doi.org/10.1007/s10915-024-02607-0","url":null,"abstract":"<p>A combined hybrid mixed and hybridizable discontinuous Galerkin method is formulated for the flow and transport equations. Convergence of the method is obtained by deriving optimal a priori error bounds in the L<span>(^2)</span> norm in space. Since the velocity in the transport equation depends on the flow problem, the stabilization parameter in the HDG method is a function of the discrete velocity. In addition, a key ingredient in the convergence proof is the construction of a projection that is shown to satisfy optimal approximation bounds. Numerical examples confirm the theoretical convergence rates and show the efficiency of high order discontinuous elements.\u0000</p>","PeriodicalId":50055,"journal":{"name":"Journal of Scientific Computing","volume":"77 1","pages":""},"PeriodicalIF":2.5,"publicationDate":"2024-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141566998","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}
引用次数: 0
A Parallel Finite Element Discretization Scheme for the Natural Convection Equations 自然对流方程的并行有限元离散化方案
IF 2.5 2区 数学
Journal of Scientific Computing Pub Date : 2024-07-04 DOI: 10.1007/s10915-024-02601-6
Yueqiang Shang
{"title":"A Parallel Finite Element Discretization Scheme for the Natural Convection Equations","authors":"Yueqiang Shang","doi":"10.1007/s10915-024-02601-6","DOIUrl":"https://doi.org/10.1007/s10915-024-02601-6","url":null,"abstract":"<p>This article presents a parallel finite element discretization scheme for solving numerically the steady natural convection equations, where a fully overlapping domain decomposition technique is used for parallelization. In this scheme, each processor computes independently a local solution in its subdomain using a mesh that covers the entire domain. It has a small mesh size <i>h</i> around the subdomain and a large mesh size <i>H</i> away from the subdomain. The discretization scheme is easy to implement based on existing serial software. It can yield an optimal convergence rate for the approximate solutions with suitable algorithmic parameters. Compared with the standard finite element method, the scheme is able to obtain an approximate solution of comparable accuracy with considerable reduction in computational time. Theoretical and numerical results show the promise of the scheme, where numerical simulation results for some benchmark problems such as the buoyancy-driven square cavity flow, right-angled triangular cavity flow and sinusoidal hot cylinder flow are provided.</p>","PeriodicalId":50055,"journal":{"name":"Journal of Scientific Computing","volume":"39 1","pages":""},"PeriodicalIF":2.5,"publicationDate":"2024-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141547111","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}
引用次数: 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学术文献互助群
群 号:604180095
Book学术官方微信