-
```
The tests are very non-standard: some of them appear to be testing the core MTJ
classes rather than unit testing this library.
I'd be happy to help restructuring of the tests.
Other than unit t…
-
These are just some near term goals for after the initial alpha release
## Array tooling pieces
- [ ] More fancy formats
- [ ] Symmetric (padded and packed)
- [ ] Hermitian (padded and packed)
…
-
From https://github.com/JuliaMath/IterativeSolvers.jl/issues/1
A comprehensive listing of methods in the references.
Please remove any methods are impractical/obsolete and add methods worth imple…
-
This is still work in progress.
So I thought a bit about the davidson solver api and I have the following ideas:
a) Eigenvalue selection/target.
We write a selection class, which can be eithe…
-
Hello all,
In the last steps of the implementation of my paper, it asks by to solve a generalized eigenproblem for the smallest eigenvalue/eigenvector pair. This roughly looks like
\\[
D^T W(x…
-
```
Implement method to obtain generalized eigenvectors for defective matrix. http://en.wikipedia.org/wiki/Generalized_eigenvector Also, it is connected with Jordan form, for finding transformation ht…
-
Introduction
----------------
This is an issue to discuss how eigensolvers could be added to Ginkgo.
In general, eigensolvers compute an [eigendecomposition](https://en.wikipedia.org/wiki/Eigen…
-
(1) Suppose T is a matrix. For T.transpose(), it is better to leave T unchanged and return transpose of T. But current version of Uni10 changes matrix T to its transpose.
(2) To do matrix multiplicat…
rezah updated
8 years ago
-
Note that `eigh` is already taken care of.
-
We have linear regression but from what I can see we don't have linear discriminant analysis which is the equivalent algorithm for classification. We even have the iris dataset which was created to de…