Abstract:
The present invention provides an actually-measured marine environment data assimilation method based on sequence recursive filtering three-dimensional variation. The method includes: preprocessing actually-measured marine environment data; calculating a target function value; calculating a gradient value of a target function; calculating a minimum value of the target function; extracting space multi-scale information from the actually-measured data; and updating background field data to form a final data assimilation analysis field. The present invention improves the traditional recursive filtering three-dimensional variation method, and sequentially assimilates information with different scales, thereby effectively overcoming the problem that multi-scale information cannot be effectively extracted by a traditional three-dimensional variation method. A high-order recursive Gaussian filter is used, and a cascaded form of the high-order recursive filter is converted into a parallel structure, so that the recursive filtering process of the recursive Gaussian filter can be executed in parallel, and many problems caused by a cascaded filter are overcome.

Description:
TECHNICAL FIELD 
       [0001]    The present invention relates to an actually-measured marine environment data assimilation method, and in particular, to an actually-measured marine environment data assimilation method based on sequence recursive filtering three-dimensional variation. 
       BACKGROUND 
       [0002]    An ocean is an activity space of an underwater vehicle, and thermocline, internal waves and other meso- and micro-scale ocean processes in the ocean directly threat the navigation safety of the underwater vehicle and affect the smooth implementation of its tasks. Thus, real-time construction of a navigation environment field around the underwater vehicle and rapid diagnosis of the meso-micro scale ocean processes have important significance. Currently, the marine environment data are mainly obtained in two ways, one way is to calculate by a numerical model, but the data can only approximately reflect the regular features of the marine environment field and are difficult to extract the meso-micro scale ocean processes; and the other way is to directly measure by a sensor, such data are the most direct observation with higher precision to the marine environment field and contain important marine information. However, due to the limitation of observation equipment and the random variation of physical quantity of an observation point, an observation result has unavoidable systematic errors and random errors. Thus, the data obtained in the two ways have their own advantages and disadvantages. 
         [0003]    A data assimilation method is a method combining observation data with a theoretical model, which is developed with the development of numerical calculation and numerical forecast business. It combines observation data obtained by different observation measures in different spaces, different times and with a mathematical model according to a certain optimization criteria and method, and establishes an optimal relation in which the model and the data coordinate with each other. By means of the data assimilation technology, effective information contained in the observation data can be maximally extracted to enhance and improve the performance of an analysis and forecast system. Therefore, the real-time observation data are combined with a theoretical model result by data assimilation to absorb the both advantages, and thus an approximately actual marine environment state field can be constructed. Three-dimensional variation is a common ocean data assimilation method. In the three-dimensional variation assimilation, a background field error covariance matrix plays an important role, which determines the degree of correction of an analysis field relative to a background field. One of the main problems researched by the traditional three-dimensional variation assimilation method is how to better construct the background field error covariance matrix. At present, there are mainly two three-dimensional variation assimilation methods, one is a correlation length method, and the other is a recursive filtering method. The correlation length method is used for constructing the background field error covariance matrix. However, the method has great randomness in the practical application, and it is difficult to give an accurate estimate on the relevant scale. Meanwhile, the method requires a huge internal memory and a huge calculation overhead. The recursive filtering method does not require explicit construction of the error covariance matrix, and compared with the correlation length method, the recursive filtering method has the advantages of high calculation speed and capability of saving the internal memory. But the correlation length method and the recursive filtering method have common defects, that is, it is difficult to effectively extract the multi-scale observation information. Thus, for the demands of the underground navigation of the underwater vehicle on the surrounding marine environment field, an efficient actually-measured marine environment data assimilation method is designed, which has an important practical value on the real-time construction of an underwater environment state field and the fast extraction of a multi-scale ocean process. 
       SUMMARY 
       [0004]    The object of the present invention is to provide an actually-measured marine environment data assimilation method based on sequence recursive filtering three-dimensional variation, which can realize the real-time construction of an underwater environment state field and the fast extraction of a multi-scale ocean process. 
         [0005]    The object of the present invention is achieved in this way: 
         [0006]    Step 1, carrying out quality control and preprocessing on actually-measured marine environment data 
         [0007]    filtering out invalid data and abnormal data in the actually-measured data at first, and then converting the actually-measured data into a format necessary for assimilation; 
         [0008]    step 2, calculating a target function value 
         [0009]    calculating the target function value by adopting the actually-measured marine environment data preprocessed in the last step and background field data by a parallel recursive filter by means of giving a filtering parameter; 
         [0010]    step 3, calculating a gradient value of a target function 
         [0011]    calculating the gradient value of the target function based on the target function value and a source code of a gradient of the target function generated by a tangent and adjoint model compiler; 
         [0012]    step 4, calculating a minimum value of the target function 
         [0013]    inputting the target function value and the gradient value of the target function in an LBFGS minimization algorithm to calculate the minimum value of the target function, wherein a state variable corresponding to the minimum value is a long wave estimate of observation data; 
         [0014]    step 5, extracting space multi-scale information from the actually-measured data 
         [0015]    subtracting the long wave estimate obtained in the step 4 from the actually-measured marine environment data to serve as new actually-measured data, adjusting the filtering parameter to decrease the same, meanwhile, replacing the actually-measured marine environment data in the step 2 with the new actually-measured data, and repeating the step 2 to the step 4 to sequentially extract the space multi-scale information from the actually-measured data; and 
         [0016]    step 6, updating the background field data 
         [0017]    updating the background field data to form a final data assimilation analysis field. 
         [0018]    The present invention provides an actually-measured marine environment data assimilation technology based on sequence recursive filtering three-dimensional variation. Compared with the actually-measured marine environment data assimilation technology adopting a traditional three-dimensional variation method, the present invention has the distinguishing features that the filtering parameter a is gradually changed to sequentially extract observation information with different scales. That is, at first, a larger value of a is taken, so the width of a frequency window of the filter becomes narrow, only long wave (low frequency) information can pass through, and the long wave estimate can be obtained by the assimilation of the recursive filtering method; then, the obtained long wave estimate is subtracted from the actually-measured marine environment data to serve as the new actually-measured data, the a is properly adjusted to decrease the same, so the width of the frequency window of the filter becomes wide, secondary long wave information can pass through, and a secondary long wave estimate is obtained by assimilation; and so on, the information of different wavebands is gradually extracted. The method provided by the present invention can overcome the problem that the multi-scale information cannot be effectively extracted by a traditional three-dimensional variation method. 
         [0019]    The present invention has the following advantages: 
         [0000]    (1) The traditional recursive filtering three-dimensional variation method is improved, and the information with different scales is assimilated in sequence to effectively overcome the problem that the multi-scale information cannot be effectively extracted by a traditional three-dimensional variation method.
 
