Institution
Vienna University of Technology
Education•Vienna, Austria•
About: Vienna University of Technology is a education organization based out in Vienna, Austria. It is known for research contribution in the topics: Laser & Cloud computing. The organization has 16723 authors who have published 49341 publications receiving 1302168 citations.
Topics: Laser, Cloud computing, Finite element method, Magnetization, Population
Papers published on a yearly basis
Papers
More filters
••
TL;DR: In this paper, a monolayers of 11-azido-undecyl-siloxane were prepared on powdered silica and on silicon wafers by the substitution of 11bromo-, undecyl, and were subsequently coupled with three substituted acyclic acid derivatives.
Abstract: Monolayers of 11-azido-undecylsiloxane were prepared on powdered silica and on silicon wafers by the substitution of 11-bromo-undecylsiloxane and were subsequently coupled with three substituted ac...
235 citations
••
13 Sep 2008TL;DR: This paper provides a review of contemporary multiobjective approaches based on the singleobjective meta-model-assisted 'Efficient Global Optimization' (EGO) procedure and describes their main concepts and introduces a new EGO-based MOOA, which utilizes the $\mathcal{S}$-metric or hypervolume contribution to decide which solution is evaluated next.
Abstract: Real-world optimization problems often require the consideration of multiple contradicting objectives. These multiobjective problems are even more challenging when facing a limited budget of evaluations due to expensive experiments or simulations. In these cases, a specific class of multiobjective optimization algorithms (MOOA) has to be applied. This paper provides a review of contemporary multiobjective approaches based on the singleobjective meta-model-assisted 'Efficient Global Optimization' (EGO) procedure and describes their main concepts. Additionally, a new EGO-based MOOA is introduced, which utilizes the $\mathcal{S}$-metric or hypervolume contribution to decide which solution is evaluated next. A benchmark on recently proposed test functions is performed allowing a budget of 130 evaluations. The results point out that the maximization of the hypervolume contribution within a real multiobjective optimization is superior to straightforward adaptations of EGO making our new approach capable of approximating the Pareto front of common problems within the allowed budget of evaluations.
234 citations
••
13 Oct 2006TL;DR: This article overviews several popular hybridization approaches and classifies them based on various characteristics, including a unified view based on a common pool template for low-level hybrids of different metaheuristics.
Abstract: Manifold possibilities of hybridizing individual metaheuristics with each other and/or with algorithms from other fields exist. A large number of publications documents the benefits and great success of such hybrids. This article overviews several popular hybridization approaches and classifies them based on various characteristics. In particular with respect to low-level hybrids of different metaheuristics, a unified view based on a common pool template is described. It helps in making similarities and different key components of existing metaheuristics explicit. We then consider these key components as a toolbox for building new, effective hybrid metaheuristics. This approach of thinking seems to be superior to sticking too strongly to the philosophies and historical backgrounds behind the different metaheuristic paradigms. Finally, particularly promising possibilities of combining metaheuristics with constraint programming and integer programming techniques are highlighted.
234 citations
••
TL;DR: In this article, the authors study how micromagnetic calculations can be applied to processes that involve a singularity of the magnetization field, namely, the Bloch point, and show that defects and thermal agitation are likely to assist Blochpoint injection, hence lowering the switching fields.
Abstract: We study how micromagnetic calculations can be applied to processes that involve a singularity of the magnetization field, namely, the Bloch point. In order to allow for comparison with recent experiments, we consider Permalloy thin-film disks supporting a vortex magnetic configuration. The structure of the Bloch point at rest in the middle of the core of the vortex is studied first, comparing the evolution of the calculation results under decreasing mesh size to analytical results. The reversal of the core of the vortex under a field applied perpendicularly to the disk plane is then investigated. We apply two different procedures to evaluate switching fields and processes: direct micromagnetic time-dependent calculation, and the evaluation of the energy barrier that separates the two orientations of the vortex core in the configuration space, using a path method. Both methods show the occurrence of Bloch points during reversal. Special attention is paid to the extrapolation towards zero mesh size of the numerical results. The calculations are confronted to experimental values from Okuno et al. [J. Magn. Magn. Mater. 240, 1 (2002)]. We conclude that defects and thermal agitation are likely to assist Bloch-point injection, hence lowering the switching fields.
234 citations
••
[...]
TL;DR: In this paper, efficiency exclusively characterizes the approximation classes involved in terms of the best-approximation error and data resolution and so the upper bound on the optimal marking parameters does not depend on the efficiency constant.
Abstract: This paper aims first at a simultaneous axiomatic presentation of the proof of optimal convergence rates for adaptive finite element methods and second at some refinements of particular questions like the avoidance of (discrete) lower bounds, inexact solvers, inhomogeneous boundary data, or the use of equivalent error estimators. Solely four axioms guarantee the optimality in terms of the error estimators.Compared to the state of the art in the temporary literature, the improvements of this article can be summarized as follows: First, a general framework is presented which covers the existing literature on optimality of adaptive schemes. The abstract analysis covers linear as well as nonlinear problems and is independent of the underlying finite element or boundary element method. Second, efficiency of the error estimator is neither needed to prove convergence nor quasi-optimal convergence behavior of the error estimator. In this paper, efficiency exclusively characterizes the approximation classes involved in terms of the best-approximation error and data resolution and so the upper bound on the optimal marking parameters does not depend on the efficiency constant. Third, some general quasi-Galerkin orthogonality is not only sufficient, but also necessary for the R -linear convergence of the error estimator, which is a fundamental ingredient in the current quasi-optimality analysis due to Stevenson 2007. Finally, the general analysis allows for equivalent error estimators and inexact solvers as well as different non-homogeneous and mixed boundary conditions.
234 citations
Authors
Showing all 16934 results
Name | H-index | Papers | Citations |
---|---|---|---|
Krzysztof Matyjaszewski | 169 | 1431 | 128585 |
Wolfgang Wagner | 156 | 2342 | 123391 |
Marco Zanetti | 145 | 1439 | 104610 |
Sridhara Dasu | 140 | 1675 | 103185 |
Duncan Carlsmith | 138 | 1660 | 103642 |
Ulrich Heintz | 136 | 1688 | 99829 |
Matthew Herndon | 133 | 1732 | 97466 |
Frank Würthwein | 133 | 1584 | 94613 |
Alain Hervé | 132 | 1279 | 87763 |
Manfred Jeitler | 132 | 1278 | 89645 |
David Taylor | 131 | 2469 | 93220 |
Roberto Covarelli | 131 | 1516 | 89981 |
Patricia McBride | 129 | 1230 | 81787 |
David Smith | 129 | 2184 | 100917 |
Lindsey Gray | 129 | 1170 | 81317 |