Journal
MATHEMATICS AND COMPUTERS IN SIMULATION
Volume 81, Issue 4, Pages 791-810Publisher
ELSEVIER
DOI: 10.1016/j.matcom.2010.07.015
Keywords
Multidimensional models; Curse of dimensionality; Parametric models; Proper Generalized Decompositions; Separated representations
Ask authors/readers for more resources
This paper focuses on the efficient solution of models defined in high dimensional spaces. Those models involve numerous numerical challenges because of their associated curse of dimensionality. It is well known that in mesh-based discrete models the complexity (degrees of freedom) scales exponentially with the dimension of the space. Many models encountered in computational science and engineering involve numerous dimensions called configurational coordinates. Some examples are the models encountered in biology making use of the chemical master equation, quantum chemistry involving the solution of the Schrodinger or Dirac equations, kinetic theory descriptions of complex systems based on the solution of the so-called Fokker-Planck equation, stochastic models in which the random variables are included as new coordinates, financial mathematics, etc. This paper revisits the curse of dimensionality and proposes an efficient strategy for circumventing such challenging issue. This strategy, based on the use of a Proper Generalized Decomposition, is specially well suited to treat the multidimensional parametric equations. (C) 2010 IMACS. Published by Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available