Search results for "MathematicsofComputing_NUMERICALANALYSIS"
showing 10 items of 149 documents
On stability and stabilization of singular uncertain Takagi-Sugeno fuzzy systems
2014
This paper deals with the problem of robust stability and robust stabilization for a class of continuous-time singular Takagi-Sugeno fuzzy systems. Sufficient conditions on stability and stabilization are proposed in terms of strict LMI (Linear Matrix Inequality) for uncertain T-S fuzzy models. In order to reduce the conservatism of results developed using quadratic method, an approach based on non-quadratic Lyapunov functions and S-procedure is proposed. Illustrative examples are given to show the effectiveness of the given results Refereed/Peer-reviewed
Stabilization of a Class of Stochastic Nonlinear Systems
2013
This paper addresses two control schemes for stochastic nonlinear systems. Firstly, an adaptive controller is designed for a class of motion equations. Then, a robust finite-time control scheme is proposed to stabilize a class of nonlinear stochastic systems. The stability of the closed-loop systems is established based on stochastic Lyapunov stability theorems. Links between these two methods are given. The efficiency of the control schemes is evaluated using numerical simulations.
Constructing a Pareto front approximation for decision making
2011
An approach to constructing a Pareto front approximation to computationally expensive multiobjective optimization problems is developed. The approximation is constructed as a sub-complex of a Delaunay triangulation of a finite set of Pareto optimal outcomes to the problem. The approach is based on the concept of inherent nondominance. Rules for checking the inherent nondominance of complexes are developed and applying the rules is demonstrated with examples. The quality of the approximation is quantified with error estimates. Due to its properties, the Pareto front approximation works as a surrogate to the original problem for decision making with interactive methods. Qc 20120127
DEGENERATE MATRIX METHOD FOR SOLVING NONLINEAR SYSTEMS OF DIFFERENTIAL EQUATIONS
1998
Degenerate matrix method for numerical solving nonlinear systems of ordinary differential equations is considered. The method is based on an application of special degenerate matrix and usual iteration procedure. The method, which is connected with an implicit Runge‐Kutta method, can be simply realized on computers. An estimation for the error of the method is given. First Published Online: 14 Oct 2010
Towards Multilevel Ant Colony Optimisation for the Euclidean Symmetric Traveling Salesman Problem
2015
Ant Colony Optimization ACO metaheuristic is one of the best known examples of swarm intelligence systems in which researchers study the foraging behavior of bees, ants and other social insects in order to solve combinatorial optimization problems. In this paper, a multilevel Ant Colony Optimization MLV-ACO for solving the traveling salesman problem is proposed, by using a multilevel process operating in a coarse-to-fine strategy. This strategy involves recursive coarsening to create a hierarchy of increasingly smaller and coarser versions of the original problem. The heart of the approach is grouping the variables that are part of the problem into clusters, which is repeated until the size…
A New Crowded Comparison Operator in Constrained Multiobjective Optimization for Capacitors Sizing and Siting in Electrical Distribution Systems
2005
This paper presents a new Crowded Comparison Operator (CCO) for NSGA-II to solve the Multiobjective and constrained problem of optimal capacitors placement in electrical distribution systems.
Direct Numerical Methods for Optimal Control Problems
2003
Development of interior point methods for linear and quadratic programming problems occurred during the 1990’s. Because of their simplicity and their convergence properties, interior point methods are attractive solvers for such problems. Moreover, extensions have been made to more general convex programming problems.
Performance modeling of epidemic routing
2006
In this paper, we develop a rigorous, unified framework based on ordinary differential equations (ODEs) to study epidemic routing and its variations. These ODEs can be derived as limits of Markovian models under a natural scaling as the number of nodes increases. While an analytical study of Markovian models is quite complex and numerical solution impractical for large networks, the corresponding ODE models yield closed-form expressions for several performance metrics of interest, and a numerical solution complexity that does not increase with the number of nodes. Using this ODE approach, we investigate how resources such as buffer space and the number of copies made for a packet can be tra…
Multiresolution-based adaptive schemes for Hyperbolic Conservation Laws
2006
Starting in the early nineties, wavelet and wavelet-like techniques have been successfully used to design adaptive schemes for the numerical solution of certain types of PDE. In this paper we review two representative examples of the development of such techniques for Hyperbolic Conservation Laws.
PAINT–SiCon: constructing consistent parametric representations of Pareto sets in nonconvex multiobjective optimization
2014
We introduce a novel approximation method for multiobjective optimization problems called PAINT–SiCon. The method can construct consistent parametric representations of Pareto sets, especially for nonconvex problems, by interpolating between nondominated solutions of a given sampling both in the decision and objective space. The proposed method is especially advantageous in computationally expensive cases, since the parametric representation of the Pareto set can be used as an inexpensive surrogate for the original problem during the decision making process. peerReviewed