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

Variational framework for distance-minimizing method in data-driven computational mechanics

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
70
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 35 publications
(70 citation statements)
references
References 38 publications
0
70
0
Order By: Relevance
“…The double minimization problem ( 19) is a combination of continuous and discrete optimization problems, the former over the continuous manifold E n+1 , the latter in the discrete data-set D. It has a combinatorial complexity, since for each material point m contributing to the global distance-function (18), n dp points can be evaluated and the minimum should be chosen among those. To efficiently solve this computationally intensive combinatorial problem, following [28,26], a staggered solution scheme is adopted here which freezes the continuous minimization problem while solving the discrete one and vice-versa. It assumes at an iteration k the optimum point in the data-set * y k n+1 ∈ D to be known and finds a closest state z n+1 k+1 ∈ E n+1 to that data-set point.…”
Section: Distance Minimizing Data-driven Problemmentioning
confidence: 99%
See 1 more Smart Citation
“…The double minimization problem ( 19) is a combination of continuous and discrete optimization problems, the former over the continuous manifold E n+1 , the latter in the discrete data-set D. It has a combinatorial complexity, since for each material point m contributing to the global distance-function (18), n dp points can be evaluated and the minimum should be chosen among those. To efficiently solve this computationally intensive combinatorial problem, following [28,26], a staggered solution scheme is adopted here which freezes the continuous minimization problem while solving the discrete one and vice-versa. It assumes at an iteration k the optimum point in the data-set * y k n+1 ∈ D to be known and finds a closest state z n+1 k+1 ∈ E n+1 to that data-set point.…”
Section: Distance Minimizing Data-driven Problemmentioning
confidence: 99%
“…In this work, following [13,16,26], a staggered distance-minimizing data-driven solver is adopted. It iteratively minimizes a quadratic distance function, defined on the material phasespace, while looking for a point in the data-set.…”
Section: Introductionmentioning
confidence: 99%
“…The RVE consists of two phases: (i) a circular inclusion and (m) a matrix surrounding the inclusion. Two phases are made of the Neo-Hookean materials that are characterized by the energy density (50) and the associated Young modulus and Poisson ratio. These material parameters are specialized to each phase…”
Section: Problem Settingmentioning
confidence: 99%
“…The microscopic BVPs are solved for 10 3 input macroscopic strain data ϵtrue‾ that are randomly distributed in the range [0,2] to compute the output data of macroenergy density. As the microscopic BVPs can be solved analytically as in Nguyen et al, 50 the material data can be easily collected. Thus, we used 10 3 data points for the high resolution of the macroscopic solution, although much less data could provide high‐quality solution.…”
Section: Representative Numerical Examplesmentioning
confidence: 99%
“…The stationary condition of Equation (12) yields the following data-driven variational equations (He and Chen, 2020;He et al, 2020b;Nguyen et al, 2020):…”
Section: Physical Solvermentioning
confidence: 99%