Synthesis of positive-real functions with low-complexity series-parallel networks

The purpose of this paper is to continue to develop the recently introduced concept of a regular positive-real function and its application to the classification of low-complexity two-terminal networks. This paper studies five- and six-element series-parallel networks with three reactive elements and presents a complete characterisation and graphical representation of the realisability conditions for these networks. The results are motivated by an approach to passive mechanical control which makes use of the inerter device. ©2009 IEEE.

Regression on fixed-rank positive semidefinite matrices: A Riemannian approach

The paper addresses the problem of learning a regression model parameterized by a fixed-rank positive semidefinite matrix. The focus is on the nonlinear nature of the search space and on scalability to high-dimensional problems. The mathematical developments rely on the theory of gradient descent algorithms adapted to the Riemannian geometry that underlies the set of fixedrank positive semidefinite matrices. In contrast with previous contributions in the literature, no restrictions are imposed on the range space of the learned matrix. The resulting algorithms maintain a linear complexity in the problem size and enjoy important invariance properties. We apply the proposed algorithms to the problem of learning a distance function parameterized by a positive semidefinite matrix. Good performance is observed on classical benchmarks. © 2011 Gilles Meyer, Silvere Bonnabel and Rodolphe Sepulchre.

Low-rank optimization on the cone of positive semidefinite matrices

We propose an algorithm for solving optimization problems defined on a subset of the cone of symmetric positive semidefinite matrices. This algorithm relies on the factorization X = Y Y T , where the number of columns of Y fixes an upper bound on the rank of the positive semidefinite matrix X. It is thus very effective for solving problems that have a low-rank solution. The factorization X = Y Y T leads to a reformulation of the original problem as an optimization on a particular quotient manifold. The present paper discusses the geometry of that manifold and derives a second-order optimization method with guaranteed quadratic convergence. It furthermore provides some conditions on the rank of the factorization to ensure equivalence with the original problem. In contrast to existing methods, the proposed algorithm converges monotonically to the sought solution. Its numerical efficiency is evaluated on two applications: the maximal cut of a graph and the problem of sparse principal component analysis. © 2010 Society for Industrial and Applied Mathematics.

Riemannian metric and geometric mean for positive semidefinite matrices of fixed rank

This paper introduces a new metric and mean on the set of positive semidefinite matrices of fixed-rank. The proposed metric is derived from a well-chosen Riemannian quotient geometry that generalizes the reductive geometry of the positive cone and the associated natural metric. The resulting Riemannian space has strong geometrical properties: it is geodesically complete, and the metric is invariant with respect to all transformations that preserve angles (orthogonal transformations, scalings, and pseudoinversion). A meaningful approximation of the associated Riemannian distance is proposed, that can be efficiently numerically computed via a simple algorithm based on SVD. The induced mean preserves the rank, possesses the most desirable characteristics of a geometric mean, and is easy to compute. © 2009 Society for Industrial and Applied Mathematics.

Low rank representation on Riemannian manifold of symmetric positive definite matrices

Sparse coding aims to find a more compact representation based on a set of dictionary atoms. A well-known technique looking at 2D sparsity is the low rank representation (LRR). However, in many computer vision applications, data often originate from a manifold, which is equipped with some Riemannian geometry. In this case, the existing LRR becomes inappropriate for modeling and incorporating the intrinsic geometry of the manifold that is potentially important and critical to applications. In this paper, we generalize the LRR over the Euclidean space to the LRR model over a specific Rimannian manifold—the manifold of symmetric positive matrices (SPD). Experiments on several computer vision datasets showcase its noise robustness and superior performance on classification and segmentation compared with state-of-the-art approaches.

Mitigation of symmetry condition in positive realness for adaptive control

Feasibility of nonlinear and adaptive control methodologies in multivariable linear time-invariant systems with state-space realization (A, B, C) is apparently limited by the standard strictly positive realness conditions that imply that the product CB must be positive definite symmetric. This paper expands the applicability of the strictly positive realness conditions used for the proofs of stability of adaptive control or control with uncertainty by showing that the not necessarily symmetric CB is only required to have a diagonal Jordan form and positive eigenvalues. The paper also shows that under the new condition any minimum-phase systems can be made strictly positive real via constant output feedback. The paper illustrates the usefulness of these extended properties with an adaptive control example. (C) 2006 Elsevier Ltd. All rights reserved.

