Advances in Computational Mathematics最新文献

筛选
英文 中文
Multi-fidelity learning of reduced order models for parabolic PDE constrained optimization 抛物型PDE约束优化降阶模型的多保真度学习
IF 2.1 3区 数学
Advances in Computational Mathematics Pub Date : 2026-03-03 DOI: 10.1007/s10444-026-10296-6
Benedikt Klein, Mario Ohlberger
{"title":"Multi-fidelity learning of reduced order models for parabolic PDE constrained optimization","authors":"Benedikt Klein,&nbsp;Mario Ohlberger","doi":"10.1007/s10444-026-10296-6","DOIUrl":"10.1007/s10444-026-10296-6","url":null,"abstract":"<div><p>This article builds on the recently proposed RB-ML-ROM approach for parameterized parabolic PDEs and proposes a novel hierarchical trust region algorithm for solving parabolic PDE constrained optimization problems. Instead of using a traditional offline/online splitting approach for model order reduction, we adopt an active learning or enrichment strategy to construct a multi-fidelity hierarchy of reduced order models on-the-fly during the outer optimization loop. The multi-fidelity surrogate model consists of a full order model, a reduced order model and a machine learning model. The proposed hierarchical framework adaptively updates its hierarchy when querying parameters, utilizing a rigorous a posteriori error estimator in an error-aware trust region framework. Numerical experiments are given to demonstrate the efficiency of the proposed approach.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"52 2","pages":""},"PeriodicalIF":2.1,"publicationDate":"2026-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10444-026-10296-6.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147336374","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Structure-preserving Lift & Learn: Scientific machine learning for nonlinear conservative partial differential equations 保持结构的提升与学习:非线性保守偏微分方程的科学机器学习
IF 2.1 3区 数学
Advances in Computational Mathematics Pub Date : 2026-03-03 DOI: 10.1007/s10444-026-10294-8
Harsh Sharma, Juan Diego Draxl Giannoni, Boris Kramer
{"title":"Structure-preserving Lift & Learn: Scientific machine learning for nonlinear conservative partial differential equations","authors":"Harsh Sharma,&nbsp;Juan Diego Draxl Giannoni,&nbsp;Boris Kramer","doi":"10.1007/s10444-026-10294-8","DOIUrl":"10.1007/s10444-026-10294-8","url":null,"abstract":"<div><p>This work presents <i>structure-preserving Lift &amp; Learn</i>, a scientific machine learning method that employs lifting variable transformations to learn structure-preserving reduced-order models for nonlinear partial differential equations (PDEs) with conservation laws. We propose a hybrid learning approach based on a recently developed energy-quadratization strategy that uses knowledge of the nonlinearity at the PDE level to derive an equivalent quadratic lifted system with quadratic system energy. The lifted dynamics obtained via energy quadratization are linear in the old variables, making model learning very effective in the lifted setting. Based on the lifted quadratic PDE model form, the proposed method derives quadratic reduced terms analytically and then uses those derived terms to formulate a constrained optimization problem to learn the remaining linear reduced operators in a structure-preserving way. The proposed hybrid learning approach yields computationally efficient quadratic reduced-order models that respect the underlying physics of the high-dimensional problem. We demonstrate the generalizability of quadratic models learned via the proposed structure-preserving Lift &amp; Learn method through three numerical examples: the one-dimensional wave equation with exponential nonlinearity, the two-dimensional sine-Gordon equation, and the two-dimensional Klein-Gordon-Zakharov equations. The numerical results show that the proposed learning approach is competitive with the state-of-the-art structure-preserving data-driven model reduction method in terms of both accuracy and computational efficiency.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"52 2","pages":""},"PeriodicalIF":2.1,"publicationDate":"2026-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147336373","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}
引用次数: 0
Optimal compactly supported functions in Sobolev spaces Sobolev空间中的最优紧支持函数
IF 2.1 3区 数学
Advances in Computational Mathematics Pub Date : 2026-03-03 DOI: 10.1007/s10444-026-10293-9
Robert Schaback
{"title":"Optimal compactly supported functions in Sobolev spaces","authors":"Robert Schaback","doi":"10.1007/s10444-026-10293-9","DOIUrl":"10.1007/s10444-026-10293-9","url":null,"abstract":"<div><p>This paper constructs unique compactly supported functions in Sobolev spaces that have minimal norm, maximal support, and maximal central value, under certain renormalizations. They may serve as optimized basis functions in interpolation or approximation, or as shape functions in meshless methods for PDE solving. Their norm is useful for proving upper bounds for convergence rates of interpolation in Sobolev spaces <span>(H_2^m(mathbb {R}^d))</span>, and this paper gives the correct rate <span>(m-d/2)</span> that arises as convergence like <span>(h^{m-d/2})</span> for interpolation at meshwidth <span>(hrightarrow 0)</span> or a blow-up like <span>(r^{-(m-d/2)})</span> for norms of compactly supported functions with support radius <span>(rrightarrow 0)</span>. In Hilbert spaces with infinitely smooth reproducing kernels, like Gaussians or inverse multiquadrics, there are no compactly supported functions at all, but in spaces with limited smoothness, compactly supported functions exist and can be optimized in the above way. The construction is described in Hilbert space via projections, and analytically via trace operators. Numerical examples are provided.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"52 2","pages":""},"PeriodicalIF":2.1,"publicationDate":"2026-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10444-026-10293-9.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147336375","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Curve fitting on a quantum annealer for an advanced navigation method 一种先进导航方法的量子退火炉曲线拟合
IF 2.1 3区 数学
Advances in Computational Mathematics Pub Date : 2026-02-23 DOI: 10.1007/s10444-026-10292-w
Philipp Isserstedt, Daniel Jaroszewski, Wolfgang Mergenthaler, Felix Paul, Bastian Harrach
{"title":"Curve fitting on a quantum annealer for an advanced navigation method","authors":"Philipp Isserstedt,&nbsp;Daniel Jaroszewski,&nbsp;Wolfgang Mergenthaler,&nbsp;Felix Paul,&nbsp;Bastian Harrach","doi":"10.1007/s10444-026-10292-w","DOIUrl":"10.1007/s10444-026-10292-w","url":null,"abstract":"<div><p>We explore the applicability of quantum annealing to the approximation task of curve fitting. To this end, we consider a function that shall approximate a given set of data points and is written as a finite linear combination of standardized functions, e.g., orthogonal polynomials. Consequently, the decision variables subject to optimization are the coefficients of that expansion. Although this task can be accomplished classically, it can also be formulated as a quadratic unconstrained binary optimization problem, which is suited to be solved with quantum annealing. Given that the size of the problem stays below a certain threshold, we find that quantum annealing yields comparable results to the classical solution. Regarding a real-world use case, we discuss the problem to find an optimized speed profile for a vessel using the framework of dynamic programming and outline how the aforementioned approximation task can be put into play. Similar to the curve fitting task, our findings indicate that quantum annealing is currently only feasible if the routing problem is modeled sufficiently small and sparse.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"52 2","pages":""},"PeriodicalIF":2.1,"publicationDate":"2026-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147287097","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}
引用次数: 0
A posteriori error estimates for a (C^1) virtual element method applied to the thin plate vibration problem. 应用于薄板振动问题的$$C^1$$虚元法的后验误差估计。
IF 2.1 3区 数学
Advances in Computational Mathematics Pub Date : 2026-02-23 DOI: 10.1007/s10444-026-10288-6
Franco Dassi, Andrés E. Rubiano, Iván Velásquez
{"title":"A posteriori error estimates for a (C^1) virtual element method applied to the thin plate vibration problem.","authors":"Franco Dassi,&nbsp;Andrés E. Rubiano,&nbsp;Iván Velásquez","doi":"10.1007/s10444-026-10288-6","DOIUrl":"10.1007/s10444-026-10288-6","url":null,"abstract":"<div><p>We propose and analyse residual-based a posteriori error estimates for the virtual element discretisation applied to the thin plate vibration problem in both two and three dimensions. Our approach involves a conforming <span>(C^1)</span> discrete formulation suitable for meshes composed of polygons and polyhedra. The reliability and efficiency of the error estimator are established through a dimension-independent proof. Finally, several numerical experiments are reported to demonstrate the optimal performance of the method in 2D and 3D.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"52 2","pages":""},"PeriodicalIF":2.1,"publicationDate":"2026-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10444-026-10288-6.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147287099","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Spectral approximation of a class of stochastic time-fractional evolution equations 一类随机时间分数进化方程的谱近似
IF 2.1 3区 数学
Advances in Computational Mathematics Pub Date : 2026-02-19 DOI: 10.1007/s10444-026-10291-x
Simen Knutsen Furset
{"title":"Spectral approximation of a class of stochastic time-fractional evolution equations","authors":"Simen Knutsen Furset","doi":"10.1007/s10444-026-10291-x","DOIUrl":"10.1007/s10444-026-10291-x","url":null,"abstract":"<div><p>A method for numerical approximation of a class of fractional parabolic stochastic evolution equations is introduced and analysed. This class of equations has recently been proposed as a space-time extension of the SPDE-method in spatial statistics. A truncation of the spectral basis function expansion is used to discretise in space, and then a quadrature is used to approximate the temporal evolution of each basis coefficient. Strong error bounds are proved both for the spectral and temporal approximations. The method is tested, and the results are verified by several numerical experiments.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"52 2","pages":""},"PeriodicalIF":2.1,"publicationDate":"2026-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10444-026-10291-x.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146230772","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A direct parallel-in-time finite difference solver for quenching combustion problem 淬火燃烧问题的直接并行时域有限差分求解器
IF 2.1 3区 数学
Advances in Computational Mathematics Pub Date : 2026-02-18 DOI: 10.1007/s10444-026-10286-8
Yufeng Xu, Ying Zhu, Desong Kong, Zhoushun Zheng
{"title":"A direct parallel-in-time finite difference solver for quenching combustion problem","authors":"Yufeng Xu,&nbsp;Ying Zhu,&nbsp;Desong Kong,&nbsp;Zhoushun Zheng","doi":"10.1007/s10444-026-10286-8","DOIUrl":"10.1007/s10444-026-10286-8","url":null,"abstract":"<div><p>In this paper, we explore a direct parallel-in-time method based on the diagonalization of the time-stepping matrix to solve the Kawarada equation, which arises from the quenching combustion process. Unlike the traditional time-marching finite difference method, where a nonlinear system may need to be solved at each time step once implicit schemes are employed, here, we form a large sparse linear system involving all unknown variables on the time-space domain, so that numerical solution can be handled all at once. Thanks to the non-uniform step sizes, the diagonalization technique can be introduced into a parallel-in-time process. Therefore, the dynamics near quenching time and quenching point can be described more accurately. We use a time window technique to release the deficiency of diagonalization, leading the accuracy and efficiency of the algorithm to be well-balanced. In numerical analysis, we propose a practical <i>PAMS</i>-framework to verify the effectiveness of the aforementioned method from four aspects including <i>Positivity, Asymptoticity, Monotonicity, and Stability</i>. Finally, several numerical experiments are conducted on 1D and 2D Kawarada equations, which demonstrate that the studied parallel-in-time method is reliable and highly efficient for quenching-type reaction diffusion equations. Meanwhile, computational time is reduced satisfactorily compared to the time-marching method.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"52 2","pages":""},"PeriodicalIF":2.1,"publicationDate":"2026-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146230774","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}
引用次数: 0
Minimum curvature method for surface reconstruction 曲面重建的最小曲率法
IF 2.1 3区 数学
Advances in Computational Mathematics Pub Date : 2026-02-18 DOI: 10.1007/s10444-026-10290-y
Hyeona Lim, Seongjai Kim
{"title":"Minimum curvature method for surface reconstruction","authors":"Hyeona Lim,&nbsp;Seongjai Kim","doi":"10.1007/s10444-026-10290-y","DOIUrl":"10.1007/s10444-026-10290-y","url":null,"abstract":"<div><p>Surface reconstruction is a challenging problem when no constraint is imposed on data locations. The problem is ill-posed, and most computational algorithms become overly expensive as the number of sample points increases. This article presents a generalization of a popular integral method called <i>minimum curvature</i> (MC) method, which is based on the numerical solution of a modified biharmonic <i>partial differential equation</i> (PDE). Surface reconstruction through the PDE solution for scattered data can be considered as an interior value problem. A new model is suggested to construct an image surface that satisfies data constraints accurately and conveniently. In order to improve the efficiency of the MC method, an effective initialization scheme is suggested. The resulting algorithm is applied for image zooming, synthetic scattered data, and agricultural data acquired by light detection and ranging (LiDAR) technology.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"52 2","pages":""},"PeriodicalIF":2.1,"publicationDate":"2026-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146230773","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}
引用次数: 0
Chebyshev accelerating technique for solving generalized non-symmetric eigenvalue problems 求解广义非对称特征值问题的Chebyshev加速技术
IF 2.1 3区 数学
Advances in Computational Mathematics Pub Date : 2026-02-12 DOI: 10.1007/s10444-026-10287-7
Lan Cheng, Cun-Qiang Miao, Yue-Yang Zhang
{"title":"Chebyshev accelerating technique for solving generalized non-symmetric eigenvalue problems","authors":"Lan Cheng,&nbsp;Cun-Qiang Miao,&nbsp;Yue-Yang Zhang","doi":"10.1007/s10444-026-10287-7","DOIUrl":"10.1007/s10444-026-10287-7","url":null,"abstract":"<div><p>Given the efficient application of Chebyshev polynomial acceleration techniques in standard symmetric and non-symmetric eigenvalue problems as well as generalized symmetric eigenvalue problems, we extend this technique to generalized non-symmetric eigenvalue problems and propose the Chebyshev-Davidson method. By partitioning the spectrum of the corresponding shifted matrix, we construct four Chebyshev polynomial filters at each iteration to accelerate the convergence of desired eigenvectors while suppressing the convergence of undesired eigenvectors. The introduction of multiple Chebyshev polynomial filters does not significantly increase the computational cost. Furthermore, to compute several eigenvalues and corresponding eigenvectors of generalized non-symmetric eigenvalue problems, we propose the block Chebyshev-Davidson method. Numerical experiments are carried out to demonstrate its superior performance and robustness compared to some state-of-the-art iterative methods.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"52 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2026-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146196584","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}
引用次数: 0
Space-time isogeometric method for a nonlocal parabolic problem 非局部抛物问题的时空等几何方法
IF 2.1 3区 数学
Advances in Computational Mathematics Pub Date : 2026-02-12 DOI: 10.1007/s10444-026-10285-9
Sudhakar Chaudhary, Shreya Chauhan, Monica Montardini
{"title":"Space-time isogeometric method for a nonlocal parabolic problem","authors":"Sudhakar Chaudhary,&nbsp;Shreya Chauhan,&nbsp;Monica Montardini","doi":"10.1007/s10444-026-10285-9","DOIUrl":"10.1007/s10444-026-10285-9","url":null,"abstract":"<div><p>In the present work, we focus on the space-time isogeometric discretization of a parabolic problem with a nonlocal diffusion coefficient. The existence and uniqueness of the solution for the continuous space-time variational formulation are proven. We prove the existence of the discrete solution and also establish the a priori error estimate for the space-time isogeometric scheme. The non-linear system is linearized through Picard’s method, and a suitable preconditioner for the linearized system is provided. Finally, to confirm the theoretical findings, the results of some numerical experiments are presented.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"52 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2026-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10444-026-10285-9.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146196477","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","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学术官方微信
小红书