1995
DOI: 10.1115/1.2836453
|View full text |Cite
|
Sign up to set email alerts
|

Decomposition and Representation Methods in Mechanical Design

Abstract: The broad interest in concurrent engineering has inspired research in the area of decomposition in mechanical design. Much of the research reported in the literature falls into one of three categories: (1) product decomposition, (2) problem decomposition, or (3) process decomposition. This paper provides a detailed discussion of the typology of decomposition in mechanical design. Related work is described and examples are provided to illustrate the need for decomposition of products, problems, and processes in… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
20
0

Year Published

2005
2005
2022
2022

Publication Types

Select...
3
3
3

Relationship

0
9

Authors

Journals

citations
Cited by 65 publications
(20 citation statements)
references
References 17 publications
0
20
0
Order By: Relevance
“…In the world of design, there are three types of design decomposition, including product decomposition, problem decomposition and process decomposition (Kusiak & Larson, 1995).…”
Section: Problem Decomposition/recompositionmentioning
confidence: 99%
“…In the world of design, there are three types of design decomposition, including product decomposition, problem decomposition and process decomposition (Kusiak & Larson, 1995).…”
Section: Problem Decomposition/recompositionmentioning
confidence: 99%
“…The use of matrices and graphs to specify the partitioning becomes prohibitive for larger systems due to the large number of variables and functions. Alternative matrix and graph representations have appeared in research on the decomposition of the system design process into individual design tasks (see, e.g., Steward 1981;Eppinger et al 1994;Kusiak and Larson 1995;Browning 2001). The transfer of information between engineers defines precedence relations between the individual tasks that can be captured in matrices or graphs.…”
Section: Existing Approaches For Specification Of the Partitioned Promentioning
confidence: 99%
“…Several representations have appeared in research focused on model-based partitioning (see, e.g., Kusiak and Larson 1995;Krishnamachari and Papalambros 1997;Michelena and Papalambros 1997;Chen et al 2005). Model-based partitioning methods typically rely on matrix or graph abstractions of the couplings between variables and functions to define a sparsity structure of the integrated problem (1).…”
Section: Existing Approaches For Specification Of the Partitioned Promentioning
confidence: 99%
“…Some examples of coordination algorithms include optimization algorithms (e.g., Collaborative Optimization (CO) [4]), fixed point iteration (e.g., Analytical Target Cascading (ATC) [5]), Newton's method (e.g., ATC [6]), and penalty methods (e.g., ATC and Augmented Lagrangian Decomposition (ALD) [7]). Distributed methods are appropriate when systems are large and sparsely connected [8], when the design environment is distributed [9], or when specialized optimization algorithms can be exploited for solving particular subproblems [10,11]. The techniques introduced in this article can be used to assess quantitatively whether distributed optimization is appropriate for a particular problem.…”
Section: Decomposition-based System Designmentioning
confidence: 99%