Описание: Hodge theory is a standard theory in characterizing differential complexes and the topology of manifolds. This text is a study of the Hodge-Kodaira and related decompositions on manifolds with boundary under mainly analytic aspects.
An analysis of two heuristic strategies for the development of mechanistic models, illustrated with historical examples from the life sciences.
In Discovering Complexity, William Bechtel and Robert Richardson examine two heuristics that guided the development of mechanistic models in the life sciences: decomposition and localization. Drawing on historical cases from disciplines including cell biology, cognitive neuroscience, and genetics, they identify a number of "choice points" that life scientists confront in developing mechanistic explanations and show how different choices result in divergent explanatory models. Describing decomposition as the attempt to differentiate functional and structural components of a system and localization as the assignment of responsibility for specific functions to specific structures, Bechtel and Richardson examine the usefulness of these heuristics as well as their fallibility -- the sometimes false assumption underlying them that nature is significantly decomposable and hierarchically organized.
When Discovering Complexity was originally published in 1993, few philosophers of science perceived the centrality of seeking mechanisms to explain phenomena in biology, relying instead on the model of nomological explanation advanced by the logical positivists (a model Bechtel and Richardson found to be utterly inapplicable to the examples from the life sciences in their study). Since then, mechanism and mechanistic explanation have become widely discussed. In a substantive new introduction to this MIT Press edition of their book, Bechtel and Richardson examine both philosophical and scientific developments in research on mechanistic models since 1993.
Andreas B?rmann develops novel approaches for the solution of network design problems as they arise in various contexts of applied optimization. At the example of an optimal expansion of the German railway network until 2030, the author derives a tailor-made decomposition technique for multi-period network design problems. Next, he develops a general framework for the solution of network design problems via aggregation of the underlying graph structure. This approach is shown to save much computation time as compared to standard techniques. Finally, the author devises a modelling framework for the approximation of the robust counterpart under ellipsoidal uncertainty, an often-studied case in the literature. Each of these three approaches opens up a fascinating branch of research which promises a better theoretical understanding of the problem and an increasing range of solvable application settings at the same time.
Автор: Irfan M. Ovacik; Reha Uzsoy Название: Decomposition Methods for Complex Factory Scheduling Problems ISBN: 1461379067 ISBN-13(EAN): 9781461379065 Издательство: Springer Рейтинг: Цена: 13974.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The factory scheduling problem, that of allocating machines to competing jobs in manufacturing facilities to optimize or at least improve system performance, is encountered in many different manufacturing environments.
Автор: Irfan M. Ovacik; Reha Uzsoy Название: Decomposition Methods for Complex Factory Scheduling Problems ISBN: 0792398351 ISBN-13(EAN): 9780792398356 Издательство: Springer Рейтинг: Цена: 23757.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Outlining the results of a systematic, long-term research effort aimed at developing effective scheduling algorithms for complex manufacturing facilities, this text focuses on a specific industrial context, that of semiconductor manufacturing.
Domain decomposition (DD) methods provide powerful tools for constructing parallel numerical solution algorithms for large scale systems of algebraic equations arising from the discretization of partial differential equations. These methods are well-established and belong to a fast developing area. In this volume, the reader will find a brief historical overview, the basic results of the general theory of domain and space decomposition methods as well as the description and analysis of practical DD algorithms for parallel computing. It is typical to find in this volume that most of the presented DD solvers belong to the family of fast algorithms, where each component is efficient with respect to the arithmetical work. Readers will discover new analysis results for both the well-known basic DD solvers and some DD methods recently devised by the authors, e.g., for elliptic problems with varying chaotically piecewise constant orthotropism without restrictions on the finite aspect ratios.
The hp finite element discretizations, in particular, by spectral elements of elliptic equations are given significant attention in current research and applications. This volume is the first to feature all components of Dirichlet-Dirichlet-type DD solvers for hp discretizations devised as numerical procedures which result in DD solvers that are almost optimal with respect to the computational work. The most important DD solvers are presented in the matrix/vector form algorithms that are convenient for practical use.
Автор: A.M. Wesselman Название: The Population-Sample Decomposition Method ISBN: 9401081476 ISBN-13(EAN): 9789401081474 Издательство: Springer Рейтинг: Цена: 12157.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: Wen-Hong Zhu Название: Virtual Decomposition Control ISBN: 3642107230 ISBN-13(EAN): 9783642107238 Издательство: Springer Рейтинг: Цена: 26122.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This is the most complete book on virtual decomposition control. This approach uses subsystem dynamics to conduct control design, while guaranteeing the stability and convergence of the entire robot without compromising the rigorousness of the system analysis.
Описание: Gives a comprehensive account of the theoretical, computational and application aspects of the problems of determining conformal modules of quadrilaterals and of mapping conformally onto a rectangle. This work presents a survey of available numerical methods and associated computer software for conformal mapping.
Автор: Michel Bercovier; Martin Gander; Ralf Kornhuber; O Название: Domain Decomposition Methods in Science and Engineering XVIII ISBN: 3642026761 ISBN-13(EAN): 9783642026768 Издательство: Springer Рейтинг: Цена: 25155.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: th This volume contains a selection of 41 refereed papers presented at the 18 International Conference of Domain Decomposition Methods hosted by the School of ComputerScience and Engineering(CSE) of the Hebrew Universityof Jerusalem, Israel, January 12-17, 2008.
Автор: Thomas Carraro; Michael Geiger; Stefan K?rkel; Rol Название: Multiple Shooting and Time Domain Decomposition Methods ISBN: 3319233203 ISBN-13(EAN): 9783319233208 Издательство: Springer Рейтинг: Цена: 19564.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
T. Akman et al: Space-Time Discontinuous Galerkin Methods for Optimal Control Problems Governed by Time Dependent Diffusion-Convection-Reaction Equations.- Th. Carraro et al: Direct and Indirect Multiple Shooting for Parabolic Optimal Control Problems.- M.J. Gander: 50 Years of Time Parallel Time Integration.- S. Grцtschel et al: Reducing Memory Requirements in Scientific Computing and Optimal Control.- Y. Hasegawa: Optimal Control of Heat and Fluid Flow for Efficient Energy Utilization.- D. Janka et al: Direct Multiple Shooting for Optimum Experimental Design.- D. Kaschek et al: A Unified Approach to Integration and Optimization of Parametric Ordinary Differential Equations.- R. Kircheis et al: Parameter Estimation for PDAE Constrained Models Using a Reduced Approach.- M. Klinger: A Variational Approach for Physically Based Image Interpolation Across Boundaries.- C. Kreutz et al: Statistics for Model Calibration.- A. Potschka: Direct Multiple Shooting for Parabolic PDE Constrained Optimization.- R. Quirynen et al: Multiple Shooting in a Microsecond.- Th. Richter et al: Time Discretizations of Fluid-Structure Interactions.- St. Ulbrich: Preconditioners Based on 'Parareal' Time-Domain Decomposition for Time-Dependent PDE-Constrained Optimization.- E. Kostina et al: Direct Multiple Shooting for Optimization Problems in ODE Models.- M. Schlick: Parareal Time-Stepping for Limit-Cycle Computation of the Incompressible Navier-Stokes Equations with Uncertain Periodic Dynamics.
Описание: For linear optimization models that can be formulated as linear programs with the block-angular structure, i.e. It can also be used as supplemental material in a second course in linear programming, computational mathematical programming, or large-scale systems.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
