RFC: add `blas/ext/base/snancusumkbn`
- 主要语言
- JavaScript
- 星标
- 6k
- 派生
- 1.3k
- 平均合并
- 1 天 3 小时
- 30 天内合并 PR
- 611
描述
## Checklist
> Please ensure the following tasks are completed before submitting a feature request.
- [x] Read and understood the [Code of Conduct][code-of-conduct].
- [x] Searched for existing issues and pull requests.
- [x] The issue name begins with `RFC:`.
## Description
> Description of the feature request.
This RFC proposes adding support for computing the cumulative sum of a single-precision floating-point strided array ignoring `NaN` values and using an improved Kahan-Babuska algorithm. This would be a lower-level strided interface which includes a native C implementation and has the following package name:
Package: `@stdlib/blas/ext/base/snancusumkbn`
## Related Issues
> Does this feature request have any related issues?
None.
## Questions
> Any questions for reviewers?
No.
## Other
> Any other information relevant to this feature request? This may include screenshots, references, sample output, and/or implementation notes.
No.
[code-of-conduct]: https://github.com/stdlib-js/stdlib/blob/develop/CODE_OF_CONDUCT.md
贡献指南
调研方向
Start by surveying existing BLAS extension packages for cumulative sums and related NaN-aware single-precision routines. Determine the conventions needed for the proposed @stdlib/blas/ext/base/snancusumkbn package, including its native C implementation and validation. Done means the package computes the strided cumulative sum while ignoring NaN values and using the improved Kahan-Babuska algorithm.
由索引模型根据 Issue 内容生成。
评估
- 技术栈
- c, javascript
- 领域
- data
- Issue 类型
- 功能
- 难度
- 5/5
- 预计耗时
- 一周以上
- 活跃度
- 停滞
- 描述清晰度
- 需要澄清
- 新手友好度
- 25/100