"There are three words that characterize this work: thoroughness, completeness and clarity. The authors are congratulated for taking the time to write an excellent linear systems textbook!" —IEEE Transactions on Automatic Control Linear systems theory plays a broad and fundamental role in electrical, mechanical, chemical and aerospace engineering, communications, and signal processing. A thorough introduction to systems theory with emphasis on control is presented in this self-contained textbook, written for a challenging one-semester graduate course. A solutions manual is available to instructors upon adoption of the text. The book’s flexible coverage and self-contained presentation also make it an excellent reference guide or self-study manual. For a treatment of linear systems that focuses primarily on the time-invariant case using streamlined presentation of the material with less formal and more intuitive proofs, please see the authors’ companion book entitled A Linear Systems Primer.

A fully updated textbook on linear systems theory Linear systems theory is the cornerstone of control theory and a well-established discipline that focuses on linear differential equations from the perspective of control and estimation. This updated second edition of Linear Systems Theory covers the subject's key topics in a unique lecture-style format, making the book easy to use for instructors and students. João Hespanha looks at system representation, stability, controllability and state feedback, observability and state estimation, and realization theory. He provides the background for advanced modern control design techniques and feedback linearization and examines advanced foundational topics, such as multivariable poles and zeros and LQG/LQR. The textbook presents only the most essential mathematical derivations and places comments, discussion, and terminology in sidebars so that readers can follow the core material easily and without distraction. Annotated proofs with sidebars explain the techniques of proof construction, including contradiction, contraposition, cycles of implications to prove equivalence, and the difference between necessity and sufficiency. Annotated theoretical developments also use sidebars to discuss relevant commands available in MATLAB, allowing students to understand these tools. This second edition contains a large number of new practice exercises with solutions. Based on typical problems, these exercises guide students to succinct and precise answers, helping to clarify issues and consolidate knowledge. The book's balanced chapters can each be covered in approximately two hours of lecture time, simplifying course planning and student review. Easy-to-use textbook in unique lecture-style format Sidebars explain topics in further detail Annotated proofs and discussions of MATLAB commands Balanced chapters can each be taught in two hours of course lecture New practice exercises with solutions included

In this book, which focuses on the use of iterative methods for solving large sparse systems of linear equations, templates are introduced to meet the needs of both the traditional user and the high-performance specialist. Templates, a description of a general algorithm rather than the executable object or source code more commonly found in a conventional software library, offer whatever degree of customization the user may desire. Templates offer three distinct advantages: they are general and reusable; they are not language specific; and they exploit the expertise of both the numerical analyst, who creates a template reflecting in-depth knowledge of a specific numerical technique, and the computational scientist, who then provides "value-added" capability to the general template description, customizing it for specific needs. For each template that is presented, the authors provide: a mathematical description of the flow of algorithm; discussion of convergence and stopping criteria to use in the iteration; suggestions for applying a method to special matrix types; advice for tuning the template; tips on parallel implementations; and hints as to when and why a method is useful.

The sparse backslash book. Everything you wanted to know but never dared to ask about modern direct linear solvers. Chen Greif, Assistant Professor, Department of Computer Science, University of British Columbia.Overall, the book is magnificent. It fills a long-felt need for an accessible textbook on modern sparse direct methods. Its choice of scope is excellent John Gilbert, Professor, Department of Computer Science, University of California, Santa Barbara.Computational scientists often encounter problems requiring the solution of sparse systems of linear equations. Attacking these problems efficiently requires an in-depth knowledge of the underlying theory, algorithms, and data structures found in sparse matrix software libraries. Here, Davis presents the fundamentals of sparse matrix algorithms to provide the requisite background. The book includes CSparse, a concise downloadable sparse matrix package that illustrates the algorithms and theorems presented in the book and equips readers with the tools necessary to understand larger and more complex software packages.With a strong emphasis on MATLAB and the C programming language, Direct Methods for Sparse Linear Systems equips readers with the working knowledge required to use sparse solver packages and write code to interface applications to those packages. The book also explains how MATLAB performs its sparse matrix computations.Audience This invaluable book is essential to computational scientists and software developers who want to understand the theory and algorithms behind modern techniques used to solve large sparse linear systems. The book also serves as an excellent practical resource for students with an interest in combinatorial scientific computing.Preface; Chapter 1: Introduction; Chapter 2: Basic algorithms; Chapter 3: Solving triangular systems; Chapter 4: Cholesky factorization; Chapter 5: Orthogonal methods; Chapter 6: LU factorization; Chapter 7: Fill-reducing orderings; Chapter 8: Solving sparse linear systems; Chapter 9: CSparse; Chapter 10: Sparse matrices in MATLAB; Appendix: Basics of the C programming language; Bibliography; Index.

State-space description-some basic concepts; Linear state-variable feedbach; Asymptotic observers and compensator design; Some algebraic complements; State-space and matrix-fraction description of multivariable systems; State feedback and compensator design; General differential systems and polynomial matrix descriptions; Some results for time-variant systems; Some further reading.

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.

Originally published in 1970, Finite Dimensional Linear Systems is a classic textbook that provides a solid foundation for learning about dynamical systems and encourages students to develop a reliable intuition for problem solving. The theory of linear systems has been the bedrock of control theory for 50 years and has served as the springboard for many significant developments, all the while remaining impervious to change. Since linearity lies at the heart of much of the mathematical analysis used in applications, a firm grounding in its central ideas is essential. This book touches upon many of the standard topics in applied mathematics, develops the theory of linear systems in a systematic way, making as much use as possible of vector ideas, and contains a number of nontrivial examples and many exercises.