.png){kind=icon}
返回
AN EFFICIENT ALGORITHM FOR THE CLASSICAL LEAST SQUARES APPROXIMATION
.png){kind=icon}
PRE
AI
DOI：10.1137/19M1259936.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We explore the computational issues concerning a new algorithm for the classical least-squares approximation of N samples by an algebraic polynomial of degree at most n when the number N of the samples is very large. The algorithm is based on a recent idea about accurate numerical approximations of sums with large numbers of terms. For a fixed n, the complexity of our algorithm in double precision accuracy is O(1). It is faster and more precise than the standard algorithm in MATLAB.
Keyword:
least squares approximation
Gaussian quadrature
orthogonal Gram polynomials
WDDK method
Newton-Raphson method
Golub-Welsch algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
分享收藏Implementation of Superconducting Cables in Medium Voltage DC Integrated Power Systems on All Electric Ships中型船舶全电力系统中中压直流集成电力系统的超导电缆实施
PREAI
分享收藏Effect of Short Circuit Current on Temperature Distribution of Current Lead for HTS Cable Termination短路电流对高温超导电缆终端电流引线温度分布的影响
PREAI
分享收藏分享收藏
查看更多内容