We investigate randomized distributed algorithms for matrix computations over loosely coupled distributed systems, such as P2P networks or sensor networks. In this poster, we discuss orthogonalization methods and orth...
We investigate randomized distributed algorithms for matrix computations over loosely coupled distributed systems, such as P2P networks or sensor networks. In this poster, we discuss orthogonalization methods and orthogonal iteration. These algorithms are very well understood in the sequential or in the classical parallel context, and they are important building blocks for many algorithms in numericallinearalgebra.
In this study an alternative characterisation of the null controllable region for linear systems subject to input saturation with strictly positive real eigenvalues is proposed. First an outer estimate of the null con...
详细信息
In this study an alternative characterisation of the null controllable region for linear systems subject to input saturation with strictly positive real eigenvalues is proposed. First an outer estimate of the null controllable region is obtained and then an iterated convexification technique is developed.
Fixed parameter iterative learning control (ILC) for linear-time invariant, single-input single-output systems subject to output noise is analysed with the intent of predicting the expectation of the underlying 'n...
详细信息
Fixed parameter iterative learning control (ILC) for linear-time invariant, single-input single-output systems subject to output noise is analysed with the intent of predicting the expectation of the underlying 'noise-free' mean square error (Euclidean norm) of the time series on each iteration. Explicit formulae are obtained in terms of the 'lifted' matrix models of the plant. Computational experiments are used to confirm the correctness of the proposed properties. Finally, frequency domain formulae are derived to provide insight into links between plant characteristics, noise spectra and other ILC parameters, and illustrated by application to the inverse-model-based ILC algorithm.
The problem on the existence of a common quadratic Lyapunov function (CQLF) for discrete switched linear systems with m stable subsystems is considered. System matrices are Schur stable. A necessary condition for the ...
详细信息
The problem on the existence of a common quadratic Lyapunov function (CQLF) for discrete switched linear systems with m stable subsystems is considered. System matrices are Schur stable. A necessary condition for the existence of a CQLF and a sufficient condition for the non-existence of a CQLF are derived, respectively. numerical examples are presented to illustrate the results.
We consider the asymptotic behavior of solutions of a linear differential system x ' = A(t)x, where A is continuous on an interval la, DC)). We are interested in the situation where the system may not have a desir...
详细信息
We consider the asymptotic behavior of solutions of a linear differential system x ' = A(t)x, where A is continuous on an interval la, DC)). We are interested in the situation where the system may not have a desirable asymptotic property such as stability, strict stability, uniform stability, or linear asymptotic equilibrium, but its solutions can be written as x = Pu, where P is continuously differentiable on la, infinity) and u is a solution of a system u ' = B(t)u that has the property in question. In this case we say that P preconditions the given system for the property in question. (C) 2010 Elsevier Inc. All rights reserved.
作者:
Ahn, H. -S.GIST
Sch Mechatron Kwangju 500712 South Korea
This study addresses methods for finding lower and upper boundaries of powers of parametric interval uncertain matrix. Two results are presented. As the first result, a method to find the exact lower and upper boundar...
详细信息
This study addresses methods for finding lower and upper boundaries of powers of parametric interval uncertain matrix. Two results are presented. As the first result, a method to find the exact lower and upper boundaries of powers of single-parametric interval matrix is established. As the second result, the lower and upper boundaries of powers of general interval matrix are evaluated. Three numerical examples and one application example are presented to validate the method and analysis proposed in this study.
Work capacity models are very important tool in profiling a person against a defined set of competencies usually related to knowledge and skills, and the person's physical and behavioral characteristics and constr...
详细信息
Work capacity models are very important tool in profiling a person against a defined set of competencies usually related to knowledge and skills, and the person's physical and behavioral characteristics and constraints. In the case of an engineering student, for example, these set of competencies may be defined by a mentor or adviser such as, but are not limited to: knowledge on certain theoretical and practical aspects, skills in analyzing and designing engineering systems, leadership skills, and team-work, for example. Physical and behavioral characteristics, on the other hand, would depend on the person being assessed and various methods are also available in literature. However, work capacity models available in literature suffer from various drawbacks such as: 1) they do not reflect the fact that work capacity vary with time and external conditions; and 2) work capacity models are usually used to describe a single agent and not on a group of agents. In order to be able to include these drawbacks and convert them as added features, a dynamic input-output model describing the work capacity of a group of agents is devised using simple linearalgebra and system theory concepts. We show that such models could be utilized in the academe in assessing the net work capacity (NWC) of a group of student working on a thesis topic, or even in the industry in assessing the NWC of a certain group of employees in a department, for example.
This paper describes a new numerical method for the solution of large linear discrete ill-posed problems, whose matrix is a Kronecker product. Problems of this kind arise, for instance, from the discretization of Fred...
详细信息
This paper describes a new numerical method for the solution of large linear discrete ill-posed problems, whose matrix is a Kronecker product. Problems of this kind arise, for instance, from the discretization of Fredholm integral equations of the first kind in two space-dimensions with a separable kernel. The available data (right-hand side) of many linear discrete ill-posed problems that arise in applications is contaminated by measurement errors. Straightforward solution of these problems generally is not meaningful because of severe error propagation. We discuss how to combine the truncated singular value decomposition (TSVD) with reduced rank vector extrapolation to determine computed approximate solutions that are fairly insensitive to the error in the data. Exploitation of the structure of the problem keeps the computational effort quite small. (C) 2010 Elsevier Inc. All rights reserved.
We consider the asymptotic behavior of solutions of a linear differential system x ' = A(t)x, where A is continuous on an interval la, DC)). We are interested in the situation where the system may not have a desir...
详细信息
We consider the asymptotic behavior of solutions of a linear differential system x ' = A(t)x, where A is continuous on an interval la, DC)). We are interested in the situation where the system may not have a desirable asymptotic property such as stability, strict stability, uniform stability, or linear asymptotic equilibrium, but its solutions can be written as x = Pu, where P is continuously differentiable on la, infinity) and u is a solution of a system u ' = B(t)u that has the property in question. In this case we say that P preconditions the given system for the property in question. (C) 2010 Elsevier Inc. All rights reserved.
We provide experimental evidence that current desktop computers feature enough computational power to solve large-scale dense linearalgebra problems. While the high computational cost of the numericalmethods for sol...
详细信息
We provide experimental evidence that current desktop computers feature enough computational power to solve large-scale dense linearalgebra problems. While the high computational cost of the numericalmethods for solving these problems can be tackled by the multiple cores of current processors, we propose to use the disk to store the large data structures associated with these applications. Our results also show that the limited amount of RAM and the comparatively slow disk of the system pose no problem for the solution of very large dense linear systems and linear least-squares problems. Thus, current desktop computers are revealed as an appealing, cost-effective platform for research groups that have to deal with large dense linearalgebra problems but have no direct access to large computing facilities.
暂无评论