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

Advances in Computational Mathematics最新文献

筛选
英文 中文
Computing eigenvalues of quasi-rational Said–Ball–Vandermonde matrices 计算准有理 Said-Ball-Vandermonde 矩阵的特征值
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-08-22 DOI: 10.1007/s10444-024-10191-y
Xiaoxiao Ma, Yingqing Xiao
{"title":"Computing eigenvalues of quasi-rational Said–Ball–Vandermonde matrices","authors":"Xiaoxiao Ma,&nbsp;Yingqing Xiao","doi":"10.1007/s10444-024-10191-y","DOIUrl":"10.1007/s10444-024-10191-y","url":null,"abstract":"<div><p>This paper focuses on computing the eigenvalues of the generalized collocation matrix of the rational Said–Ball basis, also called as the quasi-rational Said–Ball–Vandermonde (q-RSBV) matrix, with high relative accuracy. To achieve this, we propose explicit expressions for the minors of the q-RSBV matrix and develop a high-precision algorithm to compute these parameters. Additionally, we present perturbation theory and error analysis to further analyze the accuracy of our approach. Finally, we provide some numerical examples to demonstrate the high relative accuracy of our algorithms.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 5","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142022188","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
Morley type virtual element method for von Kármán equations 用于 von Kármán 方程的莫雷型虚拟元素法
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-08-22 DOI: 10.1007/s10444-024-10158-z
Devika Shylaja, Sarvesh Kumar
{"title":"Morley type virtual element method for von Kármán equations","authors":"Devika Shylaja,&nbsp;Sarvesh Kumar","doi":"10.1007/s10444-024-10158-z","DOIUrl":"10.1007/s10444-024-10158-z","url":null,"abstract":"<div><p>This paper analyses the nonconforming Morley type virtual element method to approximate a regular solution to the von Kármán equations  that describes bending of very thin elastic plates. Local existence and uniqueness of a discrete solution to the non-linear problem is discussed. A priori error estimate in the energy norm is established under minimal regularity assumptions on the exact solution. Error estimates in piecewise <span>(H^1)</span> and <span>(L^2)</span> norms are also derived. A working procedure to find an approximation for the discrete solution using Newton’s method is discussed. Numerical results that justify theoretical estimates are presented.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 5","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142022185","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
Arbitrary order spline representation of cohomology generators for isogeometric analysis of eddy current problems 用于涡流问题等距分析的同调发生器的任意阶样条表示法
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-08-19 DOI: 10.1007/s10444-024-10181-0
Bernard Kapidani, Melina Merkel, Sebastian Schöps, Rafael Vázquez
{"title":"Arbitrary order spline representation of cohomology generators for isogeometric analysis of eddy current problems","authors":"Bernard Kapidani,&nbsp;Melina Merkel,&nbsp;Sebastian Schöps,&nbsp;Rafael Vázquez","doi":"10.1007/s10444-024-10181-0","DOIUrl":"10.1007/s10444-024-10181-0","url":null,"abstract":"<div><p>Common formulations of the eddy current problem involve either vector or scalar potentials, each with its own advantages and disadvantages. An impasse arises when using scalar potential-based formulations in the presence of conductors with non-trivial topology. A remedy is to augment the approximation spaces with generators of the first cohomology group. Most existing algorithms for this require a special, e.g., hierarchical, finite element basis construction. Using insights from de Rham complex approximation with splines, we show that additional conditions are here unnecessary. Spanning tree techniques can be adapted to operate on a hexahedral mesh resulting from isomorphisms between spline spaces of differential forms and de Rham complexes on an auxiliary control mesh.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 5","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10444-024-10181-0.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142002702","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
Convergence analysis of the Dirichlet-Neumann Waveform Relaxation algorithm for time fractional sub-diffusion and diffusion-wave equations in heterogeneous media 异质介质中时间分数次扩散和扩散波方程的迪里夏-诺伊曼波形松弛算法收敛性分析
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-08-14 DOI: 10.1007/s10444-024-10185-w
Soura Sana, Bankim C Mandal
{"title":"Convergence analysis of the Dirichlet-Neumann Waveform Relaxation algorithm for time fractional sub-diffusion and diffusion-wave equations in heterogeneous media","authors":"Soura Sana,&nbsp;Bankim C Mandal","doi":"10.1007/s10444-024-10185-w","DOIUrl":"10.1007/s10444-024-10185-w","url":null,"abstract":"<div><p>This article presents a comprehensive study on the convergence behavior of the Dirichlet-Neumann Waveform Relaxation algorithm applied to solve the time fractional sub-diffusion and diffusion-wave equations in multiple subdomains, considering the presence of some heterogeneous media. Our analysis focuses on estimating the convergence rate of the algorithm and investigates how this estimate varies with different fractional orders. Furthermore, we extend our analysis to encompass the 2D sub-diffusion case. To validate our findings, we conduct numerical experiments to verify the estimated convergence rate. The results confirm the theoretical estimates and provide empirical evidence for the algorithm’s efficiency and reliability. Moreover, we push the boundaries of the algorithm’s applicability by extending it to solve the time fractional Allen-Chan equation, a problem that exceeds our initial theoretical estimates. Remarkably, we observe that the algorithm performs exceptionally well in this extended scenario for both short and long-time windows.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 4","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141980904","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
Frame-normalizable sequences 帧正则序列
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-08-09 DOI: 10.1007/s10444-024-10182-z
Pu-Ting Yu
{"title":"Frame-normalizable sequences","authors":"Pu-Ting Yu","doi":"10.1007/s10444-024-10182-z","DOIUrl":"10.1007/s10444-024-10182-z","url":null,"abstract":"<div><p>Let <i>H</i> be a separable Hilbert space and let <span>({x_{n}})</span> be a sequence in <i>H</i> that does not contain any zero elements. We say that <span>({x_{n}})</span> is a <i>Bessel-normalizable</i> or <i>frame-normalizable</i> sequence if the normalized sequence <span>({bigl {frac{x_n}{Vert x_nVert }bigr }})</span> is a Bessel sequence or a frame for <i>H</i>, respectively. In this paper, several necessary and sufficient conditions for sequences to be frame-normalizable and not frame-normalizable are proved. Perturbation theorems for frame-normalizable sequences are also proved. As applications, we show that the Balazs–Stoeva conjecture holds for Bessel-normalizable sequences. Finally, we apply our results to partially answer the open question raised by Aldroubi et al. as to whether the iterative system <span>(bigl {frac{A^{n} x}{Vert A^{n}xVert }bigr }_{nge 0,, xin S})</span> associated with a normal operator <span>(A:Hrightarrow H)</span> and a countable subset <i>S</i> of <i>H</i>, is a frame for <i>H</i>. In particular, if <i>S</i> is finite, then we are able to show that <span>(bigl {frac{A^{n} x}{Vert A^{n}xVert }bigr }_{nge 0,, xin S})</span> is not a frame for <i>H</i> whenever <span>({A^{n}x}_{nge 0,,xin S})</span> is a frame for <i>H</i>.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 4","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141908893","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
SlabLU: a two-level sparse direct solver for elliptic PDEs SlabLU：椭圆 PDE 的两级稀疏直接求解器
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-08-09 DOI: 10.1007/s10444-024-10176-x
Anna Yesypenko, Per-Gunnar Martinsson
{"title":"SlabLU: a two-level sparse direct solver for elliptic PDEs","authors":"Anna Yesypenko,&nbsp;Per-Gunnar Martinsson","doi":"10.1007/s10444-024-10176-x","DOIUrl":"10.1007/s10444-024-10176-x","url":null,"abstract":"<div><p>The paper describes a sparse direct solver for the linear systems that arise from the discretization of an elliptic PDE on a two-dimensional domain. The scheme decomposes the domain into thin subdomains, or “slabs” and uses a two-level approach that is designed with parallelization in mind. The scheme takes advantage of <span>(varvec{mathcal {H}}^textbf{2})</span>-matrix structure emerging during factorization and utilizes randomized algorithms to efficiently recover this structure. As opposed to multi-level nested dissection schemes that incorporate the use of <span>(varvec{mathcal {H}})</span> or <span>(varvec{mathcal {H}}^textbf{2})</span> matrices for a hierarchy of front sizes, SlabLU is a two-level scheme which only uses <span>(varvec{mathcal {H}}^textbf{2})</span>-matrix algebra for fronts of roughly the same size. The simplicity allows the scheme to be easily tuned for performance on modern architectures and GPUs. The solver described is compatible with a range of different local discretizations, and numerical experiments demonstrate its performance for regular discretizations of rectangular and curved geometries. The technique becomes particularly efficient when combined with very high-order accurate multidomain spectral collocation schemes. With this discretization, a Helmholtz problem on a domain of size <span>(textbf{1000} varvec{lambda } times textbf{1000} varvec{lambda })</span> (for which <span>(varvec{N}~mathbf {=100} textbf{M})</span>) is solved in 15 min to 6 correct digits on a high-powered desktop with GPU acceleration.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 4","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141909211","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
Balanced truncation for quadratic-bilinear control systems 二次线性控制系统的平衡截断
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-08-08 DOI: 10.1007/s10444-024-10186-9
Peter Benner, Pawan Goyal
{"title":"Balanced truncation for quadratic-bilinear control systems","authors":"Peter Benner,&nbsp;Pawan Goyal","doi":"10.1007/s10444-024-10186-9","DOIUrl":"10.1007/s10444-024-10186-9","url":null,"abstract":"<div><p>We discuss model order reduction (MOR) for large-scale quadratic-bilinear (QB) systems based on balanced truncation. The method for linear systems mainly involves the computation of the Gramians of the system, namely reachability and observability Gramians. These Gramians are extended to a general nonlinear setting in Scherpen (Systems Control Lett. <b>21</b>, 143-153 1993). These formulations of Gramians are not only challenging to compute for large-scale systems but hard to utilize also in the MOR framework. This work proposes algebraic Gramians for QB systems based on the underlying Volterra series representation of QB systems and their Hilbert adjoint systems. We then show their relation to a certain type of generalized quadratic Lyapunov equation. Furthermore, we quantify the reachability and observability subspaces based on the proposed Gramians. Consequently, we propose a balancing algorithm, allowing us to find those states that are simultaneously hard to reach and hard to observe. Truncating such states yields reduced-order systems. We also study sufficient conditions for the existence of Gramians, and a local stability of reduced-order models obtained using the proposed balanced truncation scheme. Finally, we demonstrate the proposed balancing-type MOR for QB systems using various numerical examples.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 4","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10444-024-10186-9.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141904535","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 WSGD scheme for backward fractional Feynman-Kac equation with nonsmooth data 非光滑数据的后向分数费曼-卡克方程的 WSGD 方案分析
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-08-08 DOI: 10.1007/s10444-024-10188-7
Liyao Hao, Wenyi Tian
{"title":"Analysis of a WSGD scheme for backward fractional Feynman-Kac equation with nonsmooth data","authors":"Liyao Hao,&nbsp;Wenyi Tian","doi":"10.1007/s10444-024-10188-7","DOIUrl":"10.1007/s10444-024-10188-7","url":null,"abstract":"<div><p>In this paper, we propose and analyze a second-order time-stepping numerical scheme for the inhomogeneous backward fractional Feynman-Kac equation with nonsmooth initial data. The complex parameters and time-space coupled Riemann-Liouville fractional substantial integral and derivative in the equation bring challenges on numerical analysis and computations. The nonlocal operators are approximated by using the weighted and shifted Grünwald difference (WSGD) formula. Then, a second-order WSGD scheme is obtained after making some initial corrections. Moreover, the error estimates of the proposed time-stepping scheme are rigorously established without the regularity requirement on the exact solution. Finally, some numerical experiments are performed to validate the efficiency and accuracy of the proposed numerical scheme.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 4","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141904533","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
Weights for moments’ geometrical localization: a canonical isomorphism 力矩几何定位的权重：典型同构
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-08-06 DOI: 10.1007/s10444-024-10183-y
Ana Alonso Rodríguez, Jessika Camaño, Eduardo De Los Santos, Francesca Rapetti
{"title":"Weights for moments’ geometrical localization: a canonical isomorphism","authors":"Ana Alonso Rodríguez,&nbsp;Jessika Camaño,&nbsp;Eduardo De Los Santos,&nbsp;Francesca Rapetti","doi":"10.1007/s10444-024-10183-y","DOIUrl":"10.1007/s10444-024-10183-y","url":null,"abstract":"<div><p>This paper deals with high order Whitney forms. We define a canonical isomorphism between two sets of degrees of freedom. This allows to geometrically localize the classical degrees of freedom, the moments, over the elements of a simplicial mesh. With such a localization, it is thus possible to associate, even with moments, a graph structure relating a field with its potential.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 4","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10444-024-10183-y.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141895604","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
Online identification and control of PDEs via reinforcement learning methods 通过强化学习方法对 PDE 进行在线识别和控制
IF 1.7 3区 数学
Advances in Computational Mathematics Pub Date : 2024-08-01 DOI: 10.1007/s10444-024-10167-y
Alessandro Alla, Agnese Pacifico, Michele Palladino, Andrea Pesare
{"title":"Online identification and control of PDEs via reinforcement learning methods","authors":"Alessandro Alla,&nbsp;Agnese Pacifico,&nbsp;Michele Palladino,&nbsp;Andrea Pesare","doi":"10.1007/s10444-024-10167-y","DOIUrl":"10.1007/s10444-024-10167-y","url":null,"abstract":"<div><p>We focus on the control of unknown partial differential equations (PDEs). The system dynamics is unknown, but we assume we are able to observe its evolution for a given control input, as typical in a reinforcement learning framework. We propose an algorithm based on the idea to control and identify on the fly the unknown system configuration. In this work, the control is based on the state-dependent Riccati approach, whereas the identification of the model on Bayesian linear regression. At each iteration, based on the observed data, we obtain an estimate of the <i>a-priori</i> unknown parameter configuration of the PDE and then we compute the control of the correspondent model. We show by numerical evidence the convergence of the method for infinite horizon control problems.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 4","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141862339","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学术文献互助群
群 号：604180095
Book学术官方微信