Skip to content

Simplify svd code now that upper bidiagonal matrices can be processed #159

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Jul 21, 2025

Conversation

andreasnoack
Copy link
Member

With #156, we can avoid the branching beased on U/L in svd!.

Copy link

codecov bot commented Jul 21, 2025

Codecov Report

All modified and coverable lines are covered by tests ✅

Project coverage is 96.55%. Comparing base (79b8953) to head (de256b9).
Report is 1 commits behind head on master.

Additional details and impacted files
@@            Coverage Diff             @@
##           master     #159      +/-   ##
==========================================
+ Coverage   96.42%   96.55%   +0.12%     
==========================================
  Files          10       10              
  Lines        1454     1450       -4     
==========================================
- Hits         1402     1400       -2     
+ Misses         52       50       -2     

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.

🚀 New features to boost your workflow:
  • ❄️ Test Analytics: Detect flaky tests, report on failures, and find test suite problems.

@andreasnoack andreasnoack merged commit 4eed112 into master Jul 21, 2025
8 checks passed
@andreasnoack andreasnoack deleted the an/simplifysvd branch July 21, 2025 16:51
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant