Repo Added
|
Files
17
|
Badge
Embed ▾
README BADGES
|
push
travis-ci
3535 of 3851 relevant lines covered (91.79%)
26522.09 hits per line
Coverage | ∆ | File | Lines | Relevant | Covered | Missed | Hits/Line |
---|
Builds | Branch | Commit | Type | Ran | Committer | Via | Coverage |
---|---|---|---|---|---|---|---|
1201 | modal/dirichlet_bc | Eliminate Dirichlet boundary conditions differently Slicing is very expensive operation on sparse matrices. Avoid slicing by calculating matrix product `K_red = C1*K*C1`, where C1 is diagonal matrix. This should be much cheaper. | push | ahojukka5 | travis-ci | pending completion |