Search results for "Nonlinear system"

showing 10 items of 1446 documents

Optimal Guaranteed Cost Control of a Class of Discrete-Time Nonlinear Systems with Markovian Switching and Mode-Dependent Mixed Time Delays

2013

Published version of an article in the journal: Abstract and Applied Analysis. Also available from the publisher at: http://dx.doi.org/10.1155/2013/653628 Open Access The guaranteed cost control problem is investigated for a class of nonlinear discrete-time systems with Markovian jumping parameters and mixed time delays. The mixed time delays involved consist of both the mode-dependent discrete delay and the distributed delay with mode-dependent lower bound. The associated cost function is of a quadratic summation form over the infinite horizon. The nonlinear functions are assumed to satisfy sector-bounded conditions. By introducing new Lyapunov-Krasovskii functionals and developing some ne…

Mathematical optimizationComputer simulationArticle SubjectApplied Mathematicslcsh:MathematicsMode (statistics)Function (mathematics)lcsh:QA1-939VDP::Mathematics and natural science: 400::Mathematics: 410::Analysis: 411Upper and lower boundsNonlinear systemQuadratic equationControl theoryConvex optimizationAnalysisMathematics
researchProduct

Shape optimization of elasto-plastic bodies under plane strains: Sensitivity analysis and numerical implementation

1992

Optimal shape design problems for an elastic body made from physically nonlinear material are presented. Sensitivity analysis is done by differentiating the discrete equations of equilibrium. Numerical examples are included.

Mathematical optimizationControl and OptimizationPlane (geometry)Structural mechanicsMathematical analysisGeneral EngineeringOptimal controlComputer Graphics and Computer-Aided DesignFinite element methodComputer Science ApplicationsNonlinear systemControl and Systems EngineeringShape optimizationSensitivity (control systems)SoftwareMathematicsPlane stressStructural Optimization
researchProduct

Approximation of the Feasible Parameter Set in worst-case identification of Hammerstein models

2005

The estimation of the Feasible Parameter Set (FPS) for Hammerstein models in a worst-case setting is considered. A bounding procedure is determined both for polytopic and ellipsoidic uncertainties. It consists in the projection of the FPS of the extended parameter vector onto suitable subspaces and in the solution of convex optimization problems which provide Uncertainties Intervals of the model parameters. The bounds obtained are tighter than in the previous approaches. hes.

Mathematical optimizationEstimation theorySystem identificationIdentification (control systems)PolytopeLinear subspaceInterval arithmeticSettore ING-INF/04 - AutomaticaControl and Systems EngineeringBounding overwatchConvex optimizationNonlinear systemsApplied mathematicsElectrical and Electronic EngineeringProjection (set theory)static nonlinearityMathematics
researchProduct

A non-hydrostatic pressure distribution solver for the nonlinear shallow water equations over irregular topography

2016

Abstract We extend a recently proposed 2D depth-integrated Finite Volume solver for the nonlinear shallow water equations with non-hydrostatic pressure distribution. The proposed model is aimed at simulating both nonlinear and dispersive shallow water processes. We split the total pressure into its hydrostatic and dynamic components and solve a hydrostatic problem and a non-hydrostatic problem sequentially, in the framework of a fractional time step procedure. The dispersive properties are achieved by incorporating the non-hydrostatic pressure component in the governing equations. The governing equations are the depth-integrated continuity equation and the depth-integrated momentum equation…

Mathematical optimizationFinite volume method010504 meteorology & atmospheric sciencesDiscretization0208 environmental biotechnology02 engineering and technologyMechanicsSolver01 natural sciencesSettore ICAR/01 - Idraulica020801 environmental engineeringUnstructured gridlaw.inventionNonlinear systemContinuity equationlawDynamic pressure Shallow waters Dispersive process Finite volume Wetting and drying Unstructured gridHydrostatic equilibriumShallow water equationsPhysics::Atmospheric and Oceanic Physics0105 earth and related environmental sciencesWater Science and TechnologyMathematicsAdvances in Water Resources
researchProduct

Qualitative Theory of Differential Equations, Difference Equations, and Dynamic Equations on Time Scales

2016

We are pleased to present this special issue. This volume reflects an increasing interest in the analysis of qualitative behavior of solutions to differential equations, difference equations, and dynamic equations on time scales. Numerous applications arising in the engineering and natural sciences call for the development of new efficient methods and for the modification and refinement of known techniques that should be adjusted for the analysis of new classes of problems. The twofold goal of this special issue is to reflect both the state-of-the-art theoretical research and important recent advances in the solution of applied problems.

Mathematical optimizationGeometric analysisDynamical systems theoryArticle SubjectDifferential equationComputer sciencelcsh:Tlcsh:Rlcsh:MedicineGeneral MedicineDelay differential equationlcsh:TechnologyGeneral Biochemistry Genetics and Molecular Biology[0-Belirlenecek]Examples of differential equationsNonlinear systemMultigrid methodEditorialSimultaneous equationsApplied mathematicslcsh:Qlcsh:ScienceGeneral Environmental Science
researchProduct

