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

Advances in Computational Mathematics最新文献

筛选
英文 中文
Adaptive choice of near-optimal expansion points for interpolation-based structure-preserving model reduction 自适应选择近优扩展点，实现基于插值的结构保持模型还原
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-07-19 DOI: 10.1007/s10444-024-10166-z
Quirin Aumann, Steffen W. R. Werner
{"title":"Adaptive choice of near-optimal expansion points for interpolation-based structure-preserving model reduction","authors":"Quirin Aumann,&nbsp;Steffen W. R. Werner","doi":"10.1007/s10444-024-10166-z","DOIUrl":"10.1007/s10444-024-10166-z","url":null,"abstract":"<div><p>Interpolation-based methods are well-established and effective approaches for the efficient generation of accurate reduced-order surrogate models. Common challenges for such methods are the automatic selection of good or even optimal interpolation points and the appropriate size of the reduced-order model. An approach that addresses the first problem for linear, unstructured systems is the iterative rational Krylov algorithm (IRKA), which computes optimal interpolation points through iterative updates by solving linear eigenvalue problems. However, in the case of preserving internal system structures, optimal interpolation points are unknown, and heuristics based on nonlinear eigenvalue problems result in numbers of potential interpolation points that typically exceed the reasonable size of reduced-order systems. In our work, we propose a projection-based iterative interpolation method inspired by IRKA for generally structured systems to adaptively compute near-optimal interpolation points as well as an appropriate size for the reduced-order system. Additionally, the iterative updates of the interpolation points can be chosen such that the reduced-order model provides an accurate approximation in specified frequency ranges of interest. For such applications, our new approach outperforms the established methods in terms of accuracy and computational effort. We show this in numerical examples with different structures.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 4","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10444-024-10166-z.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141730632","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
Randomized GCUR decompositions 随机 GCUR 分解
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-07-18 DOI: 10.1007/s10444-024-10168-x
Zhengbang Cao, Yimin Wei, Pengpeng Xie
{"title":"Randomized GCUR decompositions","authors":"Zhengbang Cao,&nbsp;Yimin Wei,&nbsp;Pengpeng Xie","doi":"10.1007/s10444-024-10168-x","DOIUrl":"10.1007/s10444-024-10168-x","url":null,"abstract":"<div><p>By exploiting the random sampling techniques, this paper derives an efficient randomized algorithm for computing a generalized CUR decomposition, which provides low-rank approximations of both matrices simultaneously in terms of some of their rows and columns. For large-scale data sets that are expensive to store and manipulate, a new variant of the discrete empirical interpolation method known as L-DEIM, which needs much lower cost and provides a significant acceleration in practice, is also combined with the random sampling approach to further improve the efficiency of our algorithm. Moreover, adopting the randomized algorithm to implement the truncation process of restricted singular value decomposition (RSVD), combined with the L-DEIM procedure, we propose a fast algorithm for computing an RSVD based CUR decomposition, which provides a coordinated low-rank approximation of the three matrices in a CUR-type format simultaneously and provides advantages over the standard CUR approximation for some applications. We establish detailed probabilistic error analysis for the algorithms and provide numerical results that show the promise of our approaches.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 4","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142412317","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
Macro-micro decomposition for consistent and conservative model order reduction of hyperbolic shallow water moment equations: a study using POD-Galerkin and dynamical low-rank approximation 对双曲浅水矩方程进行一致和保守模型阶次缩减的宏观-微观分解：使用 POD-Galerkin 和动态低阶近似的研究
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-07-16 DOI: 10.1007/s10444-024-10175-y
Julian Koellermeier, Philipp Krah, Jonas Kusch
{"title":"Macro-micro decomposition for consistent and conservative model order reduction of hyperbolic shallow water moment equations: a study using POD-Galerkin and dynamical low-rank approximation","authors":"Julian Koellermeier,&nbsp;Philipp Krah,&nbsp;Jonas Kusch","doi":"10.1007/s10444-024-10175-y","DOIUrl":"10.1007/s10444-024-10175-y","url":null,"abstract":"<div><p>Geophysical flow simulations using hyperbolic shallow water moment equations require an efficient discretization of a potentially large system of PDEs, the so-called moment system. This calls for tailored model order reduction techniques that allow for efficient and accurate simulations while guaranteeing physical properties like mass conservation. In this paper, we develop the first model reduction for the hyperbolic shallow water moment equations and achieve mass conservation. This is accomplished using a macro-micro decomposition of the model into a macroscopic (conservative) part and a microscopic (non-conservative) part with subsequent model reduction using either POD-Galerkin or dynamical low-rank approximation only on the microscopic (non-conservative) part. Numerical experiments showcase the performance of the new model reduction methods including high accuracy and fast computation times together with guaranteed conservation and consistency properties.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 4","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10444-024-10175-y.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141625059","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
Augmented Lagrangian method for tensor low-rank and sparsity models in multi-dimensional image recovery 多维图像复原中张量低阶和稀疏模型的增量拉格朗日法
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-07-16 DOI: 10.1007/s10444-024-10170-3
Hong Zhu, Xiaoxia Liu, Lin Huang, Zhaosong Lu, Jian Lu, Michael K. Ng
{"title":"Augmented Lagrangian method for tensor low-rank and sparsity models in multi-dimensional image recovery","authors":"Hong Zhu,&nbsp;Xiaoxia Liu,&nbsp;Lin Huang,&nbsp;Zhaosong Lu,&nbsp;Jian Lu,&nbsp;Michael K. Ng","doi":"10.1007/s10444-024-10170-3","DOIUrl":"10.1007/s10444-024-10170-3","url":null,"abstract":"<div><p>Multi-dimensional images can be viewed as tensors and have often embedded a low-rankness property that can be evaluated by tensor low-rank measures. In this paper, we first introduce a tensor low-rank and sparsity measure and then propose low-rank and sparsity models for tensor completion, tensor robust principal component analysis, and tensor denoising. The resulting tensor recovery models are further solved by the augmented Lagrangian method with a convergence guarantee. And its augmented Lagrangian subproblem is computed by the proximal alternative method, in which each variable has a closed-form solution. Numerical experiments on several multi-dimensional image recovery applications show the superiority of the proposed methods over the state-of-the-art methods in terms of several quantitative quality indices and visual quality.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 4","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141625052","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 continuation method for fitting a bandlimited curve to points in the plane 将带限曲线拟合到平面上各点的延续方法
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-07-16 DOI: 10.1007/s10444-024-10144-5
Mohan Zhao, Kirill Serkh
{"title":"A continuation method for fitting a bandlimited curve to points in the plane","authors":"Mohan Zhao,&nbsp;Kirill Serkh","doi":"10.1007/s10444-024-10144-5","DOIUrl":"10.1007/s10444-024-10144-5","url":null,"abstract":"<div><p>In this paper, we describe an algorithm for fitting an analytic and bandlimited closed or open curve to interpolate an arbitrary collection of points in <span>(mathbb {R}^{2})</span>. The main idea is to smooth the parametrization of the curve by iteratively filtering the Fourier or Chebyshev coefficients of both the derivative of the arc-length function and the tangential angle of the curve and applying smooth perturbations, after each filtering step, until the curve is represented by a reasonably small number of coefficients. The algorithm produces a curve passing through the set of points to an accuracy of machine precision, after a limited number of iterations. It costs <i>O</i>(<i>N</i> log <i>N</i>) operations at each iteration, provided that the number of discretization nodes is <i>N</i>. The resulting curves are smooth, affine invariant, and visually appealing and do not exhibit any ringing artifacts. The bandwidths of the constructed curves are much smaller than those of curves constructed by previous methods. We demonstrate the performance of our algorithm with several numerical experiments.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 4","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141625051","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
Finding roots of complex analytic functions via generalized colleague matrices 通过广义同事矩阵寻找复解析函数的根
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-07-15 DOI: 10.1007/s10444-024-10174-z
H. Zhang, V. Rokhlin
{"title":"Finding roots of complex analytic functions via generalized colleague matrices","authors":"H. Zhang,&nbsp;V. Rokhlin","doi":"10.1007/s10444-024-10174-z","DOIUrl":"10.1007/s10444-024-10174-z","url":null,"abstract":"<div><p>We present a scheme for finding all roots of an analytic function in a square domain in the complex plane. The scheme can be viewed as a generalization of the classical approach to finding roots of a function on the real line, by first approximating it by a polynomial in the Chebyshev basis, followed by diagonalizing the so-called “colleague matrices.” Our extension of the classical approach is based on several observations that enable the construction of polynomial bases in compact domains that satisfy three-term recurrences and are reasonably well-conditioned. This class of polynomial bases gives rise to “generalized colleague matrices,” whose eigenvalues are roots of functions expressed in these bases. In this paper, we also introduce a special-purpose QR algorithm for finding the eigenvalues of generalized colleague matrices, which is a straightforward extension of the recently introduced structured stable QR algorithm for the classical cases (see Serkh and Rokhlin 2021). The performance of the schemes is illustrated with several numerical examples.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 4","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141618198","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
Numerical analysis of a time discretized method for nonlinear filtering problem with Lévy process observations 非线性滤波问题时间离散化方法的数值分析与莱维过程观测
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-07-15 DOI: 10.1007/s10444-024-10169-w
Fengshan Zhang, Yongkui Zou, Shimin Chai, Yanzhao Cao
{"title":"Numerical analysis of a time discretized method for nonlinear filtering problem with Lévy process observations","authors":"Fengshan Zhang,&nbsp;Yongkui Zou,&nbsp;Shimin Chai,&nbsp;Yanzhao Cao","doi":"10.1007/s10444-024-10169-w","DOIUrl":"10.1007/s10444-024-10169-w","url":null,"abstract":"<div><p>In this paper, we consider a nonlinear filtering model with observations driven by correlated Wiener processes and point processes. We first derive a Zakai equation whose solution is an unnormalized probability density function of the filter solution. Then, we apply a splitting-up technique to decompose the Zakai equation into three stochastic differential equations, based on which we construct a splitting-up approximate solution and prove its half-order convergence. Furthermore, we apply a finite difference method to construct a time semi-discrete approximate solution to the splitting-up system and prove its half-order convergence to the exact solution of the Zakai equation. Finally, we present some numerical experiments to demonstrate the theoretical analysis.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 4","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10444-024-10169-w.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141618199","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
Neural and spectral operator surrogates: unified construction and expression rate bounds 神经和频谱算子代理：统一构建和表达率边界
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-07-15 DOI: 10.1007/s10444-024-10171-2
Lukas Herrmann, Christoph Schwab, Jakob Zech
{"title":"Neural and spectral operator surrogates: unified construction and expression rate bounds","authors":"Lukas Herrmann,&nbsp;Christoph Schwab,&nbsp;Jakob Zech","doi":"10.1007/s10444-024-10171-2","DOIUrl":"10.1007/s10444-024-10171-2","url":null,"abstract":"<div><p>Approximation rates are analyzed for deep surrogates of maps between infinite-dimensional function spaces, arising, e.g., as data-to-solution maps of linear and nonlinear partial differential equations. Specifically, we study approximation rates for <i>deep neural operator</i> and <i>generalized polynomial chaos (gpc) Operator</i> surrogates for nonlinear, holomorphic maps between infinite-dimensional, separable Hilbert spaces. Operator in- and outputs from function spaces are assumed to be parametrized by stable, affine representation systems. Admissible representation systems comprise orthonormal bases, Riesz bases, or suitable tight frames of the spaces under consideration. Algebraic expression rate bounds are established for both, deep neural and spectral operator surrogates acting in scales of separable Hilbert spaces containing domain and range of the map to be expressed, with finite Sobolev or Besov regularity. We illustrate the abstract concepts by expression rate bounds for the coefficient-to-solution map for a linear elliptic PDE on the torus.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 4","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141618202","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
Pairwise ranking with Gaussian kernel 使用高斯核进行配对排序
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-07-10 DOI: 10.1007/s10444-024-10165-0
Guanhang Lei, Lei Shi
{"title":"Pairwise ranking with Gaussian kernel","authors":"Guanhang Lei,&nbsp;Lei Shi","doi":"10.1007/s10444-024-10165-0","DOIUrl":"10.1007/s10444-024-10165-0","url":null,"abstract":"<div><p>Regularized pairwise ranking with Gaussian kernels is one of the cutting-edge learning algorithms. Despite a wide range of applications, a rigorous theoretical demonstration still lacks to support the performance of such ranking estimators. This work aims to fill this gap by developing novel oracle inequalities for regularized pairwise ranking. With the help of these oracle inequalities, we derive fast learning rates of Gaussian ranking estimators under a general box-counting dimension assumption on the input domain combined with the noise conditions or the standard smoothness condition. Our theoretical analysis improves the existing estimates and shows that a low intrinsic dimension of input space can help the rates circumvent the curse of dimensionality.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 4","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141566302","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 sparse spectral method for fractional differential equations in one-spatial dimension 单空间维分数微分方程的稀疏谱方法
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-07-10 DOI: 10.1007/s10444-024-10164-1
Ioannis P. A. Papadopoulos, Sheehan Olver
{"title":"A sparse spectral method for fractional differential equations in one-spatial dimension","authors":"Ioannis P. A. Papadopoulos,&nbsp;Sheehan Olver","doi":"10.1007/s10444-024-10164-1","DOIUrl":"10.1007/s10444-024-10164-1","url":null,"abstract":"<div><p>We develop a sparse spectral method for a class of fractional differential equations, posed on <span>(mathbb {R})</span>, in one dimension. These equations may include sqrt-Laplacian, Hilbert, derivative, and identity terms. The numerical method utilizes a basis consisting of weighted Chebyshev polynomials of the second kind in conjunction with their Hilbert transforms. The former functions are supported on <span>([-1,1])</span> whereas the latter have global support. The global approximation space may contain different affine transformations of the basis, mapping <span>([-1,1])</span> to other intervals. Remarkably, not only are the induced linear systems sparse, but the operator decouples across the different affine transformations. Hence, the solve reduces to solving <i>K</i> independent sparse linear systems of size <span>(mathcal {O}(n)times mathcal {O}(n))</span>, with <span>(mathcal {O}(n))</span> nonzero entries, where <i>K</i> is the number of different intervals and <i>n</i> is the highest polynomial degree contained in the sum space. This results in an <span>(mathcal {O}(n))</span> complexity solve. Applications to fractional heat and wave equations are considered.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 4","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10444-024-10164-1.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141566341","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学术文献互助群
群 号：481959085
Book学术官方微信