Matrix-vector multiplication and triangular linear solver using GPGPU for symmetric positive definite matrices derived from elliptic equations

The modern GPUs are well suited for intensive computational tasks and massive parallel computation. Sparse matrix multiplication and linear triangular solver are the most important and heavily used kernels in scientific computation, and several challenges in developing a high performance kernel with the two modules is investigated. The main interest it to solve linear systems derived from the elliptic equations with triangular elements. The resulting linear system has a symmetric positive definite matrix. The sparse matrix is stored in the compressed sparse row (CSR) format. It is proposed a CUDA algorithm to execute the matrix vector multiplication using directly the CSR format. A dependence tree algorithm is used to determine which variables the linear triangular solver can determine in parallel. To increase the number of the parallel threads, a coloring graph algorithm is implemented to reorder the mesh numbering in a pre-processing phase. The proposed method is compared with parallel and serial available libraries. The results show that the proposed method improves the computation cost of the matrix vector multiplication. The pre-processing associated with the triangular solver needs to be executed just once in the proposed method. The conjugate gradient method was implemented and showed similar convergence rate for all the compared methods. The proposed method showed significant smaller execution time.

Construction of Stability Multipliers with Prescribed Phase Characteristics: an Improved Value for $\sigma

For a feedback system consisting of a transfer function $G(s)$ in the forward path and a time-varying gain $n(t)(0 \leqq n(t) \leqq k)$ in the feedback loop, a stability multiplier $Z(s)$ has been constructed (and used to prove stability) by Freedman [2] such that $Z(s)(G(s) + {1 / K})$ and $Z(s - \sigma )(0 < \sigma < \sigma _ * )$ are strictly positive real, where $\sigma _ * $ can be computed from a knowledge of the phase-angle characteristic of $G(i\omega ) + {1 / k}$ and the time-varying gain $n(t)$ is restricted by $\sigma _ * $ by means of an integral inequality. In this note it is shown that an improved value for $\sigma _ * $ is possible by making some modifications in his derivation. ©1973 Society for Industrial and Applied Mathematics.

On the maximal rate of non-square STBCs from complex orthogonal designs

A Linear Processing Complex Orthogonal Design (LPCOD) is a p x n matrix epsilon, (p >= n) in k complex indeterminates x(1), x(2),..., x(k) such that (i) the entries of epsilon are complex linear combinations of 0, +/- x(i), i = 1,..., k and their conjugates, (ii) epsilon(H)epsilon = D, where epsilon(H) is the Hermitian (conjugate transpose) of epsilon and D is a diagonal matrix with the (i, i)-th diagonal element of the form l(1)((i))vertical bar x(1)vertical bar(2) + l(2)((i))vertical bar x(2)vertical bar(2)+...+ l(k)((i))vertical bar x(k)vertical bar(2) where l(j)((i)), i = 1, 2,..., n, j = 1, 2,...,k are strictly positive real numbers and the condition l(1)((i)) = l(2)((i)) = ... = l(k)((i)), called the equal-weights condition, holds for all values of i. For square designs it is known. that whenever a LPCOD exists without the equal-weights condition satisfied then there exists another LPCOD with identical parameters with l(1)((i)) = l(2)((i)) = ... = l(k)((i)) = 1. This implies that the maximum possible rate for square LPCODs without the equal-weights condition is the same as that or square LPCODs with equal-weights condition. In this paper, this result is extended to a subclass of non-square LPCODs. It is shown that, a set of sufficient conditions is identified such that whenever a non-square (p > n) LPCOD satisfies these sufficient conditions and do not satisfy the equal-weights condition, then there exists another LPCOD with the same parameters n, k and p in the same complex indeterminates with l(1)((i)) = l(2)((i)) = ... = l(k)((i)) = 1.

