Mercurial > repos > public > sbplib_julia
comparison Notes.md @ 761:d7d030f8f708
Add note about adjoint as trait
author | Jonatan Werpers <jonatan@werpers.com> |
---|---|
date | Wed, 14 Jul 2021 23:58:20 +0200 |
parents | 05d8ea88c690 |
children | 1d166e7a9deb |
comparison
equal
deleted
inserted
replaced
759:80d88bb1c5bd | 761:d7d030f8f708 |
---|---|
318 We should make these test simple to run for any solver. | 318 We should make these test simple to run for any solver. |
319 | 319 |
320 See [this talk](https://www.youtube.com/watch?v=vPsfZUqI4_0) for some simple ideas for defining effecive memory usage and some comparison with peak performance. | 320 See [this talk](https://www.youtube.com/watch?v=vPsfZUqI4_0) for some simple ideas for defining effecive memory usage and some comparison with peak performance. |
321 | 321 |
322 | 322 |
323 ## Adjoint as a trait on the sbp_operator level? | |
324 | |
325 It would be nice to have a way of refering to adjoints with resepct to the sbp-inner-product. | |
326 If it was possible you could reduce the number of times you have to deal with the inner product matrix. | |
327 | |
328 Since the LazyOperators package is sort of implementing matrix-free matrices there is no concept of inner products there at the moment. It seems to complicate large parts of the package if this was included there. | |
329 | |
330 A different approach would be to include it as a trait for operators so that you can specify what the adjoint for that operator is. | |
331 | |
332 |