20th Structures, Structural Dynamics, and Materials Conference 1979
DOI: 10.2514/6.1979-747
|View full text |Cite
|
Sign up to set email alerts
|

Reduced basis technique for nonlinear analysis of structures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
188
0
3

Year Published

1990
1990
2016
2016

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 136 publications
(191 citation statements)
references
References 14 publications
0
188
0
3
Order By: Relevance
“…In this simple interpretation, this is certainly not a recent idea and initial work grew out of two related lines of inquiry: one focusing on the need for effective, many-query design evaluation [44], and one from the desire for efficient parameter continuation methods for nonlinear problems [4,114,115,117].…”
Section: Historical Background and Perspectivesmentioning
confidence: 99%
“…In this simple interpretation, this is certainly not a recent idea and initial work grew out of two related lines of inquiry: one focusing on the need for effective, many-query design evaluation [44], and one from the desire for efficient parameter continuation methods for nonlinear problems [4,114,115,117].…”
Section: Historical Background and Perspectivesmentioning
confidence: 99%
“…The essential acceleration ingredients are Galerkin projection onto a low dimensional space associated with an optimally sampled smooth parametric manifold [1,5,12,14] -rapid convergence; rigorous a posteriori error bounds for the field variable and associated functional outputs of interest -reliability and control; and Offline-Online computational decomposition strategies -rapid response in the real-time and many-query contexts. In the Online stage, given a new parameter value, we rapidly calculate the reduced basis (output) approximation and associated reduced basis error bound: the operation count is independent of N and depends only on N N and Q; here Q is the number of terms in the affine parameter expansion of the operator.…”
Section: Introductionmentioning
confidence: 99%
“…The method takes its roots in domain decomposition methods and reduced basis discretizations (Fink & Rheinboldt (1983), Noor & Peters (1980), Prud'homme et al (2002)), and its applications extend to, for example, control and optimization problems. The basic idea is to first decompose the computational domain into a series of subdomains that are similar to a few reference domains (or generic computational parts).…”
mentioning
confidence: 99%