Advances in Computational Mathematics最新文献

筛选
英文 中文
Error estimates for POD-DL-ROMs: a deep learning framework for reduced order modeling of nonlinear parametrized PDEs enhanced by proper orthogonal decomposition POD-DL-ROM 的误差估计:通过适当正交分解增强的非线性参数化 PDE 减阶建模深度学习框架
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-04-24 DOI: 10.1007/s10444-024-10110-1
Simone Brivio, Stefania Fresca, Nicola Rares Franco, Andrea Manzoni
{"title":"Error estimates for POD-DL-ROMs: a deep learning framework for reduced order modeling of nonlinear parametrized PDEs enhanced by proper orthogonal decomposition","authors":"Simone Brivio,&nbsp;Stefania Fresca,&nbsp;Nicola Rares Franco,&nbsp;Andrea Manzoni","doi":"10.1007/s10444-024-10110-1","DOIUrl":"10.1007/s10444-024-10110-1","url":null,"abstract":"<div><p>POD-DL-ROMs have been recently proposed as an extremely versatile strategy to build accurate and reliable reduced order models (ROMs) for nonlinear parametrized partial differential equations, combining <i>(i)</i> a preliminary dimensionality reduction obtained through proper orthogonal decomposition (POD) for the sake of efficiency, <i>(ii)</i> an autoencoder architecture that further reduces the dimensionality of the POD space to a handful of latent coordinates, and <i>(iii)</i> a dense neural network to learn the map that describes the dynamics of the latent coordinates as a function of the input parameters and the time variable. Within this work, we aim at justifying the outstanding approximation capabilities of POD-DL-ROMs by means of a thorough error analysis, showing how the sampling required to generate training data, the dimension of the POD space, and the complexity of the underlying neural networks, impact on the solutions us to formulate practical criteria to control the relative error in the approximation of the solution field of interest, and derive general error estimates. Furthermore, we show that, from a theoretical point of view, POD-DL-ROMs outperform several deep learning-based techniques in terms of model complexity. Finally, we validate our findings by means of suitable numerical experiments, ranging from parameter-dependent operators analytically defined to several parametrized PDEs.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 3","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10444-024-10110-1.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140642700","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
Artificial neural networks with uniform norm-based loss functions 基于统一规范损失函数的人工神经网络
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-04-23 DOI: 10.1007/s10444-024-10124-9
Vinesha Peiris, Vera Roshchina, Nadezda Sukhorukova
{"title":"Artificial neural networks with uniform norm-based loss functions","authors":"Vinesha Peiris,&nbsp;Vera Roshchina,&nbsp;Nadezda Sukhorukova","doi":"10.1007/s10444-024-10124-9","DOIUrl":"10.1007/s10444-024-10124-9","url":null,"abstract":"<div><p>We explore the potential for using a nonsmooth loss function based on the max-norm in the training of an artificial neural network without hidden layers. We hypothesise that this may lead to superior classification results in some special cases where the training data are either very small or the class size is disproportional. Our numerical experiments performed on a simple artificial neural network with no hidden layer appear to confirm our hypothesis.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 3","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10444-024-10124-9.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140637705","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
The improvement of the truncated Euler-Maruyama method for non-Lipschitz stochastic differential equations 非 Lipschitz 随机微分方程的截断 Euler-Maruyama 方法的改进
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-04-22 DOI: 10.1007/s10444-024-10131-w
Weijun Zhan, Yuyuan Li
{"title":"The improvement of the truncated Euler-Maruyama method for non-Lipschitz stochastic differential equations","authors":"Weijun Zhan,&nbsp;Yuyuan Li","doi":"10.1007/s10444-024-10131-w","DOIUrl":"10.1007/s10444-024-10131-w","url":null,"abstract":"<div><p>This paper is concerned with the numerical approximations for stochastic differential equations with non-Lipschitz drift or diffusion coefficients. A modified truncated Euler-Maruyama discretization scheme is developed. Moreover, by establishing the criteria on stochastic C-stability and B-consistency of the truncated Euler-Maruyama method, we obtain the strong convergence and the convergence rate of the numerical method. Finally, numerical examples are given to illustrate our theoretical results.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 3","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140632242","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
The adjoint double layer potential on smooth surfaces in (mathbb {R}^3) and the Neumann problem $$mathbb{R}^3$$中光滑表面上的邻接双层势和诺伊曼问题
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-04-19 DOI: 10.1007/s10444-024-10111-0
J. Thomas Beale, Michael Storm, Svetlana Tlupova
{"title":"The adjoint double layer potential on smooth surfaces in (mathbb {R}^3) and the Neumann problem","authors":"J. Thomas Beale,&nbsp;Michael Storm,&nbsp;Svetlana Tlupova","doi":"10.1007/s10444-024-10111-0","DOIUrl":"10.1007/s10444-024-10111-0","url":null,"abstract":"<div><p>We present a simple yet accurate method to compute the adjoint double layer potential, which is used to solve the Neumann boundary value problem for Laplace’s equation in three dimensions. An expansion in curvilinear coordinates leads us to modify the expression for the adjoint double layer so that the singularity is reduced when evaluating the integral on the surface. Then, to regularize the integral, we multiply the Green’s function by a radial function with length parameter <span>(delta )</span> chosen so that the product is smooth. We show that a natural regularization has error <span>(O(delta ^3))</span>, and a simple modification improves the error to <span>(O(delta ^5))</span>. The integral is evaluated numerically without the need of special coordinates. We use this treatment of the adjoint double layer to solve the classical integral equation for the interior Neumann problem, altered to account for the solvability condition, and evaluate the solution on the boundary. Choosing <span>(delta = ch^{4/5})</span>, we find about <span>(O(h^4))</span> convergence in our examples, where <i>h</i> is the spacing in a background grid.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 3","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10444-024-10111-0.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140620315","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
(mathcal {H}_2) optimal rational approximation on general domains 一般域上的 $$mathcal {H}_2$$ 最佳理性逼近
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-04-18 DOI: 10.1007/s10444-024-10125-8
Alessandro Borghi, Tobias Breiten
{"title":"(mathcal {H}_2) optimal rational approximation on general domains","authors":"Alessandro Borghi,&nbsp;Tobias Breiten","doi":"10.1007/s10444-024-10125-8","DOIUrl":"10.1007/s10444-024-10125-8","url":null,"abstract":"<div><p>Optimal model reduction for large-scale linear dynamical systems is studied. In contrast to most existing works, the systems under consideration are not required to be stable, neither in discrete nor in continuous time. As a consequence, the underlying rational transfer functions are allowed to have poles in general domains in the complex plane. In particular, this covers the case of specific conservative partial differential equations such as the linear Schrödinger and the undamped linear wave equation with spectra on the imaginary axis. By an appropriate modification of the classical continuous time Hardy space <span>(varvec{mathcal {H}}_{varvec{2}})</span>, a new <span>(varvec{mathcal {H}}_{varvec{2}})</span>-like optimal model reduction problem is introduced and first-order optimality conditions are derived. As in the classical <span>(varvec{mathcal {H}}_{varvec{2}})</span> case, these conditions exhibit a rational Hermite interpolation structure for which an iterative model reduction algorithm is proposed. Numerical examples demonstrate the effectiveness of the new method.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 3","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10444-024-10125-8.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140607911","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
Structured barycentric forms for interpolation-based data-driven reduced modeling of second-order systems 基于插值的数据驱动二阶系统还原建模的结构化巴里心形式
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-04-11 DOI: 10.1007/s10444-024-10118-7
Ion Victor Gosea, Serkan Gugercin, Steffen W. R. Werner
{"title":"Structured barycentric forms for interpolation-based data-driven reduced modeling of second-order systems","authors":"Ion Victor Gosea,&nbsp;Serkan Gugercin,&nbsp;Steffen W. R. Werner","doi":"10.1007/s10444-024-10118-7","DOIUrl":"10.1007/s10444-024-10118-7","url":null,"abstract":"<div><p>An essential tool in data-driven modeling of dynamical systems from frequency response measurements is the barycentric form of the underlying rational transfer function. In this work, we propose structured barycentric forms for modeling dynamical systems with second-order time derivatives using their frequency domain input-output data. By imposing a set of interpolation conditions, the systems’ transfer functions are rewritten in different barycentric forms using different parametrizations. Loewner-like algorithms are developed for the explicit computation of second-order systems from data based on the developed barycentric forms. Numerical experiments show the performance of these new structured data-driven modeling methods compared to other interpolation-based data-driven modeling techniques from the literature.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 2","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10444-024-10118-7.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140547669","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
Computing equivariant matrices on homogeneous spaces for geometric deep learning and automorphic Lie algebras 计算同质空间上的等变矩阵,用于几何深度学习和非定态李代数
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-04-11 DOI: 10.1007/s10444-024-10126-7
Vincent Knibbeler
{"title":"Computing equivariant matrices on homogeneous spaces for geometric deep learning and automorphic Lie algebras","authors":"Vincent Knibbeler","doi":"10.1007/s10444-024-10126-7","DOIUrl":"10.1007/s10444-024-10126-7","url":null,"abstract":"<div><p>We develop an elementary method to compute spaces of equivariant maps from a homogeneous space <i>G</i>/<i>H</i> of a Lie group <i>G</i> to a module of this group. The Lie group is not required to be compact. More generally, we study spaces of invariant sections in homogeneous vector bundles, and take a special interest in the case where the fibres are algebras. These latter cases have a natural global algebra structure. We classify these automorphic algebras for the case where the homogeneous space has compact stabilisers. This work has applications in the theoretical development of geometric deep learning and also in the theory of automorphic Lie algebras.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 2","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10444-024-10126-7.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140547642","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
Numerical simulation of resistance furnaces by using distributed and lumped models 利用分布式和集合式模型对电阻炉进行数值模拟
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-04-10 DOI: 10.1007/s10444-024-10120-z
A. Bermúdez, D. Gómez, D. González
{"title":"Numerical simulation of resistance furnaces by using distributed and lumped models","authors":"A. Bermúdez,&nbsp;D. Gómez,&nbsp;D. González","doi":"10.1007/s10444-024-10120-z","DOIUrl":"10.1007/s10444-024-10120-z","url":null,"abstract":"<div><p>This work proposes a methodology that combines distributed and lumped models to simulate the current distribution within an indirect heat resistance furnace and, in particular, to calculate the current to be supplied for achieving a desired power output. The distributed model is a time-harmonic eddy current problem, which is solved numerically using the finite element method. The lumped model relies on calculating a reduced impedance associated with an equivalent circuit model. Numerical simulations and plant measurements demonstrate the effectiveness of this approach. The good correlation between the results indicates that this approximation is well-suited to support the design and improve the efficiency of the furnace in a short time.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 2","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10444-024-10120-z.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140541673","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
Robust space-time finite element methods for parabolic distributed optimal control problems with energy regularization 带能量正则化的抛物分布式最优控制问题的鲁棒时空有限元方法
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-04-10 DOI: 10.1007/s10444-024-10123-w
Ulrich Langer, Olaf Steinbach, Huidong Yang
{"title":"Robust space-time finite element methods for parabolic distributed optimal control problems with energy regularization","authors":"Ulrich Langer,&nbsp;Olaf Steinbach,&nbsp;Huidong Yang","doi":"10.1007/s10444-024-10123-w","DOIUrl":"10.1007/s10444-024-10123-w","url":null,"abstract":"<div><p>As in our previous work (<i>SINUM</i> 59(2):660–674, 2021) we consider space-time tracking optimal control problems for linear parabolic initial boundary value problems that are given in the space-time cylinder <span>(Q = Omega times (0,T))</span>, and that are controlled by the right-hand side <span>(z_varrho )</span> from the Bochner space <span>(L^2(0,T;H^{-1}(Omega )))</span>. So it is natural to replace the usual <span>(L^2(Q))</span> norm regularization by the energy regularization in the <span>(L^2(0,T;H^{-1}(Omega )))</span> norm. We derive new a priori estimates for the error <span>(Vert widetilde{u}_{varrho h} - overline{u}Vert _{L^2(Q)})</span> between the computed state <span>(widetilde{u}_{varrho h})</span> and the desired state <span>(overline{u})</span> in terms of the regularization parameter <span>(varrho )</span> and the space-time finite element mesh size <i>h</i>, and depending on the regularity of the desired state <span>(overline{u})</span>. These new estimates lead to the optimal choice <span>(varrho = h^2)</span>. The approximate state <span>(widetilde{u}_{varrho h})</span> is computed by means of a space-time finite element method using piecewise linear and continuous basis functions on completely unstructured simplicial meshes for <i>Q</i>. The theoretical results are quantitatively illustrated by a series of numerical examples in two and three space dimensions. We also provide performance studies for different solvers.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 2","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10444-024-10123-w.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140541246","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
Robust low tubal rank tensor recovery using discrete empirical interpolation method with optimized slice/feature selection 利用优化切片/特征选择的离散经验插值法进行稳健的低管阶张量恢复
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-04-06 DOI: 10.1007/s10444-024-10117-8
Salman Ahmadi-Asl, Anh-Huy Phan, Cesar F. Caiafa, Andrzej Cichocki
{"title":"Robust low tubal rank tensor recovery using discrete empirical interpolation method with optimized slice/feature selection","authors":"Salman Ahmadi-Asl,&nbsp;Anh-Huy Phan,&nbsp;Cesar F. Caiafa,&nbsp;Andrzej Cichocki","doi":"10.1007/s10444-024-10117-8","DOIUrl":"10.1007/s10444-024-10117-8","url":null,"abstract":"<div><p>In this paper, we extend the Discrete Empirical Interpolation Method (DEIM) to the third-order tensor case based on the t-product and use it to select important/significant lateral and horizontal slices/features. The proposed Tubal DEIM (TDEIM) is investigated both theoretically and numerically. In particular, the details of the error bounds of the proposed TDEIM method are derived. The experimental results show that the TDEIM can provide more accurate approximations than the existing methods. An application of the proposed method to the supervised classification task is also presented.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 2","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140352136","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
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学术文献互助群
群 号:481959085
Book学术官方微信