Giter Site home page Giter Site logo

the code for weak galerkin about festung HOT 6 CLOSED

festung avatar festung commented on May 28, 2024
the code for weak galerkin

from festung.

Comments (6)

reuterbal avatar reuterbal commented on May 28, 2024

Hi @yoczhang,

at the moment there is no adaptivity support in FESTUNG. We are thinking of adding this at some point but it requires some major changes to data structures and thus won't happen anytime soon.

Balthasar

from festung.

yoczhang avatar yoczhang commented on May 28, 2024

Dear Balthasar
Thanks very much for your kind reply!

best regards.
yongchao

from festung.

yoczhang avatar yoczhang commented on May 28, 2024

Dear @reuterbal ,
I found a relatively simple way to implement the adaptive mesh, hoping to provide some help. We can refer to the following this document, as well as the program code:
Efficient Implementation of Adaptive P1-FEM in Matlab,
http://www.asc.tuwien.ac.at/~praetorius/matlab/
I think using this method we need not to change the data structures, in every circle we just to update the coordV and V0T, and then we can do g=generateGridData(coordV, V0T).

best regards,
yongchao

from festung.

reuterbal avatar reuterbal commented on May 28, 2024

Dear @yoczhang ,
thank you for that reference. Regenerating grid data structures is an obvious choice but not the core of the problem.

Most work would go into implementing recursive edge bisection or any other refinement algorithm to actually create coordV and V0T. Furthermore, you would first need some error indicator to decide which elements to refine, and afterwards a method to project your solution from the coarse grid to the fine grid.

Other choices might include hierarchical meshes, which are better suited for hyperbolic problems, where the area of interest travels through the domain.

You can probably implement an easy mesh adaptivity algorithm for your problem using the first method and without projecting the solution but recomputing from the beginning. This is a common choice and should still save you some computation time compared to starting out with a uniformly fine grid.

Best,
Balthasar

from festung.

yoczhang avatar yoczhang commented on May 28, 2024

Dear @reuterbal ,
One limitation of this document is that it only applies to P1 situations and I will continue to improve the program. Thank you very much for your suggestion.

Best,
yongchao.

from festung.

reuterbal avatar reuterbal commented on May 28, 2024

Closing this due to inactivity.

from festung.

Related Issues (5)

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.