نتایج جستجو برای: three step explicit rk method
تعداد نتایج: 2950567 فیلتر نتایج به سال:
Modelling spatial variability and uncertainty is a highly challenging subject in soiland geosciences. Regression kriging (RK) has several advantages; nevertheless it is not able to model the spatial uncertainty of the target variable. The main aim of this study is to present and test a sequential stochastic simulation approach based on regression kriging (SSSRK), which can be used to generate a...
the burgers’ equation is a simplified form of the navier-stokes equations that very well represents their non-linear features. in this paper, numerical methods of the adomian decomposition and the modified crank – nicholson, used for solving the one-dimensional burgers’ equation, have been compared. these numerical methods have also been compared with the analytical method. in contrast to...
objective: the study was designed to examine explicit memory bias in trait-anxiety and obsessive compulsive disorder. method: memory bias was examined in three groups of subjects: low-trait anxious (20 subjects), high-trait anxious (20 subjects), and obsessive compulsive patients (20 subjects) in whom danger schema were activated after they were exposed the threat-related material. the trait-a...
A differential reproducing kernel (DRK) approximation-based collocation method is developed for solving ordinary and partial differential equations governing the oneand two-dimensional problems of elastic bodies, respectively. In the conventional reproducing kernel (RK) approximation, the shape functions for the derivatives of RK approximants are determined by directly differentiating the RK ap...
Abstract This paper aims to developed a high-order and accurate method for the solution of one-dimensional Lotka-Volterra-diffusion with Numman boundary conditions. A fourth-order compact finite difference scheme spatial part combined implicit-explicit Runge Kutta in temporal are proposed. Furthermore, points discretized by using terms fourth order accuracy. key idea proposed is take full advan...
In this paper, we solve unconstrained optimization problem using a free line search steepest descent method. First, we propose a double parameter scaled quasi Newton formula for calculating an approximation of the Hessian matrix. The approximation obtained from this formula is a positive definite matrix that is satisfied in the standard secant relation. We also show that the largest eigen value...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید