Picard iterations for a finite element shallow water equation model

ADCIRC, a finite element circulation model for shelves, coasts and estuaries, will be used for variational data assimilation. The nonlinear Euler–Lagrange (EL) problem will be solved using the iterated indirect representer algorithm. This algorithm makes such large, nonlinear but functionally smooth optimization problems feasible by iterating on linear approximations of the nonlinear problem (Picard iterations) and by making preconditioned searches in the “data subspace” at each iterate. Before solving the nonlinear EL using such Picard iterations, it essential that the iteration scheme be carefully examined within the framework of the nonassimilative or forward problem. rpose of this paper is (1) to detail a Picard iteration procedure for ADCIRC, including the problematic bottom friction term; (2) to examine the ability of the iteration scheme to recover the nonlinear forward solution from deficient background fields; and (3) to present a study of different interpolation methods for reducing the memory/disk requirements of the iteration scheme. The iteration scheme is shown to be quite robust in its ability to recover the nonlinear solution from a variety of deficient background fields. A new cubic Hermitian interpolation method is shown to be a more effective alternative to standard linear interpolation for reducing memory/disk requirements, especially for high frequency overtides.