A parallel adaptive treecode algorithm for evolution of elastically stressed solids
From MaRDI portal
Recommendations
- An adaptive treecode algorithm for computing the evolution of microstructures in an elastic media
- Large-scale simulations of microstructural evolution in elastically stressed solids.
- A Treecode Algorithm for 3D Stokeslets and Stresslets
- Variable order revised binary treecode
- Cyclically parallelized treecode for fast computations of electrostatic interactions on molecular surfaces
Cited in
(15)- A treecode algorithm for the Poisson equation in a general domain with unstructured grids
- A kernel-independent treecode based on barycentric Lagrange interpolation
- A kernel-free boundary integral method for elliptic PDEs on a doubly connected domain
- Large-scale simulations of microstructural evolution in elastically stressed solids.
- An efficient adaptive rescaling scheme for computing moving interface problems
- Parallel adaptive computation of some time-dependent materials-related microstructural problems
- A Treecode Algorithm for 3D Stokeslets and Stresslets
- Learning domain-independent Green's function for elliptic partial differential equations
- A three-layer Hele-Shaw problem driven by a sink
- An efficient rescaling algorithm for simulating the evolution of multiple elastically stressed precipitates
- A massively parallel explicit solver for elasto-dynamic problems exploiting octree meshes
- Sharp-interface problem of the Ohta-Kawasaki model for symmetric diblock copolymers
- An adaptive treecode algorithm for computing the evolution of microstructures in an elastic media
- A fourth-order kernel-free boundary integral method for the modified Helmholtz equation
- scientific article; zbMATH DE number 7600704 (Why is no real title available?)
This page was built for publication: A parallel adaptive treecode algorithm for evolution of elastically stressed solids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5372205)
