Approximate Decoupling of the Equations of Motion of Linear Underdamped Systems

1988 ◽  
Vol 55 (3) ◽  
pp. 716-720 ◽  
Author(s):  
S. M. Shahruz ◽  
F. Ma

One common procedure in the solution of a normalized damped linear system with small off-diagonal damping elements is to replace the normalized damping matrix by a selected diagonal matrix. The extent of approximation introduced by this method of decoupling the system is evaluated, and tight error bounds are derived. Moreover, if the normalized damping matrix is diagonally dominant, it is shown that decoupling the system by neglecting the off-diagonal elements indeed minimizes the error bound.

1993 ◽  
Vol 60 (3) ◽  
pp. 695-701 ◽  
Author(s):  
J. H. Hwang ◽  
F. Ma

A common procedure in the solution of a nonclassically damped linear system is to neglect the off-diagonal elements of the associated modal damping matrix. For a large-scale system, substantial reduction in computational effort is achieved by this method of decoupling the system. In the present paper, the error introduced by disregarding the off-diagonal elements is evaluated, and a quadrature formula for the approximation error is derived. A tight error bound is then obtained. In addition, an effective scheme to improve the accuracy of the approximate solution is outlined.


Author(s):  
F. Ma ◽  
J. H. Hwang

One common procedure in the solution of a damped linear systems with small off-diagonal damping elements is to neglect the off-diagonal elements of the normalized damping matrix. The extent of approximation introduced by this method of decoupling the system is evaluated, and tight error bounds are derived by alternative techniques. An effective procedure to improve the accuracy of the approximate solution is outlined.


2019 ◽  
Vol 17 (1) ◽  
pp. 1599-1614
Author(s):  
Zhiwu Hou ◽  
Xia Jing ◽  
Lei Gao

Abstract A new error bound for the linear complementarity problem (LCP) of Σ-SDD matrices is given, which depends only on the entries of the involved matrices. Numerical examples are given to show that the new bound is better than that provided by García-Esnaola and Peña [Linear Algebra Appl., 2013, 438, 1339–1446] in some cases. Based on the obtained results, we also give an error bound for the LCP of SB-matrices. It is proved that the new bound is sharper than that provided by Dai et al. [Numer. Algor., 2012, 61, 121–139] under certain assumptions.


Author(s):  
F. Ma ◽  
J. H. Hwang

Abstract In analyzing a nonclassically damped linear system, one common procedure is to neglect those damping terms which are nonclassical, and retain the classical ones. This approach is termed the method of approximate decoupling. For large-scale systems, the computational effort at adopting approximate decoupling is at least an order of magnitude smaller than the method of complex modes. In this paper, the error introduced by approximate decoupling is evaluated. A tight error bound, which can be computed with relative ease, is given for this method of approximate solution. The role that modal coupling plays in the control of error is clarified. If the normalized damping matrix is strongly diagonally dominant, it is shown that adequate frequency separation is not necessary to ensure small errors.


2020 ◽  
Vol 13 (1) ◽  
pp. 1-15
Author(s):  
Tesfaye Kebede Enyew ◽  
Gurju Awgichew ◽  
Eshetu Haile ◽  
Gashaye Dessalew Abie

Although large and sparse linear systems can be solved using iterative methods, its number of iterations is relatively large. In this case, we need to modify the existing methods in order to get approximate solutions in a small number of iterations. In this paper, the modified method called second-refinement of Gauss-Seidel method for solving linear system of equations is proposed. The main aim of this study was to minimize the number of iterations, spectral radius and to increase rate of convergence. The method can also be used to solve differential equations where the problem is transformed to system of linear equations with coefficient matrices that are strictly diagonally dominant matrices, symmetric positive definite matrices or M-matrices by using finite difference method. As we have seen in theorem 1and we assured that, if A is strictly diagonally dominant matrix, then the modified method converges to the exact solution. Similarly, in theorem 2 and 3 we proved that, if the coefficient matrices are symmetric positive definite or M-matrices, then the modified method converges. And moreover in theorem 4 we observed that, the convergence of second-refinement of Gauss-Seidel method is faster than Gauss-Seidel and refinement of Gauss-Seidel methods. As indicated in the examples, we demonstrated the efficiency of second-refinement of Gauss-Seidel method better than Gauss-Seidel and refinement of Gauss-Seidel methods.


