2,658 research outputs found

    Variational assimilation for xenon dynamical forecasts in neutronic using advanced background error covariance matrix modelling

    Get PDF
    Data assimilation method consists in combining all available pieces of information about a system to obtain optimal estimates of initial states. The different sources of information are weighted according to their accuracy by the means of error covariance matrices. Our purpose here is to evaluate the efficiency of variational data assimilation for the xenon induced oscillations forecasts in nuclear cores. In this paper we focus on the comparison between 3DVAR schemes with optimised background error covariance matrix B and a 4DVAR scheme. Tests were made in twin experiments using a simulation code which implements a mono-dimensional coupled model of xenon dynamics, thermal, and thermal–hydraulic processes. We enlighten the very good efficiency of the 4DVAR scheme as well as good results with the 3DVAR one using a careful multivariate modelling of B

    Antieigenvalues and antisingularvalues of a matrix and applications to problems in statistics

    Get PDF
    Let A be p × p positive definite matrix. A p-vector x such that Ax = x is called an eigenvector with the associated with eigenvalue . Equivalent characterizations are: (i) cos = 1, where is the angle between x and Ax. (ii) (x0Ax)−1 = xA−1x. (iii) cos = 1, where is the angle between A1/2x and A−1/2x. We ask the question what is x such that cos as defined in (i) is a minimum or the angle of separation between x and Ax is a maximum. Such a vector is called an anti-eigenvector and cos an anti-eigenvalue of A. This is the basis of operator trigonometry developed by K. Gustafson and P.D.K.M. Rao (1997), Numerical Range: The Field of Values of Linear Operators and Matrices, Springer. We may define a measure of departure from condition (ii) as min[(x0Ax)(x0A−1x)]−1 which gives the same anti-eigenvalue. The same result holds if the maximum of the angle between A1/2x and A−1/2x as in condition (iii) is sought. We define a hierarchical series of anti-eigenvalues, and also consider optimization problems associated with measures of separation between an r(< p) dimensional subspace S and its transform AS. Similar problems are considered for a general matrix A and its singular values leading to anti-singular values. Other possible definitions of anti-eigen and anti-singular values, and applications to problems in statistics will be presented
    corecore