Skip to content
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.

Sign up for GitHub

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

Revert "Use norm instead of abs in generic lu factorization (#34575)" #36096

Merged
merged 1 commit into from
Jun 2, 2020
Merged

Revert "Use norm instead of abs in generic lu factorization (#34575)" #36096

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions stdlib/LinearAlgebra/src/lu.jl
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -140,9 +140,9 @@ function generic_lufact!(A::StridedMatrix{T}, ::Val{Pivot} = Val(true);
# find index max
kp = k
if Pivot
amax = norm(zero(T))
amax = abs(zero(T))
for i = k:m
absi = norm(A[i,k])
absi = abs(A[i,k])
if absi > amax
kp = i
amax = absi
Expand Down
2 changes: 0 additions & 2 deletions stdlib/LinearAlgebra/test/generic.jl
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -365,8 +365,6 @@ LinearAlgebra.Transpose(a::ModInt{n}) where {n} = transpose(a)

# Needed for pivoting:
Base.abs(a::ModInt{n}) where {n} = a
LinearAlgebra.norm(a::ModInt{n}) where {n} = a

Base.:<(a::ModInt{n}, b::ModInt{n}) where {n} = a.k < b.k

@test A*(lu(A, Val(true))\b) == b
Expand Down