发布求助
文献互助 智能选刊 最新文献

Advances in Computational Mathematics最新文献

筛选
英文 中文
A block-randomized stochastic method with importance sampling for CP tensor decomposition 用于 CP 张量分解的带重要性采样的分块随机方法
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-03-25 DOI: 10.1007/s10444-024-10119-6
Yajie Yu, Hanyu Li
{"title":"A block-randomized stochastic method with importance sampling for CP tensor decomposition","authors":"Yajie Yu,&nbsp;Hanyu Li","doi":"10.1007/s10444-024-10119-6","DOIUrl":"10.1007/s10444-024-10119-6","url":null,"abstract":"<div><p>One popular way to compute the CANDECOMP/PARAFAC (CP) decomposition of a tensor is to transform the problem into a sequence of overdetermined least squares subproblems with Khatri-Rao product (KRP) structure involving factor matrices. In this work, based on choosing the factor matrix randomly, we propose a mini-batch stochastic gradient descent method with importance sampling for those special least squares subproblems. Two different sampling strategies are provided. They can avoid forming the full KRP explicitly and computing the corresponding probabilities directly. The adaptive step size version of the method is also given. For the proposed method, we present its theoretical properties and comprehensive numerical performance. The results on synthetic and real data show that our method is effective and efficient, and for unevenly distributed data, it performs better than the corresponding one in the literature.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 2","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140209678","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
Correction: A Grassmann manifold handbook: basic geometry and computational aspects 更正：格拉斯曼流形手册：基本几何与计算方面
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-03-22 DOI: 10.1007/s10444-024-10115-w
Thomas Bendokat, Ralf Zimmermann, P.-A. Absil
{"title":"Correction: A Grassmann manifold handbook: basic geometry and computational aspects","authors":"Thomas Bendokat,&nbsp;Ralf Zimmermann,&nbsp;P.-A. Absil","doi":"10.1007/s10444-024-10115-w","DOIUrl":"10.1007/s10444-024-10115-w","url":null,"abstract":"","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 2","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10444-024-10115-w.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140214636","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 analysis for optimal quadratic spline collocation method in two space dimensions with application to nonlinear time-fractional diffusion equation 应用于非线性时间分数扩散方程的二维空间最佳二次样条配位法数值分析
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-03-22 DOI: 10.1007/s10444-024-10116-9
Xiao Ye, Xiangcheng Zheng, Jun Liu, Yue Liu
{"title":"Numerical analysis for optimal quadratic spline collocation method in two space dimensions with application to nonlinear time-fractional diffusion equation","authors":"Xiao Ye,&nbsp;Xiangcheng Zheng,&nbsp;Jun Liu,&nbsp;Yue Liu","doi":"10.1007/s10444-024-10116-9","DOIUrl":"10.1007/s10444-024-10116-9","url":null,"abstract":"<div><p>Optimal quadratic spline collocation (QSC) method has been widely used in various problems due to its high-order accuracy, while the corresponding numerical analysis is rarely investigated since, e.g., the perturbation terms result in the asymmetry of optimal QSC discretization. We present numerical analysis for the optimal QSC method in two space dimensions via discretizing a nonlinear time-fractional diffusion equation for demonstration. The <i>L</i>2-1<span>(_sigma )</span> formula on the graded mesh is used to account for the initial solution singularity, leading to an optimal QSC–<i>L</i>2-1<span>(_{sigma })</span> scheme where the nonlinear term is treated by the extrapolation. We provide the existence and uniqueness of the numerical solution, as well as the second-order temporal accuracy and fourth-order spatial accuracy with proper grading parameters. Furthermore, we consider the fast implementation based on the sum-of-exponentials technique to reduce the computational cost. Numerical experiments are performed to verify the theoretical analysis and the effectiveness of the proposed scheme.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 2","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140188703","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 probabilistic reduced basis method for parameter-dependent problems 参数相关问题的概率还原法
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-03-13 DOI: 10.1007/s10444-024-10114-x
Marie Billaud-Friess, Arthur Macherey, Anthony Nouy, Clémentine Prieur
{"title":"A probabilistic reduced basis method for parameter-dependent problems","authors":"Marie Billaud-Friess,&nbsp;Arthur Macherey,&nbsp;Anthony Nouy,&nbsp;Clémentine Prieur","doi":"10.1007/s10444-024-10114-x","DOIUrl":"10.1007/s10444-024-10114-x","url":null,"abstract":"<div><p>Probabilistic variants of model order reduction (MOR) methods have recently emerged for improving stability and computational performance of classical approaches. In this paper, we propose a probabilistic reduced basis method (RBM) for the approximation of a family of parameter-dependent functions. It relies on a probabilistic greedy algorithm with an error indicator that can be written as an expectation of some parameter-dependent random variable. Practical algorithms relying on Monte Carlo estimates of this error indicator are discussed. In particular, when using probably approximately correct (PAC) bandit algorithm, the resulting procedure is proven to be a weak-greedy algorithm with high probability. Intended applications concern the approximation of a parameter-dependent family of functions for which we only have access to (noisy) pointwise evaluations. As a particular application, we consider the approximation of solution manifolds of linear parameter-dependent partial differential equations with a probabilistic interpretation through the Feynman-Kac formula.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 2","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140123898","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
Structured interpolation for multivariate transfer functions of quadratic-bilinear systems 二次线性系统多元传递函数的结构插值
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-03-12 DOI: 10.1007/s10444-024-10109-8
Peter Benner, Serkan Gugercin, Steffen W. R. Werner
{"title":"Structured interpolation for multivariate transfer functions of quadratic-bilinear systems","authors":"Peter Benner,&nbsp;Serkan Gugercin,&nbsp;Steffen W. R. Werner","doi":"10.1007/s10444-024-10109-8","DOIUrl":"10.1007/s10444-024-10109-8","url":null,"abstract":"<div><p>High-dimensional/high-fidelity nonlinear dynamical systems appear naturally when the goal is to accurately model real-world phenomena. Many physical properties are thereby encoded in the internal differential structure of these resulting large-scale nonlinear systems. The high dimensionality of the dynamics causes computational bottlenecks, especially when these large-scale systems need to be simulated for a variety of situations such as different forcing terms. This motivates model reduction where the goal is to replace the full-order dynamics with accurate reduced-order surrogates. Interpolation-based model reduction has been proven to be an effective tool for the construction of cheap-to-evaluate surrogate models that preserve the internal structure in the case of weak nonlinearities. In this paper, we consider the construction of multivariate interpolants in frequency domain for structured quadratic-bilinear systems. We propose definitions for structured variants of the symmetric subsystem and generalized transfer functions of quadratic-bilinear systems and provide conditions for structure-preserving interpolation by projection. The theoretical results are illustrated using two numerical examples including the simulation of molecular dynamics in crystal structures.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 2","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10444-024-10109-8.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140123990","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
New low-order mixed finite element methods for linear elasticity 线性弹性的新低阶混合有限元方法
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-03-06 DOI: 10.1007/s10444-024-10112-z
Xuehai Huang, Chao Zhang, Yaqian Zhou, Yangxing Zhu
{"title":"New low-order mixed finite element methods for linear elasticity","authors":"Xuehai Huang,&nbsp;Chao Zhang,&nbsp;Yaqian Zhou,&nbsp;Yangxing Zhu","doi":"10.1007/s10444-024-10112-z","DOIUrl":"10.1007/s10444-024-10112-z","url":null,"abstract":"<div><p>New low-order <span>({H}({{text {div}}}))</span>-conforming finite elements for symmetric tensors are constructed in arbitrary dimension. The space of shape functions is defined by enriching the symmetric quadratic polynomial space with the <span>({(d+1)})</span>-order normal-normal face bubble space. The reduced counterpart has only <span>({d(d+1)}^{{2}})</span> degrees of freedom. Basis functions are explicitly given in terms of barycentric coordinates. Low-order conforming finite element elasticity complexes starting from the Bell element, are developed in two dimensions. These finite elements for symmetric tensors are applied to devise robust mixed finite element methods for the linear elasticity problem, which possess the uniform error estimates with respect to the Lamé coefficient <span>({lambda })</span>, and superconvergence for the displacement. Numerical results are provided to verify the theoretical convergence rates.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 2","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140043445","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
Conditioning and spectral properties of isogeometric collocation matrices for acoustic wave problems 声波问题等几何配位矩阵的条件和频谱特性
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-03-04 DOI: 10.1007/s10444-024-10113-y
Elena Zampieri, Luca F. Pavarino
{"title":"Conditioning and spectral properties of isogeometric collocation matrices for acoustic wave problems","authors":"Elena Zampieri,&nbsp;Luca F. Pavarino","doi":"10.1007/s10444-024-10113-y","DOIUrl":"10.1007/s10444-024-10113-y","url":null,"abstract":"<div><p>The conditioning and spectral properties of the mass and stiffness matrices for acoustic wave problems are here investigated when isogeometric analysis (IGA) collocation methods in space and Newmark methods in time are employed. Theoretical estimates and extensive numerical results are reported for the eigenvalues and condition numbers of the acoustic mass and stiffness matrices in the reference square domain with Dirichlet, Neumann, and absorbing boundary conditions. This study focuses in particular on the spectral dependence on the polynomial degree <i>p</i>, mesh size <i>h</i>, regularity <i>k</i>, of the IGA discretization and on the time step size <span>(Delta t)</span> and parameter <span>(beta )</span> of the Newmark method. Results on the sparsity of the matrices and the eigenvalue distribution with respect to the number of degrees of freedom <span> d.o.f.</span> and the number of nonzero entries <span>nz</span> are also reported. The results show that the spectral properties of the IGA collocation matrices are comparable with the available spectral estimates for IGA Galerkin matrices associated with the Poisson problem with Dirichlet boundary conditions, and in some cases, the IGA collocation results are better than the corresponding IGA Galerkin estimates, in particular for increasing <i>p</i> and maximal regularity <span>(k=p-1)</span>.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 2","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10444-024-10113-y.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140026260","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 space–time DG method for the Schrödinger equation with variable potential 具有可变势能的薛定谔方程的时空 DG 方法
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-03-01 DOI: 10.1007/s10444-024-10108-9
Sergio Gómez, Andrea Moiola
{"title":"A space–time DG method for the Schrödinger equation with variable potential","authors":"Sergio Gómez,&nbsp;Andrea Moiola","doi":"10.1007/s10444-024-10108-9","DOIUrl":"10.1007/s10444-024-10108-9","url":null,"abstract":"<div><p>We present a space–time ultra-weak discontinuous Galerkin discretization of the linear Schrödinger equation with variable potential. The proposed method is well-posed and quasi-optimal in mesh-dependent norms for very general discrete spaces. Optimal <i>h</i>-convergence error estimates are derived for the method when test and trial spaces are chosen either as piecewise polynomials or as a novel quasi-Trefftz polynomial space. The latter allows for a substantial reduction of the number of degrees of freedom and admits piecewise-smooth potentials. Several numerical experiments validate the accuracy and advantages of the proposed method.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 2","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10444-024-10108-9.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140001071","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
Limitations of neural network training due to numerical instability of backpropagation 反向传播的数值不稳定性导致神经网络训练的局限性
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-02-11 DOI: 10.1007/s10444-024-10106-x
Clemens Karner, Vladimir Kazeev, Philipp Christian Petersen
{"title":"Limitations of neural network training due to numerical instability of backpropagation","authors":"Clemens Karner,&nbsp;Vladimir Kazeev,&nbsp;Philipp Christian Petersen","doi":"10.1007/s10444-024-10106-x","DOIUrl":"10.1007/s10444-024-10106-x","url":null,"abstract":"<div><p>We study the training of deep neural networks by gradient descent where floating-point arithmetic is used to compute the gradients. In this framework and under realistic assumptions, we demonstrate that it is <i>highly unlikely</i> to find ReLU neural networks that maintain, in the course of training with gradient descent, <i>superlinearly</i> many affine pieces with respect to their number of layers. In virtually all approximation theoretical arguments which yield high order polynomial rates of approximation, sequences of ReLU neural networks with <i>exponentially</i> many affine pieces compared to their numbers of layers are used. As a consequence, we conclude that approximating sequences of ReLU neural networks resulting from gradient descent in practice differ substantially from theoretically constructed sequences. The assumptions and the theoretical results are compared to a numerical study, which yields concurring results.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10444-024-10106-x.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139720270","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
Analysis of a (varvec{P}_1oplus varvec{RT}_0) finite element method for linear elasticity with Dirichlet and mixed boundary conditions 带 Dirichlet 和混合边界条件的线性弹性的 $$varvec{P}_1oplus varvec{RT}_0$ 有限元方法分析
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-02-05 DOI: 10.1007/s10444-024-10107-w
Hongpeng Li, Xu Li, Hongxing Rui
{"title":"Analysis of a (varvec{P}_1oplus varvec{RT}_0) finite element method for linear elasticity with Dirichlet and mixed boundary conditions","authors":"Hongpeng Li,&nbsp;Xu Li,&nbsp;Hongxing Rui","doi":"10.1007/s10444-024-10107-w","DOIUrl":"10.1007/s10444-024-10107-w","url":null,"abstract":"<div><p>In this paper, we investigate a low-order robust numerical method for the linear elasticity problem. The method is based on a Bernardi–Raugel-like <span>(varvec{H}(textrm{div}))</span>-conforming method proposed first for the Stokes flows in [Li and Rui, IMA J. Numer. Anal. <b>42</b> (2022) 3711–3734]. Therein, the lowest-order <span>(varvec{H}(textrm{div}))</span>-conforming Raviart–Thomas space (<span>(varvec{RT}_0)</span>) was added to the classical conforming <span>(varvec{P}_1times P_0)</span> pair to meet the inf-sup condition, while preserving the divergence constraint and some important features of conforming methods. Due to the inf-sup stability of the <span>(varvec{P}_1oplus varvec{RT}_0times P_0)</span> pair, a locking-free elasticity discretization with respect to the Lamé constant <span>(lambda )</span> can be naturally obtained. Moreover, our scheme is gradient-robust for the pure and homogeneous displacement boundary problem, that is, the discrete <span>(varvec{H}^1)</span>-norm of the displacement is <span>(mathcal {O}(lambda ^{-1}))</span> when the external body force is a gradient field. We also consider the mixed displacement and stress boundary problem, whose <span>(varvec{P}_1oplus varvec{RT}_0)</span> discretization should be carefully designed due to a consistency error arising from the <span>(varvec{RT}_0)</span> part. We propose both symmetric and nonsymmetric schemes to approximate the mixed boundary case. The optimal error estimates are derived for the energy norm and/or <span>(varvec{L}^2)</span>-norm. Numerical experiments demonstrate the accuracy and robustness of our schemes.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139695830","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学术官方微信