Owing to the fact that the conventional deterministic back analysis of the permeability coefficient cannot reflect the uncertainties of parameters, including the hydraulic head at the boundary, the permeability coeffi...Owing to the fact that the conventional deterministic back analysis of the permeability coefficient cannot reflect the uncertainties of parameters, including the hydraulic head at the boundary, the permeability coefficient and measured hydraulic head, a stochastic back analysis taking consideration of uncertainties of parameters was performed using the generalized Bayesian method. Based on the stochastic finite element method （SFEM） for a seepage field, the variable metric algorithm and the generalized Bayesian method, formulas for stochastic back analysis of the permeability coefficient were derived. A case study of seepage analysis of a sluice foundation was performed to illustrate the proposed method. The results indicate that, with the generalized Bayesian method that considers the uncertainties of measured hydraulic head, the permeability coefficient and the hydraulic head at the boundary, both the mean and standard deviation of the permeability coefficient can be obtained and the standard deviation is less than that obtained by the conventional Bayesian method. Therefore, the present method is valid and applicable.展开更多
In this paper, we discuss the convergence of the Broyden algorithms withrevised search direction. Under some inexact line searches, we prove that the algorithms areglobally convergent for continuously differentiable f...In this paper, we discuss the convergence of the Broyden algorithms withrevised search direction. Under some inexact line searches, we prove that the algorithms areglobally convergent for continuously differentiable functions and the rate of convergence of thealgorithms is one-step superlinear and n-step second-order for uniformly convex objective functions.展开更多
In this paper, we discuss the convergence of Broyden algorithms for the functions which are non-twice differentiable, but have LC gradient. We prove that the rate of convergence of the algorithms is linear for uniform...In this paper, we discuss the convergence of Broyden algorithms for the functions which are non-twice differentiable, but have LC gradient. We prove that the rate of convergence of the algorithms is linear for uniformly convex functions. We also demonstrate that under some mild conditions the algorithms are superlinsarly convergent.展开更多
基金supported by the National Natural Science Foundation of China (Grant No. 50579090)the National Basic Research Program of China (973 Program, Grant No. 2007CB714102)National Science and Technology Support Program of China (Program for the Eleventh Five-Year Plan, Grant No. 2006BAB04A06)
文摘Owing to the fact that the conventional deterministic back analysis of the permeability coefficient cannot reflect the uncertainties of parameters, including the hydraulic head at the boundary, the permeability coefficient and measured hydraulic head, a stochastic back analysis taking consideration of uncertainties of parameters was performed using the generalized Bayesian method. Based on the stochastic finite element method （SFEM） for a seepage field, the variable metric algorithm and the generalized Bayesian method, formulas for stochastic back analysis of the permeability coefficient were derived. A case study of seepage analysis of a sluice foundation was performed to illustrate the proposed method. The results indicate that, with the generalized Bayesian method that considers the uncertainties of measured hydraulic head, the permeability coefficient and the hydraulic head at the boundary, both the mean and standard deviation of the permeability coefficient can be obtained and the standard deviation is less than that obtained by the conventional Bayesian method. Therefore, the present method is valid and applicable.
基金This research is supported by Ministry of Education P. R. C.
文摘In this paper, we discuss the convergence of the Broyden algorithms withrevised search direction. Under some inexact line searches, we prove that the algorithms areglobally convergent for continuously differentiable functions and the rate of convergence of thealgorithms is one-step superlinear and n-step second-order for uniformly convex objective functions.
文摘In this paper, we discuss the convergence of Broyden algorithms for the functions which are non-twice differentiable, but have LC gradient. We prove that the rate of convergence of the algorithms is linear for uniformly convex functions. We also demonstrate that under some mild conditions the algorithms are superlinsarly convergent.
