Fischer / Riedmüller / Schäffler | Applied Mathematics and Parallel Computing | E-Book | sack.de
E-Book

E-Book, Englisch, 376 Seiten, eBook

Fischer / Riedmüller / Schäffler Applied Mathematics and Parallel Computing

Festschrift for Klaus Ritter

E-Book, Englisch, 376 Seiten, eBook

ISBN: 978-3-642-99789-1
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark



The authors of this Festschrift prepared these papers to honour and express their friendship to Klaus Ritter on the occasion of his sixtieth birthday. Be cause of Ritter's many friends and his international reputation among math ematicians, finding contributors was easy. In fact, constraints on the size of the book required us to limit the number of papers. Klaus Ritter has done important work in a variety of areas, especially in var ious applications of linear and nonlinear optimization and also in connection with statistics and parallel computing. For the latter we have to mention Rit ter's development of transputer workstation hardware. The wide scope of his research is reflected by the breadth of the contributions in this Festschrift. After several years of scientific research in the U.S., Klaus Ritter was ap pointed as full professor at the University of Stuttgart. Since then, his name has become inextricably connected with the regularly scheduled conferences on optimization in Oberwolfach. In 1981 he became full professor of Applied Mathematics and Mathematical Statistics at the Technical University of Mu nich. In addition to his university teaching duties, he has made the activity of applying mathematical methods to problems of industry to be centrally important.
Fischer / Riedmüller / Schäffler Applied Mathematics and Parallel Computing jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


Informatics and the Internal Necessity for the Mathematization of the Sciences.- A New Semi-infinite Programming Method for Nonlinear Approximation.- Exhibition Organized by Klaus Ritter on the Occasion of the 125th Anniversary of the Technical University of Munich.- Concavity of the Vector-Valued Functions Occuring in Fuzzy Multiobjective Decision-Making.- An Algorithm for the Solution of the Parametric Quadratic Programming Problem.- Optimal and Asymptotically Optimal Equi-partition of Rectangular Domains via Stripe Decomposition.- Trust-Region Interior-Point Algorithms for Minimization Problems with Simple Bounds.- Adaptive Kernel Estimation of a Cusp-shaped Mode.- Automatic Differentiation: The Key Idea and an Illustrative Example.- An Approach to Parallelizing Isotonic Regression.- Mathematical Programming at Oberwolfach.- A SQP-Method for Linearly Constrained Maximum Likelihood Problems.- Machine Learning via Polyhedral Concave Minimization.- Optimization Concepts in Autonomous Mobile Platform Design.- A Fuzzy Set Approach for Optimal Positioning of a Mobile Robot Using Sonar Data.- Gradient Computation by Matrix Multiplication.- Simulating Ultrasonic Range Sensors on a Transputer Workstation.- A Modular Architecture for Optimization Tutorials.- Differential Stability Conditions for Saddle Problems on Products of Convex Polyhedra.- Large-Scale Global Optimization on Transputer Networks.- The Statistical Art of Maximizing the Likelihood.- Remote Access to a Transputer Workstation.- An Extension of Multivariate Reliability Systems.- Automatic Differentiation: A Structure-Exploiting Forward Mode with Almost Optimal Complexity for Kantorovi? Trees.- Approximate Structured Optimization by Cyclic Block-Coordinate Descent.- Author Index.


Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.