Abstract
When using least squares to fit the linear model of coregionalization to multivariate geostatistical data, the sill matrices for the different regions must be estimated, subject to the constraint that they be non-negative definite. In 1992, Goulard and Voltz proposed and empirically examined an iterative algorithm for doing this. Although no proof was given for its convergence or for the uniqueness of the solution to the problem, the algorithm has subsequently been extensively and successfully used. In this paper, we prove that the minimization problem, in fact, has a unique solution and that the algorithm is guaranteed to converge to it from any starting point. We also discuss the effect of the starting point on the speed of convergence.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
