scispace - formally typeset
Open AccessBook

Topics in Matrix Analysis

TLDR
The field of values as discussed by the authors is a generalization of the field of value of matrices and functions, and it includes singular value inequalities, matrix equations and Kronecker products, and Hadamard products.
Abstract
1. The field of values 2. Stable matrices and inertia 3. Singular value inequalities 4. Matrix equations and Kronecker products 5. Hadamard products 6. Matrices and functions.

read more

Citations
More filters
Book

Linear Matrix Inequalities in System and Control Theory

Edwin E. Yaz
TL;DR: In this paper, the authors present a brief history of LMIs in control theory and discuss some of the standard problems involved in LMIs, such as linear matrix inequalities, linear differential inequalities, and matrix problems with analytic solutions.
Journal ArticleDOI

Reproduction numbers and sub-threshold endemic equilibria for compartmental models of disease transmission

TL;DR: A precise definition of the basic reproduction number, R0, is presented for a general compartmental disease transmission model based on a system of ordinary differential equations and it is shown that, if R0<1, then the disease free equilibrium is locally asymptotically stable; whereas if R 0>1,Then it is unstable.
Journal ArticleDOI

Exact Matrix Completion via Convex Optimization

TL;DR: It is proved that one can perfectly recover most low-rank matrices from what appears to be an incomplete set of entries, and that objects other than signals and images can be perfectly reconstructed from very limited information.
Book

Essentials of Robust Control

TL;DR: In this article, the authors introduce linear algebraic Riccati Equations and linear systems with Ha spaces and balance model reduction, and Ha Loop Shaping, and Controller Reduction.
Journal ArticleDOI

Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization

TL;DR: It is shown that if a certain restricted isometry property holds for the linear transformation defining the constraints, the minimum-rank solution can be recovered by solving a convex optimization problem, namely, the minimization of the nuclear norm over the given affine space.