Author(s):  
Matthias Morzfeld ◽  
Nopdanai Ajavakom ◽  
Fai Ma

A common approximation in the analysis of non-classically damped systems is to ignore the off-diagonal elements of the modal damping matrix. This procedure is termed the decoupling approximation. It is generally believed that errors due to the decoupling approximation should be negligible if the modal damping matrix is diagonally dominant. In addition, the errors are expected to decrease as the modal damping matrix becomes more diagonally dominant. It is shown numerically in this paper that, over a finite range, errors due to the decoupling approximation can increase monotonically at any specified rate while the modal damping matrix becomes more diagonally dominant with its off-diagonal elements decreasing continuously in magnitude. These unexpected drifts in errors due to the decoupling approximation can be observed at any driving frequency. Small off-diagonal elements in the modal damping matrix may not be sufficient to ensure small errors due to the decoupling approximation. Error-criteria based solely upon diagonal dominance of the modal damping matrix cannot be accurate.


1962 ◽  
Vol 29 (1) ◽  
pp. 7-14 ◽  
Author(s):  
R. M. Rosenberg

A system of n masses, equal or not, interconnected by nonlinear “symmetric” springs, and having n degrees of freedom is examined. The concept of normal modes is rigorously defined and the problem of finding them is reduced to a geometrical maximum-minimum problem in an n-space of known metric. The solution of the geometrical problem reduces the coupled equations of motion to n uncoupled equations whose natural frequencies can always be found by a single quadrature. An infinite class of systems, of which the linear system is a member, has been isolated for which the frequency amplitude can be found in closed form.


2014 ◽  
Vol 118 (1207) ◽  
pp. 1009-1038 ◽  
Author(s):  
S. Ismail ◽  
A. A. Pashilkar ◽  
R. Ayyagari ◽  
N. Sundararajan

Abstract A novel formulation of the flight dynamic equations is presented that permits a rapid solution for the design of trajectory following autopilots for nonlinear aircraft dynamic models. A robust autopilot control structure is developed based on the combination of the good features of the nonlinear dynamic inversion (NDI) method, integrator backstepping method, time scale separation and control allocation methods. The aircraft equations of motion are formulated in suitable variables so that the matrices involved in the block backstepping control design method are diagonally dominant. This allows us to use a linear controller structure for a trajectory following autopilot for the nonlinear aircraft model using the well known loop by loop controller design approach. The resulting autopilot for the fixed-wing rigid-body aircraft with a cascaded structure is referred to as the diagonally dominant backstepping (DDBS) controller. The method is illustrated here for an aircraft auto-landing problem under unknown actuator failures and severe winds. The requirement of state and control surface limiting is also addressed in the context of the design of the DDBS controller.


2009 ◽  
Vol 35 ◽  
pp. 193-234 ◽  
Author(s):  
R. El-Yaniv ◽  
D. Pechyony

We develop a technique for deriving data-dependent error bounds for transductive learning algorithms based on transductive Rademacher complexity. Our technique is based on a novel general error bound for transduction in terms of transductive Rademacher complexity, together with a novel bounding technique for Rademacher averages for particular algorithms, in terms of their "unlabeled-labeled" representation. This technique is relevant to many advanced graph-based transductive algorithms and we demonstrate its effectiveness by deriving error bounds to three well known algorithms. Finally, we present a new PAC-Bayesian bound for mixtures of transductive algorithms based on our Rademacher bounds.


Sign in / Sign up

Export Citation Format

Share Document