Papers › Efficient and flexible MATLAB implementation of 2D and 3D elastoplastic problems
Efficient and flexible MATLAB implementation of 2D and 3D elastoplastic problems
Martin Čermák, Stanislav Sysala, Jan Valdman
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We propose an effective and flexible way to implement 2D and 3D elastoplastic problems in MATLAB using fully vectorized codes. Our technique is applied to a broad class of the problems including perfect plasticity or plasticity with hardening and several yield criteria. The problems are formulated in terms of displacements, discretized by the implicit Euler method in time and the finite element method in space, and solved by the semismooth Newton method. We discuss in detail selected models with the von Mises and Prager-Drucker yield criteria and four types of finite elements. The related codes are available for download. A particular interest is devoted to the assembling of tangential stiffness matrices. Since these matrices are repeatedly constructed in each Newton iteration and in each time step, we propose another vectorized assembling than current ones known for the elastic stiffness matrices. The main idea is based on a construction of two large and sparse matrices representing the strain-displacement and tangent operators, respectively, where the former matrix remains fixed and the latter one is updated only at some integration points. Comparisons with other available MATLAB codes show that our technique is also efficient for purely elastic problems. In elastoplasticity, the assembly times are linearly proportional to the number of integration points in a plastic phase and additional times due to plasticity never exceed assembly time of the elastic stiffness matrix.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections