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

Data‐driven computing in dynamics

Abstract: SUMMARYWe formulate extensions to Data Driven Computing for both distance minimizing and entropy maximizing schemes to incorporate time integration. Previous works focused on formulating both types of solvers in the presence of static equilibrium constraints. Here formulations assign data points a variable relevance depending on distance to the solution and on maximum-entropy weighting, with distance minimizing schemes discussed as a special case. The resulting schemes consist of the minimization of a suitably… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
108
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
9

Relationship

1
8

Authors

Journals

citations
Cited by 157 publications
(110 citation statements)
references
References 35 publications
(60 reference statements)
0
108
0
Order By: Relevance
“…The convergence properties of the fixed-point solver (13) have been investigated in [1]. The Data-Driven paradigm has been extended to dynamics [3], finite kinematics [34] and objective functions other than phase-space distance can be found in [2]. The well-posedness of Data-Driven problems and properties of convergence with respect to the data set have been investigated in [4].…”
Section: (12b)mentioning
confidence: 99%
“…The convergence properties of the fixed-point solver (13) have been investigated in [1]. The Data-Driven paradigm has been extended to dynamics [3], finite kinematics [34] and objective functions other than phase-space distance can be found in [2]. The well-posedness of Data-Driven problems and properties of convergence with respect to the data set have been investigated in [4].…”
Section: (12b)mentioning
confidence: 99%
“…Under the framework of the third approach, Kirchdoerfer and Ortiz [41][42][43] have proposed a material model-free data-driven method, so called distance-minimizing data-driven computing (DMDD), for modeling elasticity problems. This method is motivated by the fact that there exist two very different types of knowledge in the context of computational mechanics that need to be integrated.…”
Section: Introductionmentioning
confidence: 99%
“…The convergence properties of the fixed-point solver (13) have been investigated in [7]. The Data-Driven paradigm has been extended to dynamics [9], finite kinematics [13] and objective functions other than phase-space distance can be found in [8]. The well-posedness of Data-Driven problems and properties of convergence with respect to the data set have been investigated in [1].…”
Section: Data-driven Simulation Algorithmmentioning
confidence: 99%
“…Kirchdoerfer and Ortiz [7,8,9] have recently proposed a new class of problems in static and dynamic elasticity, referred to as Data-Driven problems, defined on the space of strain-stress field pairs, or phase space. The problems consist of minimizing the distance between a given material data set and the subspace of compatible strain fields and stress fields in equilibrium.…”
Section: Introductionmentioning
confidence: 99%