-
To be clear, I know barely anything about these methods. I only heard that they can significantly improve performance of IRKA (a Krylov-based MOR method), but it is not my current priority to use them…
-
Arnoldi method is a fundamental component of Krylov subspace method, which is used in sparse matrix context. However, the idea of Arnoldi method can be extended to general linear operators.
TODO
-…
-
-
**Is your feature request related to a problem? Please describe.**
`faer` is very fast at computing all eigenvalues of a matrix, but oftentimes you only need a few eigenvalues (e.g. the largest/small…
-
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
- […
-
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…
-
Is it valid to consider the results of this paper from 2011: [Inner-Iteration Krylov Subspace Methods for Least Squares Problems](https://www.nii.ac.jp/TechReports/public_html/11-001E.pdf)?
Especia…
-
Some rotor models can have a large number of elements and, in addition to this fact, the high number of frequency / time sample points that may be necessary to input, may lead to a very long time and …
-
Hi,
I think it could be great to introduce the support for eigenvalue solvers. I noticed that the implicit restarted method has already been passed. The modern faster method should be the Krylov-Sc…
-
For reference, an `LTIModel` can be $E \dot{x}(t) = A x(t) + B u(t)$, $y(t) = C x(t) + Du(t)$ (continuous-time) or $E x_{n + 1} = A x_n + B u_n$, $y_n = C x_n + D u_n$ (discrete-time). In both cases, …
pmli updated
12 months ago