Abstract

AbstractConvective‐scale data assimilation uses high‐resolution numerical weather prediction models and temporally and spatially dense observations of relevant atmospheric variables. In addition, it requires a data assimilation algorithm that is able to provide initial conditions for a state vector of large size with one third or more of its components containing prognostic hydrometeors variables whose non‐negativity needs to be preserved. The algorithm also needs to be fast as the state vector requires a high updating frequency in order to catch fast‐changing convection. A computationally efficient algorithm for quadratic optimization (QO, or formerly QP) is presented here, which preserves physical properties in order to represent features of the real atmosphere. Crucially for its performance, it exploits the fact that the resulting linear constraints may be disjoint. Numerical results on a simple model designed for testing convective‐scale data assimilation show accurate results and promising computational cost. In particular, if constraints on physical quantities are disjoint and their rank is small, further reduction in computational costs can be achieved.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.