arXiv: Numerical Analysis最新文献

筛选
英文 中文
A Numerical Approach for Solving of Fractional Emden-Fowler Type Equations 求解分数阶Emden-Fowler型方程的数值方法
arXiv: Numerical Analysis Pub Date : 2019-01-08 DOI: 10.1063/1.5043786
J. Rebenda, Zdenvek vSmarda
{"title":"A Numerical Approach for Solving of Fractional Emden-Fowler Type Equations","authors":"J. Rebenda, Zdenvek vSmarda","doi":"10.1063/1.5043786","DOIUrl":"https://doi.org/10.1063/1.5043786","url":null,"abstract":"In the paper, we utilize the fractional differential transformation (FDT) to solving singular initial value problem of fractional Emden-Fowler type differential equations. The solutions of our model equations are calculated in the form of convergent series with fast computable components. The numerical results show that the approach is correct, accurate and easy to implement when applied to fractional differential equations.","PeriodicalId":283112,"journal":{"name":"arXiv: Numerical Analysis","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127191870","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Simple and robust equilibrated flux a posteriori estimates for singularly perturbed reaction–diffusion problems 奇摄动反应扩散问题的简单鲁棒平衡通量后验估计
arXiv: Numerical Analysis Pub Date : 2018-12-17 DOI: 10.1051/m2an/2020034
Iain Smears, Martin Vohral'ik
{"title":"Simple and robust equilibrated flux a posteriori estimates for singularly perturbed reaction–diffusion problems","authors":"Iain Smears, Martin Vohral'ik","doi":"10.1051/m2an/2020034","DOIUrl":"https://doi.org/10.1051/m2an/2020034","url":null,"abstract":"We consider energy norm a posteriori error analysis of conforming finite element approximations of singularly perturbed reaction-diffusion problems on simplicial meshes in arbitrary space dimension. Using an equilibrated flux reconstruction, the proposed estimator gives a guaranteed global upper bound on the error without unknown constants, and local efficiency robust with respect to the mesh size and singular perturbation parameters. Whereas previous works on equilibrated flux estimators only considered lowest-order finite element approximations and achieved robustness through the use of boundary-layer adapted submeshes or via combination with residual-based estimators, the present methodology applies in a simple way to arbitrary-order approximations and does not request any submesh or estimators combination. The equilibrated flux is obtained via local reaction-diffusion problems with suitable weights (cut-off factors), and the guaranteed upper bound features the same weights. We prove that the inclusion of these weights is not only sufficient but also necessary for robustness of any flux equilibration estimate that does not employ submeshes or estimators combination, which shows that some of the flux equilibrations proposed in the past cannot be robust. To achieve the fully computable upper bound, we derive explicit bounds for some inverse inequality constants on a simplex, which may be of independent interest.","PeriodicalId":283112,"journal":{"name":"arXiv: Numerical Analysis","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130780117","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Recursive Process for Constructing the Refinement Rules of New Combined Subdivision Schemes and Its Extended Form 构造新组合细分方案细化规则的递归过程及其扩展形式
arXiv: Numerical Analysis Pub Date : 2018-12-04 DOI: 10.1155/2021/6639706
Rabia Hameed, G. Mustafa, J. Deng, Shafqat Ali
{"title":"Recursive Process for Constructing the Refinement Rules of New Combined Subdivision Schemes and Its Extended Form","authors":"Rabia Hameed, G. Mustafa, J. Deng, Shafqat Ali","doi":"10.1155/2021/6639706","DOIUrl":"https://doi.org/10.1155/2021/6639706","url":null,"abstract":"In this article, we present a new method to construct a family of (2N+2)-point binary subdivision schemes with one tension parameter where N is a non-negative integer. The construction of the family of schemes is based on repeated local translation of points by certain displacement vectors. Therefore, the refinement rules of a (2N+2)-point scheme for N=M are recursively obtained from the refinement rules of the (2N+2)-point schemes for N=0,1,2,...,M-1. The complexity, polynomial reproduction and polynomial generation of these schemes are increased by two for the successive values of $N$. Furthermore, we modify this family of schemes to a family of (2N+3)-point schemes with two tension parameters. Moreover, a family of interproximate subdivision schemes with tension parameters is also introduced, which allows a different tension value for each edge and vertex of the initial control polygon. Interproximate schemes generate curves and surfaces such that some initial control points are interpolated and others are approximated.","PeriodicalId":283112,"journal":{"name":"arXiv: Numerical Analysis","volume":"902 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123262994","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Reduced Order Isogeometric Analysis Approach for PDEs in Parametrized Domains 参数化域偏微分方程的降阶等几何分析方法
arXiv: Numerical Analysis Pub Date : 2018-11-21 DOI: 10.1007/978-3-030-48721-8_7
Fabrizio Garotta, N. Demo, M. Tezzele, M. Carraturo, A. Reali, G. Rozza
{"title":"Reduced Order Isogeometric Analysis Approach for PDEs in Parametrized Domains","authors":"Fabrizio Garotta, N. Demo, M. Tezzele, M. Carraturo, A. Reali, G. Rozza","doi":"10.1007/978-3-030-48721-8_7","DOIUrl":"https://doi.org/10.1007/978-3-030-48721-8_7","url":null,"abstract":"","PeriodicalId":283112,"journal":{"name":"arXiv: Numerical Analysis","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121896407","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 19
A Parallel Solver for a Preconditioned Space-Time Boundary Element Method for the Heat Equation 热方程的预条件时空边界元法并行求解器
arXiv: Numerical Analysis Pub Date : 2018-11-13 DOI: 10.1007/978-3-030-56750-7_11
S. Dohr, M. Merta, G. Of, O. Steinbach, Jan Zapletal
{"title":"A Parallel Solver for a Preconditioned Space-Time Boundary Element Method for the Heat Equation","authors":"S. Dohr, M. Merta, G. Of, O. Steinbach, Jan Zapletal","doi":"10.1007/978-3-030-56750-7_11","DOIUrl":"https://doi.org/10.1007/978-3-030-56750-7_11","url":null,"abstract":"","PeriodicalId":283112,"journal":{"name":"arXiv: Numerical Analysis","volume":"272 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115899835","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
On Wielandt-Mirsky's conjecture for matrix polynomials 关于矩阵多项式的Wielandt-Mirsky猜想
arXiv: Numerical Analysis Pub Date : 2018-11-08 DOI: 10.4134/BKMS.B181065
C. Lê
{"title":"On Wielandt-Mirsky's conjecture for matrix polynomials","authors":"C. Lê","doi":"10.4134/BKMS.B181065","DOIUrl":"https://doi.org/10.4134/BKMS.B181065","url":null,"abstract":"In matrix analysis, the textit{Wielandt-Mirsky conjecture} states that $$ dist(sigma(A), sigma(B)) leq |A-B|, $$ for any normal matrices $ A, B in mathbb C^{ntimes n}$ and any operator norm $|cdot |$ on $C^{ntimes n}$. Here $dist(sigma(A), sigma(B))$ denotes the optimal matching distance between the spectra of the matrices $A$ and $B$. It was proved by A.J. Holbrook (1992) that this conjecture is false in general. However it is true for the Frobenius distance and the Frobenius norm (the Hoffman-Wielandt inequality). The main aim of this paper is to study the Hoffman-Wielandt inequality and some weaker versions of the Wielandt-Mirsky conjecture for matrix polynomials.","PeriodicalId":283112,"journal":{"name":"arXiv: Numerical Analysis","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128251766","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
An integrated data-driven computational pipeline with model order reduction for industrial and applied mathematics 一种集成数据驱动的模型降阶计算管道,用于工业数学和应用数学
arXiv: Numerical Analysis Pub Date : 2018-10-29 DOI: 10.1007/978-3-030-96173-2_7
M. Tezzele, N. Demo, A. Mola, G. Rozza
{"title":"An integrated data-driven computational pipeline with model order reduction for industrial and applied mathematics","authors":"M. Tezzele, N. Demo, A. Mola, G. Rozza","doi":"10.1007/978-3-030-96173-2_7","DOIUrl":"https://doi.org/10.1007/978-3-030-96173-2_7","url":null,"abstract":"","PeriodicalId":283112,"journal":{"name":"arXiv: Numerical Analysis","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121475516","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 27
A New Parareal Algorithm for Time-Periodic Problems with Discontinuous Inputs 输入不连续时周期问题的一种新的拟面算法
arXiv: Numerical Analysis Pub Date : 2018-10-29 DOI: 10.1007/978-3-030-56750-7_27
M. Gander, Iryna Kulchytska-Ruchka, S. Schops
{"title":"A New Parareal Algorithm for Time-Periodic Problems with Discontinuous Inputs","authors":"M. Gander, Iryna Kulchytska-Ruchka, S. Schops","doi":"10.1007/978-3-030-56750-7_27","DOIUrl":"https://doi.org/10.1007/978-3-030-56750-7_27","url":null,"abstract":"","PeriodicalId":283112,"journal":{"name":"arXiv: Numerical Analysis","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124638443","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
A Mass-Lumped Mixed Finite Element Method for Maxwell’s Equations 麦克斯韦方程组的质量集总混合有限元法
arXiv: Numerical Analysis Pub Date : 2018-10-15 DOI: 10.1007/978-3-030-44101-2_2
H. Egger, B. Radu
{"title":"A Mass-Lumped Mixed Finite Element Method for Maxwell’s Equations","authors":"H. Egger, B. Radu","doi":"10.1007/978-3-030-44101-2_2","DOIUrl":"https://doi.org/10.1007/978-3-030-44101-2_2","url":null,"abstract":"","PeriodicalId":283112,"journal":{"name":"arXiv: Numerical Analysis","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122281822","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Downwinding for Preserving Strong Stability in Explicit Integrating Factor Runge--Kutta Methods 显式积分因子Runge—Kutta方法中保持强稳定性的下卷
arXiv: Numerical Analysis Pub Date : 2018-10-10 DOI: 10.4310/PAMQ.2018.V14.N1.A1
Leah Isherwood, Zachary J. Grant, S. Gottlieb
{"title":"Downwinding for Preserving Strong Stability in Explicit Integrating Factor Runge--Kutta Methods","authors":"Leah Isherwood, Zachary J. Grant, S. Gottlieb","doi":"10.4310/PAMQ.2018.V14.N1.A1","DOIUrl":"https://doi.org/10.4310/PAMQ.2018.V14.N1.A1","url":null,"abstract":"Strong stability preserving (SSP) Runge-Kutta methods are desirable when evolving in time problems that have discontinuities or sharp gradients and require nonlinear non-inner-product stability properties to be satisfied. Unlike the case for L2 linear stability, implicit methods do not significantly alleviate the time-step restriction when the SSP property is needed. For this reason, when handling problems with a linear component that is stiff and a nonlinear component that is not, SSP integrating factor Runge--Kutta methods may offer an attractive alternative to traditional time-stepping methods. The strong stability properties of integrating factor Runge--Kutta methods where the transformed problem is evolved with an explicit SSP Runge--Kutta method with non-decreasing abscissas was recently established. In this work, we consider the use of downwinded spatial operators to preserve the strong stability properties of integrating factor Runge--Kutta methods where the Runge--Kutta method has some decreasing abscissas. We present the SSP theory for this approach and present numerical evidence to show that such an approach is feasible and performs as expected. However, we also show that in some cases the integrating factor approach with explicit SSP Runge--Kutta methods with non-decreasing abscissas performs nearly as well, if not better, than with explicit SSP Runge--Kutta methods with downwinding. In conclusion, while the downwinding approach can be rigorously shown to guarantee the SSP property for a larger time-step, in practice using the integrating factor approach by including downwinding as needed with optimal explicit SSP Runge--Kutta methods does not necessarily provide significant benefit over using explicit SSP Runge--Kutta methods with non-decreasing abscissas.","PeriodicalId":283112,"journal":{"name":"arXiv: Numerical Analysis","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132477575","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
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学术官方微信