Overview

Full Product Details

Author:   Marietta Manolessou
Publisher:   Alpha Science International Ltd
Imprint:   Alpha Science International Ltd
Weight:   0.950kg
ISBN:  

9781842654477

ISBN 10:   1842654470
Pages:   556
Publication Date:   30 January 2014
Audience:   College/higher education ,  Professional and scholarly ,  Postgraduate, Research & Scholarly ,  Professional & Vocational
Format:   Hardback
Publisher's Status:   Inactive
Availability:   Awaiting stock  

Table of Contents

Preface Linear (or Vector) Spaces Matrices – Linear Operators, Reductions Matrices – Endomorphisms, Reductions Canonical Form of a Matrix or of the Associated Endomorphism Linear and Bilinear Forms Hermitian Forms – Prehilbertian Spaces – Normed Vector Spaces Matrix Norms, Normal Self-adjoint-Unitary Operators and Numerical Analysis Appendix Topological Spaces Metric Spaces Connectivity Convexity and Applications Hilbert Spaces Orthogonal Projection Methods of Approximation and Optimization Compactness Appendix A Brief Introduction to Measure Theory and Lebesgue’s Integral The Fourier Integral and the Fourier Transformation The Laplace Transformation and Applications An Elementary Introduction to the Theory of Distributions Applications An Introduction to Analytic Functions I Cauchy Theorems An Introduction to Analytic Functions II Taylor and Laurent Series An Introduction to Analytic Functions III Zeros – Singularities – Poles An Introduction to Analytic Functions IV Applications Optimization Applications of Algebra and Topology General Introduction Linear Programming (the Simplex) A. The Algorithm of Dantzig The Simplex Algorithm B. Advanced Techniques and Applications B.1 Penalty The Simplex Algorithm. Advanced Techniques and Applications B.2 Duality The Simplex Algorithm. Advanced Techniques and Applications B.3 Integer Numbers’ Programming The method of “Cuts” Two Solved Problems as a Synthesis of the Earlier Presented Methods of Linear Programming Nonlinear Programming I Lagrange and Kuhn – Tucker Multipliers Nonlinear Programming II The Orthogonal Projection and the “Least Squares’ Approximation” Dynamic Programming – A Combinatorial Optimization Dynamic Programming – B. I Bellman’s Method of Optimization Dynamic Programming B. II. An Introduction to Optimal Control Theory Following Bellman Exercises – Applications of Bellman’s Method Appendix Index.

Reviews

Author Information

Marietta Manolessou: Head of Mathematics Department, E.I.S.T.I. International School of Information Technology, Avenue du Parc 95011, CERGY CEDEX FRANCE

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions