Efficient data structures for model-free data-driven computational mechanics
DOI10.1016/j.cma.2021.113855zbMath1506.74002arXiv2012.00357OpenAlexW3160498511MaRDI QIDQ2237265
R. Eggersmann, Michael Ortiz, Stefanie Reese, Laurent Stainier
Publication date: 27 October 2021
Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.00357
data structuresdata sciencesolid mechanicsapproximate nearest-neighbor searchdata-driven computingnearest neighbor problem
Finite element methods applied to problems in solid mechanics (74S05) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Mathematical modeling or simulation for problems pertaining to mechanics of deformable solids (74-10)
Related Items (14)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Refinements to nearest-neighbor searching in k-dimensional trees
- Satisfying general proximity/similarity queries with metric trees
- Quad trees: A data structure for retrieval by composite keys
- Model-free data-driven inelasticity
- Data-driven fracture mechanics
- Data-driven finite elasticity
- Data driven computing with noisy material data sets
- Data-based derivation of material response
- Non-parametric material state field extraction from full field measurements
- Data-driven computational mechanics
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- An Automatic Method for Solving Discrete Programming Problems
- Multidimensional binary search trees used for associative searching
- A Branch and Bound Algorithm for Computing k-Nearest Neighbors
- An Algorithm for Finding Best Matches in Logarithmic Expected Time
- Random Forests and Adaptive Nearest Neighbors
This page was built for publication: Efficient data structures for model-free data-driven computational mechanics