Stefan Diehl – författare
Visar alla böcker från författaren Stefan Diehl. Handla med fri frakt och snabb leverans.
3 produkter
3 produkter
Häftad, Svenska, 2015
276 kr
Skickas
Denna bok är tillkommen för att underlätta överbryggningen mellan gymnasieskolan och högskolans tekniska utbildningar. Den kan med fördel integreras i en första analyskurs vid högskolan, men kan även studeras enskilt, till exempel i slutet av gymnasieskolan. Boken består av fyra kapitel: Plan geometri, Trigonometri, Rymdgeometri och Analytisk geometri. Innehållet är delvis bekant från gymnasieskolan medan framställningen är gjord på ett högskolemässigt sätt.
Häftad, Engelska, 2025
435 kr
Skickas
This book is intended for a first course treating nonlinear optimization problems. It starts with a review of the necessary concepts of calculus and linear algebra, including positive definite matrices. The classical numerical optimization methods with line-search algorithms are motivated and derived, and some of their properties are investigated. The theories of constrained optimization, convexity and duality are developed rigorously and presented with focus on solving concrete optimization problems. There are numerous solved examples and exercises for which answers and in many cases complete solutions are provided.The second edition includes revisions, improved explanations, and additional content, figures and exercises. The companion book Linear and Combinatorial Optimization — A Basic Course can be read independently.
Häftad, Svenska, 2025
570 kr
Skickas
This book is intended for a first course in linear and combinatorial optimization at the university level for students who are highly familiar with linear algebra and multivariable calculus. A general theory is presented for continuous optimization problems with convex objective functions and affine constraints. The simplex, dual simplex and interior-point methods are presented for linear problems with continuous variables. For discrete problems, the general cutting-plane and branch-and-bound methods are introduced. Tailored combinatorial methods are motivated for the transportation, assignment, travelling-salesperson, maximal-flow and cheapest-path problems. The book includes numerous solved examples as well as exercises for which either answers or complete solutions are provided.The companion book Nonlinear Optimization – A Basic Course can be read independently.