Logo

Optimization and Dynamical Systems

Small book cover: Optimization and Dynamical Systems

Optimization and Dynamical Systems
by

Publisher: Springer
ISBN/ASIN: 3540198571
ISBN-13: 9783540198574
Number of pages: 414

Description:
This work is aimed at mathematics and engineering graduate students and researchers in the areas of optimization, dynamical systems, control systems, signal processing, and linear algebra. The problems solved are those of linear algebra and linear systems theory, and include such topics as diagonalizing a symmetric matrix, singular value decomposition, balanced realizations, linear programming, sensitivity minimization, and eigenvalue assignment by feedback control.

Home page url

Download or read it online for free here:
Download link
(2.8MB, PDF)

Similar books

Book cover: Convex OptimizationConvex Optimization
by - Cambridge University Press
A comprehensive introduction to the subject for students and practitioners in engineering, computer science, mathematics, statistics, finance, etc. The book shows in detail how optimization problems can be solved numerically with great efficiency.
(18164 views)
Book cover: Discrete OptimizationDiscrete Optimization
by - Utrecht University
From the table of contents: Preliminaries (Optimization Problems); Minimum Spanning Trees; Matroids; Shortest Paths; Maximum Flows; Minimum Cost Flows; Matchings; Integrality of Polyhedra; Complexity Theory; Approximation Algorithms.
(8202 views)
Book cover: Notes on OptimizationNotes on Optimization
by - Van Nostrand
The author presents the main concepts mathematical programming and optimal control to students having diverse technical backgrounds. A reasonable knowledge of advanced calculus, linear algebra, and linear differential equations is required.
(11209 views)
Book cover: The Design of Approximation AlgorithmsThe Design of Approximation Algorithms
by - Cambridge University Press
This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. It is organized around techniques for designing approximation algorithms, including greedy and local search algorithms.
(14883 views)