Efficient multi-partition topology optimization

@article{Koppen2022EfficientMT,
  title={Efficient multi-partition topology optimization},
  author={Stijn Koppen and Matthijs Langelaar and Fred van Keulen},
  journal={ArXiv},
  year={2022},
  volume={abs/2111.04619}
}
1 Citations

Efficient computation of states and sensitivities for compound structural optimisation problems using a Linear Dependency Aware Solver (LDAS)

This work proposes using a Linear Dependency Aware Solver (LDAS) to detect and exploit linear dependencies between encountered physical and adjoint loads to solve structural optimisation problems.

References

SHOWING 1-10 OF 38 REFERENCES

On multigrid-CG for efficient topology optimization

A computational approach that facilitates the efficient solution of 3-D structural topology optimization problems on a standard PC by exploiting specific characteristics of a multigrid preconditioned conjugate gradients (MGCG) solver.

Large-scale parallel topology optimization using a dual-primal substructuring solver

Issues and difficulties arising when a state-of-the-art parallel linear solver is applied to topology optimization problems and attempts to improve it by applying additional scaling and/or preconditioning strategies are discussed.

Topology optimization of hierarchical lattice structures with substructuring

Topology optimization for the computationally poor: efficient high resolution procedures using beam modeling

The reduced computational effort facilitates the optimization of high resolution structures without separating to micro and macro scales, hence non-uniform and non-periodic porous structures can be designed in a single-level optimization process.

Three-Dimensional Shape Optimization with Substructuring

The substructure or superelement formulation used in the finite element technique was employed for threedimensional shape optimization problems. In a design process, one often encounters the

Approximate reanalysis in topology optimization

This study investigates the integration of an approximate reanalysis procedure into the framework of topology optimization of continuum structures and shows that relatively rough approximations are acceptable since the errors are taken into account in the sensitivity analysis.

Revisiting approximate reanalysis in topology optimization: on the advantages of recycled preconditioning in a minimum weight procedure

It is shown that integrating recycled preconditioning into a minimum weight problem formulation can lead to a more efficient procedure than the common minimum compliance approach.