Repository navigation
Replies: 1 comment
|
By "each iteration step" here, do you mean each Krylov step? If so, you might need to ask the PETSc people. I don't see anything in their manual pages that would serve as a |
0 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Uh oh!
There was an error while loading. Please reload this page.
Thank you for any help you may be able to provide with this. Is it possible without code modification to implement a fully implicit mesh scheme using libmesh combined with Petsc? The details of which is present here:
Problem Definition:
Given a typical 2nd order Poisson problem.
Au = f,
Find u in V such that a(u,rho) = (f,rho) for all rho in V.
Approximate the problem using a sequence of finite dimensional subspaces V_h is a proper subset of V, where the discrete problem reads as,
Find u_h in V_h such that a_h(u_h,rho) = (f_h,rho) for all rho in V_h.
The continuous problem is defined with the boundary conditions, B(u) = g on the surface of the domain cap_gamma. The boundary conditions can be a combination of function values and/or partial derivatives. of u on the boundaries.
Initially Matrix A_h (and also U_h andF_h) have not incorporated any BCs, corresponding to natural BCs.
S_h(cap_gamma) denotes as degrees of freedom of the vector U_h that are related to the boundary cap_gamma.
Fully implicit method:
All components of the solution vector have to be treated as unknowns by all components of the iterative solvers.
All reactions