2010
DOI: 10.1016/j.cma.2010.01.009
|View full text |Cite
|
Sign up to set email alerts
|

A priori model reduction through Proper Generalized Decomposition for solving time-dependent partial differential equations

Abstract: International audienceOver the past years, model reduction techniques have become a necessary path for the reduction of computational requirements in the numerical simulation of complex models. A family of a priori model reduction techniques, called Proper Generalized Decomposition (PGD) methods, are receiving a growing interest. These methods rely on the a priori construction of separated variables representations of the solution of models defined in tensor product spaces. They can be interpreted as generaliz… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
276
0
2

Year Published

2011
2011
2019
2019

Publication Types

Select...
7
2

Relationship

1
8

Authors

Journals

citations
Cited by 226 publications
(281 citation statements)
references
References 35 publications
2
276
0
2
Order By: Relevance
“…While some progress has been made in this area, in particular with greedy sampling approaches, further work is needed to develop methods that exploit system structure to avoid the curse of dimensionality. Promising recent efforts towards this goal use tensor techniques [182,186]. The combination of tensor calculus [125] and parametric model reduction techniques for timedependent problems is still in its infancy, but offers a promising research direction.…”
Section: Equation-free Model Reductionmentioning
confidence: 99%
“…While some progress has been made in this area, in particular with greedy sampling approaches, further work is needed to develop methods that exploit system structure to avoid the curse of dimensionality. Promising recent efforts towards this goal use tensor techniques [182,186]. The combination of tensor calculus [125] and parametric model reduction techniques for timedependent problems is still in its infancy, but offers a promising research direction.…”
Section: Equation-free Model Reductionmentioning
confidence: 99%
“…Relation (29) means that once the algorithm has converged L W E can be viewed as the local macrobehavior near the calculated solution, defined over I ÂŒ Âœ0; T and in each subdomain X E . This behavior establishes a relation between a small perturbation in terms of macrodisplacements and a small perturbation in terms of macroforces.…”
Section: Discussion Of the Computation And Storage Costsmentioning
confidence: 99%
“…A priori model reduction techniques [42] do not require any knowledge of the solution and operate in an iterative way, where a set of simple problems, that can be seen as pseudo eigenvalue problems, need to be solved. They are based on the proper generalized decomposition (PGD) [8,43] where the deterministic vectors and stochastic functions in (6) are initially unknown and computed at the same time.…”
Section: A Priori Techniquesmentioning
confidence: 99%