ucb-bar / ucb-bar/berkeley-hardfloat
The algorithm used in DivSqrtRecF64_mulAddZ31 to calculate square-root
Open
Nobody has claimed this yet.
- Dominant language
- Scala
- Stars
- 393
- Forks
- 111
- PR merge metrics
- No merged PRs in 30d
Description
What is the algorithm used to calculate square-root in DivSqrtRecF64_mulAddZ31.scala? Dose it use Goldschmidt or Newton-Raphson algorithm, and can you provide some references about the algorithm it used?
Thank you.
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by reading DivSqrtRecF64_mulAddZ31.scala and tracing the square-root calculation. Determine whether the implementation follows Goldschmidt, Newton-Raphson, or another algorithm, then provide references supporting that identification; the issue is done when the algorithm and references are documented.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- scala
- Domain
- tooling
- Issue type
- Documentation
- Difficulty
- 2/5
- Estimated time
- 1-3 hours
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 42/100