A Multistart Scatter Search Heuristic for Smooth NLP and MINLP Problems

2005

The algorithm described here, called OptQuest/NLP or OQNLP, is a heuristic designed to find global optima for pure and mixed integer nonlinear problems with many constraints and variables, where all problem functions are differentiable with respect to the continuous variables. It uses OptQuest, a commercial implementation of scatter search developed by OptTek Systems, Inc., to provide starting points for a gradient-based local NLP solver. This solver seeks a local solution from a subset of these points, holding discrete variables fixed. The procedure is motivated by our desire to combine the superior accuracy and feasibility-seeking behavior of gradient-based local NLP solvers with the glob…

Mathematical optimizationHeuristic (computer science)Modeling languagebusiness.industrySmall numberSolvercomputer.software_genreNonlinear systemDifferentiable functionArtificial intelligencebusinessGlobal optimizationcomputerNatural language processingMathematicsInteger (computer science)
researchProduct

Estimating biophysical variable dependences with kernels

2010

This paper introduces a nonlinear measure of dependence between random variables in the context of remote sensing data analysis. The Hilbert-Schmidt Independence Criterion (HSIC) is a kernel method for evaluating statistical dependence. HSIC is based on computing the Hilbert-Schmidt norm of the cross-covariance operator of mapped samples in the corresponding Hilbert spaces. The HSIC empirical estimator is very easy to compute and has good theoretical and practical properties. We exploit the capabilities of HSIC to explain nonlinear dependences in two remote sensing problems: temperature estimation and chlorophyll concentration prediction from spectra. Results show that, when the relationshi…

Mathematical optimizationHilbert spaceKernel methodsEstimatorDependence estimationMutual informationChlorophyll concentrationNonlinear systemsymbols.namesakeKernel methodNorm (mathematics)symbolsApplied mathematicsRandom variableMathematics2010 IEEE International Geoscience and Remote Sensing Symposium
researchProduct

Synchronous approach in interactive multiobjective optimization

2006

We introduce a new approach in the methodology development for interactive multiobjective optimization. The presentation is given in the context of the interactive NIMBUS method, where the solution process is based on the classification of objective functions. The idea is to formulate several scalarizing functions, all using the same preference information of the decision maker. Thus, opposed to fixing one scalarizing function (as is done in most methods), we utilize several scalarizing functions in a synchronous way. This means that we as method developers do not make the choice between different scalarizing functions but calculate the results of different scalarizing functions and leave t…

Mathematical optimizationInformation Systems and ManagementGeneral Computer ScienceComputer sciencebusiness.industrymedia_common.quotation_subjectContext (language use)Management Science and Operations ResearchMultiple-criteria decision analysisMulti-objective optimizationIndustrial and Manufacturing EngineeringNonlinear programmingNonlinear systemModeling and SimulationSoftware systemArtificial intelligenceFunction (engineering)businessmedia_commonEuropean Journal of Operational Research
researchProduct

Experiments with classification-based scalarizing functions in interactive multiobjective optimization

2006

In multiobjective optimization methods, the multiple conflicting objectives are typically converted into a single objective optimization problem with the help of scalarizing functions and such functions may be constructed in many ways. We compare both theoretically and numerically the performance of three classification-based scalarizing functions and pay attention to how well they obey the classification information. In particular, we devote special interest to the differences the scalarizing functions have in the computational cost of guaranteeing Pareto optimality. It turns out that scalarizing functions with or without so-called augmentation terms have significant differences in this re…

Mathematical optimizationInformation Systems and ManagementGeneral Computer SciencePareto principleManagement Science and Operations ResearchMulti-objective optimizationMultiple objective programmingIndustrial and Manufacturing EngineeringSet (abstract data type)Nonlinear systemSingle objective optimization problemConflicting objectivesModeling and SimulationBenchmark (computing)MathematicsEuropean Journal of Operational Research
researchProduct

The convergence of the perturbed Newton method and its application for ill-conditioned problems

2011

Abstract Iterative methods, such as Newton’s, behave poorly when solving ill-conditioned problems: they become slow (first order), and decrease their accuracy. In this paper we analyze deeply and widely the convergence of a modified Newton method, which we call perturbed Newton, in order to overcome the usual disadvantages Newton’s one presents. The basic point of this method is the dependence of a parameter affording a degree of freedom that introduces regularization. Choices for that parameter are proposed. The theoretical analysis will be illustrated through examples.

Mathematical optimizationIterative methodApplied MathematicsSteffensen's methodNewton's method in optimizationLocal convergenceComputational Mathematicssymbols.namesakeNonlinear systemNewton fractalSecant methodsymbolsNewton's methodMathematicsApplied Mathematics and Computation
researchProduct