The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
A new generation 99 line Matlab code for compliance topology optimization and its extension to 3D
Open accessAbstract
Compact and efficient Matlab implementations of compliance topology optimization (TO) for 2D and 3D continua are given, consisting of 99 and 125 lines respectively. On discretizations ranging from 3 ⋅ 104 to 4.8 ⋅ 105 elements, the 2D version, named top99neo, shows speedups from 2.55 to 5.5 times compared to the well-known top88 code of Andreassen et al. (Struct Multidiscip Optim 43(1):1–16, 2011). The 3D version, named top3D125, is the most compact and efficient Matlab implementation for 3D TO to date, showing a speedup of 1.9 times compared to the code of Amir et al. (Struct Multidiscip Optim 49(5):815–829, 2014), on a discretization with 2.2 ⋅ 105 elements. For both codes, improvements are due to much more efficient procedures for the assembly and implementation of filters and shortcuts in the design update step. The use of an acceleration strategy, yielding major cuts in the overall computational time, is also discussed, stressing its easy integration within the basic codes.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Horn, R. A., & Johnson, C. R. (2012) · doi:10.1017/cbo9781139020411 · Cited by 4,642
Material interpolation schemes in topology optimization
Bendsøe, M. P., & Sigmund, O. (1999) · Archive of Applied Mechanics (Ingenieur Archiv) · doi:10.1007/s004190050248 · Cited by 2,827
Self-citationA 99 line topology optimization code written in Matlab
Sigmund, O. (2001) · Structural and Multidisciplinary Optimization · doi:10.1007/s001580050176 · Cited by 2,688
Self-citationMultiplier and gradient methods
Hestenes, M. R. (1969) · Journal of Optimization Theory and Applications · doi:10.1007/bf00927673 · Cited by 2,446
Numerical Methods for Large Eigenvalue Problems: Revised Edition
Saad, Y. (2011) · doi:10.1137/1.9781611970739 · Cited by 2,364 · cited 1×
“Preconditioned iterative solvers, applied for example in (Amir and Sigmund, 2011; Amir et al, 2014) and (Ferrari et al, 2018; Ferrari and Sigmund, 2020) allow the solution of the state equation with nearly optimal efficiency (Saad, 1992).”
BackgroundOn projection methods, convergence and robust formulations in topology optimization
Wang, F., Lazarov, B. S., & Sigmund, O. (2011) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-010-0602-y · Cited by 1,859
Self-citationMorphology-based black and white filters for topology optimization
Sigmund, O. (2007) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-006-0087-x · Cited by 1,727
Self-citationEfficient topology optimization in MATLAB using 88 lines of code
Andreassen, E., Clausen, A., Schevenels, M., Lazarov, B. S., & Sigmund, O. (2010) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-010-0594-7 · Cited by 1,710
Self-citationTopology optimization of non-linear elastic structures and compliant mechanisms
Bruns, T. E., & Tortorelli, D. A. (2001) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/s0045-7825(00)00278-4 · Cited by 1,385
Guest, J. K., Prévost, J. H., & Belytschko, T. (2004) · International Journal for Numerical Methods in Engineering · doi:10.1002/nme.1064 · Cited by 1,300
Cited by
Topology optimization of multi-scale structures: a review
Wu, J., Sigmund, O., & Groen, J. P. (2021) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-021-02881-8 · Cited by 688
Self-citation
Metadata
- Authors
- Ferrari, F., & Sigmund, O.
- Venue
- Structural and Multidisciplinary Optimization
- Published
- 2020-08-24
- Volume
- 62
- Issue
- 4
- Pages
- 2211-2228
- ISSN
- 1615-147X (ISSN-L)
- 1615-1488
- OpenAlex
- W3024236378
- Cited by
- 265
- References
- 25
- FWCI
- 18.06
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A new generation 99 line Matlab code for compliance topology optimization and its extension to 3D. https://app.cochat.ai/papers/10.1007/s00158-020-02629-w
- The paper
- Ferrari, F., & Sigmund, O. (2020). A new generation 99 line Matlab code for compliance topology optimization and its extension to 3D. Structural and Multidisciplinary Optimization. https://doi.org/10.1007/s00158-020-02629-w
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.