Algorithms for Function Approximation with Redundancy on Complex Geometries KU Leuven
The discretization of partial differential equations on domains with a complicated geometry requires a difficult meshing phase. This is often a laborious, manual process that typically starts from a CAD description of the geometry. It is not a secret that this process may take longer than the actual solver. A major current research interest is iso-geometric analysis, in which the basis functions of the CAD model are reused in the ...