Home  About us  Contact
 

Recursive Algorithms (recursive + algorithms)

Distribution by Scientific Domains
Engineering50%

Selected Abstracts

Recursive algorithms for unbalanced banded Toeplitz systems

NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, Issue 7 2009
P. Favati
Abstract Direct recursive algorithms for the solution of band Toeplitz systems are considered here. They exploit the displacement rank properties, which allow a large reduction of computational efforts and storage requirements. Their use of the Sherman,Morrison,Woodbury formula turns out to be particularly suitable for the case of unbalanced bandwidths. The computational costs of the algorithms under consideration are compared both in a theoretical and practical setting. Some stability issues are discussed as well. Copyright © 2009 John Wiley & Sons, Ltd. [source]

Simulation-based actuator selection for redundantly actuated robot mechanisms

JOURNAL OF FIELD ROBOTICS (FORMERLY JOURNAL OF ROBOTIC SYSTEMS), Issue 8 2002
Yong-Hoon Lee
This article presents a simulation-based strategy for sizing the actuators of a redundantly actuated robotic mechanism. The class of robotic mechanisms we consider may contain one or more closed loops and possess an arbitrary number of active and passive joints, and the number of actuators may exceed the mechanism's kinematic degrees of freedom. Our approach relies on a series of dynamic simulations of the mechanism, by applying Taguchi's method to systematically perform the simulations. To efficiently perform each of the dynamic simulations, we develop, using tools from modern screw theory, new recursive algorithms for the forward and inverse dynamics of the class of redundantly actuated mechanisms described. © 2002 Wiley Periodicals, Inc. [source]

Recursive algorithms for unbalanced banded Toeplitz systems

NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, Issue 7 2009
P. Favati
Abstract Direct recursive algorithms for the solution of band Toeplitz systems are considered here. They exploit the displacement rank properties, which allow a large reduction of computational efforts and storage requirements. Their use of the Sherman,Morrison,Woodbury formula turns out to be particularly suitable for the case of unbalanced bandwidths. The computational costs of the algorithms under consideration are compared both in a theoretical and practical setting. Some stability issues are discussed as well. Copyright © 2009 John Wiley & Sons, Ltd. [source]

Principal component analysis applied to filtered signals for maintenance management

QUALITY AND RELIABILITY ENGINEERING INTERNATIONAL, Issue 6 2010
Fausto Pedro García Márquez
Abstract This paper presents an approach for detecting and identifying faults in railway infrastructure components. The method is based on pattern recognition and data analysis algorithms. Principal component analysis (PCA) is employed to reduce the complexity of the data to two and three dimensions. PCA involves a mathematical procedure that transforms a number of variables, which may be correlated, into a smaller set of uncorrelated variables called ,principal components'. In order to improve the results obtained, the signal was filtered. The filtering was carried out employing a state,space system model, estimated by maximum likelihood with the help of the well-known recursive algorithms such as Kalman filter and fixed interval smoothing. The models explored in this paper to analyse system data lie within the so-called unobserved components class of models. Copyright © 2009 John Wiley & Sons, Ltd. [source]