-
Notifications
You must be signed in to change notification settings - Fork 106
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
LOBPCG constraint requirements #294
Comments
apologies, I think I misunderstood the intended input style for constraints here. Comparing with the docs for It would be helpful to see an example of this being using correctly. |
Yes that's correct. |
IterativeSolvers.jl's LOBPCG methods for partial eigen-decomposition provide a keyword argument interface for constraint operators/matrices. The documentation for this argument currently says
The requirements for constraint maps in the current implementation are actually much more strict than this (and much more strict than for the target operator and preconditioner).
I ran into this issue while trying to use constraints of type
LinearMaps.FunctionMap
withIterativeSolvers.lobpcg
. During construction of callableConstraint
structs, constraint operators pass through various pre-processing steps that are incompatible with generalLinearMaps
types (similar
andHermitian
). More broadly, the algorithm for constraints seems to requiresetindex!
viaview
and slicing, as well asldiv!
, seeupdate!
and methods ofConstraint
:IterativeSolvers.jl/src/lobpcg.jl
Lines 144 to 224 in ae01dfe
Could somebody more knowledgeable explain the actual requirements and suggested types for constraint operators? I think the main appeal of
IterativeSolvers.lobpcg
is compatibility with "matrix-free"/implicit linear operator types, so the currently undocumented constraint interface requirements could lead to confusion.It would be great to allow more general constraint functions & operators if it wouldn't be too much work. IIUC, these extra requirements for constraint operators arise because
nev
(# eigenvalues/vectors solved) extra columns are glued onto the constraint matrix and mutated during each iteration. Could the same processing be achieved without constraining the constraints (hehe), just by creating a separate array? I would be glad to take a crack at it if a PR is desired, although this solver seems to be stuck mid-overhaul at the moment (#247).The text was updated successfully, but these errors were encountered: