A preconditioning algorithm for largescale minimization problems
 Publisher: CoAction Publishing
 Journal: Tellus A (issn: 16000870)

Related identifiers: doi: 10.3402/tellusa.v45i5.15048
A new preconditioning algorithm is proposed, employing a Taylor series expansion of the costfunction, and the relation between the adjustment of the control variable and the computed gradient norm. The preconditioning matrix is a positive definite diagonal matrix, being a product of two positive definite diagonal matrices. One is the weight matrix related to the Hessian matrix definition in the case of identity model operator (“rough” scaling), and the other matrix is interpreted as a refined scaling of the control variable. The procedure is quite easy to implement, and the computer time and space requirements are negligible. The algorithm was tested in two cases of realistic fourdimensional variational data assimilation experiments, performed using an adiabatic version of the NMC's new regional forecast model and operationally obtained optimal interpolation analyses. Test results show a significant improvement in the decrease of the costfunction and the gradient norm when using the new preconditioning procedure. The preconditioning was applied to a memoryless quasiNewton method, however, the technique should be applicable to other minimization algorithms.DOI: 10.1034/j.16000870.1993.00011.x

Similar Research Results
(6)

Metrics
No metrics available
Share  Bookmark

 Download from


Cite this publication