I'm adding the ability for PyDDA to handle nested grids by having the horizontal boundary conditions of the inner nest be determined by the winds retrieved from the outer nest. The outer (coarse) nests retrieval is done first, then the inner nest retrievals are done using the boundary conditions and initialization from the coarse grid. I implement this using a pytree structure through a dictionary where the input grids, keyword arguments, and the retrieval's child grids can be specified. This therefore allows for an arbitrary number of inner grids at different locations, with an arbitrary number of nesting levels.
I'm adding the ability for PyDDA to handle nested grids by having the horizontal boundary conditions of the inner nest be determined by the winds retrieved from the outer nest. The outer (coarse) nests retrieval is done first, then the inner nest retrievals are done using the boundary conditions and initialization from the coarse grid. I implement this using a pytree structure through a dictionary where the input grids, keyword arguments, and the retrieval's child grids can be specified. This therefore allows for an arbitrary number of inner grids at different locations, with an arbitrary number of nesting levels.