MALAMUTE ROM Development: Jacobian Reduction #24240
-
Dear MOOSE Team, We are developing a ROM for MALAMUTE and are exploring different parts of the problem where we can achieve a reduction. In particular, we are interested in achieving reduction at the level of the Jacobian. However, we had a few concerns about the feasibility of the implementation of any such approach. Specifically, we had the following questions: (i) Is it possible to read in an approximate base Jocobian for the problem through a file or generate it through a script inside MOOSE? We would appreciate any help on this. Thanks, Anant |
Beta Was this translation helpful? Give feedback.
Replies: 2 comments 1 reply
-
The short answer to all of your questions is sadly no but we welcome contributions. You can write your own I'll give a little more detail on a few: iii) You can write your own custom line search if that's what you mean by bypassing PETSc's nonlinear solution. However, you would still be using the built-in KSP in the PETSc SNES object |
Beta Was this translation helpful? Give feedback.
The short answer to all of your questions is sadly no but we welcome contributions. You can write your own
Executioner
andSolveObject
andFEProblemBase
derived objects in which you can do almost anything you want. You could override the Jacobian computation routine from the latter for instance.I'll give a little more detail on a few:
iii) You can write your own custom line search if that's what you mean by bypassing PETSc's nonlinear solution. However, you would still be using the built-in KSP in the PETSc SNES object
iv) You could hack in some condition
MatView
calls within the framework contingent on time step/iteration number etc.v) similarly as iv)