.png){kind=icon}
返回
Fast algorithms using orthogonal polynomials
.png){kind=icon}
PRE
AI
DOI：10.1017/S0962492920000045.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We review recent advances in algorithms for quadrature, transforms, differential equations and singular integral equations using orthogonal polynomials. Quadrature based on asymptotics has facilitated optimal complexity quadrature rules, allowing for efficient computation of quadrature rules with millions of nodes. Transforms based on rank structures in change-of-basis operators allow for quasi-optimal complexity, including in multivariate settings such as on triangles and for spherical harmonics. Ordinary and partial differential equations can be solved via sparse linear algebra when set up using orthogonal polynomials as a basis, provided that care is taken with the weights of orthogonality. A similar idea, together with low-rank approximation, gives an efficient method for solving singular integral equations. These techniques can be combined to produce high-performance codes for a wide range of problems that appear in applications.
Keyword:
RANK-ONE MODIFICATION
DIFFERENTIAL-EQUATIONS
SPECTRAL METHOD
GAUSSIAN QUADRATURES
CONQUER ALGORITHM
SOBOLEV SPACES
RECURRENCE
WEIGHTS
COMPUTATION
TRANSFORM
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
11.3
论文数:
89
被引数:
3.4K
机构
引用论文
分享收藏Non-native earthworm influences on ectomycorrhizal colonization and growth of white spruce.png)
Écoscience
ÉcoscienceIF0
PREAI
分享收藏分享收藏
查看更多内容