https://github.com/chakravala/wilkinson.jl

Toolkit for studying numerical analysis and floating point algebra round-off

https://github.com/chakravala/wilkinson.jl

Science Score: 13.0%

This score indicates how likely this project is to be science-related based on various indicators:

  • CITATION.cff file
  • codemeta.json file
    Found codemeta.json file
  • .zenodo.json file
  • DOI references
  • Academic publication links
  • Committers with academic emails
  • Institutional organization owner
  • JOSS paper metadata
  • Scientific vocabulary similarity
    Low similarity (13.2%) to scientific vocabulary

Keywords

error-analysis error-propagation floating-point floating-point-arithmetic ieee754 metaprogramming numerical-analysis polynomials

Keywords from Contributors

pdf-generation proof theorem julia-set
Last synced: 5 months ago · JSON representation

Repository

Toolkit for studying numerical analysis and floating point algebra round-off

Basic Info
Statistics
  • Stars: 3
  • Watchers: 2
  • Forks: 1
  • Open Issues: 0
  • Releases: 2
Topics
error-analysis error-propagation floating-point floating-point-arithmetic ieee754 metaprogramming numerical-analysis polynomials
Created over 7 years ago · Last pushed about 2 years ago
Metadata Files
Readme License

README.md

Wilkinson.jl

Build Status Build status Coverage Status codecov.io

This package is intended to help provide a complementary detailed analysis of polynomial rounding error estimates using newly defined local and global characteristic methods. Using automated testing of different polynomial forms, an optimal expression form can be determined. The methods used include a Simpson-Stieltjes integral method to estimate error bound discrepancy and a computationally efficient characteristic method. The conclusions of the associated research (to be published by Advances in Engineering Mathematics) indicate the SyntaxTree.exprval method can be used to select optimal numerical code for polynomial basis functions with the Reduce.jl symbolic rewrite package for the Julia language, which is based on high-level code generation and macros operating on abstract syntax trees. Due to the computational simplicity of the expression value method in comparison to the floating point error bound Simpson-Stieltjes integral estimation method, the expression value method is the demonstrably faster, more efficient, and equally reliable method for determining the optimal expression form characterization.

Note that this package is not required to use the characterization method (as it is in the SyntaxTree package) and the polynomial forms can be generated by the Reduce package. The purpose of this package is to help with the analysis of the characteristic methods and to explore the local properties of the Wilkinson-type error bounds on the floating point pseudo-algebra for polynomials.

While the package is fully functional, this package continues to be a work in progress and is possibly subject to breaking changes. In the near future the source code for the research article preprints, documentation, and experimental data will be included in this repository.

Owner

  • Name: Dream Scatter
  • Login: chakravala
  • Kind: user

computational language algeber 🧐 abstract research mathematician

GitHub Events

Total
Last Year

Committers

Last synced: about 2 years ago

All Time
  • Total Commits: 12
  • Total Committers: 2
  • Avg Commits per committer: 6.0
  • Development Distribution Score (DDS): 0.25
Past Year
  • Commits: 1
  • Committers: 1
  • Avg Commits per committer: 1.0
  • Development Distribution Score (DDS): 0.0
Top Committers
Name Email Commits
Michael Reed m****d@c****m 9
Michael Reed 1****a 3
Committer Domains (Top 20 + Academic)

Issues and Pull Requests

Last synced: 7 months ago

All Time
  • Total issues: 0
  • Total pull requests: 0
  • Average time to close issues: N/A
  • Average time to close pull requests: N/A
  • Total issue authors: 0
  • Total pull request authors: 0
  • Average comments per issue: 0
  • Average comments per pull request: 0
  • Merged pull requests: 0
  • Bot issues: 0
  • Bot pull requests: 0
Past Year
  • Issues: 0
  • Pull requests: 0
  • Average time to close issues: N/A
  • Average time to close pull requests: N/A
  • Issue authors: 0
  • Pull request authors: 0
  • Average comments per issue: 0
  • Average comments per pull request: 0
  • Merged pull requests: 0
  • Bot issues: 0
  • Bot pull requests: 0
Top Authors
Issue Authors
Pull Request Authors
Top Labels
Issue Labels
Pull Request Labels

Packages

  • Total packages: 1
  • Total downloads: unknown
  • Total dependent packages: 0
  • Total dependent repositories: 0
  • Total versions: 2
juliahub.com: Wilkinson

Toolkit for studying numerical analysis and floating point algebra round-off

  • Versions: 2
  • Dependent Packages: 0
  • Dependent Repositories: 0
Rankings
Dependent repos count: 9.9%
Average: 35.5%
Dependent packages count: 38.9%
Forks count: 40.4%
Stargazers count: 52.9%
Last synced: 6 months ago

Dependencies

REQUIRE julia
  • PyPlot *
  • Reduce *
  • SyntaxTree *
  • julia 0.7