Failing case of QR decomposition
Open
Nobody has claimed this yet.
bug
- Dominant language
- Java
- Stars
- 259
- Forks
- 47
- PR merge metrics
- No merged PRs in 30d
Description
The following Qr decomposition case appears to fail:
[[ 0 , 0 ],
[ -1 , 0 ]]
with results
Q= [[ 0.0, 1.0 ],
[ 1.0, 0.0 ]]
R= [[ -1.0, 0.0 ],
[ 0.0, -1.0 ]]
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 names no implementation file or test. Locate the QR decomposition entry point, reproduce the reported 2x2 matrix case, and inspect any existing decomposition tests. Done means the failure is characterized and the case is covered by a passing regression test.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- java
- Domain
- data
- Issue type
- Bug
- Difficulty
- 3/5
- Estimated time
- 1-2 days
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 35/100