-
At present there are a variety of special structured matrix types - diagonal, bidiagonal, tridiagonal, symtridiagonal, banded, triangular, hessenberg, symmetric, hermitian, sparse CSC, and so on - in …
-
Currently, we can only put a matrix in Hessenberg form if it is square. But we allow non-square matrices in ishessenberg. I'm just wondering if it was intentional, and whether we should return false o…
-
@baharev
I want to use sdopt-tearing in my Master's project but I am having some difficulty interacting with your code. Currently, I manually create the incidence matrix and pass it to the methods i…
-
### Current implementation
Current implementation of locking is to wait until a subdiagonal element of the Hessenberg matrix becomes small, and then do a local schur decomposition of the left upper b…
-
```
_
_ _ _(_)_ | A fresh approach to technical computing
(_) | (_) (_) | Documentation: https://docs.julialang.org
_ _ _| |_ __ _ | Type "?help" fo…
-
**Please, I would prefer that nobody make announcements on blogs about this (in reddit, hackernews, etc.) before the release on crates.io which will occur during the second half of august.**
All th…
-
Suppose that we have an Arnoldi relation
```
AV = VH + hveₖ' = [V v]B where B = [H; heₖ']
```
and some unitary matrix Q, then a similar Krylov-relation would be
```
AVQ = VHQ + hveₖ'Q
```…
-
This issue is checklist/wishlist of things we should plan to do before we feel we can start announcing the existance of the packade to colleagues (maybe version 0.1). Feel free to add if you think it …
-
Adding transpose operations to the base property breaks QR.
```
using LinearAlgebra
function Base.getproperty(x::AbstractMatrix, name::Symbol)
if name === :T
return transpose(x)
…
-
Several of the methods are inner-outer iteration methods. At some point in the algorithm you need to solve a smaller problem (typically the Galerkin projection of the problem). In commit 6554628cb1a5…