Extended Divide-and-Conquer Algorithm for Uncertainty Analysis of Multibody Systems in Polynomial Chaos Expansion Framework

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

In this paper, an advanced algorithm is presented to efficiently form and solve the equations of motion of multibody problems involving uncertainty in the system parameters and/or excitations. Uncertainty is introduced to the system through the application of polynomial chaos expansion (PCE). In this scheme, states of the system, nondeterministic parameters, and constraint loads are projected onto the space of specific orthogonal base functions through modal values. Computational complexity of traditional methods of forming and solving the resulting governing equations drastically grows as a cubic function of the size of the nondeterministic system which is significantly larger than the original deterministic multibody problem. In this paper, the divide-and-conquer algorithm (DCA) will be extended to form and solve the nondeterministic governing equations of motion avoiding the construction of the mass and Jacobian matrices of the entire system. In this strategy, stochastic governing equations of motion of each individual body as well as those associated with kinematic constraints at connecting joints are developed in terms of base functions and modal terms. Then using the divide-and-conquer scheme, the entire system is swept in the assembly and disassembly passes to recursively form and solve nondeterministic equations of motion for modal values of spatial accelerations and constraint loads. In serial and parallel implementations, computational complexity of the method is expected to, respectively, increase as a linear and logarithmic function of the size.

Original languageEnglish (US)
Article number031015
JournalJournal of Computational and Nonlinear Dynamics
Volume11
Issue number3
DOIs
StatePublished - May 1 2016

Fingerprint

Divide-and-conquer Algorithm
Chaos Expansion
Polynomial Chaos
Uncertainty Analysis
Uncertainty analysis
Multibody Systems
Chaos theory
Equations of motion
Polynomials
Equations of Motion
Governing equation
Computational complexity
Jacobian matrices
Basis Functions
Computational Complexity
Entire
Uncertainty
Disassembly
Kinematics
Orthogonal Functions

ASJC Scopus subject areas

  • Mechanical Engineering
  • Applied Mathematics
  • Control and Systems Engineering

Cite this

@article{9b6bb6af21ff4912b871844ad04ae2e1,
title = "Extended Divide-and-Conquer Algorithm for Uncertainty Analysis of Multibody Systems in Polynomial Chaos Expansion Framework",
abstract = "In this paper, an advanced algorithm is presented to efficiently form and solve the equations of motion of multibody problems involving uncertainty in the system parameters and/or excitations. Uncertainty is introduced to the system through the application of polynomial chaos expansion (PCE). In this scheme, states of the system, nondeterministic parameters, and constraint loads are projected onto the space of specific orthogonal base functions through modal values. Computational complexity of traditional methods of forming and solving the resulting governing equations drastically grows as a cubic function of the size of the nondeterministic system which is significantly larger than the original deterministic multibody problem. In this paper, the divide-and-conquer algorithm (DCA) will be extended to form and solve the nondeterministic governing equations of motion avoiding the construction of the mass and Jacobian matrices of the entire system. In this strategy, stochastic governing equations of motion of each individual body as well as those associated with kinematic constraints at connecting joints are developed in terms of base functions and modal terms. Then using the divide-and-conquer scheme, the entire system is swept in the assembly and disassembly passes to recursively form and solve nondeterministic equations of motion for modal values of spatial accelerations and constraint loads. In serial and parallel implementations, computational complexity of the method is expected to, respectively, increase as a linear and logarithmic function of the size.",
author = "Mohammad Poursina",
year = "2016",
month = "5",
day = "1",
doi = "10.1115/1.4031573",
language = "English (US)",
volume = "11",
journal = "Journal of Computational and Nonlinear Dynamics",
issn = "1555-1415",
publisher = "American Society of Mechanical Engineers(ASME)",
number = "3",

}

TY - JOUR

T1 - Extended Divide-and-Conquer Algorithm for Uncertainty Analysis of Multibody Systems in Polynomial Chaos Expansion Framework

AU - Poursina, Mohammad

PY - 2016/5/1

Y1 - 2016/5/1

N2 - In this paper, an advanced algorithm is presented to efficiently form and solve the equations of motion of multibody problems involving uncertainty in the system parameters and/or excitations. Uncertainty is introduced to the system through the application of polynomial chaos expansion (PCE). In this scheme, states of the system, nondeterministic parameters, and constraint loads are projected onto the space of specific orthogonal base functions through modal values. Computational complexity of traditional methods of forming and solving the resulting governing equations drastically grows as a cubic function of the size of the nondeterministic system which is significantly larger than the original deterministic multibody problem. In this paper, the divide-and-conquer algorithm (DCA) will be extended to form and solve the nondeterministic governing equations of motion avoiding the construction of the mass and Jacobian matrices of the entire system. In this strategy, stochastic governing equations of motion of each individual body as well as those associated with kinematic constraints at connecting joints are developed in terms of base functions and modal terms. Then using the divide-and-conquer scheme, the entire system is swept in the assembly and disassembly passes to recursively form and solve nondeterministic equations of motion for modal values of spatial accelerations and constraint loads. In serial and parallel implementations, computational complexity of the method is expected to, respectively, increase as a linear and logarithmic function of the size.

AB - In this paper, an advanced algorithm is presented to efficiently form and solve the equations of motion of multibody problems involving uncertainty in the system parameters and/or excitations. Uncertainty is introduced to the system through the application of polynomial chaos expansion (PCE). In this scheme, states of the system, nondeterministic parameters, and constraint loads are projected onto the space of specific orthogonal base functions through modal values. Computational complexity of traditional methods of forming and solving the resulting governing equations drastically grows as a cubic function of the size of the nondeterministic system which is significantly larger than the original deterministic multibody problem. In this paper, the divide-and-conquer algorithm (DCA) will be extended to form and solve the nondeterministic governing equations of motion avoiding the construction of the mass and Jacobian matrices of the entire system. In this strategy, stochastic governing equations of motion of each individual body as well as those associated with kinematic constraints at connecting joints are developed in terms of base functions and modal terms. Then using the divide-and-conquer scheme, the entire system is swept in the assembly and disassembly passes to recursively form and solve nondeterministic equations of motion for modal values of spatial accelerations and constraint loads. In serial and parallel implementations, computational complexity of the method is expected to, respectively, increase as a linear and logarithmic function of the size.

UR - http://www.scopus.com/inward/record.url?scp=84947475276&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84947475276&partnerID=8YFLogxK

U2 - 10.1115/1.4031573

DO - 10.1115/1.4031573

M3 - Article

AN - SCOPUS:84947475276

VL - 11

JO - Journal of Computational and Nonlinear Dynamics

JF - Journal of Computational and Nonlinear Dynamics

SN - 1555-1415

IS - 3

M1 - 031015

ER -