-
I previously used pica and it uses the mks2013 algorithm, as well as lanczos (but not sure which is doing what). There is no mks2013 option in your library? Or it could be a feature? I was liking its …
-
Dear Jie,
Thank you for your excellent package.
I have successfully solved the problem with a spin-1 diamond chain up to 12 spins.
Now, I aim to increase the number of spins to 18 while conser…
-
Hello and thanks very doing this job. I am happy to see a project like this.have you implemented lanczos algorithm so far? I need to find the k largest eigenvalues of a dense matrix!
Thanks
-
### Describe the problem
When I use Transform Image to scale and transform an image, it appears to be using Nearest Neighbor sampling. Results are blocky. Is it possible to enable other sampling al…
-
The Lanczos algorithm may suffer from numerical instability, see discussion in e.g. https://en.wikipedia.org/wiki/Lanczos_algorithm.
The generous unit-test tolerances indicate numerical round-off err…
-
**Let us choose the algorithm used to upscale/downscale the image from the game window.**
Some algorithm that could be great:
- Bilinear
- Bicubic
- Nearest neighbor
- Area (great for downscali…
-
I saw that the Bicubic algorithm has been implemented recently. This is very good news for me because now I can use the whole zune-image pipeline to load and have simple manipulations of images, witho…
-
### Description
The [Lanczos algorithm ](https://en.wikipedia.org/wiki/Lanczos_algorithm) is a numerical method that can be used to calculate time-evolution of closed quantum system. It is a computat…
-
A comprehensive listing of methods in the references.
Please remove any methods are impractical/obsolete and add methods worth implementing to the list.
Linear systems
- Stationary methods
- […
-
It is pretty common to want to compute unitary matrix exponentials of the form $e^{iAt}b$ for Hermitian matrices $A$. It would be nice to have a method that takes advantage of $A$ being Hermitian he…