The moving least squares interpolation method is a way to approximate a function to a set of target points from source points. It involves spatial search (hence the use of ArborX) and linear algebra. This presentation will show the interpolation and its use, as well as the performances of the current implementation. It will end with how I was introduced to HPC and Kokkos and how I will keep on using Kokkos in my later career.
mrlag31
commented
9 months ago
The moving least squares interpolation method is a way to approximate a function to a set of target points from source points. It involves spatial search (hence the use of ArborX) and linear algebra. This presentation will show the interpolation and its use, as well as the performances of the current implementation. It will end with how I was introduced to HPC and Kokkos and how I will keep on using Kokkos in my later career.