You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I have an idea for a preconditioning approach for SNESVIRS, which might be something I would work on in Dartington.
SNESVIRS is the reduced space Newton method for variational inequalities, which works by dealing with an "active set", which is a subset of the full DOF set of variables where the constraint is (currently) a strict inequality rather than equality.
My proposal is to make a Python preconditioner that injects the active set into the full space, then does something to it with a KSP, and then projects back to the reduced space again (by copying over only the active DOFs).
In particular, the KSP could then do a solve using Auxiliary Operator PC.
I'm interested in comments about whether this is:
mathematically sensible,
plausible to implement in Firedrake.
The text was updated successfully, but these errors were encountered:
I don't think that the full space approach is sensible. What about rediscretizing the bilinear form with a DirichletBC with the (iteration-dependent) inactive set?
I have an idea for a preconditioning approach for SNESVIRS, which might be something I would work on in Dartington.
SNESVIRS is the reduced space Newton method for variational inequalities, which works by dealing with an "active set", which is a subset of the full DOF set of variables where the constraint is (currently) a strict inequality rather than equality.
My proposal is to make a Python preconditioner that injects the active set into the full space, then does something to it with a KSP, and then projects back to the reduced space again (by copying over only the active DOFs).
In particular, the KSP could then do a solve using Auxiliary Operator PC.
I'm interested in comments about whether this is:
The text was updated successfully, but these errors were encountered: