We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure [email protected]
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Matrix theory is the lingua franca of everyone who deals with dynamically evolving systems, and familiarity with efficient matrix computations is an essential part of the modern curriculum in dynamical systems and associated computation. This is a master's-level textbook on dynamical systems and computational matrix algebra. It is based on the remarkable identity of these two disciplines in the context of linear, time-variant, discrete-time systems and their algebraic equivalent, quasi-separable systems. The authors' approach provides a single, transparent framework that yields simple derivations of basic notions, as well as new and fundamental results such as constrained model reduction, matrix interpolation theory and scattering theory. This book outlines all the fundamental concepts that allow readers to develop the resulting recursive computational schemes needed to solve practical problems. An ideal treatment for graduate students and academics in electrical and computer engineering, computer science and applied mathematics.
Covers differentiation and integration, higher derivatives, partial derivatives, series expansion, integral transforms, convolution integrals, Laplace transforms, linear and time-invariant systems, linear ordinary differential equations, periodic functions, Fourier series and transforms, and matrix algebra.
Chapter 2 is methodological, offering a primer on multimodal network analysis. It proceeds by quickly reviewing 1-mode network analysis, paying special attention to summarizing several measures of network centrality and how they relate to power. Often, relational data that are 2-mode or multimodal are “projected” into one of the node sets. Ties are then defined by their shared relations to the second-mode nodes so that 1-mode measures of centrality and algorithms for community detection can be employed. We discuss the loss of information on structure and agency that projection entails and argue that, in many cases, projection is neither helpful nor necessary. We then proceed to detailed discussions of methods for 2-mode and 3-mode network analysis, from first principles of matrix algebra to centrality measures and core-periphery analysis; faction analysis and community detection; as well as structural/regular equivalence and blockmodeling. We conclude with a brief introduction to recent advances in statistical network modelling that facilitate inferences about multimodal networks.
Written in a conversational tone, this classroom-tested text introduces the fundamentals of linear programming and game theory, showing readers how to apply serious mathematics to practical real-life questions by modelling linear optimization problems and strategic games. The treatment of linear programming includes two distinct graphical methods. The game theory chapters include a novel proof of the minimax theorem for 2x2 zero-sum games. In addition to zero-sum games, the text presents variable-sum games, ordinal games, and n-player games as the natural result of relaxing or modifying the assumptions of zero-sum games. All concepts and techniques are derived from motivating examples, building in complexity, which encourages students to think creatively and leads them to understand how the mathematics is applied. With no prerequisite besides high school algebra, the text will be useful to motivated high school students and undergraduates studying business, economics, mathematics, and the social sciences.
Abadir and Magnus (2002, Econometric Theory) proposed a standard for notation in econometrics. The consistent use of the proposed notation in our volumes shows that it is in fact practical. The notational conventions described here mainly apply to the material covered in this volume. Further notation will be introduced, as needed, as the Series develops.
Three families of examples are given of sets of $(0,1)$-matrices whose pairwise products form a basis for the
underlying full matrix algebra. In the first two families, the elements have
rank at most two and some of the products can have multiple entries. In the
third example, the matrices have equal rank $\!\sqrt{n}$ and all of the pairwise products are single-entried $(0,1)$-matrices.
Let ${{M}_{n}}$ be the algebra of all $n\,\times \,n$ matrices over $\mathbb{C}$. We say that $A,B\in {{M}_{n}}$ quasi-commute if there exists a nonzero $\xi \,\in \,\mathbb{C}$ such that $AB\,=\,\xi BA$. In the paper we classify bijective not necessarily linear maps $\Phi :{{M}_{n}}\to {{M}_{n}}$ which preserve quasi-commutativity in both directions.
Recommend this
Email your librarian or administrator to recommend adding this to your organisation's collection.