Recent years have seen a significant rise of interest in max-linear theory and techniques. Specialised international conferences and seminars or special sessions devoted to max-algebra have been organised. This book aims to provide a first detailed and self-contained account of linear-algebraic aspects of max-algebra for general (that is both irreducible and reducible) matrices. Among the main features of the book is the presentation of the fundamental max-algebraic theory (Chapters 1-4), often scattered in research articles, reports and theses, in one place in a comprehensive and unified form. This presentation is made with all proofs and in full generality (that is for both irreducible and reducible matrices). Another feature is the presence of advanced material (Chapters 5-10), most of which has not appeared in a book before and in many cases has not been published at all. Intended for a wide-ranging readership, this book will be useful for anyone with basic mathematical knowledge (including undergraduate students) who wish to learn fundamental max-algebraic ideas and techniques. It will also be useful for researchers working in tropical geometry or idempotent analysis.

This book provides an introduction to the theory of linear systems and control for students in business mathematics, econometrics, computer science, and engineering; the focus is on discrete time systems. The subjects treated are among the central topics of deterministic linear system theory: controllability, observability, realization theory, stability and stabilization by feedback, LQ-optimal control theory. Kalman filtering and LQC-control of stochastic systems are also discussed, as are modeling, time series analysis and model specification, along with model validation.

Iterative Methods for Linear Systems?offers a mathematically rigorous introduction to fundamental iterative methods for systems of linear algebraic equations. The book distinguishes itself from other texts on the topic by providing a straightforward yet comprehensive analysis of the Krylov subspace methods, approaching the development and analysis of algorithms from various algorithmic and mathematical perspectives, and going beyond the standard description of iterative methods by connecting them in a natural way to the idea of preconditioning.??

Large sparse linear systems of equations are ubiquitous in science, engineering and beyond. This open access monograph focuses on factorization algorithms for solving such systems. It presents classical techniques for complete factorizations that are used in sparse direct methods and discusses the computation of approximate direct and inverse factorizations that are key to constructing general-purpose algebraic preconditioners for iterative solvers. A unified framework is used that emphasizes the underlying sparsity structures and highlights the importance of understanding sparse direct methods when developing algebraic preconditioners. Theoretical results are complemented by sparse matrix algorithm outlines. This monograph is aimed at students of applied mathematics and scientific computing, as well as computational scientists and software developers who are interested in understanding the theory and algorithms needed to tackle sparse systems. It is assumed that the reader has completed a basic course in linear algebra and numerical mathematics.

This second edition comprehensively presents important tools of linear systems theory, including differential and difference equations, Laplace and Z transforms, and more. Linear Systems Theory discusses: Nonlinear and linear systems in the state space form and through the transfer function method Stability, including marginal stability, asymptotical stability, global asymptotical stability, uniform stability, uniform exponential stability, and BIBO stability Controllability Observability Canonical forms System realizations and minimal realizations, including state space approach and transfer function realizations System design Kalman filters Nonnegative systems Adaptive control Neural networks The book focuses mainly on applications in electrical engineering, but it provides examples for most branches of engineering, economics, and social sciences. What's New in the Second Edition? Case studies drawn mainly from electrical and mechanical engineering applications, replacing many of the longer case studies Expanded explanations of both linear and nonlinear systems as well as new problem sets at the end of each chapter Illustrative examples in all the chapters An introduction and analysis of new stability concepts An expanded chapter on neural networks, analyzing advances that have occurred in that field since the first edition Although more mainstream than its predecessor, this revision maintains the rigorous mathematical approach of the first edition, providing fast, efficient development of the material. Linear Systems Theory enables its reader to develop his or her capabilities for modeling dynamic phenomena, examining their properties, and applying them to real-life situations.

This book combines a solid theoretical background in linear algebra with practical algorithms for numerical solution of linear algebra problems. Developed from a number of courses taught repeatedly by the authors, the material covers topics like matrix algebra, theory for linear systems of equations, spectral theory, vector and matrix norms combined with main direct and iterative numerical methods, least squares problems, and eigenproblems. Numerical algorithms illustrated by computer programs written in MATLAB® are also provided as supplementary material on SpringerLink to give the reader a better understanding of professional numerical software for the solution of real-life problems. Perfect for a one- or two-semester course on numerical linear algebra, matrix computation, and large sparse matrices, this text will interest students at the advanced undergraduate or graduate level.