(2) A high-order recursive Gaussian filter is used, and a cascaded form of the high-order recursive filter is converted into a parallel structure, so that the recursive filtering process of the recursive Gaussian filter can be executed in parallel, and many problems caused by a cascaded filter are overcome.
 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0020]      FIG. 1  is a flowchart of actually-measured marine environment data assimilation. 
           [0021]      FIG. 2  is an execution flowchart of sequence recursive filtering three-dimensional variation. 
       
    
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS 
       [0022]    The present invention will be described below in more detail by examples. 
         [0023]    In combination with  FIG. 1 , the present invention mainly includes the following steps: Step 1, preprocessing actually-measured marine environment data 
         [0024]    In order to assimilate the actually-measured marine environment data in a background field database, at first, quality control of the actually-measured data is carried out to filter out invalid data and abnormal data in the actually-measured data, and then the actually-measured data after the quality control are converted into a format necessary for assimilation, for example, a common ASCII format or a binary storage format. 
         [0025]    Step 2, calculating a target function value 
         [0026]    The target function value is calculated by adopting the actually-measured marine environment data preprocessed in the last step and background field data by a parallel recursive filter by means of giving a filtering parameter. 
         [0027]    Step 3, calculating a gradient value of a target function 
         [0028]    The gradient value of the target function is calculated based on the target function value and a source code of a gradient of the target function generated by a tangent and adjoint model compiler. 
         [0029]    Step 4, calculating a minimum value of the target function 
         [0030]    The target function value and the gradient value of the target function are input in an LBF GS (limited memory Broyden-Fletcher-Glodfarb-Shanno) minimization algorithm to calculate the minimum value of the target function, wherein a state variable corresponding to the minimum value is a long wave estimate of observation data. 
         [0031]    Step 5, extracting space multi-scale information from the actually-measured data 
         [0032]    The long wave estimate obtained in the step 4 is subtracted from the actually-measured marine environment data to serve as new actually-measured data, the filtering parameter is adjusted to decrease it, meanwhile, the actually-measured marine environment data in the step 2 are replaced by the new actually-measured data, and the step 2 to the step 4 are repeated to sequentially extract secondary long wave and short wave information from the actually-measured data. 
         [0033]    Step 6, updating the background field data 
         [0034]    The background field data are updated to form a final data assimilation analysis field. 
         [0035]    The present invention will be described below in more detail in combination with  FIG. 2 . 
         [0036]    Step 1, carrying out preprocessing and quality control on actually-measured marine environment data 
         [0037]    In order to eliminate errors and irregular data contained in the observation data as much as possible, preprocessing and quality control are carried out on the actually-measured marine environment data firstly. In the present invention, the preprocessing and quality control of the data are completed by the following six steps: area test, repeated depth test, depth inverse test, temperature data range test, temperature and salinity gradient test and density stability test. 
         [0038]    Step 1.1, area test 
         [0039]    In order to locate the actually-measured marine environment data within a certain range around an underwater vehicle, the area test needs to be carried out, the test method adopted in the present invention is an area search method, that is, if the actually-measured marine environment data are within a longitude and latitude range selected by a user, the actually-measured marine environment data are retained, and if the actually-measured marine environment data are beyond the range, it is removed, and the data range can be set according to the demand of the user. 
         [0040]    Step 1.2, repeated depth test 
         [0041]    In order to remove repeated depth data from an observation profile, the repeated depth test needs to be carried out. The test method adopted in the present invention is a linear search method, that is, for each observation profile, if repeated depth data are searched from the profile, the repeated depth data are marked, a human-computer interaction test is carried out, and one repeated profile is removed according to the principle of continuity and consistency of the marine environment data on the same depth layer with upper and lower layers. 
         [0042]    Step 1.3, depth inverse test 
         [0043]    In order to check whether a virtual depth inverse exists in the observation data, the depth inverse test needs to be carried out. The test method adopted in the present invention is the linear search method, when depth inverse data are found, the depth inverse data are marked, the human-computer interaction test is further carried out, and the marine environment data of an effective depth layer are retained in combination with the observation data of the upper and lower layers and the surrounding observation data. 
         [0044]    Step 1.4, data range test of temperature and salinity 
         [0045]    In order to ensure that no extreme value occurs in temperature and salinity observation data, the data range test needs to be carried out. The test method adopted in the present invention is a comparison test method, that is, a maximum temperature and salinity range and a minimum temperature and salinity range of each sea area are counted and given in advance, if the temperature and salinity observation data exceed the ranges, the temperature and salinity observation data are removed. 
         [0046]    Step 1.5, temperature and salinity gradient test 
         [0047]    In order to ensure that no extreme value occurs in a temperature and salinity observation profile gradient, the gradient test needs to be carried out. The test method adopted in the present invention is the comparison test method, that is, a maximum gradient value range of temperature and salinity of each sea area is counted and given in advance, if the temperature and salinity observation data exceed the range, the temperature and salinity observation data are removed. 
         [0048]    Step 1.6, density stability test 
         [0049]    In order to ensure that no virtual density inverse occurs in the observation profile data, the density stability test needs to be carried out. The test method adopted in the present invention is the linear search method, that is, the density value of each layer is compared from top to bottom, if the density of the lower layer is smaller than the density of the upper layer, the lower layer is marked, the human-computer interaction test is further carried out, the authenticity of the density inverse is judged in combination with the marine environment features of the observation area and the historical observation data of the sea area, if the density inverse is true, the density inverse is retained, and otherwise, the density inverse is removed. 
         [0050]    Step 1.7, preprocessing the actually-measured marine environment data after the quality control 
         [0051]    The actually-measured data after the quality control in the step 1.1 to the step 1.6 are converted into a format necessary for assimilation, for example, a common ASCII format or a binary storage format, to serve as an input interface of the next data assimilation process. 
         [0052]    Step 2, calculating a target function value of sequence recursive filtering three-dimensional variation 
         [0053]    In order to calculate a minimum value of a target function to obtain an optimal estimate of a state variable of the observation data, the target function value needs to be calculated in advance. The specific calculation method is as follows: 
         [0054]    step 2.1, defining the target function 
         [0055]    In order to avoid an inverse of a background field error covariance matrix with a very large calculating amount, the target function adopted in the present invention is: 
         [0000]        J ( w )=½ w   y   Bw+ ½( HBw−d ) y   O   −1 ( HBw−d )
 
         [0000]    wherein, J represents the target function, w=B −1 (x−x b ), B represents the background field error covariance matrix, x b  represents a background field (generally a forecast field) vector, and x represents the state variable. O represents an observation field error covariance matrix, H represents an interpolation operator from a mode grid to an observation point, d=y−Hx b , and y represents a measurement vector. The background field is obtained by data assimilation step forward integration by an ocean numerical model. A control variable of the target function is w. 
         [0056]    Step 2.2, giving an initial estimated value of w 
         [0057]    According to the expression of the target function, before the optional w is obtained by an optimization algorithm, an initial estimated value of w needs to be given. In the present invention, the initial estimated value of the w is set as 0, according to a calculation formula of the w in the step 2.1, when the initial estimated value of the w is set as 0, the initial estimated value of the state variable is indirectly set as the value x b  of the background field. 
         [0058]    Step 2.3, calculating Bw by parallel recursive filtering 
         [0059]    A calculation process of Bw is simulated by a parallel recursive filter in the present invention, and a transfer function S (z) of the parallel recursive filter is defined as: 
         [0000]        S ( z )= S   1 ( z )+ S   2 ( z )+ S   3 ( z )+ S   4 ( z ) 
         [0060]    the filter is actually a low-order parallel form converted from a four-order van Vliet recursive Gauss filter. Wherein, the function S i (z)(i=1, 2, 3, 4) is calculated according to the following formula: 
         [0000]    
       
         
           
             
               
                 S 
                 1 
               
                
               
                 ( 
                 z 
                 ) 
               
             
             = 
             
               
                 
                   
                     e 
                     1 
                   
                    
                   z 
                 
                 + 
                 
                   f 
                   1 
                 
               
               
                 
                   ( 
                   
                     z 
                     - 
                     
                       d 
                       1 
                     
                   
                   ) 
                 
                  
                 
                   ( 
                   
                     z 
                     - 
                     
                       d 
                       2 
                     
                   
                   ) 
                 
               
             
           
         
       
       
         
           
             
               
                 S 
                 2 
               
                
               
                 ( 
                 z 
                 ) 
               
             
             = 
             
               
                 
                   
                     e 
                     2 
                   
                    
                   z 
                 
                 + 
                 
                   f 
                   2 
                 
               
               
                 
                   ( 
                   
                     z 
                     - 
                     
                       d 
                       3 
                     
                   
                   ) 
                 
                  
                 
                   ( 
                   
                     z 
                     - 
                     
                       d 
                       4 
                     
                   
                   ) 
                 
               
             
           
         
       
       
         
           
             
               
                 S 
                 3 
               
                
               
                 ( 
                 z 
                 ) 
               
             
             = 
             
               
                 
                   
                     e 
                     3 
                   
                    
                   z 
                 
                 + 
                 
                   f 
                   3 
                 
               
               
                 
                   ( 
                   
                     1 
                     - 
                     
                       
                         d 
                         1 
                       
                        
                       z 
                     
                   
                   ) 
                 
                  
                 
                   ( 
                   
                     1 
                     - 
                     
                       
                         d 
                         2 
                       
                        
                       z 
                     
                   
                   ) 
                 
               
             
           
         
       
       
         
           
             
               
                 S 
                 4 
               
                
               
                 ( 
                 z 
                 ) 
               
             
             = 
             
               
                 
                   
                     e 
                     4 
                   
                    
                   z 
                 
                 + 
                 
                   f 
                   4 
                 
               
               
                 
                   ( 
                   
                     1 
                     - 
                     
                       
                         d 
                         3 
                       
                        
                       z 
                     
                   
                   ) 
                 
                  
                 
                   ( 
                   
                     1 
                     - 
                     
                       
                         d 
                         4 
                       
                        
                       z 
                     
                   
                   ) 
                 
               
             
           
         
       
     
         [0061]    wherein, e i , f i (i=1, 2, 3, 4) represents an undetermined coefficient, and it can be known by calculation that: 
         [0000]        e   1 =2 Re ( c   1 ),  f   1 =−2 Re ( c   1   d   2 )
 
         [0000]        e   2 =2 Re ( c   2 ),  f   2 =−2 Re ( c   2   d   2 )
 
         [0000]        e   3 =2 Re ( c   3   d   3 ),  f   3 =−2 Re ( c   3 )
 
         [0000]        e   4 =2 Re ( c   4   d   4 ),  f   4 =−2 Re ( c   4 )
 
         [0062]    wherein, Re(.) represents taking a real part of a complex number, c i , d i (i=1, 2, 3, 4) represents an undetermined coefficient, and it can be known by calculation that: 
         [0000]    
       
         
           
             
               c 
               1 
             
             = 
             
               S_ 
                
               
                 
                   ( 
                   
                     d 
                     1 
                   
                   ) 
                 
                 · 
                 
                   
                     α 
                      
                     
                         
                     
                      
                     
                       d 
                       1 
                       4 
                     
                   
                   
                     
                       ( 
                       
                         
                           d 
                           1 
                         
                         - 
                         
                           d 
                           2 
                         
                       
                       ) 
                     
                      
                     
                       ( 
                       
                         
                           d 
                           1 
                         
                         - 
                         
                           d 
                           3 
                         
                       
                       ) 
                     
                      
                     
                       ( 
                       
                         
                           d 
                           1 
                         
                         - 
                         
                           d 
                           4 
                         
                       
                       ) 
                     
                   
                 
               
             
           
         
       
       
         
           
             
               c 
               2 
             
             = 
             
               S_ 
                
               
                 
                   ( 
                   
                     d 
                     3 
                   
                   ) 
                 
                 · 
                 
                   
                     α 
                      
                     
                         
                     
                      
                     
                       d 
                       3 
                       4 
                     
                   
                   
                     
                       ( 
                       
                         
                           d 
                           3 
                         
                         - 
                         
                           d 
                           1 
                         
                       
                       ) 
                     
                      
                     
                       ( 
                       
                         
                           d 
                           3 
                         
                         - 
                         
                           d 
                           2 
                         
                       
                       ) 
                     
                      
                     
                       ( 
                       
                         
                           d 
                           3 
                         
                         - 
                         
                           d 
                           4 
                         
                       
                       ) 
                     
                   
                 
               
             
           
         
       
       
         
           
             
               c 
               3 
             
             = 
             
               
                 c 
                 1 
               
                
               
                 d 
                 1 
                 
                   - 
                   1 
                 
               
             
           
         
       
       
         
           
             
               c 
               4 
             
             = 
             
               
                 c 
                 2 
               
                
               
                 d 
                 3 
                 
                   - 
                   1 
                 
               
             
           
         
       
       
         
           
             
               
                 
                   
                     
                       
                         d 
                         1 
                       
                        
                       
                         ( 
                         σ 
                         ) 
                       
                     
                     = 
                     
                       
                         
                           d 
                           1 
                         
                          
                         
                           ( 
                           
                             σ 
                             0 
                           
                           ) 
                         
                       
                       
                         1 
                         q 
                       
                     
                   
                 
               
               
                 
                   
                     
                       
                         d 
                         2 
                       
                        
                       
                         ( 
                         σ 
                         ) 
                       
                     
                     = 
                     
                       
                         d 
                         1 
                         * 
                       
                        
                       
                         ( 
                         σ 
                         ) 
                       
                     
                   
                 
               
               
                 
                   
                     
                       
                         d 
                         3 
                       
                        
                       
                         ( 
                         σ 
                         ) 
                       
                     
                     = 
                     
                       
                         
                           d 
                           3 
                         
                          
                         
                           ( 
                           
                             σ 
                             0 
                           
                           ) 
                         
                       
                       
                         1 
                         q 
                       
                     
                   
                 
               
               
                 
                   
                     
                       
                         d 
                         4 
                       
                        
                       
                         ( 
                         σ 
                         ) 
                       
                     
                     = 
                     
                       
                         d 
                         3 
                         * 
                       
                        
                       
                         ( 
                         σ 
                         ) 
                       
                     
                   
                 
               
             
             , 
             
               q 
               = 
               
                 σ 
                 
                   σ 
                   0 
                 
               
             
             , 
             
               
                 
                   
                     
                       
                         d 
                         1 
                       
                        
                       
                         ( 
                         
                           σ 
                           0 
                         
                         ) 
                       
                     
                     = 
                     
                       1.13228 
                       + 
                       
                         1.28114 
                          
                         
                             
                         
                          
                         i 
                       
                     
                   
                 
               
               
                 
                   
                     
                       
                         d 
                         2 
                       
                        
                       
                         ( 
                         
                           σ 
                           0 
                         
                         ) 
                       
                     
                     = 
                     
                       d 
                       1 
                       * 
                     
                   
                 
               
               
                 
                   
                     
                       
                         d 
                         3 
                       
                        
                       
                         ( 
                         
                           σ 
                           0 
                         
                         ) 
                       
                     
                     = 
                     
                       1.78534 
                       - 
                       
                         0.46763 
                          
                         
                             
                         
                          
                         i 
                       
                     
                   
                 
               
               
                 
                   
                     
                       
                         d 
                         4 
                       
                        
                       
                         ( 
                         
                           σ 
                           0 
                         
                         ) 
                       
                     
                     = 
                     
                       d 
                       3 
                       * 
                     
                   
                 
               
             
             , 
             
               
                 σ 
                 0 
               
               = 
               2 
             
             , 
             
               σ 
               &gt; 
               0 
             
             , 
           
         
       
     
         [0063]    superscript “*” represents conjugate, and a represents a filtering parameter. 
         [0064]    Wherein, S −1  (z) (z=d 1 , d 3 ) represents the transfer function of the four-order van Vliet recursive Gauss filter, and the expression thereof is as follows: 
         [0000]    
       
         
           
             
               
                 S 
                 
                   - 
                   1 
                 
               
                
               
                 ( 
                 z 
                 ) 
               
             
             = 
             
               α 
               
                 1 
                 + 
                 
                   
                     ∑ 
                     
                       i 
                       = 
                       1 
                     
                     4 
                   
                    
                   
                       
                   
                    
                   
                     
                       b 
                       i 
                     
                      
                     
                       z 
                       i 
                     
                   
                 
               
             
           
         
       
     
         [0065]    in the above formula, the expressions of b i (i=1, 2, 3, 4) and α are as follows: 
         [0000]    
       
         
           
             
               b 
               1 
             
             = 
             
               - 
               
                 
                   ∏ 
                   
                     i 
                     = 
                     1 
                   
                   4 
                 
                  
                 
                     
                 
                  
                 
                   
                     d 
                     i 
                     
                       - 
                       1 
                     
                   
                    
                   
                     
                       ∑ 
                       
                         i 
                         = 
                         3 
                       
                       4 
                     
                      
                     
                         
                     
                      
                     
                       
                         ∑ 
                         
                           j 
                           = 
                           2 
                         
                         
                           i 
                           - 
                           1 
                         
                       
                        
                       
                           
                       
                        
                       
                         
                           ∑ 
                           
                             k 
                             = 
                             1 
                           
                           
                             j 
                             - 
                             1 
                           
                         
                          
                         
                             
                         
                          
                         
                           
                             d 
                             i 
                           
                            
                           
                             d 
                             j 
                           
                            
                           
                             d 
                             k 
                           
                         
                       
                     
                   
                 
               
             
           
         
       
       
         
           
             
               b 
               2 
             
             = 
             
               - 
               
                 
                   ∏ 
                   
                     i 
                     = 
                     1 
                   
                   4 
                 
                  
                 
                     
                 
                  
                 
                   
                     d 
                     i 
                     
                       - 
                       1 
                     
                   
                    
                   
                     
                       ∑ 
                       
                         i 
                         = 
                         2 
                       
                       4 
                     
                      
                     
                         
                     
                      
                     
                       
                         ∑ 
                         
                           j 
                           = 
                           1 
                         
                         
                           i 
                           - 
                           1 
                         
                       
                        
                       
                         
                           d 
                           i 
                         
                          
                         
                           d 
                           j 
                         
                       
                     
                   
                 
               
             
           
         
       
       
         
           
             
               b 
               3 
             
             = 
             
               - 
               
                 
                   ∏ 
                   
                     i 
                     = 
                     1 
                   
                   4 
                 
                  
                 
                     
                 
                  
                 
                   
                     d 
                     i 
                     
                       - 
                       1 
                     
                   
                    
                   
                     
                       ∑ 
                       
                         i 
                         = 
                         1 
                       
                       4 
                     
                      
                     
                       d 
                       i 
                     
                   
                 
               
             
           
         
       
       
         
           
             
               b 
               4 
             
             = 
             
               - 
               
                 
                   ∏ 
                   
                     i 
                     = 
                     1 
                   
                   4 
                 
                  
                 
                     
                 
                  
                 
                   d 
                   i 
                   
                     - 
                     1 
                   
                 
               
             
           
         
       
       
         
           
             
               α 
               = 
               
                 1 
                 + 
                 
                   
                     ∑ 
                     
                       i 
                       = 
                       1 
                     
                     4 
                   
                    
                   
                     b 
                     i 
                   
                 
               
             
             ; 
           
         
       
     
         [0066]    Step 2.4, calculating an observation increment: d=y−Hx b    
         [0067]    H represents a bilinear interpolation operator, and a mode space is mapped into an observation space by the H. In the present invention, the H is calculated by a bilinear inverse distance method, namely, when state values of four grid points on a unit grid of the mode are interpolated in an observation position in the unit grid, physical distances from the four grid points to the observation point are calculated firstly, and then, weighted average is carried out on the state values of the four mode grids with inverse ratios of the distances as weights to obtain the state value of the observation position. 
         [0068]    Step 2.5, calculating the target function value J(w) 
         [0069]    The values of w, Bw and d calculated in the steps 2.2, 2.3 and 2.4 are brought in the target function determined in the step 2.1 to calculate the target function value. 
         [0070]    Step 3, calculating a gradient value of the target function 
         [0071]    To calculate a minimum value of the target function to control the optimal estimate of a control variable, the gradient value of the target function to w needs to be calculated in advance. The specific calculation method is as follows: 
         [0072]    step 3.1, defining a gradient of the target function the calculation formula of the gradient of the target function adopted in the present invention is as follows: 
         [0000]      ∇ J=B ( w−H   T   O   −1 ( d−HBw ))
 
         [0073]    wherein, the superscript “T” represents transposition, and the meanings of other symbols are consistent with those in the calculation formula of the target function defined in the step 2.1. 
         [0074]    Step 3.2 generating a source code of the gradient of the target function based on a tangent and adjoint model compiler 
         [0075]    Since a recursive filtering algorithm is needed when the target function value is calculated, it is difficult to directly calculate the gradient of the target function by the definition. For the convenience of calculation, a Fortran calculation source code for calculating the target function is input in the TAMC, and the compiler automatically returns a Fortran source code of the gradient of the target function. 
         [0076]    Step 3.3, calculating the gradient value ∇J of the target function 
         [0077]    The gradient value of the target function to the w will be obtained by operating the Fortran source code of the gradient of the target function calculated in the step 3.2. 
         [0078]    Step 4, calculating the minimum value of the target function 
         [0079]    To obtain the optimal estimate of the control variable, the minimum value of the target function needs to be calculated. The specific calculation method is as follows: 
         [0080]    step 4.1, inputting the target function value and the gradient value of the target function in an LBFGS (limited memory Broyden-Fletcher-Glodfarb-Shanno) minimization algorithm; 
         [0081]    step 4.2, automatically determining a feasible descent direction and a search step length at the control variable by the minimization algorithm according to the gradient value and the target function value, wherein the feasible descent direction and the search step length are used for determining an initial value of the control variable of next linear search in the optimization algorithm; and step 4.3, updating the control variable w by the analysis field obtained by the optimization algorithm, calculating the gradient value ∇J of the target function again, judging whether the gradient meets a convergence criteria at the moment, and if not, repeating the steps 4.1 to 4.2, continuing to calculate until the convergence criteria is met; if the gradient meets the convergence criteria, logging out the calculation, wherein the value of a state variable x corresponding to the minimum value obtained at the moment is the optimal estimate of the background field, namely the analysis field. The optimal estimate is optimal under the least-square meaning. 
         [0082]    The convergence criteria adopted in the present invention is as follows: 
         [0083]    |∇j∥∇J 0 |&lt;0.01, wherein, ∇J 0  represents the gradient value of the target function in the first iteration. 
         [0084]    Step 5, extracting space multi-scale information from the actually-measured data 
         [0085]    In order to extract the multi-scale marine environment information from the observation data, a sequence recursive filtering process needs to be carried out. The specific calculation method is as follows: 
         [0086]    step 5.1, calculating x new =Bw new  by the recursive Gauss filter in the step 2.3; 
         [0087]    step 5.2, subtracting the long wave estimate obtained in the step 5.1 from the observation data to serve as new observation data, that is, d=d−Hx new . The observation data herein refer to a margin obtained by subtracting the long wave estimate obtained in the step 5.1 from the preprocessed observation value obtained in the step 1; 
         [0088]    step 5.3, adjusting the value of a to decrease it, that is, making σ=σ (m) &lt;σ (m-1) ; 
         [0089]    wherein a decreases in an exponential decay mode, for example, σ=σ/2 M-1 , wherein M represents a circulation times, which is generally 8; 
         [0090]    step 5.4, judging whether a termination condition is satisfied; if not, recording the current state variable x, and turning to the step 2; and if the termination condition is satisfied, turning to a step 6. 
         [0091]    Whether the circulation times satisfy a set time M is used as the termination condition. The circulation times M is generally 8, and at this time, the a value is reduced to 0.7% of the initial value a. 
         [0092]    Step 6, updating the background field data 
         [0093]    The state variable x obtained in each circulation among the M times of circulation in the step 5 is accumulated to obtain the final analysis field, and then a data assimilation process is completed. The analysis field can be used as a data field for reflecting the current marine environment state.