OpenResearchAlpha

Journal of Mechanical Design · 19 Nov 2026

Spectral Clustering for Large‐Scale Design Structure Matrices

Heekun Rohh-index 1, Johannes J. Norheim, Olivier L. de Weckh-index 45

0
Citations
no database records one yet
0
Citations in 2026
so far
45
Leading author's h-index
Olivier L. de Weck, in QAI's scholar index
28
References
works it cites, from open citation data

Citations by database

Each database indexes a different set of journals, preprints and books, so they are shown side by side rather than blended.

  • OpenCitations0
  • Crossref0

Citations per year

The current year is still counting.

  • 2026 so far0

Abstract

ABSTRACT This paper proposes applying a matrix spectra‐based method for clustering large‐scale Design Structure Matrices (DSMs), envisioned as a diagnostic tool for Extreme Designs (XDs). DSMs represent connectivity between system components, functions, or organizations, where clustering often reveals the system's modular and hierarchical structure. Clustering on DSMs—which also connects to the inherent “coupled‐ness” of the large‐scale engineering design—is especially important in managing the high complexity and uncertainty associated with XD. However, detecting the system cluster structure for complex systems is challenging due to the problem's inherent combinatorial and non‐unique nature. Prior methods targeted for DSM typically relied on randomized search (e.g., the widely‐used Idicula–Gutierrez–Thebeau Algorithm [IGTA]) or guaranteed optimality at the cost of high computational load and limited scalability (e.g., Mixed‐Integer Linear Programming [MILP]‐based methods). We illustrate that the spectral method, widely adapted in the image segmentation community, can also serve for clustering engineering—oriented DSMs, characterized by hierarchical structure and limited connections per parts. We demonstrate the spectral clustering method on DSM's normalized Laplacian, which corresponds to a relaxed maximization of the normalized modularity metric. Consequently, the suggested algorithm performs reasonably close to optimality while being computationally efficient on regular DSMs (15.1% loss in modularity with −99.978% reduction in computation time, on average against the optimal MILP method, for the jet engine DSM example) while demonstrating scalability handling up to 100,000 elements for synthetic, XD‐oriented DSMs. We compare the scalability and performance of this approach against established methods, including IGTA and MILP, to demonstrate its potential.

What the data shows

  • No database records a citation yet, as is usual for a paper this new.
  • Olivier L. de Weck has the highest h-index among the authors (45).

Graph

This paper in the middle, its authors and their most-cited papers below, the papers it cites to the left and the papers citing it to the right. The timeline lays every paper out by year.

Citing paper shares an authorAuthor without a profileSize shows citations, or h-index for authors

Select a node for its details. Drag to pan, scroll to zoom, drag a node to move it.

Start with

Authors (3)

Each author's standing in QAI's scholar index: the works their ORCID iD is attached to, and for anyone whose ORCID record names a lab OpenResearch follows, their arXiv preprints matched by name and a shared co-author. Names are as printed on the paper.

ProfileMost-cited paper

Cited by 0 papers

Who cites this paper, from open citation data, with Crossref's record of each; the 100 newest when there are more.

0 shown
No citing papers for this filter.

References (28)

What it cites, from open citation data, with Crossref's record of each.

Sign in to see 8 more references

A free account opens the rest of the citing papers and references on every paper’s page.