ABSTRACT. Recent research on discounting in long term economic models involves hyperbolic discounting, in which the marginal discount rate shrinks as time passes. To investigate hyperbolic discounting and exhaustible resource allocation, this work develops a discrete‐time world oil model and model solution procedure, then uses the model to examine the consequences of adopting conventional (constant annual) discounting when hyperbolic discounting is appropriate, of adopting one hyperbolic discount rate path when a different hyperbolic path is appropriate, and of adopting hyperbolic discounting when conventional discounting is appropriate. Five conventional and two hyperbolic discount rate paths are considered. One hyperbolic path is that used by Nordhaus and Boyer [2000]; the other is that recommended by Weitzman [2001]. The generality of the findings is also assessed. 相似文献
We establish the existence and stability of multidimensional transonic shocks for the Euler equations for steady potential compressible fluids. The Euler equations, consisting of the conservation law of mass and the Bernoulli law for the velocity, can be written as a second-order, nonlinear equation of mixed elliptic-hyperbolic type for the velocity potential. The transonic shock problem can be formulated into the following free boundary problem: The free boundary is the location of the transonic shock which divides the two regions of smooth flow, and the equation is hyperbolic in the upstream region where the smooth perturbed flow is supersonic. We develop a nonlinear approach to deal with such a free boundary problem in order to solve the transonic shock problem. Our results indicate that there exists a unique solution of the free boundary problem such that the equation is always elliptic in the downstream region and the free boundary is smooth, provided that the hyperbolic phase is close to a uniform flow. We prove that the free boundary is stable under the steady perturbation of the hyperbolic phase. We also establish the existence and stability of multidimensional transonic shocks near spherical or circular transonic shocks.
In this paper, we consider equilibrium problems and introduce the concept of (S)+ condition for bifunctions. Existence results for equilibrium problems with the (S)+ condition are derived. As special cases, we obtain several existence results for the generalized nonlinear variational inequality studied by Ding and Tarafdar (Ref. 1) and the generalized variational inequality studied by Cubiotti and Yao (Ref. 2). Finally, applications to a class of eigenvalue problems are given. 相似文献
The paper concerns conditioning aspects of finite-dimensional problems arising when the Tikhonov regularization is applied
to discrete ill-posed problems. A relation between the regularization parameter and the sensitivity of the regularized solution
is investigated. The main conclusion is that the condition number can be decreased only to the square root of that for the
nonregularized problem. The convergence of solutions of regularized discrete problems to the exact generalized solution is
analyzed just in the case when the regularization corresponds to the minimal condition number. The convergence theorem is
proved under the assumption of the suitable relation between the discretization level and the data error. As an example the
method of truncated singular value decomposition with regularization is considered.
This revised version was published online in July 2006 with corrections to the Cover Date. 相似文献
We introduce a new construction algorithm for digital nets for integration in certain weighted tensor product Hilbert spaces. The first weighted Hilbert space we consider is based on Walsh functions. Dick and Pillichshammer calculated the worst-case error for integration using digital nets for this space. Here we extend this result to a special construction method for digital nets based on polynomials over finite fields. This result allows us to find polynomials which yield a small worst-case error by computer search. We prove an upper bound on the worst-case error for digital nets obtained by such a search algorithm which shows that the convergence rate is best possible and that strong tractability holds under some condition on the weights.
We extend the results for the weighted Hilbert space based on Walsh functions to weighted Sobolev spaces. In this case we use randomly digitally shifted digital nets. The construction principle is the same as before, only the worst-case error is slightly different. Again digital nets obtained from our search algorithm yield a worst-case error achieving the optimal rate of convergence and as before strong tractability holds under some condition on the weights. These results show that such a construction of digital nets yields the until now best known results of this kind and that our construction methods are comparable to the construction methods known for lattice rules.
We conclude the article with numerical results comparing the expected worst-case error for randomly digitally shifted digital nets with those for randomly shifted lattice rules.
New explicit, zero dissipative, hybrid Numerov type methods are presented in this paper. We derive these methods using an alternative which avoids the use of costly high accuracy interpolatory nodes. We only need the Taylor expansion at some internal points then. The method is of sixth algebraic order at a cost of seven stages per step while their phase lag order is fourteen. The zero dissipation condition is satisfied, so the methods possess an non empty interval of periodicity. Numerical results over some well known problems in physics and mechanics indicate the superiority of the new method. 相似文献
We consider the problem of minimizing an SC1 function subject to inequality constraints. We propose a local algorithm whose distinguishing features are that: (a) a fast convergence rate is achieved under reasonable assumptions that do not include strict complementarity at the solution; (b) the solution of only linear systems is required at each iteration; (c) all the points generated are feasible. After analyzing a basic Newton algorithm, we propose some variants aimed at reducing the computational costs and, in particular, we consider a quasi-Newton version of the algorithm. 相似文献