Root finding bounds in Davis EOS
Open
Nobody has claimed this yet.
enhancement
good first issue
- Dominant language
- C++
- Stars
- 39
- Forks
- 22
- Avg merge
- 10h 22m
- Merged PRs (30d)
- 3
Description
As @dholladay00 they are hardcoded. We will revisit this as needed.
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
The issue concerns hardcoded root-finding bounds in the Davis EOS, but it names no files, tests, or entry points. First locate the Davis EOS root-finding implementation and clarify whether the bounds should become configurable; completion criteria are not specified in the issue.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- cpp
- Domain
- hpc
- Issue type
- Refactor
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100