Variable-Structure Control Design of Switched Systems With an Application to a DC-DC Power Converter

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Design of SPR systems with dynamic compensators and output variable structure control

This paper presents necessary and sufficient conditions for the following problem: given a linear time invariant plant G(s) = N(s)D(s)-1 = C(sI - A]-1B, with m inputs, p outputs, p > m, rank(C) = p, rank(B) = rank(CB) = m, £nd a tandem dynamic controller Gc(s) = D c(s)-1Nc(s) = Cc(sI - A c)-1Bc + Dc, with p inputs and m outputs and a constant output feedback matrix Ko ε ℝm×p such that the feedback system is Strictly Positive Real (SPR). It is shown that this problem has solution if and only if all transmission zeros of the plant have negative real parts. When there exists solution, the proposed method firstly obtains Gc(s) in order to all transmission zeros of Gc(s)G(s) present negative real parts and then Ko is found as the solution of some Linear Matrix Inequalities (LMIs). Then, taking into account this result, a new LMI based design for output Variable Structure Control (VSC) of uncertain dynamic plants is presented. The method can consider the following design specifications: matched disturbances or nonlinearities of the plant, output constraints, decay rate and matched and nonmatched plant uncertainties. © 2006 IEEE.

Variable structure control of switched systems based on Lyapunov-Metzler-SPR systems

This paper presents two Variable Structure Controllers (VSC) for continuous-time switched plants. It is assumed that the state vector is available for feedback. The proposed control system provides a switching rule and also the variable structure control input. The design is based on Lyapunov-Metzler (LM) inequalities and also on Strictly Positive Real (SPR) systems stability results. The definition of Lyapunov-Metzler-SPR (LMS) systems and its direct application in the design of VSC for switched systems are introduced in this paper. Two examples illustrate the design of the proposed VSC, considering a plant given by a switched system with a switched-state control law and two linear time-invariant systems, that are not controllable and also can not be stabilized with state feedback. ©2008 IEEE.

Comparative study of LMI-based output feedback spr synthesis for plants with different numbers of inputs and outputs

New Linear Matrix Inequalities (LMI) conditions are proposed for the following problem, called Strictly Positive Real (SPR) synthesis: given a linear time-invariant plant, find a constant output feedback matrix Ko and a constant output tandem matrix F for the controlled system to be SPR. It is assumed that the plant has the number of outputs greater than the number of inputs. Some sufficient conditions for the solution of the problem are presented and compared. These results can be directly applied in the LMI-based design of Variable Structure Control (VSC) of uncertain plants. ©2008 IEEE.

Síntese de sistemas estritamente reais positivos através do critério de routh-hurwitz

Given a linear time-invariant plant Gol(s) with one input and q outputs, where q > 1, a method based on the Routh-Hurwitz Stability Criterion is proposed to obtain a constant tandem matrix F ∈ ℝq, such that FGOl(s) is a minimumphase system. From this solution, the system FGol(s) is represented in state space by {A, B, FC} and a constant output feedback matrix K0 ∈ ℝ is obtained such that the feedback system {A - BK0C, B, FC} is Strictly Positive Real (SPR). The proposed procedure offers necessary and sufficient conditions for both problems. Initially, the general case, with a generic q, is analyzed. Following, the particular cases q = 2 and q = 3 are studied.

Implementation of a DC-DC converter with variable structure control of switched systems

This paper presents a control method for a class of continuous-time switched systems, using state feedback variable structure controllers. The method is applied to the control of a two-cell dc-dc buck converter and a control circuit design using the software PSpice is proposed. The design is based on Lyapunov-Metzler-SPR systems and the performance of the resulting control system is superior to that afforded by a recently-proposed alternative sliding-mode control technique. The dc-dc power converters are very used in industrial applications, for instance, in power systems of hybrid electric vehicles and aircrafts. Good results were obtained and the proposed design is also inexpensive because it uses electric components that can be easily found for the hardware implementation. Future researches on the subject include the hardware validation of the dc-dc converter controller and the robust control design of switched systems, with structural failures. © 2011 IEEE.