1
94%
develop: 94%

Ran 19 Apr 2025 01:26AM UTC

Files 92

Run time 2s

Badge

Embed ▾

Committed 19 Apr 2025 12:57AM UTC coverage: 94.777% (-0.009%) from 94.786%

Job # 14544069614.1

Build Type

push

github

Committed by

web-flow

Commit Message

Better exact diagonalisation (#306)

# Changes
* Implement a `LinearMap` from
[LinearMaps.jl](https://github.com/JuliaLinearAlgebra/LinearMaps.jl),
which allows us to use operators as matrices without storing the
matrices in memory.
* Use the `LinearMap` to implement matrix-free variants of
`KrylovKitSolver`, `ArpackSolver`, and `LOBPCGSolver`.
* Refactor of the `ExactDiagonalizationProblem` and its surrounding
infrastructure.

# Changed behaviour
* `ArpackSolver` and `LOBPCGSolver` now use the matrix-free algorithm by
default.

Run Details

6932 of 7314 relevant lines covered (94.78%)

11143439.58 hits per line

RimuQMC / Rimu.jl / 14544069614 / 1
94%
develop: 94%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 14544069614.1

RimuQMC / Rimu.jl / 14544069614 / 1 94% develop: 94%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 14544069614.1

RimuQMC / Rimu.jl / 14544069614 / 1
94%
develop: 94%

README BADGES
x