A new method for predicting response in complex linear systems

1975 ◽  
Vol 38 (3) ◽  
pp. 373-385 ◽  
Author(s):  
K.W. Kayser ◽  
J.L. Bogdanoff
Keyword(s):  
Linear Systems ◽  
New Method ◽  
Complex Linear

A new method for predicting response in complex linear systems II

1977 ◽  
Vol 53 (4) ◽  
pp. 459-469 ◽  
Author(s):  
J.L. Bogdanoff ◽  
K. Kayser ◽  
W. Krieger
Keyword(s):  
Linear Systems ◽  
New Method ◽  
Complex Linear

On the rectangular fuzzy complex linear systems

2020 ◽  
Vol 91 ◽  
pp. 106196 ◽  
Author(s):  
M. Ghanbari ◽  
T. Allahviranloo ◽  
W. Pedrycz
Keyword(s):  
Linear Systems ◽  
Complex Linear

scholarly journals Design of regular positive and stable descriptor systems via state-feedbacks for descriptor continuous-time linear systems with singular pencils

2014 ◽  
Vol 24 (3) ◽  
pp. 289-297
Author(s):  
Tadeusz Kaczorek
Keyword(s):  
Linear Systems ◽  
Continuous Time ◽  
Special Form ◽  
The State ◽  
New Method ◽  
Descriptor Systems ◽  
Descriptor System ◽  
Asymptotically Stable ◽  
Numerical Example ◽  
Time Linear

Abstract A new method is proposed of design of regular positive and asymptotically stable descriptor systems by the use of state-feedbacks for descriptor continuous-time linear systems with singular pencils. The method is based on the reduction of the descriptor system by elementary row and column operations to special form. A procedure for the design of the state-feedbacks gain matrix is presented and illustrated by a numerical example

scholarly journals Three theorems on hierarchical decomposition of similarity linear systems

2004 ◽  
Vol 17 (2) ◽  
pp. 241-249
Author(s):  
Yuan-Wei Jing ◽  
Jun Zhao ◽  
Mile Stankovski ◽  
Georgi Dimirovski
Keyword(s):  
Dynamical Systems ◽  
Linear Systems ◽  
Hierarchical Structures ◽  
Hierarchical Decomposition ◽  
Linear Dynamical Systems ◽  
System Decomposition ◽  
Complex Linear

In this paper the problem of system decomposition of complex linear dynamical systems biy exploiting the similarity property is studied. System decompositions are sought in terms of similarity hierarchical structures. The method for constructing the transformation is derived. The conditions for such decomposition of complex linear systems are given.

Reduction-by-Projection Method for Linear Programming Problems

2014 ◽  
Vol 672-674 ◽  
pp. 1968-1971
Author(s):  
Xue Tong ◽  
Jun Qiang Wei
Keyword(s):  
Linear Programming ◽  
Linear Systems ◽  
Integer Linear Programming ◽  
Projection Method ◽  
Simplex Method ◽  
New Method ◽  
Linear Programming Problems

This paper defines the projection of algebic systems, and studies the projecting algorithm for linear systems. As its application, a new method is given to solve linear programming problems, which is called reduction-by-projection method. For many problems, especially when the problems have many constraint conditions in comparison with the number of their variables, the method needs less computation than simplex method and others. The great advantage of the method is shown when solving the integer linear programming problems.

Sign in / Sign up

Export Citation Format

Share Document