Premium
Reduced order parameter estimation using quasilinearization and quadratic programming
Author(s) -
Siade Adam J.,
Putti Mario,
Yeh William W.G.
Publication year - 2012
Publication title -
water resources research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.863
H-Index - 217
eISSN - 1944-7973
pISSN - 0043-1397
DOI - 10.1029/2011wr011471
Subject(s) - linearization , quadratic programming , mathematical optimization , mathematics , subspace topology , estimation theory , convergence (economics) , quadratic equation , inverse problem , computation , algorithm , nonlinear system , mathematical analysis , physics , geometry , quantum mechanics , economics , economic growth
The ability of a particular model to accurately predict how a system responds to forcing is predicated on various model parameters that must be appropriately identified. There are many algorithms whose purpose is to solve this inverse problem, which is often computationally intensive. In this study, we propose a new algorithm that significantly reduces the computational burden associated with parameter identification. The algorithm is an extension of the quasilinearization approach where the governing system of differential equations is linearized with respect to the parameters. The resulting inverse problem therefore becomes a linear regression or quadratic programming problem (QP) for minimizing the sum of squared residuals; the solution becomes an update on the parameter set. This process of linearization and regression is repeated until convergence takes place. This algorithm has not received much attention, as the QPs can become quite large, often infeasible for real‐world systems. To alleviate this drawback, proper orthogonal decomposition is applied to reduce the size of the linearized model, thereby reducing the computational burden of solving each QP. In fact, this study shows that the snapshots need only be calculated once at the very beginning of the algorithm, after which no further calculations of the reduced‐model subspace are required. The proposed algorithm therefore only requires one linearized full‐model run per parameter at the first iteration followed by a series of reduced‐order QPs. The method is applied to a groundwater model with about 30,000 computation nodes where as many as 15 zones of hydraulic conductivity are estimated.