2010
DOI: 10.1002/nme.3050
|View full text |Cite
|
Sign up to set email alerts
|

Efficient non‐linear model reduction via a least‐squares Petrov–Galerkin projection and compressive tensor approximations

Abstract: SUMMARYA Petrov-Galerkin projection method is proposed for reducing the dimension of a discrete non-linear static or dynamic computational model in view of enabling its processing in real time. The right reduced-order basis is chosen to be invariant and is constructed using the Proper Orthogonal Decomposition method. The left reduced-order basis is selected to minimize the two-norm of the residual arising at each Newton iteration. Thus, this basis is iteration-dependent, enables capturing of non-linearities, a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

3
633
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 556 publications
(664 citation statements)
references
References 40 publications
3
633
0
Order By: Relevance
“…This is particularly true in the proposed approach since the tensor,Q must be evaluated at each iteration. Over the years, various approximations to tensor products have been derived (Carlberg et al 2011;Wang & Ahuja 2008). In this paper, an alternative method to alleviate tensor computations is presented.…”
Section: Galerkin Mor Of the Navier Stokes Equationmentioning
confidence: 99%
“…This is particularly true in the proposed approach since the tensor,Q must be evaluated at each iteration. Over the years, various approximations to tensor products have been derived (Carlberg et al 2011;Wang & Ahuja 2008). In this paper, an alternative method to alleviate tensor computations is presented.…”
Section: Galerkin Mor Of the Navier Stokes Equationmentioning
confidence: 99%
“…It is important to remind that, even when the number of degrees of freedom is drastically reduced (from about 10 5 to a few dozen in our case), the nonlinearities may compromise the reduction of computational time if they are not correctly handled. A number of works have addressed this issue, see, e.g., (Carlberg et al, 2011;Grepl et al, 2007;Baiges et al, 2012;Wang et al, 2012;Yano et al, 2012;Grinberg et al, 2009;Grinberg, 2012). With the current implementation of our method, we observed a reduction of 20% to 30% of the CPU time with respect to the full order model.…”
Section: Reduced Vs Full Simulationsmentioning
confidence: 74%
“…In a first subset of these strategies, the nonlinear function is reconstructed by interpolation over an other POD basis ("gappy" technique) [5,34,51,36]. The expansion of the nonlinear term reads: Kerfriden …”
Section: Evaluation Of Nonlinear Terms On Reduced Spatial Domains-mentioning
confidence: 99%