Search results for "Computational Mathematic"
showing 10 items of 987 documents
Bounds on transient phase plastic deformations in optimal design of steel frames subjected to cyclic loads
2009
A minimum volume multicriterion design of elastic perfectly plastic steel frames subjected to a combination of quasi-static fixed and cyclic loads, bounding the transient phase plastic deformations, is proposed. The problem is formulated according to a plastic shakedown criterion, so that incremental and instantaneous collapse are certainly prevented when the frame is subjected to very strongly amplified cyclic loads. The further condition that the structure must also behave elastically in serviceability conditions is imposed. Since the steady-state loading history is known it is possible to directly bound the steady-state plastic deformations. By applying a suitable own bounding theorem, i…
Guaranteed lower bounds for cost functionals of time-periodic parabolic optimization problems
2019
In this paper, a new technique is shown for deriving computable, guaranteed lower bounds of functional type (minorants) for two different cost functionals subject to a parabolic time-periodic boundary value problem. Together with previous results on upper bounds (majorants) for one of the cost functionals, both minorants and majorants lead to two-sided estimates of functional type for the optimal control problem. Both upper and lower bounds are derived for the second new cost functional subject to the same parabolic PDE-constraints, but where the target is a desired gradient. The time-periodic optimal control problems are discretized by the multiharmonic finite element method leading to lar…
Comparison of Numerical Methods in the Contrast Imaging Problem in NMR
2013
International audience; In this article, the contrast imaging problem in nuclear magnetic resonance is modeled as a Mayer problem in optimal control. A first synthesis of locally optimal solutions is given in the single-input case using geometric methods based on Pontryagin's maximum principle. We then compare these results using direct methods and a moment-based approach, and make a first step towards global optimality. Finally, some preliminary results are given in the bi-input case.
Numerische Behandlung von Verzweigungsproblemen bei gew�hnlichen Differentialgleichungen
1979
We present a new method for the numerical solution of bifurcation problems for ordinary differential equations. It is based on a modification of the classical Ljapunov-Schmidt-theory. We transform the problem of determining the nontrivial branch bifurcating from the trivial solution into the problem of solving regular nonlinear boundary value problems, which can be treated numerically by standard methods (multiple shooting, difference methods).
An enhanced memetic differential evolution in filter design for defect detection in paper production.
2008
This article proposes an Enhanced Memetic Differential Evolution (EMDE) for designing digital filters which aim at detecting defects of the paper produced during an industrial process. Defect detection is handled by means of two Gabor filters and their design is performed by the EMDE. The EMDE is a novel adaptive evolutionary algorithm which combines the powerful explorative features of Differential Evolution with the exploitative features of three local search algorithms employing different pivot rules and neighborhood generating functions. These local search algorithms are the Hooke Jeeves Algorithm, a Stochastic Local Search, and Simulated Annealing. The local search algorithms are adap…
IDEA: interface dynamics and energetics algorithm.
2007
IDEA, interface dynamics and energetics algorithm, was implemented, in FORTRAN, under different operating systems to mimic dynamics and energetics of elementary events involved in interfacial processes. The code included a parallel elaboration scheme in which both the stochastic and the deterministic components, involved in the developed physical model, worked simultaneously. IDEA also embodied an optionally running VISUAL subroutine, showing the dynamic energy changes caused by the surface events, e.g., occurring at the gas-solid interface. Monte Carlo and ordinary differential equation system subroutines were employed in a synergistic way to drive the occurrence of the elementary events a…
Parallel Schwarz methods for convection-dominated semilinear diffusion problems
2002
AbstractParallel two-level Schwarz methods are proposed for the numerical solution of convection-diffusion problems, with the emphasis on convection-dominated problems. Two variants of the methodology are investigated. They differ from each other by the type of boundary conditions (Dirichlet- or Neumann-type) posed on a part of the second-level subdomain interfaces. Convergence properties of the two-level Schwarz methods are experimentally compared with those of a variant of the standard multi-domain Schwarz alternating method. Numerical experiments performed on a distributed memory multiprocessor computer illustrate parallel efficiency of the methods.
Classifier Optimized for Resource-constrained Pervasive Systems and Energy-efficiency
2017
Computational intelligence is often used in smart environment applications in order to determine a user’scontext. Many computational intelligence algorithms are complex and resource-consuming which can beproblematic for implementation devices such as FPGA:s, ASIC:s and low-level microcontrollers. Thesetypes of devices are, however, highly useful in pervasive and mobile computing due to their small size,energy-efficiency and ability to provide fast real-time responses. In this paper, we propose a classi-fier, CORPSE, specifically targeted for implementation in FPGA:s, ASIC:s or low-level microcontrollers.CORPSE has a small memory footprint, is computationally inexpensive, and is suitable for…
Treed Gaussian Process Regression for Solving Offline Data-Driven Continuous Multiobjective Optimization Problems
2023
Abstract For offline data-driven multiobjective optimization problems (MOPs), no new data is available during the optimization process. Approximation models (or surrogates) are first built using the provided offline data and an optimizer, e.g. a multiobjective evolutionary algorithm, can then be utilized to find Pareto optimal solutions to the problem with surrogates as objective functions. In contrast to online data-driven MOPs, these surrogates cannot be updated with new data and, hence, the approximation accuracy cannot be improved by considering new data during the optimization process. Gaussian process regression (GPR) models are widely used as surrogates because of their ability to pr…
PAINT : Pareto front interpolation for nonlinear multiobjective optimization
2011
A method called PAINT is introduced for computationally expensive multiobjective optimization problems. The method interpolates between a given set of Pareto optimal outcomes. The interpolation provided by the PAINT method implies a mixed integer linear surrogate problem for the original problem which can be optimized with any interactive method to make decisions concerning the original problem. When the scalarizations of the interactive method used do not introduce nonlinearity to the problem (which is true e.g., for the synchronous NIMBUS method), the scalarizations of the surrogate problem can be optimized with available mixed integer linear solvers. Thus, the use of the interactive meth…