Cartesian Cut Cell Method repository. This repository contains code and resources related to the Cartesian cut cell method
The Cartesian cut cell method is a powerful numerical technique for solving partial differential equations (PDEs) on irregular domains or complex geometries. It combines the simplicity and efficiency of structured Cartesian grids with the flexibility to handle arbitrary geometries using cut cells.
This repository aims to provide:
- Implementation of the Cartesian cut cell method in [Julia].
- Examples and tutorials demonstrating the application of the method to various PDEs and geometries.
- Documentation and resources for understanding the theory and implementation details of the Cartesian cut cell method.
-
Implementation:
./src
: Contains the code implementing the Cartesian cut cell method. This includes the core algorithm as well as any utilities or helper functions. -
Examples:
./test
: Provides examples demonstrating how to use the Cartesian cut cell method -
Documentation:
.\docs
: Contains documentation and implementation details -
References:
- [Julia] [1.10]
- Implement Operators, Matrix : Cut Cell machinery - OK
- Test Operators - WIP :
- Gradient : OK
- Divergence : WIP
- Poisson Disk Inside :
- Implement OK
- Test Ok
- Comp WIP
- Poisson Disk Outside : WIP : Deal Interface Boundary condition and Border Condition
- Test Poisson 3D - Fix CartesianGeometry
axs
- Stefan Problem : Cut Cell operators formulation + Implementation