Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ Institut National de...arrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Hal
Article . 2013
Data sources: Hal
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ProdInra
Article . 2013
License: CC BY SA
Data sources: ProdInra
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
HAL INRAE
Article . 2013
Data sources: HAL INRAE
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Computational Economics
Article . 2012 . Peer-reviewed
License: Springer TDM
Data sources: Crossref
versions View all 6 versions
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

Comparing Numerical Methods for Solving the Competitive Storage Model

Authors: Gouel, Christophe;

Comparing Numerical Methods for Solving the Competitive Storage Model

Abstract

Cet article compare les méthodes numériques permettant de résoudre le modèle de stockage compétitif. Puisque le stockage implique une contrainte de non-négativité des stocks, les méthodes de résolution doivent être choisies avec soin. Le modèle est résolu par itération sur la fonction valeur et à l'aide de plusieurs méthodes de projection, incluant la paramétrisation des anticipations et l'approximation des règles de décisions. En considérant aussi un modèle de stockage avec rendement d'opportunité, dans lequel la contrainte d'inégalité est lissée, des méthodes de perturbation sont aussi appliquées. La paramétrisation des anticipations est la méthode la plus précise, alors que les méthodes de perturbation se montrent inadaptées pour résoudre ce modèle très non-linéaire. La méthode de grille endogène permet une résolution très rapide si l'offre est supposée inélastique.

This paper compares numerical methods for solving the competitive storage model. Because storage implies a nonnegativity constraint on stocks, the solution methods must be considered carefully. The model is solved using value function iteration and several projection approaches, including parameterised expectations and decision rules approximation. In considering a storage model with convenience yield, in which the inequality constraint is smoothed, perturbation methods are also applied. Parameterised expectations approximation proves to be the most accurate method, whereas perturbation techniques are shown inadequate for solving this highly nonlinear model. The endogenous grid method allows rapid solution if supply is assumed to be inelastic.

Country
France
Keywords

Binding constraint, Nonlinear rational expectations models, Binding constraint;Nonlinear rational expectations models;Numerical methods, Binding constraint, Nonlinear rational expectations models, Numerical methods, paramètre du modèle, paramétrisation, stockagecontrainte paramétriquecoût de stockage, coût de stockage, stockage, JEL: E - Macroeconomics and Monetary Economics/E.E3 - Prices, [SHS.ECO]Humanities and Social Sciences/Economics and Finance, JEL: D - Microeconomics/D.D8 - Information, Business Fluctuations, Economies et finances, JEL: C - Mathematical and Quantitative Methods/C.C6 - Mathematical Methods • Programming Models • Mathematical and Simulation Modeling/C.C6.C63 - Computational Techniques • Simulation Modeling, Economies and finances, paramétrisation, contrainte paramétrique, Knowledge, and Cycles/E.E3.E37 - Forecasting and Simulation: Models and Applications, paramètre du modèle, and Uncertainty/D.D8.D84 - Expectations • Speculations, 518, Numerical methods, Binding constraint,Nonlinear rational expectations models,Numerical methods, [SHS.ECO] Humanities and Social Sciences/Economics and Finance

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    13
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
13
Average
Average
Average
Green
bronze
Related to Research communities
INRAE