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

Advances in Computational Mathematics最新文献

筛选
英文 中文
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
Topological phase estimation method for reparameterized periodic functions 重新参数化周期函数的拓扑相位估算方法
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-07-08 DOI: 10.1007/s10444-024-10157-0
Thomas Bonis, Frédéric Chazal, Bertrand Michel, Wojciech Reise
{"title":"Topological phase estimation method for reparameterized periodic functions","authors":"Thomas Bonis,&nbsp;Frédéric Chazal,&nbsp;Bertrand Michel,&nbsp;Wojciech Reise","doi":"10.1007/s10444-024-10157-0","DOIUrl":"10.1007/s10444-024-10157-0","url":null,"abstract":"<div><p>We consider a signal composed of several periods of a periodic function, of which we observe a noisy reparametrization. The phase estimation problem consists of finding that reparametrization and, in particular, the number of observed periods. Existing methods are well suited to the setting where the periodic function is known or, at least, simple. We consider the case when it is unknown, and we propose an estimation method based on the shape of the signal. We use the persistent homology of sublevel sets of the signal to capture the temporal structure of its local extrema. We infer the number of periods in the signal by counting points in the persistence diagram and their multiplicities. Using the estimated number of periods, we construct an estimator of the reparametrization. It is based on counting the number of sufficiently prominent local minima in the signal. This work is motivated by a vehicle positioning problem, on which we evaluated the proposed method.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 4","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10444-024-10157-0.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141556904","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
An adaptive finite element DtN method for the acoustic-elastic interaction problem 声弹相互作用问题的自适应有限元 DtN 方法
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-07-08 DOI: 10.1007/s10444-024-10160-5
Lei Lin, Junliang Lv, Shuxin Li
{"title":"An adaptive finite element DtN method for the acoustic-elastic interaction problem","authors":"Lei Lin,&nbsp;Junliang Lv,&nbsp;Shuxin Li","doi":"10.1007/s10444-024-10160-5","DOIUrl":"10.1007/s10444-024-10160-5","url":null,"abstract":"<div><p>Consider the scattering of a time-harmonic acoustic incident wave by a bounded, penetrable and isotropic elastic solid, which is immersed in a homogeneous compressible air/fluid. By the Dirichlet-to-Neumann (DtN) operator, an exact transparent boundary condition is introduced and the model is formulated as a boundary value problem of acoustic-elastic interaction. Based on a duality argument technique, an a posteriori error estimate is derived for the finite element method with the truncated DtN boundary operator. The a posteriori error estimate consists of the finite element approximation error and the truncation error of the DtN boundary operator, where the latter decays exponentially with respect to the truncation parameter. An adaptive finite element algorithm is proposed for solving the acoustic-elastic interaction problem, where the truncation parameter is determined through the truncation error and the mesh elements for local refinements are chosen through the finite element discretization error. Numerical experiments are presented to demonstrate the effectiveness of the proposed method.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 4","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141556905","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
Estimates for coefficients in Jacobi series for functions with limited regularity by fractional calculus 用分数微积分估算有限正则函数的雅可比数列系数
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-07-08 DOI: 10.1007/s10444-024-10159-y
Guidong Liu, Wenjie Liu, Beiping Duan
{"title":"Estimates for coefficients in Jacobi series for functions with limited regularity by fractional calculus","authors":"Guidong Liu,&nbsp;Wenjie Liu,&nbsp;Beiping Duan","doi":"10.1007/s10444-024-10159-y","DOIUrl":"10.1007/s10444-024-10159-y","url":null,"abstract":"<div><p>In this paper, optimal estimates on the decaying rates of Jacobi expansion coefficients are obtained by fractional calculus for functions with algebraic and logarithmic singularities. This is inspired by the fact that integer-order derivatives fail to deal with singularity of fractional-type, while fractional calculus can. To this end, we first introduce new fractional Sobolev spaces defined as the range of the <span>(L^p)</span>-space under the Riemann-Liouville fractional integral. The connection between these new spaces and classical fractional-order Sobolev spaces is then elucidated. Under this framework, the optimal decaying rate of Jacobi expansion coefficients is obtained, based on which the projection errors under different norms are given. This work is expected to introduce fractional calculus into traditional fields in approximation theory and to explore the possibility in solving classical problems by this ‘new’ tool.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 4","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141556906","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
An adaptive time-stepping Fourier pseudo-spectral method for the Zakharov-Rubenchik equation 扎哈罗夫-鲁本奇克方程的自适应时间步进傅立叶伪谱方法
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-07-03 DOI: 10.1007/s10444-024-10155-2
Bingquan Ji, Xuanxuan Zhou
{"title":"An adaptive time-stepping Fourier pseudo-spectral method for the Zakharov-Rubenchik equation","authors":"Bingquan Ji,&nbsp;Xuanxuan Zhou","doi":"10.1007/s10444-024-10155-2","DOIUrl":"10.1007/s10444-024-10155-2","url":null,"abstract":"<div><p>An adaptive time-stepping scheme is developed for the Zakharov-Rubenchik system to resolve the multiple time scales accurately and to improve the computational efficiency during long-time simulations. The Crank-Nicolson formula and the Fourier pseudo-spectral method are respectively utilized for the temporal and spatial approximations. The proposed numerical method is proved to preserve the mass and energy conservative laws in the discrete levels exactly so that the magnetic field, the density of mass, and the fluid speed are stable on a general class of nonuniform time meshes. With the aid of the priori estimates derived from the discrete invariance and the newly proved discrete Gronwall inequality on variable time grids, sharp convergence analysis of the fully discrete scheme is established rigorously. Error estimate shows that the suggested adaptive time-stepping method can attain the second-order accuracy in time and the spectral accuracy in space. Extensive numerical experiments coupled with an adaptive time-stepping algorithm are presented to show the effectiveness of our numerical method in capturing the multiple time scale evolution for various velocity cases during the interactions of solitons.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 4","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10444-024-10155-2.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141495975","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学术官方微信