98 resultados para Weak Greedy Algorithms


Relevância:

20.00% 20.00%

Publicador:

Resumo:

This book shows how to exploit the special structure of such problems to develop efficient numerical algorithms.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We investigate the use of a percolation-field-effect-transistor for the continuous weak measurement of a spatially Rabi oscillating trapped electron through the change in percolation pathway of the transistor channel. In contrast to conventional devices, this detection mechanism in principle does not require a change in the stored energy of the gate capacitance to modify the drain current, so reducing the measurement back-action. The signal-to-noise ratio and measurement bandwidth are seen to be improved compared to conventional devices, allowing further aspects of the dynamic behaviour to be observed. © 2013 AIP Publishing LLC.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

There is a need for a stronger theoretical understanding of Multidisciplinary Design Optimization (MDO) within the field. Having developed a differential geometry framework in response to this need, we consider how standard optimization algorithms can be modeled using systems of ordinary differential equations (ODEs) while also reviewing optimization algorithms which have been derived from ODE solution methods. We then use some of the framework's tools to show how our resultant systems of ODEs can be analyzed and their behaviour quantitatively evaluated. In doing so, we demonstrate the power and scope of our differential geometry framework, we provide new tools for analyzing MDO systems and their behaviour, and we suggest hitherto neglected optimization methods which may prove particularly useful within the MDO context. Copyright © 2013 by ASME.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We present the Unified Form Language (UFL), which is a domain-specific language for representing weak formulations of partial differential equations with a view to numerical approximation. Features of UFL include support for variational forms and functionals, automatic differentiation of forms and expressions, arbitrary function space hierarchies formultifield problems, general differential operators and flexible tensor algebra. With these features, UFL has been used to effortlessly express finite element methods for complex systems of partial differential equations in near-mathematical notation, resulting in compact, intuitive and readable programs. We present in this work the language and its construction. An implementation of UFL is freely available as an open-source software library. The library generates abstract syntax tree representations of variational problems, which are used by other software libraries to generate concrete low-level implementations. Some application examples are presented and libraries that support UFL are highlighted. © 2014 ACM.