An efficient method for obtaining the general solution for the force balance equations with hard point contacts

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

A compact formulation which is more efficient than the traditional pseudoinverse formulation for obtaining the general solution for the force balance equations has been presented in [1]. With hard point contacts considered, the force balance equations can be decomposed into two sets of rank 3, smaller linear equations if proper coordinate frames of the reference member and at the contact points are chosen. This decomposition, together with the compact formulation, can reduce the steps of the Gaussian elimination process, increase parallelism of the algorithm, and therefore, keep the computation time for obtaining the general solution for the force balance equations to a minimum.

Original languageEnglish
Pages (from-to)255-260
Number of pages6
JournalIEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Volume27
Issue number2
DOIs
Publication statusPublished - 1997 Dec 1

Fingerprint

Point contacts
Linear equations
Decomposition

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Artificial Intelligence
  • Human-Computer Interaction

Cite this

@article{1878bb5c1d04455bb9a403ff67a35674,
title = "An efficient method for obtaining the general solution for the force balance equations with hard point contacts",
abstract = "A compact formulation which is more efficient than the traditional pseudoinverse formulation for obtaining the general solution for the force balance equations has been presented in [1]. With hard point contacts considered, the force balance equations can be decomposed into two sets of rank 3, smaller linear equations if proper coordinate frames of the reference member and at the contact points are chosen. This decomposition, together with the compact formulation, can reduce the steps of the Gaussian elimination process, increase parallelism of the algorithm, and therefore, keep the computation time for obtaining the general solution for the force balance equations to a minimum.",
author = "Fan-Tien Cheng",
year = "1997",
month = "12",
day = "1",
doi = "10.1109/3477.558810",
language = "English",
volume = "27",
pages = "255--260",
journal = "IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics",
issn = "1083-4419",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

TY - JOUR

T1 - An efficient method for obtaining the general solution for the force balance equations with hard point contacts

AU - Cheng, Fan-Tien

PY - 1997/12/1

Y1 - 1997/12/1

N2 - A compact formulation which is more efficient than the traditional pseudoinverse formulation for obtaining the general solution for the force balance equations has been presented in [1]. With hard point contacts considered, the force balance equations can be decomposed into two sets of rank 3, smaller linear equations if proper coordinate frames of the reference member and at the contact points are chosen. This decomposition, together with the compact formulation, can reduce the steps of the Gaussian elimination process, increase parallelism of the algorithm, and therefore, keep the computation time for obtaining the general solution for the force balance equations to a minimum.

AB - A compact formulation which is more efficient than the traditional pseudoinverse formulation for obtaining the general solution for the force balance equations has been presented in [1]. With hard point contacts considered, the force balance equations can be decomposed into two sets of rank 3, smaller linear equations if proper coordinate frames of the reference member and at the contact points are chosen. This decomposition, together with the compact formulation, can reduce the steps of the Gaussian elimination process, increase parallelism of the algorithm, and therefore, keep the computation time for obtaining the general solution for the force balance equations to a minimum.

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

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

U2 - 10.1109/3477.558810

DO - 10.1109/3477.558810

M3 - Article

VL - 27

SP - 255

EP - 260

JO - IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

JF - IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

SN - 1083-4419

IS - 2

ER -