-
Hello Boris,
Does the approximation of a kernel matrix with hss guarantee to preserve positive definiteness? If yes, how does it achieve that?
Thank you!
-
I tried out the 'CTVsuggest' package, as requested by Achim Zeileis.
For the NumericalNumerics task view, it suggested the following packages:
CTVsuggest(taskview = "NumericalMathematics", n = 20)…
-
Hi,
First, I'm really glad someone has started a project like this for Julia as the language has a lot of potential for implementing MCMC algorithms. I'd like to propose some small extensions to the…
nfoti updated
12 years ago
-
Sometimes `RecurrenceArray` is slower than `getindex` when actually assembling the values e.g.
```
using ClassicalOrthogonalPolynomials
using SingularIntegrals
import ClassicalOrthogonalPolyno…
-
Sometimes we're only interested in the marginal posterior rather than the joint posterior. One way to compute this if we have a batch of `b x q x d` points (where `b` is the batch dimension, `q` is t…
-
### Checklist
- [X] I've read the [contribution guidelines](https://github.com/autowarefoundation/autoware/blob/main/CONTRIBUTING.md).
- [X] I've searched other issues and no duplicate issues were fo…
-
I think I would perhaps be able to implement a smarter system of handling `matrixWorldNeedsUpdate` based on a tri-state value ("no update needed", "I need update", "some children need update"). With s…
-
## Submitter
Hi, my name is Aleksandra (Sasha) Kim, I am a postdoctoral researcher at ETH Zurich.
## Description
My entry is a dashboard that attempts to combine the story and motivation of globa…
-
I want to calculate the inverse of a sparse matrix, how can I do this ?
for example
```py
vers_n=200000
ind_i = torch.Tensor(list(range(vers_n))).long().view(1,-1)
ind_j = torch.Tensor(list(ran…
-
**Concisely describe the proposed feature**
Support efficient operations (e.g. matmul ) for large matrix. The current `ti.Matrix` is designed for small matrices, therefore the compilation is extreme …