θ-convex nonlinear programming problems
International Nuclear Information System (INIS)
Emam, T.
2008-01-01
A class of sets and a class of functions called θ-convex sets and θ-convex functions are introduced by relaxing the definitions of convex sets and operator θ on the sets and domain of definition of the functions. The optimally results for θ-convex programming problems are established.
Bonus algorithm for large scale stochastic nonlinear programming problems
Diwekar, Urmila
2015-01-01
This book presents the details of the BONUS algorithm and its real world applications in areas like sensor placement in large scale drinking water networks, sensor placement in advanced power systems, water management in power systems, and capacity expansion of energy systems. A generalized method for stochastic nonlinear programming based on a sampling based approach for uncertainty analysis and statistical reweighting to obtain probability information is demonstrated in this book. Stochastic optimization problems are difficult to solve since they involve dealing with optimization and uncertainty loops. There are two fundamental approaches used to solve such problems. The first being the decomposition techniques and the second method identifies problem specific structures and transforms the problem into a deterministic nonlinear programming problem. These techniques have significant limitations on either the objective function type or the underlying distributions for the uncertain variables. Moreover, these ...
Nonlinear programming for classification problems in machine learning
Astorino, Annabella; Fuduli, Antonio; Gaudioso, Manlio
2016-10-01
We survey some nonlinear models for classification problems arising in machine learning. In the last years this field has become more and more relevant due to a lot of practical applications, such as text and web classification, object recognition in machine vision, gene expression profile analysis, DNA and protein analysis, medical diagnosis, customer profiling etc. Classification deals with separation of sets by means of appropriate separation surfaces, which is generally obtained by solving a numerical optimization model. While linear separability is the basis of the most popular approach to classification, the Support Vector Machine (SVM), in the recent years using nonlinear separating surfaces has received some attention. The objective of this work is to recall some of such proposals, mainly in terms of the numerical optimization models. In particular we tackle the polyhedral, ellipsoidal, spherical and conical separation approaches and, for some of them, we also consider the semisupervised versions.
COYOTE: a finite element computer program for nonlinear heat conduction problems
International Nuclear Information System (INIS)
Gartling, D.K.
1978-06-01
COYOTE is a finite element computer program designed for the solution of two-dimensional, nonlinear heat conduction problems. The theoretical and mathematical basis used to develop the code is described. Program capabilities and complete user instructions are presented. Several example problems are described in detail to demonstrate the use of the program
TRUMP3-JR: a finite difference computer program for nonlinear heat conduction problems
International Nuclear Information System (INIS)
Ikushima, Takeshi
1984-02-01
Computer program TRUMP3-JR is a revised version of TRUMP3 which is a finite difference computer program used for the solution of multi-dimensional nonlinear heat conduction problems. Pre- and post-processings for input data generation and graphical representations of calculation results of TRUMP3 are avaiable in TRUMP3-JR. The calculation equations, program descriptions and user's instruction are presented. A sample problem is described to demonstrate the use of the program. (author)
Domí nguez, Luis F.; Pistikopoulos, Efstratios N.
2012-01-01
An algorithm for the solution of convex multiparametric mixed-integer nonlinear programming problems arising in process engineering problems under uncertainty is introduced. The proposed algorithm iterates between a multiparametric nonlinear
A Smooth Newton Method for Nonlinear Programming Problems with Inequality Constraints
Directory of Open Access Journals (Sweden)
Vasile Moraru
2012-02-01
Full Text Available The paper presents a reformulation of the Karush-Kuhn-Tucker (KKT system associated nonlinear programming problem into an equivalent system of smooth equations. Classical Newton method is applied to solve the system of equations. The superlinear convergence of the primal sequence, generated by proposed method, is proved. The preliminary numerical results with a problems test set are presented.
Czech Academy of Sciences Publication Activity Database
Lukšan, Ladislav; Vlček, Jan
1998-01-01
Roč. 5, č. 3 (1998), s. 219-247 ISSN 1070-5325 R&D Projects: GA ČR GA201/96/0918 Keywords : nonlinear programming * sparse problems * equality constraints * truncated Newton method * augmented Lagrangian function * indefinite systems * indefinite preconditioners * conjugate gradient method * residual smoothing Subject RIV: BA - General Mathematics Impact factor: 0.741, year: 1998
A Kind of Nonlinear Programming Problem Based on Mixed Fuzzy Relation Equations Constraints
Li, Jinquan; Feng, Shuang; Mi, Honghai
In this work, a kind of nonlinear programming problem with non-differential objective function and under the constraints expressed by a system of mixed fuzzy relation equations is investigated. First, some properties of this kind of optimization problem are obtained. Then, a polynomial-time algorithm for this kind of optimization problem is proposed based on these properties. Furthermore, we show that this algorithm is optimal for the considered optimization problem in this paper. Finally, numerical examples are provided to illustrate our algorithms.
CASKETSS-HEAT: a finite difference computer program for nonlinear heat conduction problems
International Nuclear Information System (INIS)
Ikushima, Takeshi
1988-12-01
A heat conduction program CASKETSS-HEAT has been developed. CASKETSS-HEAT is a finite difference computer program used for the solution of multi-dimensional nonlinear heat conduction problems. Main features of CASKETSS-HEAT are as follows. (1) One, two and three-dimensional geometries for heat conduction calculation are available. (2) Convection and radiation heat transfer of boundry can be specified. (3) Phase change and chemical change can be treated. (4) Finned surface heat transfer can be treated easily. (5) Data memory allocation in the program is variable according to problem size. (6) The program is a compatible heat transfer analysis program to the stress analysis program SAP4 and SAP5. (7) Pre- and post-processing for input data generation and graphic representation of calculation results are available. In the paper, brief illustration of calculation method, input data and sample calculation are presented. (author)
Directory of Open Access Journals (Sweden)
Samir Dey
2015-07-01
Full Text Available This paper proposes a new multi-objective intuitionistic fuzzy goal programming approach to solve a multi-objective nonlinear programming problem in context of a structural design. Here we describe some basic properties of intuitionistic fuzzy optimization. We have considered a multi-objective structural optimization problem with several mutually conflicting objectives. The design objective is to minimize weight of the structure and minimize the vertical deflection at loading point of a statistically loaded three-bar planar truss subjected to stress constraints on each of the truss members. This approach is used to solve the above structural optimization model based on arithmetic mean and compare with the solution by intuitionistic fuzzy goal programming approach. A numerical solution is given to illustrate our approach.
A nonlinear oscillatory problem
International Nuclear Information System (INIS)
Zhou Qingqing.
1991-10-01
We have studied the nonlinear oscillatory problem of orthotropic cylindrical shell, we have analyzed the character of the oscillatory system. The stable condition of the oscillatory system has been given. (author). 6 refs
A chaos-based evolutionary algorithm for general nonlinear programming problems
International Nuclear Information System (INIS)
El-Shorbagy, M.A.; Mousa, A.A.; Nasr, S.M.
2016-01-01
In this paper we present a chaos-based evolutionary algorithm (EA) for solving nonlinear programming problems named chaotic genetic algorithm (CGA). CGA integrates genetic algorithm (GA) and chaotic local search (CLS) strategy to accelerate the optimum seeking operation and to speed the convergence to the global solution. The integration of global search represented in genetic algorithm and CLS procedures should offer the advantages of both optimization methods while offsetting their disadvantages. By this way, it is intended to enhance the global convergence and to prevent to stick on a local solution. The inherent characteristics of chaos can enhance optimization algorithms by enabling it to escape from local solutions and increase the convergence to reach to the global solution. Twelve chaotic maps have been analyzed in the proposed approach. The simulation results using the set of CEC’2005 show that the application of chaotic mapping may be an effective strategy to improve the performances of EAs.
Robust Optimization Using Supremum of the Objective Function for Nonlinear Programming Problems
International Nuclear Information System (INIS)
Lee, Se Jung; Park, Gyung Jin
2014-01-01
In the robust optimization field, the robustness of the objective function emphasizes an insensitive design. In general, the robustness of the objective function can be achieved by reducing the change of the objective function with respect to the variation of the design variables and parameters. However, in conventional methods, when an insensitive design is emphasized, the performance of the objective function can be deteriorated. Besides, if the numbers of the design variables are increased, the numerical cost is quite high in robust optimization for nonlinear programming problems. In this research, the robustness index for the objective function and a process of robust optimization are proposed. Moreover, a method using the supremum of linearized functions is also proposed to reduce the computational cost. Mathematical examples are solved for the verification of the proposed method and the results are compared with those from the conventional methods. The proposed approach improves the performance of the objective function and its efficiency
Domínguez, Luis F.
2012-06-25
An algorithm for the solution of convex multiparametric mixed-integer nonlinear programming problems arising in process engineering problems under uncertainty is introduced. The proposed algorithm iterates between a multiparametric nonlinear programming subproblem and a mixed-integer nonlinear programming subproblem to provide a series of parametric upper and lower bounds. The primal subproblem is formulated by fixing the integer variables and solved through a series of multiparametric quadratic programming (mp-QP) problems based on quadratic approximations of the objective function, while the deterministic master subproblem is formulated so as to provide feasible integer solutions for the next primal subproblem. To reduce the computational effort when infeasibilities are encountered at the vertices of the critical regions (CRs) generated by the primal subproblem, a simplicial approximation approach is used to obtain CRs that are feasible at each of their vertices. The algorithm terminates when there does not exist an integer solution that is better than the one previously used by the primal problem. Through a series of examples, the proposed algorithm is compared with a multiparametric mixed-integer outer approximation (mp-MIOA) algorithm to demonstrate its computational advantages. © 2012 American Institute of Chemical Engineers (AIChE).
International Nuclear Information System (INIS)
Biffle, J.H.
1991-01-01
1 - Description of program or function: JAC is a two-dimensional finite element program for solving large deformation, temperature dependent, quasi-static mechanics problems with the nonlinear conjugate gradient (CG) technique. Either plane strain or axisymmetric geometry may be used with material descriptions which include temperature dependent elastic-plastic, temperature dependent secondary creep, and isothermal soil models. The nonlinear effects examined include material and geometric nonlinearities due to large rotations, large strains, and surface which slide relative to one another. JAC is vectorized to perform efficiently on the Cray1 computer. A restart capability is included. 2 - Method of solution: The nonlinear conjugate gradient method is employed in a two-dimensional plane strain or axisymmetric setting with various techniques for accelerating convergence. Sliding interface conditions are also implemented. A four-node Lagrangian uniform strain element is used with orthogonal hourglass viscosity to control the zero energy modes. Three sets of continuum equations are needed - kinematic statements, constitutive equations, and equations of equilibrium - to describe the deformed configuration of the body. 3 - Restrictions on the complexity of the problem - Maxima of: 10 load and solution control functions, 4 materials. The strain rate is assumed constant over a time interval. Current large rotation theory is applicable to a maximum shear strain of 1.0. JAC should be used with caution for large shear strains. Problem size is limited only by available memory
Problems in nonlinear resistive MHD
International Nuclear Information System (INIS)
Turnbull, A.D.; Strait, E.J.; La Haye, R.J.; Chu, M.S.; Miller, R.L.
1998-01-01
Two experimentally relevant problems can relatively easily be tackled by nonlinear MHD codes. Both problems require plasma rotation in addition to the nonlinear mode coupling and full geometry already incorporated into the codes, but no additional physics seems to be crucial. These problems discussed here are: (1) nonlinear coupling and interaction of multiple MHD modes near the B limit and (2) nonlinear coupling of the m/n = 1/1 sawtooth mode with higher n gongs and development of seed islands outside q = 1
The nurse scheduling problem: a goal programming and nonlinear optimization approaches
Hakim, L.; Bakhtiar, T.; Jaharuddin
2017-01-01
Nurses scheduling is an activity of allocating nurses to conduct a set of tasks at certain room at a hospital or health centre within a certain period. One of obstacles in the nurse scheduling is the lack of resources in order to fulfil the needs of the hospital. Nurse scheduling which is undertaken manually will be at risk of not fulfilling some nursing rules set by the hospital. Therefore, this study aimed to perform scheduling models that satisfy all the specific rules set by the management of Bogor State Hospital. We have developed three models to overcome the scheduling needs. Model 1 is designed to schedule nurses who are solely assigned to a certain inpatient unit and Model 2 is constructed to manage nurses who are assigned to an inpatient room as well as at Polyclinic room as conjunct nurses. As the assignment of nurses on each shift is uneven, then we propose Model 3 to minimize the variance of the workload in order to achieve equitable assignment on every shift. The first two models are formulated in goal programming framework, while the last model is in nonlinear optimization form.
Nonlinear problems in theoretical physics
International Nuclear Information System (INIS)
Ranada, A.F.
1979-01-01
This volume contains the lecture notes and review talks delivered at the 9th GIFT international seminar on theoretical physics on the general subject 'Nonlinear Problems in Theoretical Physics'. Mist contributions deal with recent developments in the theory of the spectral transformation and solitons, but there are also articles from the field of transport theory and plasma physics and an unconventional view of classical and quantum electrodynamics. All contributions to this volume will appear under their corresponding subject categories. (HJ)
Recent advances in multiparametric nonlinear programming
Domí nguez, Luis F.; Narciso, Diogo A.; Pistikopoulos, Efstratios N.
2010-01-01
In this paper, we present recent developments in multiparametric nonlinear programming. For the case of convex problems, we highlight key issues regarding the full characterization of the parametric solution space and we discuss, through an illustrative example problem, four alternative state-of-the-art multiparametric nonlinear programming algorithms. We also identify a number of main challenges for the non-convex case and highlight future research directions. © 2009 Elsevier Ltd. All rights reserved.
Recent advances in multiparametric nonlinear programming
Domínguez, Luis F.
2010-05-01
In this paper, we present recent developments in multiparametric nonlinear programming. For the case of convex problems, we highlight key issues regarding the full characterization of the parametric solution space and we discuss, through an illustrative example problem, four alternative state-of-the-art multiparametric nonlinear programming algorithms. We also identify a number of main challenges for the non-convex case and highlight future research directions. © 2009 Elsevier Ltd. All rights reserved.
A solution to nonlinearity problems
International Nuclear Information System (INIS)
Neuffer, D.V.
1989-01-01
New methods of correcting dynamic nonlinearities resulting from the multipole content of a synchrotron or transport line are presented. In a simplest form, correction elements are places at the center (C) of the accelerator half-cells as well as near the focusing (F) and defocusing (D) quadrupoles. In a first approximation, the corrector strengths follow Simpson's Rule, forming an accurate quasi-local canceling approximation to the nonlinearity. The F, C, and D correctors may also be used to obtain precise control of the horizontal, coupled, and vertical motion. Correction by three or more orders of magnitude can be obtained, and simple solutions to a fundamental problem in beam transport have been obtained. 13 refs., 1 fig., 1 tab
Nonlinear programming analysis and methods
Avriel, Mordecai
2012-01-01
This text provides an excellent bridge between principal theories and concepts and their practical implementation. Topics include convex programming, duality, generalized convexity, analysis of selected nonlinear programs, techniques for numerical solutions, and unconstrained optimization methods.
Directory of Open Access Journals (Sweden)
Zulqurnain Sabir
2014-06-01
Full Text Available In this paper, computational intelligence technique are presented for solving multi-point nonlinear boundary value problems based on artificial neural networks, evolutionary computing approach, and active-set technique. The neural network is to provide convenient methods for obtaining useful model based on unsupervised error for the differential equations. The motivation for presenting this work comes actually from the aim of introducing a reliable framework that combines the powerful features of ANN optimized with soft computing frameworks to cope with such challenging system. The applicability and reliability of such methods have been monitored thoroughly for various boundary value problems arises in science, engineering and biotechnology as well. Comprehensive numerical experimentations have been performed to validate the accuracy, convergence, and robustness of the designed scheme. Comparative studies have also been made with available standard solution to analyze the correctness of the proposed scheme.
International Nuclear Information System (INIS)
Snider, D.M.
1981-02-01
INVERT 1.0 is a digital computer program written in FORTRAN IV which calculates the surface heat flux of a one-dimensional solid using an interior-measured temperature and a physical description of the solid. By using two interior-measured temperatures, INVERT 1.0 can provide a solution for the heat flux at two surfaces, the heat flux at a boundary and the time dependent power, or the heat flux at a boundary and the time varying thermal conductivity of a material composing the solid. The analytical solution to inversion problem is described for the one-dimensional cylinder, sphere, or rectangular slab. The program structure, input instructions, and sample problems demonstrating the accuracy of the solution technique are included
Nonlinear programming with feedforward neural networks.
Energy Technology Data Exchange (ETDEWEB)
Reifman, J.
1999-06-02
We provide a practical and effective method for solving constrained optimization problems by successively training a multilayer feedforward neural network in a coupled neural-network/objective-function representation. Nonlinear programming problems are easily mapped into this representation which has a simpler and more transparent method of solution than optimization performed with Hopfield-like networks and poses very mild requirements on the functions appearing in the problem. Simulation results are illustrated and compared with an off-the-shelf optimization tool.
Optimization for nonlinear inverse problem
International Nuclear Information System (INIS)
Boyadzhiev, G.; Brandmayr, E.; Pinat, T.; Panza, G.F.
2007-06-01
The nonlinear inversion of geophysical data in general does not yield a unique solution, but a single model, representing the investigated field, is preferred for an easy geological interpretation of the observations. The analyzed region is constituted by a number of sub-regions where the multi-valued nonlinear inversion is applied, which leads to a multi-valued solution. Therefore, combining the values of the solution in each sub-region, many acceptable models are obtained for the entire region and this complicates the geological interpretation of geophysical investigations. In this paper are presented new methodologies, capable to select one model, among all acceptable ones, that satisfies different criteria of smoothness in the explored space of solutions. In this work we focus on the non-linear inversion of surface waves dispersion curves, which gives structural models of shear-wave velocity versus depth, but the basic concepts have a general validity. (author)
Nonlinear acceleration of transport criticality problems
International Nuclear Information System (INIS)
Park, H.; Knoll, D.A.; Newman, C.K.
2011-01-01
We present a nonlinear acceleration algorithm for the transport criticality problem. The algorithm combines the well-known nonlinear diffusion acceleration (NDA) with a recently developed, Newton-based, nonlinear criticality acceleration (NCA) algorithm. The algorithm first employs the NDA to reduce the system to scalar flux, then the NCA is applied to the resulting drift-diffusion system. We apply a nonlinear elimination technique to eliminate the eigenvalue from the Jacobian matrix. Numerical results show that the algorithm reduces the CPU time a factor of 400 in a very diffusive system, and a factor of 5 in a non-diffusive system. (author)
Combined algorithms in nonlinear problems of magnetostatics
International Nuclear Information System (INIS)
Gregus, M.; Khoromskij, B.N.; Mazurkevich, G.E.; Zhidkov, E.P.
1988-01-01
To solve boundary problems of magnetostatics in unbounded two- and three-dimensional regions, we construct combined algorithms based on a combination of the method of boundary integral equations with the grid methods. We study the question of substantiation of the combined method of nonlinear magnetostatic problem without the preliminary discretization of equations and give some results on the convergence of iterative processes that arise in non-linear cases. We also discuss economical iterative processes and algorithms that solve boundary integral equations on certain surfaces. Finally, examples of numerical solutions of magnetostatic problems that arose when modelling the fields of electrophysical installations are given too. 14 refs.; 2 figs.; 1 tab
Advanced Research Workshop on Nonlinear Hyperbolic Problems
Serre, Denis; Raviart, Pierre-Arnaud
1987-01-01
The field of nonlinear hyperbolic problems has been expanding very fast over the past few years, and has applications - actual and potential - in aerodynamics, multifluid flows, combustion, detonics amongst other. The difficulties that arise in application are of theoretical as well as numerical nature. In fact, the papers in this volume of proceedings deal to a greater extent with theoretical problems emerging in the resolution of nonlinear hyperbolic systems than with numerical methods. The volume provides an excellent up-to-date review of the current research trends in this area.
Studies in nonlinear problems of energy
Energy Technology Data Exchange (ETDEWEB)
Matkowsky, B.J.
1992-07-01
Emphasis has been on combustion and flame propagation. The research program was on modeling, analysis and computation of combustion phenomena, with emphasis on transition from laminar to turbulent combustion. Nonlinear dynamics and pattern formation were investigated in the transition. Stability of combustion waves, and transitions to complex waves are described. Combustion waves possess large activation energies, so that chemical reactions are significant only in thin layers, or reaction zones. In limit of infinite activation energy, the zones shrink to moving surfaces, (fronts) which must be found during the analysis, so that (moving free boundary problems). The studies are carried out for limiting case with fronts, while the numerical studies are carried out for finite, though large, activation energy. Accurate resolution of the solution in the reaction zones is essential, otherwise false predictions of dynamics are possible. Since the the reaction zones move, adaptive pseudo-spectral methods were developed. The approach is based on a synergism of analytical and computational methods. The numerical computations build on and extend the analytical information. Furthermore, analytical solutions serve as benchmarks for testing the accuracy of the computation. Finally, ideas from analysis (singular perturbation theory) have induced new approaches to computations. The computational results suggest new analysis to be considered. Among the recent interesting results, was spatio-temporal chaos in combustion. One goal is extension of the adaptive pseudo-spectral methods to adaptive domain decomposition methods. Efforts have begun to develop such methods for problems with multiple reaction zones, corresponding to problems with more complex, and more realistic chemistry. Other topics included stochastics, oscillators, Rysteretic Josephson junctions, DC SQUID, Markov jumps, laser with saturable absorber, chemical physics, Brownian movement, combustion synthesis, etc.
Selected Problems in Nonlinear Dynamics and Sociophysics
Westley, Alexandra Renee
This Ph.D. dissertation focuses on a collection of problems on the dynamical behavior of nonlinear many-body systems, drawn from two substantially different areas. First, the dynamical behavior seen in strongly nonlinear lattices such as in the Fermi-Pasta-Ulam-Tsingou (FPUT) system (part I) and second, time evolution behavior of interacting living objects which can be broadly considered as sociophysics systems (part II). The studies on FPUT-like systems will comprise of five chapters, dedicated to the properties of solitary and anti-solitary waves in the system, how localized nonlinear excitations decay and spread throughout these lattices, how two colliding solitary waves can precipitate highly localized and stable excitations, a possible alternative way to view these localized excitations through Duffing oscillators, and finally an exploration of parametric resonance in an FPUT-like lattice. Part II consists of two problems in the context of sociophysics. I use molecular dynamics inspired simulations to study the size and the stability of social groups of chimpanzees (such as those seen in central Africa) and compare the results with existing observations on the stability of chimpanzee societies. Secondly, I use an agent-based model to simulate land battles between an intelligent army and an insurgency when both have access to equally powerful weaponry. The study considers genetic algorithm based adaptive strategies to infer the strategies needed for the intelligent army to win the battles.
Neutrosophic Integer Programming Problem
Directory of Open Access Journals (Sweden)
Mai Mohamed
2017-02-01
Full Text Available In this paper, we introduce the integer programming in neutrosophic environment, by considering coffecients of problem as a triangulare neutrosophic numbers. The degrees of acceptance, indeterminacy and rejection of objectives are simultaneously considered.
ROTAX: a nonlinear optimization program by axes rotation method
International Nuclear Information System (INIS)
Suzuki, Tadakazu
1977-09-01
A nonlinear optimization program employing the axes rotation method has been developed for solving nonlinear problems subject to nonlinear inequality constraints and its stability and convergence efficiency were examined. The axes rotation method is a direct search of the optimum point by rotating the orthogonal coordinate system in a direction giving the minimum objective. The searching direction is rotated freely in multi-dimensional space, so the method is effective for the problems represented with the contours having deep curved valleys. In application of the axes rotation method to the optimization problems subject to nonlinear inequality constraints, an improved version of R.R. Allran and S.E.J. Johnsen's method is used, which deals with a new objective function composed of the original objective and a penalty term to consider the inequality constraints. The program is incorporated in optimization code system SCOOP. (auth.)
Bayesian nonlinear regression for large small problems
Chakraborty, Sounak; Ghosh, Malay; Mallick, Bani K.
2012-01-01
Statistical modeling and inference problems with sample sizes substantially smaller than the number of available covariates are challenging. This is known as large p small n problem. Furthermore, the problem is more complicated when we have multiple correlated responses. We develop multivariate nonlinear regression models in this setup for accurate prediction. In this paper, we introduce a full Bayesian support vector regression model with Vapnik's ε-insensitive loss function, based on reproducing kernel Hilbert spaces (RKHS) under the multivariate correlated response setup. This provides a full probabilistic description of support vector machine (SVM) rather than an algorithm for fitting purposes. We have also introduced a multivariate version of the relevance vector machine (RVM). Instead of the original treatment of the RVM relying on the use of type II maximum likelihood estimates of the hyper-parameters, we put a prior on the hyper-parameters and use Markov chain Monte Carlo technique for computation. We have also proposed an empirical Bayes method for our RVM and SVM. Our methods are illustrated with a prediction problem in the near-infrared (NIR) spectroscopy. A simulation study is also undertaken to check the prediction accuracy of our models. © 2012 Elsevier Inc.
Bayesian nonlinear regression for large small problems
Chakraborty, Sounak
2012-07-01
Statistical modeling and inference problems with sample sizes substantially smaller than the number of available covariates are challenging. This is known as large p small n problem. Furthermore, the problem is more complicated when we have multiple correlated responses. We develop multivariate nonlinear regression models in this setup for accurate prediction. In this paper, we introduce a full Bayesian support vector regression model with Vapnik\\'s ε-insensitive loss function, based on reproducing kernel Hilbert spaces (RKHS) under the multivariate correlated response setup. This provides a full probabilistic description of support vector machine (SVM) rather than an algorithm for fitting purposes. We have also introduced a multivariate version of the relevance vector machine (RVM). Instead of the original treatment of the RVM relying on the use of type II maximum likelihood estimates of the hyper-parameters, we put a prior on the hyper-parameters and use Markov chain Monte Carlo technique for computation. We have also proposed an empirical Bayes method for our RVM and SVM. Our methods are illustrated with a prediction problem in the near-infrared (NIR) spectroscopy. A simulation study is also undertaken to check the prediction accuracy of our models. © 2012 Elsevier Inc.
Applications and algorithms for mixed integer nonlinear programming
International Nuclear Information System (INIS)
Leyffer, Sven; Munson, Todd; Linderoth, Jeff; Luedtke, James; Miller, Andrew
2009-01-01
The mathematical modeling of systems often requires the use of both nonlinear and discrete components. Discrete decision variables model dichotomies, discontinuities, and general logical relationships. Nonlinear functions are required to accurately represent physical properties such as pressure, stress, temperature, and equilibrium. Problems involving both discrete variables and nonlinear constraint functions are known as mixed-integer nonlinear programs (MINLPs) and are among the most challenging computational optimization problems faced by researchers and practitioners. In this paper, we describe relevant scientific applications that are naturally modeled as MINLPs, we provide an overview of available algorithms and software, and we describe ongoing methodological advances for solving MINLPs. These algorithmic advances are making increasingly larger instances of this important family of problems tractable.
WHAMSE: a program for three-dimensional nonlinear structural dynamics
International Nuclear Information System (INIS)
Belytschko, T.; Tsay, C.S.
1982-02-01
WHAMSE is a computer program for the nonlinear, transient analysis of structures. The formulation includes both geometric and material nonlinearities, so problems with large displacements and elastic-plastic behavior can be treated. Explicit time integration is used, so the program is most suitable for implusive loads. Energy balance calculations are provided to check numerical stability. The mass matrix is lumped. A finite element format is used for the description of the problem geometry, so the program is quite versatile in treating complex engineering structures. The following elements are included: a triangular element for thin plates and shells, a beam element, a spring element and a rigid body. Mesh generation features are provided to simplify program input. Other features of the program are: (1) a restart capability; (2) a variety of output options, such as printer plots or CALCOMP plots of selected time histories, picture (snapshot) output, and CALCOMP plots of the undeformed and deformed structure
Multisplitting for linear, least squares and nonlinear problems
Energy Technology Data Exchange (ETDEWEB)
Renaut, R.
1996-12-31
In earlier work, presented at the 1994 Iterative Methods meeting, a multisplitting (MS) method of block relaxation type was utilized for the solution of the least squares problem, and nonlinear unconstrained problems. This talk will focus on recent developments of the general approach and represents joint work both with Andreas Frommer, University of Wupertal for the linear problems and with Hans Mittelmann, Arizona State University for the nonlinear problems.
Energy Technology Data Exchange (ETDEWEB)
Cai, X C; Marcinkowski, L; Vassilevski, P S
2005-02-10
This paper extends previous results on nonlinear Schwarz preconditioning ([4]) to unstructured finite element elliptic problems exploiting now nonlocal (but small) subspaces. The non-local finite element subspaces are associated with subdomains obtained from a non-overlapping element partitioning of the original set of elements and are coarse outside the prescribed element subdomain. The coarsening is based on a modification of the agglomeration based AMGe method proposed in [8]. Then, the algebraic construction from [9] of the corresponding non-linear finite element subproblems is applied to generate the subspace based nonlinear preconditioner. The overall nonlinearly preconditioned problem is solved by an inexact Newton method. Numerical illustration is also provided.
Nonlinear singular perturbation problems of arbitrary real orders
International Nuclear Information System (INIS)
Bijura, Angelina M.
2003-10-01
Higher order asymptotic solutions of singularly perturbed nonlinear fractional integral and derivatives of order 1/2 are investigated. It is particularly shown that whilst certain asymptotic expansions are applied successfully to linear equations and particular nonlinear problems, the standard formal asymptotic expansion is appropriate for the general class of nonlinear equations. This theory is then generalised to the general equation (of order β, 0 < β < 1). (author)
Analytical Solutions to Non-linear Mechanical Oscillation Problems
DEFF Research Database (Denmark)
Kaliji, H. D.; Ghadimi, M.; Barari, Amin
2011-01-01
In this paper, the Max-Min Method is utilized for solving the nonlinear oscillation problems. The proposed approach is applied to three systems with complex nonlinear terms in their motion equations. By means of this method, the dynamic behavior of oscillation systems can be easily approximated u...
A Linearized Relaxing Algorithm for the Specific Nonlinear Optimization Problem
Directory of Open Access Journals (Sweden)
Mio Horai
2016-01-01
Full Text Available We propose a new method for the specific nonlinear and nonconvex global optimization problem by using a linear relaxation technique. To simplify the specific nonlinear and nonconvex optimization problem, we transform the problem to the lower linear relaxation form, and we solve the linear relaxation optimization problem by the Branch and Bound Algorithm. Under some reasonable assumptions, the global convergence of the algorithm is certified for the problem. Numerical results show that this method is more efficient than the previous methods.
On a non-linear pseudodifferential boundary value problem
International Nuclear Information System (INIS)
Nguyen Minh Chuong.
1989-12-01
A pseudodifferential boundary value problem for operators with symbols taking values in Sobolev spaces and with non-linear right-hand side was studied. Existence and uniqueness theorems were proved. (author). 11 refs
Nonlinear diffusion problem arising in plasma physics
International Nuclear Information System (INIS)
Berryman, J.G.; Holland, C.J.
1978-01-01
In earlier studies of plasma diffusion with Okuda-Dawson scaling (D approx. n/sup -1/2/), perturbation theory indicated that arbitrary initial data should evolve rapidly toward the separation solution of the relevant nonlinear diffusion equation. Now a Lyapunov functional has been found which is strictly decreasing in time and bounded below. The rigorous proof that arbitrary initial data evolve toeard the separable solution is summarized. Rigorous bounds on the decay time are also presented
Nonlinear Knowledge in Kernel-Based Multiple Criteria Programming Classifier
Zhang, Dongling; Tian, Yingjie; Shi, Yong
Kernel-based Multiple Criteria Linear Programming (KMCLP) model is used as classification methods, which can learn from training examples. Whereas, in traditional machine learning area, data sets are classified only by prior knowledge. Some works combine the above two classification principle to overcome the defaults of each approach. In this paper, we propose a model to incorporate the nonlinear knowledge into KMCLP in order to solve the problem when input consists of not only training example, but also nonlinear prior knowledge. In dealing with real world case breast cancer diagnosis, the model shows its better performance than the model solely based on training data.
Contribution of Fuzzy Minimal Cost Flow Problem by Possibility Programming
S. Fanati Rashidi; A. A. Noora
2010-01-01
Using the concept of possibility proposed by zadeh, luhandjula ([4,8]) and buckley ([1]) have proposed the possibility programming. The formulation of buckley results in nonlinear programming problems. Negi [6]re-formulated the approach of Buckley by the use of trapezoidal fuzzy numbers and reduced the problem into fuzzy linear programming problem. Shih and Lee ([7]) used the Negi approach to solve a minimum cost flow problem, whit fuzzy costs and the upper and lower bound. ...
Higher-order techniques for some problems of nonlinear control
Directory of Open Access Journals (Sweden)
Sarychev Andrey V.
2002-01-01
Full Text Available A natural first step when dealing with a nonlinear problem is an application of some version of linearization principle. This includes the well known linearization principles for controllability, observability and stability and also first-order optimality conditions such as Lagrange multipliers rule or Pontryagin's maximum principle. In many interesting and important problems of nonlinear control the linearization principle fails to provide a solution. In the present paper we provide some examples of how higher-order methods of differential geometric control theory can be used for the study nonlinear control systems in such cases. The presentation includes: nonlinear systems with impulsive and distribution-like inputs; second-order optimality conditions for bang–bang extremals of optimal control problems; methods of high-order averaging for studying stability and stabilization of time-variant control systems.
Duality in non-linear programming
Jeyalakshmi, K.
2018-04-01
In this paper we consider duality and converse duality for a programming problem involving convex objective and constraint functions with finite dimensional range. We do not assume any constraint qualification. The dual is presented by reducing the problem to a standard Lagrange multiplier problem.
New Exact Penalty Functions for Nonlinear Constrained Optimization Problems
Directory of Open Access Journals (Sweden)
Bingzhuang Liu
2014-01-01
Full Text Available For two kinds of nonlinear constrained optimization problems, we propose two simple penalty functions, respectively, by augmenting the dimension of the primal problem with a variable that controls the weight of the penalty terms. Both of the penalty functions enjoy improved smoothness. Under mild conditions, it can be proved that our penalty functions are both exact in the sense that local minimizers of the associated penalty problem are precisely the local minimizers of the original constrained problem.
Renormalization-group approach to nonlinear radiation-transport problems
International Nuclear Information System (INIS)
Chapline, G.F.
1980-01-01
A Monte Carlo method is derived for solving nonlinear radiation-transport problems that allows one to average over the effects of many photon absorptions and emissions at frequencies where the opacity is large. This method should allow one to treat radiation-transport problems with large optical depths, e.g., line-transport problems, with little increase in computational effort over that which is required for optically thin problems
On a Highly Nonlinear Self-Obstacle Optimal Control Problem
Energy Technology Data Exchange (ETDEWEB)
Di Donato, Daniela, E-mail: daniela.didonato@unitn.it [University of Trento, Department of Mathematics (Italy); Mugnai, Dimitri, E-mail: dimitri.mugnai@unipg.it [Università di Perugia, Dipartimento di Matematica e Informatica (Italy)
2015-10-15
We consider a non-quadratic optimal control problem associated to a nonlinear elliptic variational inequality, where the obstacle is the control itself. We show that, fixed a desired profile, there exists an optimal solution which is not far from it. Detailed characterizations of the optimal solution are given, also in terms of approximating problems.
On the solvability of initial boundary value problems for nonlinear ...
African Journals Online (AJOL)
In this paper, we study the initial boundary value problems for a non-linear time dependent Schrödinger equation with Dirichlet and Neumann boundary conditions, respectively. We prove the existence and uniqueness of solutions of the initial boundary value problems by using Galerkin's method. Keywords: Initial boundary ...
Multigrid Reduction in Time for Nonlinear Parabolic Problems
Energy Technology Data Exchange (ETDEWEB)
Falgout, R. D. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Manteuffel, T. A. [Univ. of Colorado, Boulder, CO (United States); O' Neill, B. [Univ. of Colorado, Boulder, CO (United States); Schroder, J. B. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
2016-01-04
The need for parallel-in-time is being driven by changes in computer architectures, where future speed-ups will be available through greater concurrency, but not faster clock speeds, which are stagnant.This leads to a bottleneck for sequential time marching schemes, because they lack parallelism in the time dimension. Multigrid Reduction in Time (MGRIT) is an iterative procedure that allows for temporal parallelism by utilizing multigrid reduction techniques and a multilevel hierarchy of coarse time grids. MGRIT has been shown to be effective for linear problems, with speedups of up to 50 times. The goal of this work is the efficient solution of nonlinear problems with MGRIT, where efficient is defined as achieving similar performance when compared to a corresponding linear problem. As our benchmark, we use the p-Laplacian, where p = 4 corresponds to a well-known nonlinear diffusion equation and p = 2 corresponds to our benchmark linear diffusion problem. When considering linear problems and implicit methods, the use of optimal spatial solvers such as spatial multigrid imply that the cost of one time step evaluation is fixed across temporal levels, which have a large variation in time step sizes. This is not the case for nonlinear problems, where the work required increases dramatically on coarser time grids, where relatively large time steps lead to worse conditioned nonlinear solves and increased nonlinear iteration counts per time step evaluation. This is the key difficulty explored by this paper. We show that by using a variety of strategies, most importantly, spatial coarsening and an alternate initial guess to the nonlinear time-step solver, we can reduce the work per time step evaluation over all temporal levels to a range similar with the corresponding linear problem. This allows for parallel scaling behavior comparable to the corresponding linear problem.
Renormgroup symmetries in problems of nonlinear geometrical optics
International Nuclear Information System (INIS)
Kovalev, V.F.
1996-01-01
Utilization and further development of the previously announced approach [1,2] enables one to construct renormgroup symmetries for a boundary value problem for the system of equations which describes propagation of a powerful radiation in a nonlinear medium in geometrical optics approximation. With the help of renormgroup symmetries new rigorous and approximate analytical solutions of nonlinear geometrical optics equations are obtained. Explicit analytical expressions are presented that characterize spatial evolution of laser beam which has an arbitrary intensity dependence at the boundary of the nonlinear medium. (author)
First international conference on nonlinear problems in aviation and aerospace
International Nuclear Information System (INIS)
Sivasundaram, S.
1994-01-01
The International Conference on Nonlinear Problems in Aviation and Aerospace was held at Embry-Riddle Aeronautical University, Daytona Beach, Florida on May 9-11, 1996. This conference was sponsored by the International Federation of Nonlinear Analysts, International Federation of Information Processing, and Embry-Riddle Aeronautical University. Over one hundred engineers, scientists, and mathematicians from seventeen countries attended. These proceedings include keynote addresses, invited lectures, and contributed papers presented during the conference
96 International Conference on Nonlinear Programming
1998-01-01
About 60 scientists and students attended the 96' International Conference on Nonlinear Programming, which was held September 2-5 at Institute of Compu tational Mathematics and Scientific/Engineering Computing (ICMSEC), Chi nese Academy of Sciences, Beijing, China. 25 participants were from outside China and 35 from China. The conference was to celebrate the 60's birthday of Professor M.J.D. Powell (Fellow of Royal Society, University of Cambridge) for his many contributions to nonlinear optimization. On behalf of the Chinese Academy of Sciences, vice president Professor Zhi hong Xu attended the opening ceremony of the conference to express his warm welcome to all the participants. After the opening ceremony, Professor M.J.D. Powell gave the keynote lecture "The use of band matrices for second derivative approximations in trust region methods". 13 other invited lectures on recent advances of nonlinear programming were given during the four day meeting: "Primal-dual methods for nonconvex optimization" by...
A remark on some nonlinear elliptic problems
Directory of Open Access Journals (Sweden)
Lucio Boccardo
2002-10-01
Full Text Available We shall prove an existence result of $W_0^{1,p}(Omega$ solutions for the boundary value problem $$displylines{ -mathop{m div} a(x, u,abla u=F quadmbox{in }Omegacr u=0quadmbox{on }partialOmega }$$ with right hand side in $W^{-1,p'}(Omega$. The features of the equation are that no restrictions on the growth of the function $a(x,s,xi$ with respect to $s$ are assumed and that $a(x,s,xi$ with respect to $xi$ is monotone, but not strictly monotone. We overcome the difficulty of the uncontrolled growth of $a$ thanks to a suitable definition of solution (similar to the one introduced in cite{B6} for the study of the Dirichlet problem in $L^1$ and the difficulty of the not strict monotonicity thanks to a technique (the $L^1$-version of Minty's Lemma similar to the one used in cite{BO}.
Muravyov, Alexander A.
1999-01-01
In this paper, a method for obtaining nonlinear stiffness coefficients in modal coordinates for geometrically nonlinear finite-element models is developed. The method requires application of a finite-element program with a geometrically non- linear static capability. The MSC/NASTRAN code is employed for this purpose. The equations of motion of a MDOF system are formulated in modal coordinates. A set of linear eigenvectors is used to approximate the solution of the nonlinear problem. The random vibration problem of the MDOF nonlinear system is then considered. The solutions obtained by application of two different versions of a stochastic linearization technique are compared with linear and exact (analytical) solutions in terms of root-mean-square (RMS) displacements and strains for a beam structure.
Nonlinear Elliptic Boundary Value Problems at Resonance with Nonlinear Wentzell Boundary Conditions
Directory of Open Access Journals (Sweden)
Ciprian G. Gal
2017-01-01
Full Text Available Given a bounded domain Ω⊂RN with a Lipschitz boundary ∂Ω and p,q∈(1,+∞, we consider the quasilinear elliptic equation -Δpu+α1u=f in Ω complemented with the generalized Wentzell-Robin type boundary conditions of the form bx∇up-2∂nu-ρbxΔq,Γu+α2u=g on ∂Ω. In the first part of the article, we give necessary and sufficient conditions in terms of the given functions f, g and the nonlinearities α1, α2, for the solvability of the above nonlinear elliptic boundary value problems with the nonlinear boundary conditions. In other words, we establish a sort of “nonlinear Fredholm alternative” for our problem which extends the corresponding Landesman and Lazer result for elliptic problems with linear homogeneous boundary conditions. In the second part, we give some additional results on existence and uniqueness and we study the regularity of the weak solutions for these classes of nonlinear problems. More precisely, we show some global a priori estimates for these weak solutions in an L∞-setting.
Galerkin approximations of nonlinear optimal control problems in Hilbert spaces
Directory of Open Access Journals (Sweden)
Mickael D. Chekroun
2017-07-01
Full Text Available Nonlinear optimal control problems in Hilbert spaces are considered for which we derive approximation theorems for Galerkin approximations. Approximation theorems are available in the literature. The originality of our approach relies on the identification of a set of natural assumptions that allows us to deal with a broad class of nonlinear evolution equations and cost functionals for which we derive convergence of the value functions associated with the optimal control problem of the Galerkin approximations. This convergence result holds for a broad class of nonlinear control strategies as well. In particular, we show that the framework applies to the optimal control of semilinear heat equations posed on a general compact manifold without boundary. The framework is then shown to apply to geoengineering and mitigation of greenhouse gas emissions formulated here in terms of optimal control of energy balance climate models posed on the sphere $\\mathbb{S}^2$.
PLANS; a finite element program for nonlinear analysis of structures. Volume 2: User's manual
Pifko, A.; Armen, H., Jr.; Levy, A.; Levine, H.
1977-01-01
The PLANS system, rather than being one comprehensive computer program, is a collection of finite element programs used for the nonlinear analysis of structures. This collection of programs evolved and is based on the organizational philosophy in which classes of analyses are treated individually based on the physical problem class to be analyzed. Each of the independent finite element computer programs of PLANS, with an associated element library, can be individually loaded and used to solve the problem class of interest. A number of programs have been developed for material nonlinear behavior alone and for combined geometric and material nonlinear behavior. The usage, capabilities, and element libraries of the current programs include: (1) plastic analysis of built-up structures where bending and membrane effects are significant, (2) three dimensional elastic-plastic analysis, (3) plastic analysis of bodies of revolution, and (4) material and geometric nonlinear analysis of built-up structures.
Solution of Contact Problems for Nonlinear Gao Beam and Obstacle
Directory of Open Access Journals (Sweden)
J. Machalová
2015-01-01
Full Text Available Contact problem for a large deformed beam with an elastic obstacle is formulated, analyzed, and numerically solved. The beam model is governed by a nonlinear fourth-order differential equation developed by Gao, while the obstacle is considered as the elastic foundation of Winkler’s type in some distance under the beam. The problem is static without a friction and modeled either using Signorini conditions or by means of normal compliance contact conditions. The problems are then reformulated as optimal control problems which is useful both for theoretical aspects and for solution methods. Discretization is based on using the mixed finite element method with independent discretization and interpolations for foundation and beam elements. Numerical examples demonstrate usefulness of the presented solution method. Results for the nonlinear Gao beam are compared with results for the classical Euler-Bernoulli beam model.
New preconditioned conjugate gradient algorithms for nonlinear unconstrained optimization problems
International Nuclear Information System (INIS)
Al-Bayati, A.; Al-Asadi, N.
1997-01-01
This paper presents two new predilection conjugate gradient algorithms for nonlinear unconstrained optimization problems and examines their computational performance. Computational experience shows that the new proposed algorithms generally imp lone the efficiency of Nazareth's [13] preconditioned conjugate gradient algorithm. (authors). 16 refs., 1 tab
Experimental analysis of nonlinear problems in solid mechanics
International Nuclear Information System (INIS)
1982-01-01
The booklet presents abstracts of papers from the Euromech Colloqium No. 152 held from Sept. 20th to 24th, 1982 in Wuppertal, Federal Republic of Germany. All the papers are dealing with Experimental Analysis of Nonlinear Problems in Solid Mechanics. (RW)
Multiple solutions for inhomogeneous nonlinear elliptic problems arising in astrophyiscs
Directory of Open Access Journals (Sweden)
Marco Calahorrano
2004-04-01
Full Text Available Using variational methods we prove the existence and multiplicity of solutions for some nonlinear inhomogeneous elliptic problems on a bounded domain in $mathbb{R}^n$, with $ngeq 2$ and a smooth boundary, and when the domain is $mathbb{R}_+^n$
Some problems on nonlinear hyperbolic equations and applications
Peng, YueJun
2010-01-01
This volume is composed of two parts: Mathematical and Numerical Analysis for Strongly Nonlinear Plasma Models and Exact Controllability and Observability for Quasilinear Hyperbolic Systems and Applications. It presents recent progress and results obtained in the domains related to both subjects without attaching much importance to the details of proofs but rather to difficulties encountered, to open problems and possible ways to be exploited. It will be very useful for promoting further study on some important problems in the future.
Adomian decomposition method for nonlinear Sturm-Liouville problems
Directory of Open Access Journals (Sweden)
Sennur Somali
2007-09-01
Full Text Available In this paper the Adomian decomposition method is applied to the nonlinear Sturm-Liouville problem-y" + y(tp=λy(t, y(t > 0, t ∈ I = (0, 1, y(0 = y(1 = 0, where p > 1 is a constant and λ > 0 is an eigenvalue parameter. Also, the eigenvalues and the behavior of eigenfuctions of the problem are demonstrated.
ARSTEC, Nonlinear Optimization Program Using Random Search Method
International Nuclear Information System (INIS)
Rasmuson, D. M.; Marshall, N. H.
1979-01-01
1 - Description of problem or function: The ARSTEC program was written to solve nonlinear, mixed integer, optimization problems. An example of such a problem in the nuclear industry is the allocation of redundant parts in the design of a nuclear power plant to minimize plant unavailability. 2 - Method of solution: The technique used in ARSTEC is the adaptive random search method. The search is started from an arbitrary point in the search region and every time a point that improves the objective function is found, the search region is centered at that new point. 3 - Restrictions on the complexity of the problem: Presently, the maximum number of independent variables allowed is 10. This can be changed by increasing the dimension of the arrays
Some nonlinear problems in the manipulation of beams
International Nuclear Information System (INIS)
Sessler, A.M.
1990-01-01
An overview is given of nonlinear problems that arise in the manipulation of beams. Beams can be made of material particles or photons, can be intense or dilute, can be energetic or not, and they can be propagating in vacuum or in a medium. The nonlinear aspects of the motion are different in each case, and this diversity of behavior is categorized. Many examples are given, which serves to illustrate the categorization and, furthermore, display the richness of behavior encountered in the physics of beams. 25 refs., 5 figs
Contribution of Fuzzy Minimal Cost Flow Problem by Possibility Programming
Directory of Open Access Journals (Sweden)
S. Fanati Rashidi
2010-06-01
Full Text Available Using the concept of possibility proposed by zadeh, luhandjula ([4,8] and buckley ([1] have proposed the possibility programming. The formulation of buckley results in nonlinear programming problems. Negi [6]re-formulated the approach of Buckley by the use of trapezoidal fuzzy numbers and reduced the problem into fuzzy linear programming problem. Shih and Lee ([7] used the Negi approach to solve a minimum cost flow problem, whit fuzzy costs and the upper and lower bound. In this paper we shall consider the general form of this problem where all of the parameters and variables are fuzzy and also a model for solving is proposed
A Recurrent Neural Network for Nonlinear Fractional Programming
Directory of Open Access Journals (Sweden)
Quan-Ju Zhang
2012-01-01
Full Text Available This paper presents a novel recurrent time continuous neural network model which performs nonlinear fractional optimization subject to interval constraints on each of the optimization variables. The network is proved to be complete in the sense that the set of optima of the objective function to be minimized with interval constraints coincides with the set of equilibria of the neural network. It is also shown that the network is primal and globally convergent in the sense that its trajectory cannot escape from the feasible region and will converge to an exact optimal solution for any initial point being chosen in the feasible interval region. Simulation results are given to demonstrate further the global convergence and good performance of the proposing neural network for nonlinear fractional programming problems with interval constraints.
Computer programs for nonlinear algebraic equations
International Nuclear Information System (INIS)
Asaoka, Takumi
1977-10-01
We have provided principal computer subroutines for obtaining numerical solutions of nonlinear algebraic equations through a review of the various methods. Benchmark tests were performed on these subroutines to grasp the characteristics of them compared to the existing subroutines. As computer programs based on the secant method, subroutines of the Muller's method using the Chambers' algorithm were newly developed, in addition to the equipment of subroutines of the Muller's method itself. The programs based on the Muller-Chambers' method are useful especially for low-order polynomials with complex coefficients except for the case of finding the triple roots, three close roots etc. In addition, we have equipped subroutines based on the Madsen's algorithm, a variant of the Newton's method. The subroutines have revealed themselves very useful as standard programs because all the roots are found accurately for every case though they take longer computing time than other subroutines for low-order polynomials. It is shown also that an existing subroutine of the Bairstow's method gives the fastest algorithm for polynomials with complex coefficients, except for the case of finding the triple roots etc. We have provided also subroutines to estimate error bounds for all the roots produced with the various algorithms. (auth.)
Lectures on nonlinear evolution equations initial value problems
Racke, Reinhard
2015-01-01
This book mainly serves as an elementary, self-contained introduction to several important aspects of the theory of global solutions to initial value problems for nonlinear evolution equations. The book employs the classical method of continuation of local solutions with the help of a priori estimates obtained for small data. The existence and uniqueness of small, smooth solutions that are defined for all values of the time parameter are investigated. Moreover, the asymptotic behavior of the solutions is described as time tends to infinity. The methods for nonlinear wave equations are discussed in detail. Other examples include the equations of elasticity, heat equations, the equations of thermoelasticity, Schrödinger equations, Klein-Gordon equations, Maxwell equations and plate equations. To emphasize the importance of studying the conditions under which small data problems offer global solutions, some blow-up results are briefly described. Moreover, the prospects for corresponding initial-boundary value p...
Nonlinear problems in fluid dynamics and inverse scattering: Nonlinear waves and inverse scattering
Ablowitz, Mark J.
1994-12-01
Research investigations involving the fundamental understanding and applications of nonlinear wave motion and related studies of inverse scattering and numerical computation have been carried out and a number of significant results have been obtained. A class of nonlinear wave equations which can be solved by the inverse scattering transform (IST) have been studied, including the Kadaomtsev-Petviashvili (KP) equation, the Davey-Stewartson equation, and the 2+1 Toda system. The solutions obtained by IST correspond to the Cauchy initial value problem with decaying initial data. We have also solved two important systems via the IST method: a 'Volterra' system in 2+1 dimensions and a new one dimensional nonlinear equation which we refer to as the Toda differential-delay equation. Research in computational chaos in moderate to long time numerical simulations continues.
On a mixed problem for a coupled nonlinear system
Directory of Open Access Journals (Sweden)
Marcondes R. Clark
1997-03-01
Full Text Available In this article we prove the existence and uniqueness of solutions to the mixed problem associated with the nonlinear system $$ u_{tt}-M(int_Omega |abla u|^2dxDelta u+|u|^ ho u+heta =f $$ $$ heta _t -Delta heta +u_{t}=g $$ where $M$ is a positive real function, and $f$ and $g$ are known real functions.
On discrete maximum principles for nonlinear elliptic problems
Czech Academy of Sciences Publication Activity Database
Karátson, J.; Korotov, S.; Křížek, Michal
2007-01-01
Roč. 76, č. 1 (2007), s. 99-108 ISSN 0378-4754 R&D Projects: GA MŠk 1P05ME749; GA AV ČR IAA1019201 Institutional research plan: CEZ:AV0Z10190503 Keywords : nonlinear elliptic problem * mixed boundary conditions * finite element method Subject RIV: BA - General Mathematics Impact factor: 0.738, year: 2007
Directory of Open Access Journals (Sweden)
Azza Hassan Amer
2017-12-01
Full Text Available Geometric programming problem is a powerful tool for solving some special type nonlinear programming problems. In the last few years we have seen a very rapid development on solving multiobjective geometric programming problem. A few mathematical programming methods namely fuzzy programming, goal programming and weighting methods have been applied in the recent past to find the compromise solution. In this paper, -constraint method has been applied in bi-level multiobjective geometric programming problem to find the Pareto optimal solution at each level. The equivalent mathematical programming problems are formulated to find their corresponding value of the objective function based on the duality theorem at eash level. Here, we have developed a new algorithm for fuzzy programming technique to solve bi-level multiobjective geometric programming problems to find an optimal compromise solution. Finally the solution procedure of the fuzzy technique is illustrated by a numerical example
Adolescent Assertiveness: Problems and Programs.
Reece, Randi S.; Wilborn, Bobbie L.
1980-01-01
Assertiveness training programs in the school setting provide a method to work with students with behavior problems. When students can manage their environments more effectively, they view the educational experience more positively and find that their present world and their transition to the adult world proceeds more productively. (Author)
Application of nonlinear Krylov acceleration to radiative transfer problems
International Nuclear Information System (INIS)
Till, A. T.; Adams, M. L.; Morel, J. E.
2013-01-01
The iterative solution technique used for radiative transfer is normally nested, with outer thermal iterations and inner transport iterations. We implement a nonlinear Krylov acceleration (NKA) method in the PDT code for radiative transfer problems that breaks nesting, resulting in more thermal iterations but significantly fewer total inner transport iterations. Using the metric of total inner transport iterations, we investigate a crooked-pipe-like problem and a pseudo-shock-tube problem. Using only sweep preconditioning, we compare NKA against a typical inner / outer method employing GMRES / Newton and find NKA to be comparable or superior. Finally, we demonstrate the efficacy of applying diffusion-based preconditioning to grey problems in conjunction with NKA. (authors)
A new integrability theory for certain nonlinear physical problems
International Nuclear Information System (INIS)
Berger, M.S.
1993-01-01
A new mathematically sound integrability theory for certain nonlinear problems defined by ordinary or partial differential equations is defined. The new theory works in an arbitrary finite number of space dimensions. Moreover, if a system is integrable in the new sense described here, it has a remarkable stability property that distinguishes if from any previously known integrability ideas. The new theory proceeds by establishing a ''global normal form'' for the problem at hand. This normal form holds subject to canonical coordinate transformations, extending such classical ideas by using new nonlinear methods of infinite dimensional functional analysis. The global normal form in question is related to the mathematical theory of singularities of mappings of H. Whitney and R. Thom extended globally and form finite to infinite dimensions. Thus bifurcation phenomena are naturally included in the new integrability theory. Typical examples include the classically nonintegrable Riccati equation, certain non-Euclidean mean field theories, certain parabolic reaction diffusion equations and the hyperbolic nonlinear telegrapher's equation. (Author)
Implicit solvers for large-scale nonlinear problems
International Nuclear Information System (INIS)
Keyes, David E; Reynolds, Daniel R; Woodward, Carol S
2006-01-01
Computational scientists are grappling with increasingly complex, multi-rate applications that couple such physical phenomena as fluid dynamics, electromagnetics, radiation transport, chemical and nuclear reactions, and wave and material propagation in inhomogeneous media. Parallel computers with large storage capacities are paving the way for high-resolution simulations of coupled problems; however, hardware improvements alone will not prove enough to enable simulations based on brute-force algorithmic approaches. To accurately capture nonlinear couplings between dynamically relevant phenomena, often while stepping over rapid adjustments to quasi-equilibria, simulation scientists are increasingly turning to implicit formulations that require a discrete nonlinear system to be solved for each time step or steady state solution. Recent advances in iterative methods have made fully implicit formulations a viable option for solution of these large-scale problems. In this paper, we overview one of the most effective iterative methods, Newton-Krylov, for nonlinear systems and point to software packages with its implementation. We illustrate the method with an example from magnetically confined plasma fusion and briefly survey other areas in which implicit methods have bestowed important advantages, such as allowing high-order temporal integration and providing a pathway to sensitivity analyses and optimization. Lastly, we overview algorithm extensions under development motivated by current SciDAC applications
Nonlinear beam dynamics experimental program at SPEAR
International Nuclear Information System (INIS)
Tran, P.; Pellegrini, C.; Cornacchia, M.; Lee, M.; Corbett, W.
1995-01-01
Since nonlinear effects can impose strict performance limitations on modern colliders and storage rings, future performance improvements depend on further understanding of nonlinear beam dynamics. Experimental studies of nonlinear beam motion in three-dimensional space have begun in SPEAR using turn-by-turn transverse and longitudinal phase-space monitors. This paper presents preliminary results from an on-going experiment in SPEAR
Global Optimization of Nonlinear Blend-Scheduling Problems
Directory of Open Access Journals (Sweden)
Pedro A. Castillo Castillo
2017-04-01
Full Text Available The scheduling of gasoline-blending operations is an important problem in the oil refining industry. This problem not only exhibits the combinatorial nature that is intrinsic to scheduling problems, but also non-convex nonlinear behavior, due to the blending of various materials with different quality properties. In this work, a global optimization algorithm is proposed to solve a previously published continuous-time mixed-integer nonlinear scheduling model for gasoline blending. The model includes blend recipe optimization, the distribution problem, and several important operational features and constraints. The algorithm employs piecewise McCormick relaxation (PMCR and normalized multiparametric disaggregation technique (NMDT to compute estimates of the global optimum. These techniques partition the domain of one of the variables in a bilinear term and generate convex relaxations for each partition. By increasing the number of partitions and reducing the domain of the variables, the algorithm is able to refine the estimates of the global solution. The algorithm is compared to two commercial global solvers and two heuristic methods by solving four examples from the literature. Results show that the proposed global optimization algorithm performs on par with commercial solvers but is not as fast as heuristic approaches.
Lavrentiev regularization method for nonlinear ill-posed problems
International Nuclear Information System (INIS)
Kinh, Nguyen Van
2002-10-01
In this paper we shall be concerned with Lavientiev regularization method to reconstruct solutions x 0 of non ill-posed problems F(x)=y o , where instead of y 0 noisy data y δ is an element of X with absolut(y δ -y 0 ) ≤ δ are given and F:X→X is an accretive nonlinear operator from a real reflexive Banach space X into itself. In this regularization method solutions x α δ are obtained by solving the singularly perturbed nonlinear operator equation F(x)+α(x-x*)=y δ with some initial guess x*. Assuming certain conditions concerning the operator F and the smoothness of the element x*-x 0 we derive stability estimates which show that the accuracy of the regularized solutions is order optimal provided that the regularization parameter α has been chosen properly. (author)
Non-linear programming method in optimization of fast reactors
International Nuclear Information System (INIS)
Pavelesku, M.; Dumitresku, Kh.; Adam, S.
1975-01-01
Application of the non-linear programming methods on optimization of nuclear materials distribution in fast reactor is discussed. The programming task composition is made on the basis of the reactor calculation dependent on the fuel distribution strategy. As an illustration of this method application the solution of simple example is given. Solution of the non-linear program is done on the basis of the numerical method SUMT. (I.T.)
Nonlinear Eigenvalue Problems in Elliptic Variational Inequalities: a local study
International Nuclear Information System (INIS)
Conrad, F.; Brauner, C.; Issard-Roch, F.; Nicolaenko, B.
1985-01-01
The authors consider a class of Nonlinear Eigenvalue Problems (N.L.E.P.) associated with Elliptic Variational Inequalities (E.V.I.). First the authors introduce the main tools for a local study of branches of solutions; the authors extend the linearization process required in the case of equations. Next the authors prove the existence of arcs of solutions close to regular vs singular points, and determine their local behavior up to the first order. Finally, the authors discuss the connection between their regularity condition and some stability concept. 37 references, 6 figures
Nonlinear triple-point problems on time scales
Directory of Open Access Journals (Sweden)
Douglas R. Anderson
2004-04-01
Full Text Available We establish the existence of multiple positive solutions to the nonlinear second-order triple-point boundary-value problem on time scales, $$displaylines{ u^{Delta abla}(t+h(tf(t,u(t=0, cr u(a=alpha u(b+delta u^Delta(a,quad eta u(c+gamma u^Delta(c=0 }$$ for $tin[a,c]subsetmathbb{T}$, where $mathbb{T}$ is a time scale, $eta, gamma, deltage 0$ with $Beta+gamma>0$, $0
Eigenvalue problems for degenerate nonlinear elliptic equations in anisotropic media
Directory of Open Access Journals (Sweden)
Vicenţiu RăDulescu
2005-06-01
Full Text Available We study nonlinear eigenvalue problems of the type Ã¢ÂˆÂ’div(a(xÃ¢ÂˆÂ‡u=g(ÃŽÂ»,x,u in Ã¢Â„ÂN, where a(x is a degenerate nonnegative weight. We establish the existence of solutions and we obtain information on qualitative properties as multiplicity and location of solutions. Our approach is based on the critical point theory in Sobolev weighted spaces combined with a Caffarelli-Kohn-Nirenberg-type inequality. A specific minimax method is developed without making use of Palais-Smale condition.
Numerical solution of non-linear diffusion problems
International Nuclear Information System (INIS)
Carmen, A. del; Ferreri, J.C.
1998-01-01
This paper presents a method for the numerical solution of non-linear diffusion problems using finite-differences in moving grids. Due to the presence of steep fronts in the solution domain and to the presence of advective terms originating in the grid movement, an implicit TVD scheme, first order in time and second order in space has been developed. Some algebraic details of the derivation are given. Results are shown for the pure advection of a scalar as a test case and an example dealing with the slow spreading of viscous fluids over plane surfaces. The agreement between numerical and analytical solutions is excellent. (author). 8 refs., 3 figs
Chenlu Miao; Gang Du; Yi Xia; Danping Wang
2016-01-01
Many leader-follower relationships exist in product family design engineering problems. We use bilevel programming (BLP) to reflect the leader-follower relationship and describe such problems. Product family design problems have unique characteristics; thus, mixed integer nonlinear BLP (MINLBLP), which has both continuous and discrete variables and multiple independent lower-level problems, is widely used in product family optimization. However, BLP is difficult in theory and is an NP-hard pr...
Electric generating capacity planning: A nonlinear programming approach
Energy Technology Data Exchange (ETDEWEB)
Yakin, M.Z.; McFarland, J.W.
1987-02-01
This paper presents a nonlinear programming approach for long-range generating capacity expansion planning in electrical power systems. The objective in the model is the minimization of total cost consisting of investment cost plus generation cost for a multi-year planning horizon. Reliability constraints are imposed by using standard and practical reserve margin requirements. State equations representing the dynamic aspect of the problem are included. The electricity demand (load) and plant availabilities are treated as random variables, and the method of cumulants is used to calculate the expected energy generated by each plant in each year of the planning horizon. The resulting model has a (highly) nonlinear objective function and linear constraints. The planning model is solved over the multiyear planning horizon instead of decomposing it into one-year period problems. This approach helps the utility decision maker to carry out extensive sensitivity analysis easily. A case study example is provided using EPRI test data. Relationships among the reserve margin, total cost and surplus energy generating capacity over the planning horizon are explored by analyzing the model.
Nonlinear problems of the theory of heterogeneous slightly curved shells
Kantor, B. Y.
1973-01-01
An account if given of the variational method of the solution of physically and geometrically nonlinear problems of the theory of heterogeneous slightly curved shells. Examined are the bending and supercritical behavior of plates and conical and spherical cupolas of variable thickness in a temperature field, taking into account the dependence of the elastic parameters on temperature. The bending, stability in general and load-bearing capacity of flexible isotropic elastic-plastic shells with different criteria of plasticity, taking into account compressibility and hardening. The effect of the plastic heterogeneity caused by heat treatment, surface work hardening and irradiation by fast neutron flux is investigated. Some problems of the dynamic behavior of flexible shells are solved. Calculations are performed in high approximations. Considerable attention is given to the construction of a machine algorithm and to the checking of the convergence of iterative processes.
Stokes phenomena and monodromy deformation problem for nonlinear Schrodinger equation
International Nuclear Information System (INIS)
Chowdury, A.R.; Naskar, M.
1986-01-01
Following Flaschka and Newell, the inverse problem for Painleve IV is formulated with the help of similarity variables. The Painleve IV arises as the eliminant of the two second-order ordinary differential equations originating from the nonlinear Schrodinger equation. Asymptotic expansions are obtained near the singularities at zero and infinity of the complex eigenvalue plane. The corresponding analysis then displays the Stokes phenomena. The monodromy matrices connecting the solution Y /sub j/ in the sector S /sub j/ to that in S /sub j+1/ are fixed in structure by the imposition of certain conditions. It is then shown that a deformation keeping the monodromy data fixed leads to the nonlinear Schrodinger equation. While Flaschka and Newell did not make any absolute determination of the Stokes parameters, the present approach yields the values of the Stokes parameters in an explicit way, which in turn can determine the matrix connecting the solutions near zero and infinity. Finally, it is shown that the integral equation originating from the analyticity and asymptotic nature of the problem leads to the similarity solution previously determined by Boiti and Pampinelli
Nonlinear Preconditioning and its Application in Multicomponent Problems
Liu, Lulu
2015-12-07
The Multiplicative Schwarz Preconditioned Inexact Newton (MSPIN) algorithm is presented as a complement to Additive Schwarz Preconditioned Inexact Newton (ASPIN). At an algebraic level, ASPIN and MSPIN are variants of the same strategy to improve the convergence of systems with unbalanced nonlinearities; however, they have natural complementarity in practice. MSPIN is naturally based on partitioning of degrees of freedom in a nonlinear PDE system by field type rather than by subdomain, where a modest factor of concurrency can be sacrificed for physically motivated convergence robustness. ASPIN, originally introduced for decompositions into subdomains, is natural for high concurrency and reduction of global synchronization. The ASPIN framework, as an option for the outermost solver, successfully handles strong nonlinearities in computational fluid dynamics, but is barely explored for the highly nonlinear models of complex multiphase flow with capillarity, heterogeneity, and complex geometry. In this dissertation, the fully implicit ASPIN method is demonstrated for a finite volume discretization based on incompressible two-phase reservoir simulators in the presence of capillary forces and gravity. Numerical experiments show that the number of global nonlinear iterations is not only scalable with respect to the number of processors, but also significantly reduced compared with the standard inexact Newton method with a backtracking technique. Moreover, the ASPIN method, in contrast with the IMPES method, saves overall execution time because of the savings in timestep size. We consider the additive and multiplicative types of inexact Newton algorithms in the field-split context, and we augment the classical convergence theory of ASPIN for the multiplicative case. Moreover, we provide the convergence analysis of the MSPIN algorithm. Under suitable assumptions, it is shown that MSPIN is locally convergent, and desired superlinear or even quadratic convergence can be
Fault detection for nonlinear systems - A standard problem approach
DEFF Research Database (Denmark)
Stoustrup, Jakob; Niemann, Hans Henrik
1998-01-01
The paper describes a general method for designing (nonlinear) fault detection and isolation (FDI) systems for nonlinear processes. For a rich class of nonlinear systems, a nonlinear FDI system can be designed using convex optimization procedures. The proposed method is a natural extension...
Initial boundary value problems of nonlinear wave equations in an exterior domain
International Nuclear Information System (INIS)
Chen Yunmei.
1987-06-01
In this paper, we investigate the existence and uniqueness of the global solutions to the initial boundary value problems of nonlinear wave equations in an exterior domain. When the space dimension n >= 3, the unique global solution of the above problem is obtained for small initial data, even if the nonlinear term is fully nonlinear and contains the unknown function itself. (author). 10 refs
Development of nonlinear dynamic analysis program for nuclear piping systems
International Nuclear Information System (INIS)
Kamichika, Ryoichi; Izawa, Masahiro; Yamadera, Masao
1980-01-01
In the design for nuclear power piping, pipe-whip protection shall be considered in order to keep the function of safety related system even when postulated piping rupture occurs. This guideline was shown in U.S. Regulatory Guide 1.46 for the first time and has been applied in Japanese nuclear power plants. In order to analyze the dynamic behavior followed by pipe rupture, nonlinear analysis is required for the piping system including restraints which play the role of an energy absorber. REAPPS (Rupture Effective Analysis of Piping Systems) has been developed for this purpose. This program can be applied to general piping systems having branches etc. Pre- and post- processors are prepared in this program in order to easily input the data for the piping engineer and show the results optically by use of a graphic display respectively. The piping designer can easily solve many problems in his daily work by use of this program. This paper describes about the theoretical background and functions of this program and shows some examples. (author)
Linear differential equations to solve nonlinear mechanical problems: A novel approach
Nair, C. Radhakrishnan
2004-01-01
Often a non-linear mechanical problem is formulated as a non-linear differential equation. A new method is introduced to find out new solutions of non-linear differential equations if one of the solutions of a given non-linear differential equation is known. Using the known solution of the non-linear differential equation, linear differential equations are set up. The solutions of these linear differential equations are found using standard techniques. Then the solutions of the linear differe...
Chang, Hung-Chieh; Lin, Pei-Chun
2014-02-01
Economic dispatch is the short-term determination of the optimal output from a number of electricity generation facilities to meet the system load while providing power. As such, it represents one of the main optimization problems in the operation of electrical power systems. This article presents techniques to substantially improve the efficiency of the canonical coordinates method (CCM) algorithm when applied to nonlinear combined heat and power economic dispatch (CHPED) problems. The improvement is to eliminate the need to solve a system of nonlinear differential equations, which appears in the line search process in the CCM algorithm. The modified algorithm was tested and the analytical solution was verified using nonlinear CHPED optimization problems, thereby demonstrating the effectiveness of the algorithm. The CCM methods proved numerically stable and, in the case of nonlinear programs, produced solutions with unprecedented accuracy within a reasonable time.
FATAL, General Experiment Fitting Program by Nonlinear Regression Method
International Nuclear Information System (INIS)
Salmon, L.; Budd, T.; Marshall, M.
1982-01-01
1 - Description of problem or function: A generalized fitting program with a free-format keyword interface to the user. It permits experimental data to be fitted by non-linear regression methods to any function describable by the user. The user requires the minimum of computer experience but needs to provide a subroutine to define his function. Some statistical output is included as well as 'best' estimates of the function's parameters. 2 - Method of solution: The regression method used is based on a minimization technique devised by Powell (Harwell Subroutine Library VA05A, 1972) which does not require the use of analytical derivatives. The method employs a quasi-Newton procedure balanced with a steepest descent correction. Experience shows this to be efficient for a very wide range of application. 3 - Restrictions on the complexity of the problem: The current version of the program permits functions to be defined with up to 20 parameters. The function may be fitted to a maximum of 400 points, preferably with estimated values of weight given
Nonlinear Preconditioning and its Application in Multicomponent Problems
Liu, Lulu
2015-01-01
the convergence of systems with unbalanced nonlinearities; however, they have natural complementarity in practice. MSPIN is naturally based on partitioning of degrees of freedom in a nonlinear PDE system by field type rather than by subdomain, where a modest
Energy Technology Data Exchange (ETDEWEB)
Carey, G.F.; Young, D.M.
1993-12-31
The program outlined here is directed to research on methods, algorithms, and software for distributed parallel supercomputers. Of particular interest are finite element methods and finite difference methods together with sparse iterative solution schemes for scientific and engineering computations of very large-scale systems. Both linear and nonlinear problems will be investigated. In the nonlinear case, applications with bifurcation to multiple solutions will be considered using continuation strategies. The parallelizable numerical methods of particular interest are a family of partitioning schemes embracing domain decomposition, element-by-element strategies, and multi-level techniques. The methods will be further developed incorporating parallel iterative solution algorithms with associated preconditioners in parallel computer software. The schemes will be implemented on distributed memory parallel architectures such as the CRAY MPP, Intel Paragon, the NCUBE3, and the Connection Machine. We will also consider other new architectures such as the Kendall-Square (KSQ) and proposed machines such as the TERA. The applications will focus on large-scale three-dimensional nonlinear flow and reservoir problems with strong convective transport contributions. These are legitimate grand challenge class computational fluid dynamics (CFD) problems of significant practical interest to DOE. The methods developed and algorithms will, however, be of wider interest.
Variational problems arising in classical mechanics and nonlinear elasticity
International Nuclear Information System (INIS)
Spencer, P.
1999-01-01
In this thesis we consider two different classes of variational problems. First, one-dimensional problems arising from classical mechanics where the problem is to determine whether there is a unique function η 0 (x) which minimises the energy functional of the form I(η) = ∫ a b L(x,η(x), η'(x)) dx. We will investigate uniqueness by making a change of dependent and independent variables and showing that for a class of integrands L with a particular kind of scaling invariance the resulting integrand is completely convex. The change of variables arises by applying results from Lie group theory as applied in the study of differential equations and this work is motivated by [60] and [68]. Second, the problem of minimising energy functionals of the form E(u) = ∫ A W(∇u(x)) dx in the case of a nonlinear elastic body occupying an annular region A contains R 2 with u : A-bar → A-bar. This work is motivated by [57] (in particular the example of paragraph 4). We will consider rotationally symmetric deformations satisfying prescribed boundary conditions. We will show the existence of minimisers for stored energy functions of the form W(F) = g-tilde(vertical bar-F-vertical bar, det(F)) in a class of general rotationally symmetric deformations of a compressible annulus and for stored energy functions of the form W(F) = g-bar(vertical bar-F-vertical bar) in a class of rotationally symmetric deformations of an incompressible annulus. We will also show that in each case the minimisers are solutions of the full equilibrium equations. A model problem will be considered where the energy functional is the Dirichlet integral and it will be shown that the rotationally symmetric solution obtained is a minimiser among admissible non-rotationally symmetric deformations. In the case of an incompressible annulus, we will consider the Dirichlet integral as the energy functional and show that the rotationally symmetric equilibrium solutions in this case are weak local minimisers in
Geometric Programming Approach to an Interactive Fuzzy Inventory Problem
Directory of Open Access Journals (Sweden)
Nirmal Kumar Mandal
2011-01-01
Full Text Available An interactive multiobjective fuzzy inventory problem with two resource constraints is presented in this paper. The cost parameters and index parameters, the storage space, the budgetary cost, and the objective and constraint goals are imprecise in nature. These parameters and objective goals are quantified by linear/nonlinear membership functions. A compromise solution is obtained by geometric programming method. If the decision maker is not satisfied with this result, he/she may try to update the current solution to his/her satisfactory solution. In this way we implement man-machine interactive procedure to solve the problem through geometric programming method.
Application of HPEM to investigate the response and stability of nonlinear problems in vibration
DEFF Research Database (Denmark)
Mohammadi, M.H.; Mohammadi, A.; Kimiaeifar, A.
2010-01-01
In this work, a powerful analytical method, called He's Parameter Expanding Methods (HPEM) is used to obtain the exact solution of nonlinear problems in nonlinear vibration. In this work, the governing equation is obtained by using Lagrange method, then the nonlinear governing equation is solved...
Measurement problem in PROGRAM UNIVERSE
International Nuclear Information System (INIS)
Noyes, H.P.; Gefwert, C.
1984-12-01
We present a discrete theory that meets the measurement problem in a new way. We generate a growing universe of bit strings, labeled by 2 127 + 136 strings organized by some representation of the closed, four level, combinatorial hierarchy, of bit-length N 139 greater than or equal to 139. The rest of the strings for each label, which grow in both length and number, are called addresses. The generating algorithm, called PROGRAM UNIVERSE, starts from a random choice between the two symbols ''0'' and ''1'' and grows (a) by discriminating between two randomly chosen strings and adjoining a novel result to the universe, or when the string so generated is not novel, by (b) adjoining a randomly chosen bit at the growing end of each string. We obtain, by appropriate definitions and interpretations, stable ''particles'' which satisfy the usual relativistic kinematics and quantized angular momentum without being localizable in a continuum space-time. The labeling scheme is congruent with the ''standard model'' of quarks and leptons with three generations, but for the problem at hand, the implementation of this aspect of the theory is unimportant. What matters most is that (a) these complicated ''particles'' have the periodicities familiar from relativistic ''deBroglie waves'' and resolve in a discrete way the ''wave-particle dualism'' and (b) can be ''touched'' by our discrete equivalent of ''soft photons'' in such a way as to follow, macroscopically, the usual Rutherford scattering trajectories with the associated bound states. Thus our theory could provide a discrete description of ''measurement'' in a way that allows no conceptual barrier between the ''micro'' and the ''macro'' worlds, if we are willing to base our physics on counting and exclude the ambiguities associated with the unobservable ''continuum''. 27 refs
Nonlinear problems in data-assimilation : Can synchronization help?
Tribbia, J. J.; Duane, G. S.
2009-12-01
Over the past several years, operational weather centers have initiated ensemble prediction and assimilation techniques to estimate the error covariance of forecasts in the short and the medium range. The ensemble techniques used are based on linear methods. The theory This technique s been shown to be a useful indicator of skill in the linear range where forecast errors are small relative to climatological variance. While this advance has been impressive, there are still ad hoc aspects of its use in practice, like the need for covariance inflation which are troubling. Furthermore, to be of utility in the nonlinear range an ensemble assimilation and prediction method must be capable of giving probabilistic information for the situation where a probability density forecast becomes multi-modal. A prototypical, simplest example of such a situation is the planetary-wave regime transition where the pdf is bimodal. Our recent research show how the inconsistencies and extensions of linear methodology can be consistently treated using the paradigm of synchronization which views the problems of assimilation and forecasting as that of optimizing the forecast model state with respect to the future evolution of the atmosphere.
Solving nonlinear nonstationary problem of heat-conductivity by finite element method
Directory of Open Access Journals (Sweden)
Антон Янович Карвацький
2016-11-01
Full Text Available Methodology and effective solving algorithm of non-linear dynamic problems of thermal and electric conductivity with significant temperature dependence of thermal and physical properties are given on the basis of finite element method (FEM and Newton linearization method. Discrete equations system FEM was obtained with the use of Galerkin method, where the main function is the finite element form function. The methodology based on successive solving problems of thermal and electrical conductivity has been examined in the work in order to minimize the requirements for calculating resources (RAM. in particular. Having used Mathcad software original programming code was developed to solve the given problem. After investigation of the received results, comparative analyses of accurate solution data and results of numerical solutions, obtained with the use of Matlab programming products, was held. The geometry of one fourth part of the finite sized cylinder was used to test the given numerical model. The discretization of the calculation part was fulfilled using the open programming software for automated Gmsh nets with tetrahedral units, while ParaView, which is an open programming code as well, was used to visualize the calculation results. It was found out that the maximum value violation of potential and temperature determination doesn`t exceed 0,2-0,83% in the given work according to the problem conditions
Application of the Green's function method to some nonlinear problems of an electron storage ring
International Nuclear Information System (INIS)
Kheifets, S.
1984-01-01
One of the most important characteristics of an electron storage ring is the size of the beam. However analytical calculations of beam size are beset with problems and the computational methods and programs which are used to overcome these are inadequate for all problems in which stochastic noise is an essential part. Two examples are, for an electron storage ring, beam-size evaluation including beam-beam interactions, and finding the beam size for a nonlinear machine. The method described should overcome some of the problems. It uses the Green's function method applied to the Fokker-Planck equation governing the distribution function in the phase space of particle motion. The new step is to consider the particle motion in two degrees of freedom rather than in one dimension. The technique is described fully and is then applied to a strong-focusing machine. (U.K.)
Numerical methods for solution of some nonlinear problems of mathematical physics
International Nuclear Information System (INIS)
Zhidkov, E.P.
1981-01-01
The continuous analog of the Newton method and its application to some nonlinear problems of mathematical physics using a computer is considered. It is shown that the application of this method in JINR to the wide range of nonlinear problems has shown its universality and high efficiency [ru
A fast nonlinear conjugate gradient based method for 3D frictional contact problems
Zhao, J.; Vollebregt, E.A.H.; Oosterlee, C.W.
2014-01-01
This paper presents a fast numerical solver for a nonlinear constrained optimization problem, arising from a 3D frictional contact problem. It incorporates an active set strategy with a nonlinear conjugate gradient method. One novelty is to consider the tractions of each slip element in a polar
A fast nonlinear conjugate gradient based method for 3D concentrated frictional contact problems
J. Zhao (Jing); E.A.H. Vollebregt (Edwin); C.W. Oosterlee (Cornelis)
2015-01-01
htmlabstractThis paper presents a fast numerical solver for a nonlinear constrained optimization problem, arising from 3D concentrated frictional shift and rolling contact problems with dry Coulomb friction. The solver combines an active set strategy with a nonlinear conjugate gradient method. One
Interior Point Methods for Large-Scale Nonlinear Programming
Czech Academy of Sciences Publication Activity Database
Lukšan, Ladislav; Matonoha, Ctirad; Vlček, Jan
2005-01-01
Roč. 20, č. 4-5 (2005), s. 569-582 ISSN 1055-6788 R&D Projects: GA AV ČR IAA1030405 Institutional research plan: CEZ:AV0Z10300504 Keywords : nonlinear programming * interior point methods * KKT systems * indefinite preconditioners * filter methods * algorithms Subject RIV: BA - General Mathematics Impact factor: 0.477, year: 2005
Mathematical programming methods for large-scale topology optimization problems
DEFF Research Database (Denmark)
Rojas Labanda, Susana
for mechanical problems, but has rapidly extended to many other disciplines, such as fluid dynamics and biomechanical problems. However, the novelty and improvements of optimization methods has been very limited. It is, indeed, necessary to develop of new optimization methods to improve the final designs......, and at the same time, reduce the number of function evaluations. Nonlinear optimization methods, such as sequential quadratic programming and interior point solvers, have almost not been embraced by the topology optimization community. Thus, this work is focused on the introduction of this kind of second...... for the classical minimum compliance problem. Two of the state-of-the-art optimization algorithms are investigated and implemented for this structural topology optimization problem. A Sequential Quadratic Programming (TopSQP) and an interior point method (TopIP) are developed exploiting the specific mathematical...
New results on the mathematical problems in nonlinear physics
International Nuclear Information System (INIS)
1980-01-01
The main topics treated in this report are: I) Existence of generalized Lagrangians. II) Conserved densities for odd-order polynomial evolution equations and linear evolution systems. III ) Conservation laws for Klein-Gordon, Di rae and Maxwell equations. IV) Stability conditions for finite-energy solutions of a non-linear Klein-Gordon equation. V) Hamiltonian approach to non-linear evolution equations and Backlund transformations. VI) Anharmonic vibrations: Status of results and new possible approaches. (Author) 83 refs
Costiner, Sorin; Taasan, Shlomo
1994-01-01
This paper presents multigrid (MG) techniques for nonlinear eigenvalue problems (EP) and emphasizes an MG algorithm for a nonlinear Schrodinger EP. The algorithm overcomes the mentioned difficulties combining the following techniques: an MG projection coupled with backrotations for separation of solutions and treatment of difficulties related to clusters of close and equal eigenvalues; MG subspace continuation techniques for treatment of the nonlinearity; an MG simultaneous treatment of the eigenvectors at the same time with the nonlinearity and with the global constraints. The simultaneous MG techniques reduce the large number of self consistent iterations to only a few or one MG simultaneous iteration and keep the solutions in a right neighborhood where the algorithm converges fast.
Domínguez, Luis F.
2010-12-01
This work introduces two algorithms for the solution of pure integer and mixed-integer bilevel programming problems by multiparametric programming techniques. The first algorithm addresses the integer case of the bilevel programming problem where integer variables of the outer optimization problem appear in linear or polynomial form in the inner problem. The algorithm employs global optimization techniques to convexify nonlinear terms generated by a reformulation linearization technique (RLT). A continuous multiparametric programming algorithm is then used to solve the reformulated convex inner problem. The second algorithm addresses the mixed-integer case of the bilevel programming problem where integer and continuous variables of the outer problem appear in linear or polynomial forms in the inner problem. The algorithm relies on the use of global multiparametric mixed-integer programming techniques at the inner optimization level. In both algorithms, the multiparametric solutions obtained are embedded in the outer problem to form a set of single-level (M)(I)(N)LP problems - which are then solved to global optimality using standard fixed-point (global) optimization methods. Numerical examples drawn from the open literature are presented to illustrate the proposed algorithms. © 2010 Elsevier Ltd.
The solution of a coupled system of nonlinear physical problems using the homotopy analysis method
International Nuclear Information System (INIS)
El-Wakil, S A; Abdou, M A
2010-01-01
In this article, the homotopy analysis method (HAM) has been applied to solve coupled nonlinear evolution equations in physics. The validity of this method has been successfully demonstrated by applying it to two nonlinear evolution equations, namely coupled nonlinear diffusion reaction equations and the (2+1)-dimensional Nizhnik-Novikov Veselov system. The results obtained by this method show good agreement with the ones obtained by other methods. The proposed method is a powerful and easy to use analytic tool for nonlinear problems and does not need small parameters in the equations. The HAM solutions contain an auxiliary parameter that provides a convenient way of controlling the convergence region of series solutions. The results obtained here reveal that the proposed method is very effective and simple for solving nonlinear evolution equations. The basic ideas of this approach can be widely employed to solve other strongly nonlinear problems.
From a Nonlinear, Nonconvex Variational Problem to a Linear, Convex Formulation
International Nuclear Information System (INIS)
Egozcue, J.; Meziat, R.; Pedregal, P.
2002-01-01
We propose a general approach to deal with nonlinear, nonconvex variational problems based on a reformulation of the problem resulting in an optimization problem with linear cost functional and convex constraints. As a first step we explicitly explore these ideas to some one-dimensional variational problems and obtain specific conclusions of an analytical and numerical nature
Bivium as a Mixed Integer Programming Problem
DEFF Research Database (Denmark)
Borghoff, Julia; Knudsen, Lars Ramkilde; Stolpe, Mathias
2009-01-01
over $GF(2)$ into a combinatorial optimization problem. We convert the Boolean equation system into an equation system over $\\mathbb{R}$ and formulate the problem of finding a $0$-$1$-valued solution for the system as a mixed-integer programming problem. This enables us to make use of several...
Mathematical problems in non-linear Physics: some results
International Nuclear Information System (INIS)
1979-01-01
The basic results presented in this report are the following: 1) Characterization of the range and Kernel of the variational derivative. 2) Determination of general conservation laws in linear evolution equations, as well as bounds for the number of polynomial conserved densities in non-linear evolution equations in two independent variables of even order. 3) Construction of the most general evolution equation which has a given family of conserved densities. 4) Regularity conditions for the validity of the Lie invariance method. 5) A simple class of perturbations in non-linear wave equations. 6) Soliton solutions in generalized KdV equations. (author)
Leibov Roman
2017-01-01
This paper presents a bilinear approach to nonlinear differential equations system approximation problem. Sometimes the nonlinear differential equations right-hand sides linearization is extremely difficult or even impossible. Then piecewise-linear approximation of nonlinear differential equations can be used. The bilinear differential equations allow to improve piecewise-linear differential equations behavior and reduce errors on the border of different linear differential equations systems ...
Energy Technology Data Exchange (ETDEWEB)
Zou, Li [Dalian Univ. of Technology, Dalian City (China). State Key Lab. of Structural Analysis for Industrial Equipment; Liang, Songxin; Li, Yawei [Dalian Univ. of Technology, Dalian City (China). School of Mathematical Sciences; Jeffrey, David J. [Univ. of Western Ontario, London (Canada). Dept. of Applied Mathematics
2017-06-01
Nonlinear boundary value problems arise frequently in physical and mechanical sciences. An effective analytic approach with two parameters is first proposed for solving nonlinear boundary value problems. It is demonstrated that solutions given by the two-parameter method are more accurate than solutions given by the Adomian decomposition method (ADM). It is further demonstrated that solutions given by the ADM can also be recovered from the solutions given by the two-parameter method. The effectiveness of this method is demonstrated by solving some nonlinear boundary value problems modeling beam-type nano-electromechanical systems.
Polyanin, A. D.; Sorokin, V. G.
2017-12-01
The paper deals with nonlinear reaction-diffusion equations with one or several delays. We formulate theorems that allow constructing exact solutions for some classes of these equations, which depend on several arbitrary functions. Examples of application of these theorems for obtaining new exact solutions in elementary functions are provided. We state basic principles of construction, selection, and use of test problems for nonlinear partial differential equations with delay. Some test problems which can be suitable for estimating accuracy of approximate analytical and numerical methods of solving reaction-diffusion equations with delay are presented. Some examples of numerical solutions of nonlinear test problems with delay are considered.
Solving Large Scale Nonlinear Eigenvalue Problem in Next-Generation Accelerator Design
Energy Technology Data Exchange (ETDEWEB)
Liao, Ben-Shan; Bai, Zhaojun; /UC, Davis; Lee, Lie-Quan; Ko, Kwok; /SLAC
2006-09-28
A number of numerical methods, including inverse iteration, method of successive linear problem and nonlinear Arnoldi algorithm, are studied in this paper to solve a large scale nonlinear eigenvalue problem arising from finite element analysis of resonant frequencies and external Q{sub e} values of a waveguide loaded cavity in the next-generation accelerator design. They present a nonlinear Rayleigh-Ritz iterative projection algorithm, NRRIT in short and demonstrate that it is the most promising approach for a model scale cavity design. The NRRIT algorithm is an extension of the nonlinear Arnoldi algorithm due to Voss. Computational challenges of solving such a nonlinear eigenvalue problem for a full scale cavity design are outlined.
Ultimate limit state design of sheet pile walls by finite elements and nonlinear programming
DEFF Research Database (Denmark)
Krabbenhøft, Kristian; Damkilde, Lars; Krabbenhøft, Sven
2005-01-01
The design of sheet pile walls by lower bound limit analysis is considered. The design problem involves the determination of the necessary yield moment of the wall, the wall depth and the anchor force such that the structure is able to sustain the given loads. This problem is formulated...... as a nonlinear programming problem where the yield moment of the wall is minimized subject to equilibrium and yield conditions. The finite element discretization used enables exact fulfillment of these conditions and thus, according to the lower bound theorem, the solutions are safe....
Morozov-type discrepancy principle for nonlinear ill-posed problems ...
Indian Academy of Sciences (India)
For proving the existence of a regularization parameter under a Morozov-type discrepancy principle for Tikhonov regularization of nonlinear ill-posed problems, it is required to impose additional nonlinearity assumptions on the forward operator. Lipschitz continuity of the Freéchet derivative and requirement of the Lipschitz ...
Analytical Solution of Nonlinear Problems in Classical Dynamics by Means of Lagrange-Ham
DEFF Research Database (Denmark)
Kimiaeifar, Amin; Mahdavi, S. H; Rabbani, A.
2011-01-01
In this work, a powerful analytical method, called Homotopy Analysis Methods (HAM) is coupled with Lagrange method to obtain the exact solution for nonlinear problems in classic dynamics. In this work, the governing equations are obtained by using Lagrange method, and then the nonlinear governing...
Morozov-type discrepancy principle for nonlinear ill-posed problems ...
Indian Academy of Sciences (India)
2016-08-26
Aug 26, 2016 ... For proving the existence of a regularization parameter under a Morozov-type discrepancy principle for Tikhonov regularization of nonlinear ill-posed problems, it is required to impose additional nonlinearity assumptions on the forward operator. Lipschitz continuity of the Freéchet derivative and requirement ...
Relaxation and decomposition methods for mixed integer nonlinear programming
Nowak, Ivo; Bank, RE
2005-01-01
This book presents a comprehensive description of efficient methods for solving nonconvex mixed integer nonlinear programs, including several numerical and theoretical results, which are presented here for the first time. It contains many illustrations and an up-to-date bibliography. Because on the emphasis on practical methods, as well as the introduction into the basic theory, the book is accessible to a wide audience. It can be used both as a research and as a graduate text.
Directory of Open Access Journals (Sweden)
Olav Slupphaug
2001-01-01
Full Text Available We present a mathematical programming approach to robust control of nonlinear systems with uncertain, possibly time-varying, parameters. The uncertain system is given by different local affine parameter dependent models in different parts of the state space. It is shown how this representation can be obtained from a nonlinear uncertain system by solving a set of continuous linear semi-infinite programming problems, and how each of these problems can be solved as a (finite series of ordinary linear programs. Additionally, the system representation includes control- and state constraints. The controller design method is derived from Lyapunov stability arguments and utilizes an affine parameter dependent quadratic Lyapunov function. The controller has a piecewise affine output feedback structure, and the design amounts to finding a feasible solution to a set of linear matrix inequalities combined with one spectral radius constraint on the product of two positive definite matrices. A local solution approach to this nonconvex feasibility problem is proposed. Complexity of the design method and some special cases such as state- feedback are discussed. Finally, an application of the results is given by proposing an on-line computationally feasible algorithm for constrained nonlinear state- feedback model predictive control with robust stability.
The preparation problem in nonlinear extensions of quantum theory
Cavalcanti, Eric G.; Menicucci, Nicolas C.; Pienaar, Jacques L.
2012-01-01
Nonlinear modifications to the laws of quantum mechanics have been proposed as a possible way to consistently describe information processing in the presence of closed timelike curves. These have recently generated controversy due to possible exotic information-theoretic effects, including breaking quantum cryptography and radically speeding up both classical and quantum computers. The physical interpretation of such theories, however, is still unclear. We consider a large class of operationa...
Parallel Solution of Robust Nonlinear Model Predictive Control Problems in Batch Crystallization
Directory of Open Access Journals (Sweden)
Yankai Cao
2016-06-01
Full Text Available Representing the uncertainties with a set of scenarios, the optimization problem resulting from a robust nonlinear model predictive control (NMPC strategy at each sampling instance can be viewed as a large-scale stochastic program. This paper solves these optimization problems using the parallel Schur complement method developed to solve stochastic programs on distributed and shared memory machines. The control strategy is illustrated with a case study of a multidimensional unseeded batch crystallization process. For this application, a robust NMPC based on min–max optimization guarantees satisfaction of all state and input constraints for a set of uncertainty realizations, and also provides better robust performance compared with open-loop optimal control, nominal NMPC, and robust NMPC minimizing the expected performance at each sampling instance. The performance of robust NMPC can be improved by generating optimization scenarios using Bayesian inference. With the efficient parallel solver, the solution time of one optimization problem is reduced from 6.7 min to 0.5 min, allowing for real-time application.
A nonsmooth nonlinear conjugate gradient method for interactive contact force problems
DEFF Research Database (Denmark)
Silcowitz, Morten; Abel, Sarah Maria Niebe; Erleben, Kenny
2010-01-01
of a nonlinear complementarity problem (NCP), which can be solved using an iterative splitting method, such as the projected Gauss–Seidel (PGS) method. We present a novel method for solving the NCP problem by applying a Fletcher–Reeves type nonlinear nonsmooth conjugate gradient (NNCG) type method. We analyze...... and present experimental convergence behavior and properties of the new method. Our results show that the NNCG method has at least the same convergence rate as PGS, and in many cases better....
Non-linear analytic and coanalytic problems (Lp-theory, Clifford analysis, examples)
International Nuclear Information System (INIS)
Dubinskii, Yu A; Osipenko, A S
2000-01-01
Two kinds of new mathematical model of variational type are put forward: non-linear analytic and coanalytic problems. The formulation of these non-linear boundary-value problems is based on a decomposition of the complete scale of Sobolev spaces into the 'orthogonal' sum of analytic and coanalytic subspaces. A similar decomposition is considered in the framework of Clifford analysis. Explicit examples are presented
Non-linear analytic and coanalytic problems ( L_p-theory, Clifford analysis, examples)
Dubinskii, Yu A.; Osipenko, A. S.
2000-02-01
Two kinds of new mathematical model of variational type are put forward: non-linear analytic and coanalytic problems. The formulation of these non-linear boundary-value problems is based on a decomposition of the complete scale of Sobolev spaces into the "orthogonal" sum of analytic and coanalytic subspaces. A similar decomposition is considered in the framework of Clifford analysis. Explicit examples are presented.
Directory of Open Access Journals (Sweden)
Salih Yalcinbas
2016-01-01
Full Text Available In this study, a numerical approach is proposed to obtain approximate solutions of nonlinear system of second order boundary value problem. This technique is essentially based on the truncated Fermat series and its matrix representations with collocation points. Using the matrix method, we reduce the problem system of nonlinear algebraic equations. Numerical examples are also given to demonstrate the validity and applicability of the presented technique. The method is easy to implement and produces accurate results.
Morozov-type discrepancy principle for nonlinear ill-posed problems ...
Indian Academy of Sciences (India)
[3] Engl H W, Kunisch K and Neubauer A, Convergence rates for Tikhonov regularization of nonliner problems, Inverse Problems 5 (1989) 523–540. [4] Hanke M, Neubauer A and Scherzer O, A convergence analysis of Landweber iteration for nonlinear ill-posed problems, Numer. Math. 72 (1995) 21–37. [5] Hofmann B and ...
Minimax terminal approach problem in two-level hierarchical nonlinear discrete-time dynamical system
Energy Technology Data Exchange (ETDEWEB)
Shorikov, A. F., E-mail: afshorikov@mail.ru [Ural Federal University, 19 S. Mira, Ekaterinburg, 620002, Russia Institute of Mathematics and Mechanics, Ural Branch of Russian Academy of Sciences, 16 S. Kovalevskaya, Ekaterinburg, 620990 (Russian Federation)
2015-11-30
We consider a discrete–time dynamical system consisting of three controllable objects. The motions of all objects are given by the corresponding vector nonlinear or linear discrete–time recurrent vector relations, and control system for its has two levels: basic (first or I level) that is dominating and subordinate level (second or II level) and both have different criterions of functioning and united a priori by determined informational and control connections defined in advance. For the dynamical system in question, we propose a mathematical formalization in the form of solving a multistep problem of two-level hierarchical minimax program control over the terminal approach process with incomplete information and give a general scheme for its solving.
Costiner, Sorin; Ta'asan, Shlomo
1995-07-01
Algorithms for nonlinear eigenvalue problems (EP's) often require solving self-consistently a large number of EP's. Convergence difficulties may occur if the solution is not sought in an appropriate region, if global constraints have to be satisfied, or if close or equal eigenvalues are present. Multigrid (MG) algorithms for nonlinear problems and for EP's obtained from discretizations of partial differential EP have often been shown to be more efficient than single level algorithms. This paper presents MG techniques and a MG algorithm for nonlinear Schrödinger Poisson EP's. The algorithm overcomes the above mentioned difficulties combining the following techniques: a MG simultaneous treatment of the eigenvectors and nonlinearity, and with the global constrains; MG stable subspace continuation techniques for the treatment of nonlinearity; and a MG projection coupled with backrotations for separation of solutions. These techniques keep the solutions in an appropriate region, where the algorithm converges fast, and reduce the large number of self-consistent iterations to only a few or one MG simultaneous iteration. The MG projection makes it possible to efficiently overcome difficulties related to clusters of close and equal eigenvalues. Computational examples for the nonlinear Schrödinger-Poisson EP in two and three dimensions, presenting special computational difficulties that are due to the nonlinearity and to the equal and closely clustered eigenvalues are demonstrated. For these cases, the algorithm requires O(qN) operations for the calculation of q eigenvectors of size N and for the corresponding eigenvalues. One MG simultaneous cycle per fine level was performed. The total computational cost is equivalent to only a few Gauss-Seidel relaxations per eigenvector. An asymptotic convergence rate of 0.15 per MG cycle is attained.
DOUBLE TRIALS METHOD FOR NONLINEAR PROBLEMS ARISING IN HEAT TRANSFER
Directory of Open Access Journals (Sweden)
Chun-Hui He
2011-01-01
Full Text Available According to an ancient Chinese algorithm, the Ying Buzu Shu, in about second century BC, known as the rule of double false position in West after 1202 AD, two trial roots are assumed to solve algebraic equations. The solution procedure can be extended to solve nonlinear differential equations by constructing an approximate solution with an unknown parameter, and the unknown parameter can be easily determined using the Ying Buzu Shu. An example in heat transfer is given to elucidate the solution procedure.
Analytical vs. Simulation Solution Techniques for Pulse Problems in Non-linear Stochastic Dynamics
DEFF Research Database (Denmark)
Iwankiewicz, R.; Nielsen, Søren R. K.
Advantages and disadvantages of available analytical and simulation techniques for pulse problems in non-linear stochastic dynamics are discussed. First, random pulse problems, both those which do and do not lead to Markov theory, are presented. Next, the analytical and analytically-numerical tec......Advantages and disadvantages of available analytical and simulation techniques for pulse problems in non-linear stochastic dynamics are discussed. First, random pulse problems, both those which do and do not lead to Markov theory, are presented. Next, the analytical and analytically...
DEFF Research Database (Denmark)
Barari, Amin; Ganjavi, B.; Jeloudar, M. Ghanbari
2010-01-01
and fluid mechanics. Design/methodology/approach – Two new but powerful analytical methods, namely, He's VIM and HPM, are introduced to solve some boundary value problems in structural engineering and fluid mechanics. Findings – Analytical solutions often fit under classical perturbation methods. However......, as with other analytical techniques, certain limitations restrict the wide application of perturbation methods, most important of which is the dependence of these methods on the existence of a small parameter in the equation. Disappointingly, the majority of nonlinear problems have no small parameter at all......Purpose – In the last two decades with the rapid development of nonlinear science, there has appeared ever-increasing interest of scientists and engineers in the analytical techniques for nonlinear problems. This paper considers linear and nonlinear systems that are not only regarded as general...
Assessment of non-linear analysis finite element program (NONSAP) for inelastic analysis
International Nuclear Information System (INIS)
Chang, T.Y.; Prachuktam, S.; Reich, M.
1976-11-01
An assessment on a nonlinear structural analysis finite element program called NONSAP is given with respect to its inelastic analysis capability for pressure vessels and components. The assessment was made from the review of its theoretical basis and bench mark problem runs. It was found that NONSAP has only limited capability for inelastic analysis. However, the program was written flexible enough that it can be easily extended or modified to suit the user's need. Moreover, some of the numerical difficulties in using NONSAP are pointed out
Some contributions to non-linear physic: Mathematical problems
International Nuclear Information System (INIS)
1981-01-01
The main results contained in this report are the following: i ) Lagrangian universality holds in a precisely defined weak sense. II ) Isolation of 5th order polynomial evolution equations having high order conservation laws. III ) Hamiltonian formulation of a wide class of non-linear evolution equations. IV) Some properties of the symmetries of Gardner-like systems. v) Characterization of the range and Kernel of ζ/ζ u α , |α | - 1. vi) A generalized variational approach and application to the anharmonic oscillator. v II ) Relativistic correction and quasi-classical approximation to the anechoic oscillator. VII ) Properties of a special class of 6th-order anharmonic oscillators. ix) A new method for constructing conserved densities In PDE. (Author) 97 refs
Discrete Time McKean–Vlasov Control Problem: A Dynamic Programming Approach
Energy Technology Data Exchange (ETDEWEB)
Pham, Huyên, E-mail: pham@math.univ-paris-diderot.fr; Wei, Xiaoli, E-mail: tyswxl@gmail.com [Laboratoire de Probabilités et Modèles Aléatoires, CNRS, UMR 7599, Université Paris Diderot (France)
2016-12-15
We consider the stochastic optimal control problem of nonlinear mean-field systems in discrete time. We reformulate the problem into a deterministic control problem with marginal distribution as controlled state variable, and prove that dynamic programming principle holds in its general form. We apply our method for solving explicitly the mean-variance portfolio selection and the multivariate linear-quadratic McKean–Vlasov control problem.
Discrete Time McKean–Vlasov Control Problem: A Dynamic Programming Approach
International Nuclear Information System (INIS)
Pham, Huyên; Wei, Xiaoli
2016-01-01
We consider the stochastic optimal control problem of nonlinear mean-field systems in discrete time. We reformulate the problem into a deterministic control problem with marginal distribution as controlled state variable, and prove that dynamic programming principle holds in its general form. We apply our method for solving explicitly the mean-variance portfolio selection and the multivariate linear-quadratic McKean–Vlasov control problem.
Nonlinear radiation transport problems involving widely varying mean free paths
International Nuclear Information System (INIS)
Chapline, G. Jr.; Wood, L.
1976-01-01
In this report a method is given for modifying the Monte-Carlo approach so that one can accurately treat problems that involve both large and small mean free paths. This method purports to offer the advantages of the general Monte Carlo technique as far as relatively great accuracy of simulation of microscopic physical phenomena is concerned, and the advantage of a diffusion theory approach as far as decent time steps in thick problems are concerned; it does suffer from something of the statistical fluctuation problems of the Monte Carlo, although in analytically attenuated and modified form
Paradox in a non-linear capacitated transportation problem
Directory of Open Access Journals (Sweden)
Dahiya Kalpana
2006-01-01
Full Text Available This paper discusses a paradox in fixed charge capacitated transportation problem where the objective function is the sum of two linear fractional functions consisting of variables costs and fixed charges respectively. A paradox arises when the transportation problem admits of an objective function value which is lower than the optimal objective function value, by transporting larger quantities of goods over the same route. A sufficient condition for the existence of a paradox is established. Paradoxical range of flow is obtained for any given flow in which the corresponding objective function value is less than the optimum value of the given transportation problem. Numerical illustration is included in support of theory.
Dissipative Control Systems and Disturbance Attenuation for Nonlinear H∞ Problems
International Nuclear Information System (INIS)
Frankowska, H.; Quincampoix, M.
1999-01-01
We characterize functions satisfying a dissipative inequality associated with a control problem. Such a characterization is provided in terms of an epicontingent solution, or a viscosity supersolution to a partial differential equation called Isaacs' equation. Links between supersolutions and epicontingent solutions to Isaacs' equation are studied. Finally, we derive (possibly discontinuous) disturbance attenuation feedback of the H ∞ problem from contingent formulation of Isaacs' equation
Nonlinear Multidimensional Assignment Problems Efficient Conic Optimization Methods and Applications
2015-06-24
WORK UNIT NUMBER 7. PERFORMING ORGANIZATION NAME(S) AND ADDRESS(ES) Arizona State University School of Mathematical & Statistical Sciences 901 S...SUPPLEMENTARY NOTES 14. ABSTRACT The major goals of this project were completed: the exact solution of previously unsolved challenging combinatorial optimization... combinatorial optimization problem, the Directional Sensor Problem, was solved in two ways. First, heuristically in an engineering fashion and second, exactly
SEACAS Theory Manuals: Part 1. Problem Formulation in Nonlinear Solid Mechancis
Energy Technology Data Exchange (ETDEWEB)
Attaway, S.W.; Laursen, T.A.; Zadoks, R.I.
1998-08-01
This report gives an introduction to the basic concepts and principles involved in the formulation of nonlinear problems in solid mechanics. By way of motivation, the discussion begins with a survey of some of the important sources of nonlinearity in solid mechanics applications, using wherever possible simple one dimensional idealizations to demonstrate the physical concepts. This discussion is then generalized by presenting generic statements of initial/boundary value problems in solid mechanics, using linear elasticity as a template and encompassing such ideas as strong and weak forms of boundary value problems, boundary and initial conditions, and dynamic and quasistatic idealizations. The notational framework used for the linearized problem is then extended to account for finite deformation of possibly inelastic solids, providing the context for the descriptions of nonlinear continuum mechanics, constitutive modeling, and finite element technology given in three companion reports.
Cross-constrained problems for nonlinear Schrodinger equation with harmonic potential
Directory of Open Access Journals (Sweden)
Runzhang Xu
2012-11-01
Full Text Available This article studies a nonlinear Schodinger equation with harmonic potential by constructing different cross-constrained problems. By comparing the different cross-constrained problems, we derive different sharp criterion and different invariant manifolds that separate the global solutions and blowup solutions. Moreover, we conclude that some manifolds are empty due to the essence of the cross-constrained problems. Besides, we compare the three cross-constrained problems and the three depths of the potential wells. In this way, we explain the gaps in [J. Shu and J. Zhang, Nonlinear Shrodinger equation with harmonic potential, Journal of Mathematical Physics, 47, 063503 (2006], which was pointed out in [R. Xu and Y. Liu, Remarks on nonlinear Schrodinger equation with harmonic potential, Journal of Mathematical Physics, 49, 043512 (2008].
Directory of Open Access Journals (Sweden)
Alain Mignot
2005-09-01
Full Text Available This paper shows the existence of a solution of the quasi-static unilateral contact problem with nonlocal friction law for nonlinear elastic materials. We set up a variational incremental problem which admits a solution, when the friction coefficient is small enough, and then by passing to the limit with respect to time we obtain a solution.
Existence of bounded solutions of Neumann problem for a nonlinear degenerate elliptic equation
Directory of Open Access Journals (Sweden)
Salvatore Bonafede
2017-10-01
Full Text Available We prove the existence of bounded solutions of Neumann problem for nonlinear degenerate elliptic equations of second order in divergence form. We also study some properties as the Phragmen-Lindelof property and the asymptotic behavior of the solutions of Dirichlet problem associated to our equation in an unbounded domain.
A Weak Solution of a Stochastic Nonlinear Problem
Directory of Open Access Journals (Sweden)
M. L. Hadji
2015-01-01
Full Text Available We consider a problem modeling a porous medium with a random perturbation. This model occurs in many applications such as biology, medical sciences, oil exploitation, and chemical engineering. Many authors focused their study mostly on the deterministic case. The more classical one was due to Biot in the 50s, where he suggested to ignore everything that happens at the microscopic level, to apply the principles of the continuum mechanics at the macroscopic level. Here we consider a stochastic problem, that is, a problem with a random perturbation. First we prove a result on the existence and uniqueness of the solution, by making use of the weak formulation. Furthermore, we use a numerical scheme based on finite differences to present numerical results.
Some New Results in Astrophysical Problems of Nonlinear Theory of Radiative Transfer
Pikichyan, H. V.
2017-07-01
In the interpretation of the observed astrophysical spectra, a decisive role is related to nonlinear problems of radiative transfer, because the processes of multiple interactions of matter of cosmic medium with the exciting intense radiation ubiquitously occur in astrophysical objects, and in their vicinities. Whereas, the intensity of the exciting radiation changes the physical properties of the original medium, and itself was modified, simultaneously, in a self-consistent manner under its influence. In the present report, we show that the consistent application of the principle of invariance in the nonlinear problem of bilateral external illumination of a scattering/absorbing one-dimensional anisotropic medium of finite geometrical thickness allows for simplifications that were previously considered as a prerogative only of linear problems. The nonlinear problem is analyzed through the three methods of the principle of invariance: (i) an adding of layers, (ii) its limiting form, described by differential equations of invariant imbedding, and (iii) a transition to the, so-called, functional equations of the "Ambartsumyan's complete invariance". Thereby, as an alternative to the Boltzmann equation, a new type of equations, so-called "kinetic equations of equivalence", are obtained. By the introduction of new functions - the so-called "linear images" of solution of nonlinear problem of radiative transfer, the linear structure of the solution of the nonlinear problem under study is further revealed. Linear images allow to convert naturally the statistical characteristics of random walk of a "single quantum" or their "beam of unit intensity", as well as widely known "probabilistic interpretation of phenomena of transfer", to the field of nonlinear problems. The structure of the equations obtained for determination of linear images is typical of linear problems.
Consensus problem in directed networks of multi-agents via nonlinear protocols
International Nuclear Information System (INIS)
Liu Xiwei; Chen Tianping; Lu Wenlian
2009-01-01
In this Letter, the consensus problem via distributed nonlinear protocols for directed networks is investigated. Its dynamical behaviors are described by ordinary differential equations (ODEs). Based on graph theory, matrix theory and the Lyapunov direct method, some sufficient conditions of nonlinear protocols guaranteeing asymptotical or exponential consensus are presented and rigorously proved. The main contribution of this work is that for nonlinearly coupled networks, we generalize the results for undirected networks to directed networks. Consensus under pinning control technique is also developed here. Simulations are also given to show the validity of the theories.
Inverse Boundary Value Problem for Non-linear Hyperbolic Partial Differential Equations
Nakamura, Gen; Vashisth, Manmohan
2017-01-01
In this article we are concerned with an inverse boundary value problem for a non-linear wave equation of divergence form with space dimension $n\\geq 3$. This non-linear wave equation has a trivial solution, i.e. zero solution. By linearizing this equation at the trivial solution, we have the usual linear isotropic wave equation with the speed $\\sqrt{\\gamma(x)}$ at each point $x$ in a given spacial domain. For any small solution $u=u(t,x)$ of this non-linear equation, we have the linear isotr...
Strongly nonlinear nonhomogeneous elliptic unilateral problems with L^1 data and no sign conditions
Directory of Open Access Journals (Sweden)
Elhoussine Azroul
2012-05-01
Full Text Available In this article, we prove the existence of solutions to unilateral problems involving nonlinear operators of the form: $$ Au+H(x,u,abla u=f $$ where $A$ is a Leray Lions operator from $W_0^{1,p(x}(Omega$ into its dual $W^{-1,p'(x}(Omega$ and $H(x,s,xi$ is the nonlinear term satisfying some growth condition but no sign condition. The right hand side $f$ belong to $L^1(Omega$.
Topological approximation methods for evolutionary problem of nonlinear hydrodynamics
Zvyagin, Victor
2008-01-01
The authors present functional analytical methods for solving a class of partial differential equations. The results have important applications to the numerical treatment of rheology (specific examples are the behaviour of blood or print colours) and to other applications in fluid mechanics. A class of methods for solving problems in hydrodynamics is presented.
Optimal Control Problems for Nonlinear Variational Evolution Inequalities
Directory of Open Access Journals (Sweden)
Eun-Young Ju
2013-01-01
Full Text Available We deal with optimal control problems governed by semilinear parabolic type equations and in particular described by variational inequalities. We will also characterize the optimal controls by giving necessary conditions for optimality by proving the Gâteaux differentiability of solution mapping on control variables.
Employee assistance program treats personal problems.
Bednarek, R J; Featherston, H J
1984-03-01
Though the concept of employee assistance programs (EAPs) is widely accepted throughout business and industry, few hospitals have established similar channels for dealing with workers whose personal problems cause work-related problems. Among the reasons for the health care profession's lack of involvement in this area are: lack of information about costs and benefits of EAPs; the hospital's multidisciplinary environment in which standards of employee competence and behavior are set by persons from many disciplines; hospital working hours; and health care workers' attitudes about their vulnerability to illness. St. Benedict's Hospital, Ogden, UT, however, has confronted the question of how to demonstrate Christian concern for its employees. St. Benedict's EAP, the Helping Hand, which was created in 1979, combines progressive disciplinary action with the opportunity for early intervention in and treatment of employees' personal problems. When a worker with personal problems is referred to the EAP coordinator, he or she is matched with the appropriate community or hospital resource for treatment. Supervisors are trained to identify employee problems and to focus on employee job performance rather than on attempting to diagnose the problem. St. Benedict's records during the program's first three years illustrate the human benefits as well as the cost savings of an EAP. Of 92 hospital employees who took part in the EAP, 72 improved their situations or resolved their problems. The hospital's turnover rates declined from 36 percent to 20 percent, and approximately $40,800 in turnover and replacement costs were saved.
A nonlinear bi-level programming approach for product portfolio management.
Ma, Shuang
2016-01-01
Product portfolio management (PPM) is a critical decision-making for companies across various industries in today's competitive environment. Traditional studies on PPM problem have been motivated toward engineering feasibilities and marketing which relatively pay less attention to other competitors' actions and the competitive relations, especially in mathematical optimization domain. The key challenge lies in that how to construct a mathematical optimization model to describe this Stackelberg game-based leader-follower PPM problem and the competitive relations between them. The primary work of this paper is the representation of a decision framework and the optimization model to leverage the PPM problem of leader and follower. A nonlinear, integer bi-level programming model is developed based on the decision framework. Furthermore, a bi-level nested genetic algorithm is put forward to solve this nonlinear bi-level programming model for leader-follower PPM problem. A case study of notebook computer product portfolio optimization is reported. Results and analyses reveal that the leader-follower bi-level optimization model is robust and can empower product portfolio optimization.
Nonlinear Chance Constrained Problems: Optimality Conditions, Regularization and Solvers
Czech Academy of Sciences Publication Activity Database
Adam, Lukáš; Branda, Martin
2016-01-01
Roč. 170, č. 2 (2016), s. 419-436 ISSN 0022-3239 R&D Projects: GA ČR GA15-00735S Institutional support: RVO:67985556 Keywords : Chance constrained programming * Optimality conditions * Regularization * Algorithms * Free MATLAB codes Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 1.289, year: 2016 http://library.utia.cas.cz/separaty/2016/MTR/adam-0460909.pdf
Cho, Yumi
2018-05-01
We study nonlinear elliptic problems with nonstandard growth and ellipticity related to an N-function. We establish global Calderón-Zygmund estimates of the weak solutions in the framework of Orlicz spaces over bounded non-smooth domains. Moreover, we prove a global regularity result for asymptotically regular problems which are getting close to the regular problems considered, when the gradient variable goes to infinity.
Quasi-stability of a vector trajectorial problem with non-linear partial criteria
Directory of Open Access Journals (Sweden)
Vladimir A. Emelichev
2003-10-01
Full Text Available Multi-objective (vector combinatorial problem of finding the Pareto set with four kinds of non-linear partial criteria is considered. Necessary and sufficient conditions of that kind of stability of the problem (quasi-stability are obtained. The problem is a discrete analogue of the lower semicontinuity by Hausdorff of the optimal mapping. Mathematics Subject Classification 2000: 90C10, 90C05, 90C29, 90C31.
Non-linear nuclear engineering models as genetic programming application
International Nuclear Information System (INIS)
Domingos, Roberto P.; Schirru, Roberto; Martinez, Aquilino S.
1997-01-01
This work presents a Genetic Programming paradigm and a nuclear application. A field of Artificial Intelligence, based on the concepts of Species Evolution and Natural Selection, can be understood as a self-programming process where the computer is the main agent responsible for the discovery of a program able to solve a given problem. In the present case, the problem was to find a mathematical expression in symbolic form, able to express the existent relation between equivalent ratio of a fuel cell, the enrichment of fuel elements and the multiplication factor. Such expression would avoid repeatedly reactor physics codes execution for core optimization. The results were compared with those obtained by different techniques such as Neural Networks and Linear Multiple Regression. Genetic Programming has shown to present a performance as good as, and under some features superior to Neural Network and Linear Multiple Regression. (author). 10 refs., 8 figs., 1 tabs
Energy Technology Data Exchange (ETDEWEB)
Bouaricha, A. [Argonne National Lab., IL (United States). Mathematics and Computer Science Div.; Schnabel, R.B. [Colorado Univ., Boulder, CO (United States). Dept. of Computer Science
1996-12-31
This paper describes a modular software package for solving systems of nonlinear equations and nonlinear least squares problems, using a new class of methods called tensor methods. It is intended for small to medium-sized problems, say with up to 100 equations and unknowns, in cases where it is reasonable to calculate the Jacobian matrix or approximate it by finite differences at each iteration. The software allows the user to select between a tensor method and a standard method based upon a linear model. The tensor method models F({ital x}) by a quadratic model, where the second-order term is chosen so that the model is hardly more expensive to form, store, or solve than the standard linear model. Moreover, the software provides two different global strategies, a line search and a two- dimensional trust region approach. Test results indicate that, in general, tensor methods are significantly more efficient and robust than standard methods on small and medium-sized problems in iterations and function evaluations.
PENNON: A code for convex nonlinear and semidefinite programming
Czech Academy of Sciences Publication Activity Database
Kočvara, Michal; Stingl, M.
2003-01-01
Roč. 18, č. 3 (2003), s. 317-333 ISSN 1055-6788 R&D Projects: GA ČR GA201/00/0080 Grant - others:BMBF(DE) 03ZOM3ER Institutional research plan: CEZ:AV0Z1075907 Keywords : convex programming * semidefinite programming * large-scale problems Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 0.306, year: 2003
Directory of Open Access Journals (Sweden)
Chenlu Miao
2016-01-01
Full Text Available Many leader-follower relationships exist in product family design engineering problems. We use bilevel programming (BLP to reflect the leader-follower relationship and describe such problems. Product family design problems have unique characteristics; thus, mixed integer nonlinear BLP (MINLBLP, which has both continuous and discrete variables and multiple independent lower-level problems, is widely used in product family optimization. However, BLP is difficult in theory and is an NP-hard problem. Consequently, using traditional methods to solve such problems is difficult. Genetic algorithms (GAs have great value in solving BLP problems, and many studies have designed GAs to solve BLP problems; however, such GAs are typically designed for special cases that do not involve MINLBLP with one or multiple followers. Therefore, we propose a bilevel GA to solve these particular MINLBLP problems, which are widely used in product family problems. We give numerical examples to demonstrate the effectiveness of the proposed algorithm. In addition, a reducer family case study is examined to demonstrate practical applications of the proposed BLGA.
Energy Technology Data Exchange (ETDEWEB)
Kaikina, Elena I., E-mail: ekaikina@matmor.unam.mx [Centro de Ciencias Matemáticas, UNAM Campus Morelia, AP 61-3 (Xangari), Morelia CP 58089, Michoacán (Mexico)
2013-11-15
We consider the inhomogeneous Dirichlet initial-boundary value problem for the nonlinear Schrödinger equation, formulated on a half-line. We study traditionally important problems of the theory of nonlinear partial differential equations, such as global in time existence of solutions to the initial-boundary value problem and the asymptotic behavior of solutions for large time.
International Nuclear Information System (INIS)
Kaikina, Elena I.
2013-01-01
We consider the inhomogeneous Dirichlet initial-boundary value problem for the nonlinear Schrödinger equation, formulated on a half-line. We study traditionally important problems of the theory of nonlinear partial differential equations, such as global in time existence of solutions to the initial-boundary value problem and the asymptotic behavior of solutions for large time
Avdyushev, Victor A.
2017-12-01
Orbit determination from a small sample of observations over a very short observed orbital arc is a strongly nonlinear inverse problem. In such problems an evaluation of orbital uncertainty due to random observation errors is greatly complicated, since linear estimations conventionally used are no longer acceptable for describing the uncertainty even as a rough approximation. Nevertheless, if an inverse problem is weakly intrinsically nonlinear, then one can resort to the so-called method of disturbed observations (aka observational Monte Carlo). Previously, we showed that the weaker the intrinsic nonlinearity, the more efficient the method, i.e. the more accurate it enables one to simulate stochastically the orbital uncertainty, while it is strictly exact only when the problem is intrinsically linear. However, as we ascertained experimentally, its efficiency was found to be higher than that of other stochastic methods widely applied in practice. In the present paper we investigate the intrinsic nonlinearity in complicated inverse problems of Celestial Mechanics when orbits are determined from little informative samples of observations, which typically occurs for recently discovered asteroids. To inquire into the question, we introduce an index of intrinsic nonlinearity. In asteroid problems it evinces that the intrinsic nonlinearity can be strong enough to affect appreciably probabilistic estimates, especially at the very short observed orbital arcs that the asteroids travel on for about a hundredth of their orbital periods and less. As it is known from regression analysis, the source of intrinsic nonlinearity is the nonflatness of the estimation subspace specified by a dynamical model in the observation space. Our numerical results indicate that when determining asteroid orbits it is actually very slight. However, in the parametric space the effect of intrinsic nonlinearity is exaggerated mainly by the ill-conditioning of the inverse problem. Even so, as for the
A boundary control problem with a nonlinear reaction term
Directory of Open Access Journals (Sweden)
John R. Cannon
2009-04-01
Full Text Available The authors study the problem $u_t=u_{xx}-au$, $0
Linear combination of forecasts with numerical adjustment via MINIMAX non-linear programming
Directory of Open Access Journals (Sweden)
Jairo Marlon Corrêa
2016-03-01
Full Text Available This paper proposes a linear combination of forecasts obtained from three forecasting methods (namely, ARIMA, Exponential Smoothing and Artificial Neural Networks whose adaptive weights are determined via a multi-objective non-linear programming problem, which seeks to minimize, simultaneously, the statistics: MAE, MAPE and MSE. The results achieved by the proposed combination are compared with the traditional approach of linear combinations of forecasts, where the optimum adaptive weights are determined only by minimizing the MSE; with the combination method by arithmetic mean; and with individual methods
Menu-Driven Solver Of Linear-Programming Problems
Viterna, L. A.; Ferencz, D.
1992-01-01
Program assists inexperienced user in formulating linear-programming problems. A Linear Program Solver (ALPS) computer program is full-featured LP analysis program. Solves plain linear-programming problems as well as more-complicated mixed-integer and pure-integer programs. Also contains efficient technique for solution of purely binary linear-programming problems. Written entirely in IBM's APL2/PC software, Version 1.01. Packed program contains licensed material, property of IBM (copyright 1988, all rights reserved).
Programming languages for business problem solving
Wang, Shouhong
2007-01-01
It has become crucial for managers to be computer literate in today's business environment. It is also important that those entering the field acquire the fundamental theories of information systems, the essential practical skills in computer applications, and the desire for life-long learning in information technology. Programming Languages for Business Problem Solving presents a working knowledge of the major programming languages, including COBOL, C++, Java, HTML, JavaScript, VB.NET, VBA, ASP.NET, Perl, PHP, XML, and SQL, used in the current business computing environment. The book examin
Studies in nonlinear problems of energy. Progress report, January 1, 1992--December 31, 1992
Energy Technology Data Exchange (ETDEWEB)
Matkowsky, B.J.
1992-07-01
Emphasis has been on combustion and flame propagation. The research program was on modeling, analysis and computation of combustion phenomena, with emphasis on transition from laminar to turbulent combustion. Nonlinear dynamics and pattern formation were investigated in the transition. Stability of combustion waves, and transitions to complex waves are described. Combustion waves possess large activation energies, so that chemical reactions are significant only in thin layers, or reaction zones. In limit of infinite activation energy, the zones shrink to moving surfaces, (fronts) which must be found during the analysis, so that (moving free boundary problems). The studies are carried out for limiting case with fronts, while the numerical studies are carried out for finite, though large, activation energy. Accurate resolution of the solution in the reaction zones is essential, otherwise false predictions of dynamics are possible. Since the the reaction zones move, adaptive pseudo-spectral methods were developed. The approach is based on a synergism of analytical and computational methods. The numerical computations build on and extend the analytical information. Furthermore, analytical solutions serve as benchmarks for testing the accuracy of the computation. Finally, ideas from analysis (singular perturbation theory) have induced new approaches to computations. The computational results suggest new analysis to be considered. Among the recent interesting results, was spatio-temporal chaos in combustion. One goal is extension of the adaptive pseudo-spectral methods to adaptive domain decomposition methods. Efforts have begun to develop such methods for problems with multiple reaction zones, corresponding to problems with more complex, and more realistic chemistry. Other topics included stochastics, oscillators, Rysteretic Josephson junctions, DC SQUID, Markov jumps, laser with saturable absorber, chemical physics, Brownian movement, combustion synthesis, etc.
Systems of general nonlinear set-valued mixed variational inequalities problems in Hilbert spaces
Directory of Open Access Journals (Sweden)
Cho Yeol
2011-01-01
Full Text Available Abstract In this paper, the existing theorems and methods for finding solutions of systems of general nonlinear set-valued mixed variational inequalities problems in Hilbert spaces are studied. To overcome the difficulties, due to the presence of a proper convex lower semi-continuous function, φ and a mapping g, which appeared in the considered problem, we have used some applications of the resolvent operator technique. We would like to point out that although many authors have proved results for finding solutions of the systems of nonlinear set-valued (mixed variational inequalities problems, it is clear that it cannot be directly applied to the problems that we have considered in this paper because of φ and g. 2000 AMS Subject Classification: 47H05; 47H09; 47J25; 65J15.
Numerical methods for the design of large-scale nonlinear discrete ill-posed inverse problems
International Nuclear Information System (INIS)
Haber, E; Horesh, L; Tenorio, L
2010-01-01
Design of experiments for discrete ill-posed problems is a relatively new area of research. While there has been some limited work concerning the linear case, little has been done to study design criteria and numerical methods for ill-posed nonlinear problems. We present an algorithmic framework for nonlinear experimental design with an efficient numerical implementation. The data are modeled as indirect, noisy observations of the model collected via a set of plausible experiments. An inversion estimate based on these data is obtained by a weighted Tikhonov regularization whose weights control the contribution of the different experiments to the data misfit term. These weights are selected by minimization of an empirical estimate of the Bayes risk that is penalized to promote sparsity. This formulation entails a bilevel optimization problem that is solved using a simple descent method. We demonstrate the viability of our design with a problem in electromagnetic imaging based on direct current resistivity and magnetotelluric data
On the solvability of initial-value problems for nonlinear implicit difference equations
Directory of Open Access Journals (Sweden)
Ha Thi Ngoc Yen
2004-07-01
Full Text Available Our aim is twofold. First, we propose a natural definition of index for linear nonautonomous implicit difference equations, which is similar to that of linear differential-algebraic equations. Then we extend this index notion to a class of nonlinear implicit difference equations and prove some existence theorems for their initial-value problems.
Admissible solutions for a class of nonlinear parabolic problem with non-negative data
Czech Academy of Sciences Publication Activity Database
Feireisl, Eduard; Petzeltová, Hana; Simondon, F.
2001-01-01
Roč. 131, č. 5 (2001), s. 857-883 ISSN 0308-2105 R&D Projects: GA AV ČR IAA1019703 Keywords : admissible solutions%nonlinear parabolic problem * admissible solutions * comparison principle * non-negative data Subject RIV: BA - General Mathematics Impact factor: 0.441, year: 2001
Directory of Open Access Journals (Sweden)
Xiaofeng Zhang
2017-12-01
Full Text Available In this paper, we consider the existence of positive solutions to a singular semipositone boundary value problem of nonlinear fractional differential equations. By applying the fixed point index theorem, some new results for the existence of positive solutions are obtained. In addition, an example is presented to demonstrate the application of our main results.
Czech Academy of Sciences Publication Activity Database
Mukhigulashvili, Sulkhan; Půža, B.
2015-01-01
Roč. 2015, January (2015), s. 17 ISSN 1687-2770 Institutional support: RVO:67985840 Keywords : higher order nonlinear functional-differential equations * two-point right-focal boundary value problem * strong singularity Subject RIV: BA - General Mathematics Impact factor: 0.642, year: 2015 http://link.springer.com/article/10.1186%2Fs13661-014-0277-1
Kassa, Semu Mitiku; Tsegay, Teklay Hailay
2017-08-01
Tri-level optimization problems are optimization problems with three nested hierarchical structures, where in most cases conflicting objectives are set at each level of hierarchy. Such problems are common in management, engineering designs and in decision making situations in general, and are known to be strongly NP-hard. Existing solution methods lack universality in solving these types of problems. In this paper, we investigate a tri-level programming problem with quadratic fractional objective functions at each of the three levels. A solution algorithm has been proposed by applying fuzzy goal programming approach and by reformulating the fractional constraints to equivalent but non-fractional non-linear constraints. Based on the transformed formulation, an iterative procedure is developed that can yield a satisfactory solution to the tri-level problem. The numerical results on various illustrative examples demonstrated that the proposed algorithm is very much promising and it can also be used to solve larger-sized as well as n-level problems of similar structure.
On a Mixed Nonlinear One Point Boundary Value Problem for an Integrodifferential Equation
Directory of Open Access Journals (Sweden)
Mesloub Said
2008-01-01
Full Text Available This paper is devoted to the study of a mixed problem for a nonlinear parabolic integro-differential equation which mainly arise from a one dimensional quasistatic contact problem. We prove the existence and uniqueness of solutions in a weighted Sobolev space. Proofs are based on some a priori estimates and on the Schauder fixed point theorem. we also give a result which helps to establish the regularity of a solution.
Directory of Open Access Journals (Sweden)
M. G. Crandall
1999-07-01
Full Text Available We study existence of continuous weak (viscosity solutions of Dirichlet and Cauchy-Dirichlet problems for fully nonlinear uniformly elliptic and parabolic equations. Two types of results are obtained in contexts where uniqueness of solutions fails or is unknown. For equations with merely measurable coefficients we prove solvability of the problem, while in the continuous case we construct maximal and minimal solutions. Necessary barriers on external cones are also constructed.
International Nuclear Information System (INIS)
Ruas, V.
1982-09-01
A class of simplicial finite elements for solving incompressible elasticity problems in n-dimensional space, n=2 or 3, is presented. An asymmetric structure of the shape functions with respect to the centroid of the simplex, renders them particularly stable in the large strain case, in which the incompressibility condition is nonlinear. It is proved that under certain assembling conditions of the elements, there exists a solution to the corresponding discrete problems. Numerical examples illustrate the efficiency of the method. (Author) [pt
Response of Non-Linear Shock Absorbers-Boundary Value Problem Analysis
Rahman, M. A.; Ahmed, U.; Uddin, M. S.
2013-08-01
A nonlinear boundary value problem of two degrees-of-freedom (DOF) untuned vibration damper systems using nonlinear springs and dampers has been numerically studied. As far as untuned damper is concerned, sixteen different combinations of linear and nonlinear springs and dampers have been comprehensively analyzed taking into account transient terms. For different cases, a comparative study is made for response versus time for different spring and damper types at three important frequency ratios: one at r = 1, one at r > 1 and one at r <1. The response of the system is changed because of the spring and damper nonlinearities; the change is different for different cases. Accordingly, an initially stable absorber may become unstable with time and vice versa. The analysis also shows that higher nonlinearity terms make the system more unstable. Numerical simulation includes transient vibrations. Although problems are much more complicated compared to those for a tuned absorber, a comparison of the results generated by the present numerical scheme with the exact one shows quite a reasonable agreement
Continuous reformulations for zero-one programming problems
Marianna De Santis; Francesco Rinaldi
2010-01-01
In this work, we study continuous reformulations of zero-one programming problems. We prove that, under suitable conditions, the optimal solutions of a zero-one programming problem can be obtained by solving a specific continuous problem.
Spectral methods for a nonlinear initial value problem involving pseudo differential operators
International Nuclear Information System (INIS)
Pasciak, J.E.
1982-01-01
Spectral methods (Fourier methods) for approximating the solution of a nonlinear initial value problem involving pseudo differential operators are defined and analyzed. A semidiscrete approximation to the nonlinear equation based on an L 2 projection is described. The semidiscrete L 2 approximation is shown to be a priori stable and convergent under sufficient decay and smoothness assumptions on the initial data. It is shown that the semidiscrete method converges with infinite order, that is, higher order decay and smoothness assumptions imply higher order error bounds. Spectral schemes based on spacial collocation are also discussed
Adaptive wavelet collocation methods for initial value boundary problems of nonlinear PDE's
Cai, Wei; Wang, Jian-Zhong
1993-01-01
We have designed a cubic spline wavelet decomposition for the Sobolev space H(sup 2)(sub 0)(I) where I is a bounded interval. Based on a special 'point-wise orthogonality' of the wavelet basis functions, a fast Discrete Wavelet Transform (DWT) is constructed. This DWT transform will map discrete samples of a function to its wavelet expansion coefficients in O(N log N) operations. Using this transform, we propose a collocation method for the initial value boundary problem of nonlinear PDE's. Then, we test the efficiency of the DWT transform and apply the collocation method to solve linear and nonlinear PDE's.
On the Cauchy problem for nonlinear Schrödinger equations with rotation
Antonelli, Paolo; Marahrens, Daniel; Sparber, Christof
2011-01-01
We consider the Cauchy problem for (energy-subcritical) nonlinear Schrödinger equations with sub-quadratic external potentials and an additional angular momentum rotation term. This equation is a well-known model for superuid quantum gases in rotating traps. We prove global existence (in the energy space) for defocusing nonlinearities without any restriction on the rotation frequency, generalizing earlier results given in [11, 12]. Moreover, we find that the rotation term has a considerable in fiuence in proving finite time blow-up in the focusing case.
Domain decomposition based iterative methods for nonlinear elliptic finite element problems
Energy Technology Data Exchange (ETDEWEB)
Cai, X.C. [Univ. of Colorado, Boulder, CO (United States)
1994-12-31
The class of overlapping Schwarz algorithms has been extensively studied for linear elliptic finite element problems. In this presentation, the author considers the solution of systems of nonlinear algebraic equations arising from the finite element discretization of some nonlinear elliptic equations. Several overlapping Schwarz algorithms, including the additive and multiplicative versions, with inexact Newton acceleration will be discussed. The author shows that the convergence rate of the Newton`s method is independent of the mesh size used in the finite element discretization, and also independent of the number of subdomains into which the original domain in decomposed. Numerical examples will be presented.
On the Cauchy problem for nonlinear Schrödinger equations with rotation
Antonelli, Paolo
2011-10-01
We consider the Cauchy problem for (energy-subcritical) nonlinear Schrödinger equations with sub-quadratic external potentials and an additional angular momentum rotation term. This equation is a well-known model for superuid quantum gases in rotating traps. We prove global existence (in the energy space) for defocusing nonlinearities without any restriction on the rotation frequency, generalizing earlier results given in [11, 12]. Moreover, we find that the rotation term has a considerable in fiuence in proving finite time blow-up in the focusing case.
Computer programs for solving systems of nonlinear equations
International Nuclear Information System (INIS)
Asaoka, Takumi
1978-03-01
Computer programs to find a solution, usually the one closest to some guess, of a system of simultaneous nonlinear equations are provided for real functions of the real arguments. These are based on quasi-Newton methods or projection methods, which are briefly reviewed in the present report. Benchmark tests were performed on these subroutines to grasp their characteristics. As the program not requiring analytical forms of the derivatives of the Jacobian matrix, we have dealt with NS01A of Powell, NS03A of Reid for a system with the sparse Jacobian and NONLIN of Brown. Of these three subroutines of quasi-Newton methods, NONLIN is shown to be the most useful because of its stable algorithm and short computation time. On the other hand, as the subroutine for which the derivatives of the Jacobian are to be supplied analytically, we have tested INTECH of a quasi-Newton method based on the Boggs' algorithm, PROJA of Georg and Keller based on the projection method and an option of NS03A. The results have shown that INTECH, treating variables which appear only linearly in the functions separately, takes the shortest computation time, on the whole, while the projection method requires further research to find an optimal algorithm. (auth.)
Iterative solution of a nonlinear system arising in phase change problems
International Nuclear Information System (INIS)
Williams, M.A.
1987-01-01
We consider several iterative methods for solving the nonlinear system arising from an enthalpy formulation of a phase change problem. We present the formulation of the problem. Implicit discretization of the governing equations results in a mildly nonlinear system at each time step. We discuss solving this system using Jacobi, Gauss-Seidel, and SOR iterations and a new modified preconditioned conjugate gradient (MPCG) algorithm. The new MPCG algorithm and its properties are discussed in detail. Numerical results are presented comparing the performance of the SOR algorithm and the MPCG algorithm with 1-step SSOR preconditioning. The MPCG algorithm exhibits a superlinear rate of convergence. The SOR algorithm exhibits a linear rate of convergence. Thus, the MPCG algorithm requires fewer iterations to converge than the SOR algorithm. However in most cases, the SOR algorithm requires less total computation time than the MPCG algorithm. Hence, the SOR algorithm appears to be more appropriate for the class of problems considered. 27 refs., 11 figs
International Nuclear Information System (INIS)
Semenova, V.N.
2016-01-01
A boundary value problem for a nonlinear second order differential equation has been considered. A numerical method has been proposed to solve this problem using power series. Results of numerical experiments have been presented in the paper [ru
State and parameter estimation in nonlinear systems as an optimal tracking problem
International Nuclear Information System (INIS)
Creveling, Daniel R.; Gill, Philip E.; Abarbanel, Henry D.I.
2008-01-01
In verifying and validating models of nonlinear processes it is important to incorporate information from observations in an efficient manner. Using the idea of synchronization of nonlinear dynamical systems, we present a framework for connecting a data signal with a model in a way that minimizes the required coupling yet allows the estimation of unknown parameters in the model. The need to evaluate unknown parameters in models of nonlinear physical, biophysical, and engineering systems occurs throughout the development of phenomenological or reduced models of dynamics. Our approach builds on existing work that uses synchronization as a tool for parameter estimation. We address some of the critical issues in that work and provide a practical framework for finding an accurate solution. In particular, we show the equivalence of this problem to that of tracking within an optimal control framework. This equivalence allows the application of powerful numerical methods that provide robust practical tools for model development and validation
Stochastic Fractional Programming Approach to a Mean and Variance Model of a Transportation Problem
Directory of Open Access Journals (Sweden)
V. Charles
2011-01-01
Full Text Available In this paper, we propose a stochastic programming model, which considers a ratio of two nonlinear functions and probabilistic constraints. In the former, only expected model has been proposed without caring variability in the model. On the other hand, in the variance model, the variability played a vital role without concerning its counterpart, namely, the expected model. Further, the expected model optimizes the ratio of two linear cost functions where as variance model optimize the ratio of two non-linear functions, that is, the stochastic nature in the denominator and numerator and considering expectation and variability as well leads to a non-linear fractional program. In this paper, a transportation model with stochastic fractional programming (SFP problem approach is proposed, which strikes the balance between previous models available in the literature.
Zhu, Yuanheng; Zhao, Dongbin; Li, Xiangjun
2017-03-01
H ∞ control is a powerful method to solve the disturbance attenuation problems that occur in some control systems. The design of such controllers relies on solving the zero-sum game (ZSG). But in practical applications, the exact dynamics is mostly unknown. Identification of dynamics also produces errors that are detrimental to the control performance. To overcome this problem, an iterative adaptive dynamic programming algorithm is proposed in this paper to solve the continuous-time, unknown nonlinear ZSG with only online data. A model-free approach to the Hamilton-Jacobi-Isaacs equation is developed based on the policy iteration method. Control and disturbance policies and value are approximated by neural networks (NNs) under the critic-actor-disturber structure. The NN weights are solved by the least-squares method. According to the theoretical analysis, our algorithm is equivalent to a Gauss-Newton method solving an optimization problem, and it converges uniformly to the optimal solution. The online data can also be used repeatedly, which is highly efficient. Simulation results demonstrate its feasibility to solve the unknown nonlinear ZSG. When compared with other algorithms, it saves a significant amount of online measurement time.
Special function solutions of a spectral problem for a nonlinear quantum oscillator
International Nuclear Information System (INIS)
Schulze-Halberg, A; Morris, J R
2012-01-01
We construct exact solutions of a spectral problem involving the Schrödinger equation for a nonlinear, one-parameter oscillator potential. In contrast to a previous analysis of the problem (Carinena et al 2007 Ann. Phys. 322 434–59), where solutions were given through a Rodrigues-type formula, our approach leads to closed-form representations of the solutions in terms of special functions, not containing any derivative operators. We show normalizability and orthogonality of our solutions, as well as correct reduction of the problem to the harmonic oscillator model, if the parameter in the potential gets close to zero. (paper)
Multi-level nonlinear diffusion acceleration method for multigroup transport k-Eigenvalue problems
International Nuclear Information System (INIS)
Anistratov, Dmitriy Y.
2011-01-01
The nonlinear diffusion acceleration (NDA) method is an efficient and flexible transport iterative scheme for solving reactor-physics problems. This paper presents a fast iterative algorithm for solving multigroup neutron transport eigenvalue problems in 1D slab geometry. The proposed method is defined by a multi-level system of equations that includes multigroup and effective one-group low-order NDA equations. The Eigenvalue is evaluated in the exact projected solution space of smallest dimensionality, namely, by solving the effective one- group eigenvalue transport problem. Numerical results that illustrate performance of the new algorithm are demonstrated. (author)
The Cauchy problem for non-linear Klein-Gordon equations
International Nuclear Information System (INIS)
Simon, J.C.H.; Taflin, E.
1993-01-01
We consider in R n+1 , n≥2, the non-linear Klein-Gordon equation. We prove for such an equation that there is neighbourhood of zero in a Hilbert space of initial conditions for which the Cauchy problem has global solutions and on which there is asymptotic completeness. The inverse of the wave operator linearizes the non-linear equation. If, moreover, the equation is manifestly Poincare covariant then the non-linear representation of the Poincare-Lie algebra, associated with the non-linear Klein-Gordon equation is integrated to a non-linear representation of the Poincare group on an invariant neighbourhood of zero in the Hilbert space. This representation is linearized by the inverse of the wave operator. The Hilbert space is, in both cases, the closure of the space of the differentiable vectors for the linear representation of the Poincare group, associated with the Klein-Gordon equation, with respect to a norm defined by the representation of the enveloping algebra. (orig.)
An Improved Search Approach for Solving Non-Convex Mixed-Integer Non Linear Programming Problems
Sitopu, Joni Wilson; Mawengkang, Herman; Syafitri Lubis, Riri
2018-01-01
The nonlinear mathematical programming problem addressed in this paper has a structure characterized by a subset of variables restricted to assume discrete values, which are linear and separable from the continuous variables. The strategy of releasing nonbasic variables from their bounds, combined with the “active constraint” method, has been developed. This strategy is used to force the appropriate non-integer basic variables to move to their neighbourhood integer points. Successful implementation of these algorithms was achieved on various test problems.
Directory of Open Access Journals (Sweden)
Sie Long Kek
2015-01-01
Full Text Available A computational approach is proposed for solving the discrete time nonlinear stochastic optimal control problem. Our aim is to obtain the optimal output solution of the original optimal control problem through solving the simplified model-based optimal control problem iteratively. In our approach, the adjusted parameters are introduced into the model used such that the differences between the real system and the model used can be computed. Particularly, system optimization and parameter estimation are integrated interactively. On the other hand, the output is measured from the real plant and is fed back into the parameter estimation problem to establish a matching scheme. During the calculation procedure, the iterative solution is updated in order to approximate the true optimal solution of the original optimal control problem despite model-reality differences. For illustration, a wastewater treatment problem is studied and the results show the efficiency of the approach proposed.
Directory of Open Access Journals (Sweden)
Koh Kim Jie
2017-01-01
Full Text Available Quadratic damping nonlinearity is challenging for displacement based structural dynamics problem as the problem is nonlinear in time derivative of the primitive variable. For such nonlinearity, the formulation of tangent stiffness matrix is not lucid in the literature. Consequently, ambiguity related to kinematics update arises when implementing the time integration-iterative algorithm. In present work, an Euler-Bernoulli beam vibration problem with quadratic damping nonlinearity is addressed as the main source of quadratic damping nonlinearity arises from drag force estimation, which is generally valid only for slender structures. Employing Newton-Raphson formulation, tangent stiffness components associated with quadratic damping nonlinearity requires velocity input for evaluation purpose. For this reason, two mathematically equivalent algorithm structures with different kinematics arrangement are tested. Both algorithm structures result in the same accuracy and convergence characteristic of solution.
Bíró, Oszkár; Koczka, Gergely; Preis, Kurt
2014-05-01
An efficient finite element method to take account of the nonlinearity of the magnetic materials when analyzing three-dimensional eddy current problems is presented in this paper. The problem is formulated in terms of vector and scalar potentials approximated by edge and node based finite element basis functions. The application of Galerkin techniques leads to a large, nonlinear system of ordinary differential equations in the time domain. The excitations are assumed to be time-periodic and the steady-state periodic solution is of interest only. This is represented either in the frequency domain as a finite Fourier series or in the time domain as a set of discrete time values within one period for each finite element degree of freedom. The former approach is the (continuous) harmonic balance method and, in the latter one, discrete Fourier transformation will be shown to lead to a discrete harmonic balance method. Due to the nonlinearity, all harmonics, both continuous and discrete, are coupled to each other. The harmonics would be decoupled if the problem were linear, therefore, a special nonlinear iteration technique, the fixed-point method is used to linearize the equations by selecting a time-independent permeability distribution, the so-called fixed-point permeability in each nonlinear iteration step. This leads to uncoupled harmonics within these steps. As industrial applications, analyses of large power transformers are presented. The first example is the computation of the electromagnetic field of a single-phase transformer in the time domain with the results compared to those obtained by traditional time-stepping techniques. In the second application, an advanced model of the same transformer is analyzed in the frequency domain by the harmonic balance method with the effect of the presence of higher harmonics on the losses investigated. Finally a third example tackles the case of direct current (DC) bias in the coils of a single-phase transformer.
International Nuclear Information System (INIS)
Kaltenbacher, Barbara; Kirchner, Alana; Vexler, Boris
2011-01-01
Parameter identification problems for partial differential equations usually lead to nonlinear inverse problems. A typical property of such problems is their instability, which requires regularization techniques, like, e.g., Tikhonov regularization. The main focus of this paper will be on efficient methods for determining a suitable regularization parameter by using adaptive finite element discretizations based on goal-oriented error estimators. A well-established method for the determination of a regularization parameter is the discrepancy principle where the residual norm, considered as a function i of the regularization parameter, should equal an appropriate multiple of the noise level. We suggest to solve the resulting scalar nonlinear equation by an inexact Newton method, where in each iteration step, a regularized problem is solved at a different discretization level. The proposed algorithm is an extension of the method suggested in Griesbaum A et al (2008 Inverse Problems 24 025025) for linear inverse problems, where goal-oriented error estimators for i and its derivative are used for adaptive refinement strategies in order to keep the discretization level as coarse as possible to save computational effort but fine enough to guarantee global convergence of the inexact Newton method. This concept leads to a highly efficient method for determining the Tikhonov regularization parameter for nonlinear ill-posed problems. Moreover, we prove that with the so-obtained regularization parameter and an also adaptively discretized Tikhonov minimizer, usual convergence and regularization results from the continuous setting can be recovered. As a matter of fact, it is shown that it suffices to use stationary points of the Tikhonov functional. The efficiency of the proposed method is demonstrated by means of numerical experiments. (paper)
A New Spectral Local Linearization Method for Nonlinear Boundary Layer Flow Problems
Directory of Open Access Journals (Sweden)
S. S. Motsa
2013-01-01
Full Text Available We propose a simple and efficient method for solving highly nonlinear systems of boundary layer flow problems with exponentially decaying profiles. The algorithm of the proposed method is based on an innovative idea of linearizing and decoupling the governing systems of equations and reducing them into a sequence of subsystems of differential equations which are solved using spectral collocation methods. The applicability of the proposed method, hereinafter referred to as the spectral local linearization method (SLLM, is tested on some well-known boundary layer flow equations. The numerical results presented in this investigation indicate that the proposed method, despite being easy to develop and numerically implement, is very robust in that it converges rapidly to yield accurate results and is more efficient in solving very large systems of nonlinear boundary value problems of the similarity variable boundary layer type. The accuracy and numerical stability of the SLLM can further be improved by using successive overrelaxation techniques.
Directory of Open Access Journals (Sweden)
MOHAMED KEZZAR
2015-08-01
Full Text Available In this research, an efficient technique of computation considered as a modified decomposition method was proposed and then successfully applied for solving the nonlinear problem of the two dimensional flow of an incompressible viscous fluid between nonparallel plane walls. In fact this method gives the nonlinear term Nu and the solution of the studied problem as a power series. The proposed iterative procedure gives on the one hand a computationally efficient formulation with an acceleration of convergence rate and on the other hand finds the solution without any discretization, linearization or restrictive assumptions. The comparison of our results with those of numerical treatment and other earlier works shows clearly the higher accuracy and efficiency of the used Modified Decomposition Method.
International Nuclear Information System (INIS)
Sen, S.; Roy Chowdhury, A.
1989-06-01
The nonlinear Alfven waves are governed by the Vector Derivative nonlinear Schroedinger (VDNLS) equation, which for parallel or quasi parallel propagation reduces to the Derivative Nonlinear Schroedinger (DNLS) equation for the circularly polarized waves. We have formulated the Quantum Inverse problem for a new type of Nonlinear Schroedinger Equation which has many properties similar to the usual NLS problem but the structure of classical and quantum R matrix are distinctly different. The commutation rules of the scattering data are obtained and the Algebraic Bethe Ansatz is formulated to derive the eigenvalue equation for the energy of the excited states. 10 refs
Directory of Open Access Journals (Sweden)
Qingkai Kong
2012-02-01
Full Text Available In this paper, we study the existence and multiplicity of positive solutions of a class of nonlinear fractional boundary value problems with Dirichlet boundary conditions. By applying the fixed point theory on cones we establish a series of criteria for the existence of one, two, any arbitrary finite number, and an infinite number of positive solutions. A criterion for the nonexistence of positive solutions is also derived. Several examples are given for demonstration.
Directory of Open Access Journals (Sweden)
Alexander N. Kvitko
2017-01-01
Full Text Available An algorithm for constructing a control function that transfers a wide class of stationary nonlinear systems of ordinary differential equations from an initial state to a final state under certain control restrictions is proposed. The algorithm is designed to be convenient for numerical implementation. A constructive criterion of the desired transfer possibility is presented. The problem of an interorbital flight is considered as a test example and it is simulated numerically with the presented method.
Iterative Methods for Solving Nonlinear Parabolic Problem in Pension Saving Management
Koleva, M. N.
2011-11-01
In this work we consider a nonlinear parabolic equation, obtained from Riccati like transformation of the Hamilton-Jacobi-Bellman equation, arising in pension saving management. We discuss two numerical iterative methods for solving the model problem—fully implicit Picard method and mixed Picard-Newton method, which preserves the parabolic characteristics of the differential problem. Numerical experiments for comparison the accuracy and effectiveness of the algorithms are discussed. Finally, observations are given.
Positive solutions for a nonlinear periodic boundary-value problem with a parameter
Directory of Open Access Journals (Sweden)
Jingliang Qiu
2012-08-01
Full Text Available Using topological degree theory with a partially ordered structure of space, sufficient conditions for the existence and multiplicity of positive solutions for a second-order nonlinear periodic boundary-value problem are established. Inspired by ideas in Guo and Lakshmikantham [6], we study the dependence of positive periodic solutions as a parameter approaches infinity, $$ lim_{lambdao +infty}|x_{lambda}|=+infty,quadhbox{or}quad lim_{lambdao+infty}|x_{lambda}|=0. $$
On the Cauchy problem for a Sobolev-type equation with quadratic non-linearity
International Nuclear Information System (INIS)
Aristov, Anatoly I
2011-01-01
We investigate the asymptotic behaviour as t→∞ of the solution of the Cauchy problem for a Sobolev-type equation with quadratic non-linearity and develop ideas used by I. A. Shishmarev and other authors in the study of classical and Sobolev-type equations. Conditions are found under which it is possible to consider the case of an arbitrary dimension of the spatial variable.
Existence of solutions to nonlinear parabolic unilateral problems with an obstacle depending on time
Directory of Open Access Journals (Sweden)
Nabila Bellal
2014-10-01
Full Text Available Using the penalty method, we prove the existence of solutions to nonlinear parabolic unilateral problems with an obstacle depending on time. To find a solution, the original inequality is transformed into an equality by adding a positive function on the right-hand side and a complementary condition. This result can be seen as a generalization of the results by Mokrane in [11] where the obstacle is zero.
Directory of Open Access Journals (Sweden)
Zhong Wan
2013-01-01
Full Text Available In accord with the practical engineering design conditions, a nonlinear programming model is constructed for maximizing the fatigue life of V-belt drive in which some polymorphic uncertainties are incorporated. For a given satisfaction level and a confidence level, an equivalent formulation of this uncertain optimization model is obtained where only interval parameters are involved. Based on the concepts of maximal and minimal range inequalities for describing interval inequality, the interval parameter model is decomposed into two standard nonlinear programming problems, and an algorithm, called two-step based sampling algorithm, is developed to find an interval optimal solution for the original problem. Case study is employed to demonstrate the validity and practicability of the constructed model and the algorithm.
Inverse periodic problem for the discrete approximation of the Schroedinger nonlinear equation
International Nuclear Information System (INIS)
Bogolyubov, N.N.; Prikarpatskij, A.K.; AN Ukrainskoj SSR, Lvov. Inst. Prikladnykh Problem Mekhaniki i Matematiki)
1982-01-01
The problem of numerical solution of the Schroedinger nonlinear equation (1) iPSIsub(t) = PSIsub(xx)+-2(PSI)sup(2)PSI. The numerical solution of nonlinear differential equation supposes its discrete approximation is required for the realization of the computer calculation process. Tor the equation (1) there exists the following discrete approximation by variable x(2) iPSIsub(n, t) = (PSIsub(n+1)-2PSIsub(n)+PSIsub(n-1))/(Δx)sup(2)+-(PSIsub(n))sup(2)(PSIsub(n+1)+PSIsub(n-1)), n=0, +-1, +-2... where PSIsub(n)(+) is the corresponding value of PSI(x, t) function in the node and divisions with the equilibrium step Δx. The main problem is obtaining analytically exact solutions of the equations (2). The analysis of the equation system (2) is performed on the base of the discrete analogue of the periodic variant of the inverse scattering problem method developed with the aid of nonlinear equations of the Korteweg-de Vries type. Obtained in explicit form are analytical solutions of the equations system (2). The solutions are expressed through the Riemann THETA-function [ru
Gazzola, Filippo; Sweers, Guido
2010-01-01
This monograph covers higher order linear and nonlinear elliptic boundary value problems in bounded domains, mainly with the biharmonic or poly-harmonic operator as leading principal part. Underlying models and, in particular, the role of different boundary conditions are explained in detail. As for linear problems, after a brief summary of the existence theory and Lp and Schauder estimates, the focus is on positivity or - since, in contrast to second order equations, a general form of a comparison principle does not exist - on “near positivity.” The required kernel estimates are also presented in detail. As for nonlinear problems, several techniques well-known from second order equations cannot be utilized and have to be replaced by new and different methods. Subcritical, critical and supercritical nonlinearities are discussed and various existence and nonexistence results are proved. The interplay with the positivity topic from the ﬁrst part is emphasized and, moreover, a far-reaching Gidas-Ni-Nirenbe...
Iterative Runge–Kutta-type methods for nonlinear ill-posed problems
International Nuclear Information System (INIS)
Böckmann, C; Pornsawad, P
2008-01-01
We present a regularization method for solving nonlinear ill-posed problems by applying the family of Runge–Kutta methods to an initial value problem, in particular, to the asymptotical regularization method. We prove that the developed iterative regularization method converges to a solution under certain conditions and with a general stopping rule. Some particular iterative regularization methods are numerically implemented. Numerical results of the examples show that the developed Runge–Kutta-type regularization methods yield stable solutions and that particular implicit methods are very efficient in saving iteration steps
Cengizci, Süleyman; Atay, Mehmet Tarık; Eryılmaz, Aytekin
2016-01-01
This paper is concerned with two-point boundary value problems for singularly perturbed nonlinear ordinary differential equations. The case when the solution only has one boundary layer is examined. An efficient method so called Successive Complementary Expansion Method (SCEM) is used to obtain uniformly valid approximations to this kind of solutions. Four test problems are considered to check the efficiency and accuracy of the proposed method. The numerical results are found in good agreement with exact and existing solutions in literature. The results confirm that SCEM has a superiority over other existing methods in terms of easy-applicability and effectiveness.
POSITIVE SOLUTIONS OF A NONLINEAR THREE-POINT EIGENVALUE PROBLEM WITH INTEGRAL BOUNDARY CONDITIONS
Directory of Open Access Journals (Sweden)
FAOUZI HADDOUCHI
2015-11-01
Full Text Available In this paper, we study the existence of positive solutions of a three-point integral boundary value problem (BVP for the following second-order differential equation u''(t + \\lambda a(tf(u(t = 0; 0 0 is a parameter, 0 <\\eta < 1, 0 <\\alpha < 1/{\\eta}. . By using the properties of the Green's function and Krasnoselskii's fixed point theorem on cones, the eigenvalue intervals of the nonlinear boundary value problem are considered, some sufficient conditions for the existence of at least one positive solutions are established.
Multi-objective convex programming problem arising in multivariate ...
African Journals Online (AJOL)
user
Multi-objective convex programming problem arising in ... However, although the consideration of multiple objectives may seem a novel concept, virtually any nontrivial ..... Solving multiobjective programming problems by discrete optimization.
International Nuclear Information System (INIS)
Leaf, G.K.; Minkoff, M.
1982-01-01
1 - Description of problem or function: DISPL1 is a software package for solving second-order nonlinear systems of partial differential equations including parabolic, elliptic, hyperbolic, and some mixed types. The package is designed primarily for chemical kinetics- diffusion problems, although not limited to these problems. Fairly general nonlinear boundary conditions are allowed as well as inter- face conditions for problems in an inhomogeneous medium. The spatial domain is one- or two-dimensional with rectangular Cartesian, cylindrical, or spherical (in one dimension only) geometry. 2 - Method of solution: The numerical method is based on the use of Galerkin's procedure combined with the use of B-Splines (C.W.R. de-Boor's B-spline package) to generate a system of ordinary differential equations. These equations are solved by a sophisticated ODE software package which is a modified version of Hindmarsh's GEAR package, NESC Abstract 592. 3 - Restrictions on the complexity of the problem: The spatial domain must be rectangular with sides parallel to the coordinate geometry. Cross derivative terms are not permitted in the PDE. The order of the B-Splines is at most 12. Other parameters such as the number of mesh points in each coordinate direction, the number of PDE's etc. are set in a macro table used by the MORTRAn2 preprocessor in generating the object code
Directory of Open Access Journals (Sweden)
Hideki Katagiri
2017-10-01
Full Text Available This paper considers linear programming problems (LPPs where the objective functions involve discrete fuzzy random variables (fuzzy set-valued discrete random variables. New decision making models, which are useful in fuzzy stochastic environments, are proposed based on both possibility theory and probability theory. In multi-objective cases, Pareto optimal solutions of the proposed models are newly defined. Computational algorithms for obtaining the Pareto optimal solutions of the proposed models are provided. It is shown that problems involving discrete fuzzy random variables can be transformed into deterministic nonlinear mathematical programming problems which can be solved through a conventional mathematical programming solver under practically reasonable assumptions. A numerical example of agriculture production problems is given to demonstrate the applicability of the proposed models to real-world problems in fuzzy stochastic environments.
A Semismooth Newton Method for Nonlinear Parameter Identification Problems with Impulsive Noise
Clason, Christian
2012-01-01
This work is concerned with nonlinear parameter identification in partial differential equations subject to impulsive noise. To cope with the non-Gaussian nature of the noise, we consider a model with L 1 fitting. However, the nonsmoothness of the problem makes its efficient numerical solution challenging. By approximating this problem using a family of smoothed functionals, a semismooth Newton method becomes applicable. In particular, its superlinear convergence is proved under a second-order condition. The convergence of the solution to the approximating problem as the smoothing parameter goes to zero is shown. A strategy for adaptively selecting the regularization parameter based on a balancing principle is suggested. The efficiency of the method is illustrated on several benchmark inverse problems of recovering coefficients in elliptic differential equations, for which one- and two-dimensional numerical examples are presented. © by SIAM.
Luo, Xiaodong
2014-10-01
The ensemble Kalman filter (EnKF) is an efficient algorithm for many data assimilation problems. In certain circumstances, however, divergence of the EnKF might be spotted. In previous studies, the authors proposed an observation-space-based strategy, called residual nudging, to improve the stability of the EnKF when dealing with linear observation operators. The main idea behind residual nudging is to monitor and, if necessary, adjust the distances (misfits) between the real observations and the simulated ones of the state estimates, in the hope that by doing so one may be able to obtain better estimation accuracy. In the present study, residual nudging is extended and modified in order to handle nonlinear observation operators. Such extension and modification result in an iterative filtering framework that, under suitable conditions, is able to achieve the objective of residual nudging for data assimilation problems with nonlinear observation operators. The 40-dimensional Lorenz-96 model is used to illustrate the performance of the iterative filter. Numerical results show that, while a normal EnKF may diverge with nonlinear observation operators, the proposed iterative filter remains stable and leads to reasonable estimation accuracy under various experimental settings.
A Simple FEM Formulation Applied to Nonlinear Problems of Impact with Thermomechanical Coupling
Directory of Open Access Journals (Sweden)
João Paulo de Barros Cavalcante
Full Text Available Abstract The thermal effects of problems involving deformable structures are essential to describe the behavior of materials in feasible terms. Verifying the transformation of mechanical energy into heat it is possible to predict the modifications of mechanical properties of materials due to its temperature changes. The current paper presents the numerical development of a finite element method suitable for nonlinear structures coupled with thermomechanical behavior; including impact problems. A simple and effective alternative formulation is presented, called FEM positional, to deal with the dynamic nonlinear systems. The developed numerical is based on the minimum potential energy written in terms of nodal positions instead of displacements. The effects of geometrical, material and thermal nonlinearities are considered. The thermodynamically consistent formulation is based on the laws of thermodynamics and the Helmholtz free-energy, used to describe the thermoelastic and the thermoplastic behaviors. The coupled thermomechanical model can result in secondary effects that cause redistributions of internal efforts, depending on the history of deformation and material properties. The numerical results of the proposed formulation are compared with examples found in the literature.
On some nonlinear problems arising in the physics of ionized gases
International Nuclear Information System (INIS)
Hilhorst-Goldman, D.
1981-01-01
The author reports results obtained by rigorous analysis of a nonlinear differential equation for the electron density nsub(e) in a specific type of electrical discharge. The problem is essentially two-dimensional. She discusses in particular the escape of electrons to infinity above a critical temperature and the boundary layer exhibited by nsub(e) near zero temperature. A singular boundary value problem arising in a pre-breakdown gas discharge is discussed. A Coulomb gas is considered in a special experimental situation: the pre-breakdown gas discharge between two electrodes. The equation for the negative charge density can be formulated as a nonlinear parabolic equation degenerate at the origin. The existence and uniqueness of the solution are proved as well as the asymptotic stability of its unique steady state. Some results are also given about the rate of convergence. The variational characterisation of the limit solution of a singular perturbation problem and variational analysis of a perturbed free boundary problem are considered. (Auth./C.F.)
Arbitrary Lagrangian-Eulerian method for non-linear problems of geomechanics
International Nuclear Information System (INIS)
Nazem, M; Carter, J P; Airey, D W
2010-01-01
In many geotechnical problems it is vital to consider the geometrical non-linearity caused by large deformation in order to capture a more realistic model of the true behaviour. The solutions so obtained should then be more accurate and reliable, which should ultimately lead to cheaper and safer design. The Arbitrary Lagrangian-Eulerian (ALE) method originated from fluid mechanics, but has now been well established for solving large deformation problems in geomechanics. This paper provides an overview of the ALE method and its challenges in tackling problems involving non-linearities due to material behaviour, large deformation, changing boundary conditions and time-dependency, including material rate effects and inertia effects in dynamic loading applications. Important aspects of ALE implementation into a finite element framework will also be discussed. This method is then employed to solve some interesting and challenging geotechnical problems such as the dynamic bearing capacity of footings on soft soils, consolidation of a soil layer under a footing, and the modelling of dynamic penetration of objects into soil layers.
Directory of Open Access Journals (Sweden)
Omar Abu Arqub
2014-01-01
Full Text Available The purpose of this paper is to present a new kind of analytical method, the so-called residual power series, to predict and represent the multiplicity of solutions to nonlinear boundary value problems of fractional order. The present method is capable of calculating all branches of solutions simultaneously, even if these multiple solutions are very close and thus rather difficult to distinguish even by numerical techniques. To verify the computational efficiency of the designed proposed technique, two nonlinear models are performed, one of them arises in mixed convection flows and the other one arises in heat transfer, which both admit multiple solutions. The results reveal that the method is very effective, straightforward, and powerful for formulating these multiple solutions.
Initial-value problem for the Gardner equation applied to nonlinear internal waves
Rouvinskaya, Ekaterina; Kurkina, Oxana; Kurkin, Andrey; Talipova, Tatiana; Pelinovsky, Efim
2017-04-01
The Gardner equation is a fundamental mathematical model for the description of weakly nonlinear weakly dispersive internal waves, when cubic nonlinearity cannot be neglected. Within this model coefficients of quadratic and cubic nonlinearity can both be positive as well as negative, depending on background conditions of the medium, where waves propagate (sea water density stratification, shear flow profile) [Rouvinskaya et al., 2014, Kurkina et al., 2011, 2015]. For the investigation of weakly dispersive behavior in the framework of nondimensional Gardner equation with fixed (positive) sign of quadratic nonlinearity and positive or negative cubic nonlinearity {eq1} partial η/partial t+6η( {1± η} )partial η/partial x+partial ^3η/partial x^3=0, } the series of numerical experiments of initial-value problem was carried out for evolution of a bell-shaped impulse of negative polarity (opposite to the sign of quadratic nonlinear coefficient): {eq2} η(x,t=0)=-asech2 ( {x/x0 } ), for which amplitude a and width x0 was varied. Similar initial-value problem was considered in the paper [Trillo et al., 2016] for the Korteweg - de Vries equation. For the Gardner equation with different signs of cubic nonlinearity the initial-value problem for piece-wise constant initial condition was considered in detail in [Grimshaw et al., 2002, 2010]. It is widely known, for example, [Pelinovsky et al., 2007], that the Gardner equation (1) with negative cubic nonlinearity has a family of classic solitary wave solutions with only positive polarity,and with limiting amplitude equal to 1. Therefore evolution of impulses (2) of negative polarity (whose amplitudes a were varied from 0.1 to 3, and widths at the level of a/2 were equal to triple width of solitons with the same amplitude for a 1) was going on a universal scenario with the generation of nonlinear Airy wave. For the Gardner equation (1) with the positive cubic nonlinearity coefficient there exist two one-parametric families of
Zhu, Yuanheng; Zhao, Dongbin; Yang, Xiong; Zhang, Qichao
2018-02-01
Sum of squares (SOS) polynomials have provided a computationally tractable way to deal with inequality constraints appearing in many control problems. It can also act as an approximator in the framework of adaptive dynamic programming. In this paper, an approximate solution to the optimal control of polynomial nonlinear systems is proposed. Under a given attenuation coefficient, the Hamilton-Jacobi-Isaacs equation is relaxed to an optimization problem with a set of inequalities. After applying the policy iteration technique and constraining inequalities to SOS, the optimization problem is divided into a sequence of feasible semidefinite programming problems. With the converged solution, the attenuation coefficient is further minimized to a lower value. After iterations, approximate solutions to the smallest -gain and the associated optimal controller are obtained. Four examples are employed to verify the effectiveness of the proposed algorithm.
Directory of Open Access Journals (Sweden)
Ureña Antonio J
2002-01-01
Full Text Available A generalization of the well-known Hartman–Nagumo inequality to the case of the vector ordinary -Laplacian and classical degree theory provide existence results for some associated nonlinear boundary value problems.
Fymat, A. L.
1976-01-01
The paper studies the inversion of the radiative transfer equation describing the interaction of electromagnetic radiation with atmospheric aerosols. The interaction can be considered as the propagation in the aerosol medium of two light beams: the direct beam in the line-of-sight attenuated by absorption and scattering, and the diffuse beam arising from scattering into the viewing direction, which propagates more or less in random fashion. The latter beam has single scattering and multiple scattering contributions. In the former case and for single scattering, the problem is reducible to first-kind Fredholm equations, while for multiple scattering it is necessary to invert partial integrodifferential equations. A nonlinear minimization search method, applicable to the solution of both types of problems has been developed, and is applied here to the problem of monitoring aerosol pollution, namely the complex refractive index and size distribution of aerosol particles.
Research program with no ''measurement problem''
International Nuclear Information System (INIS)
Noyes, H.P.; Gefwert, C.; Manthey, M.J.
1985-07-01
The ''measurement problem'' of contemporary physics is met by recognizing that the physicist participates when constructing and when applying the theory consisting of the formulated formal and measurement criteria (the expressions and rules) providing the necessary conditions which allow him to compute and measure facts, yet retains objectivity by requiring that these criteria, rules and facts be in corroborative equilibrium. We construct the particulate states of quantum physics by a recursive program which incorporates the non-determinism born of communication between asynchronous processes over a shared memory. Their quantum numbers and coupling constants arise from the construction via the unique 4-level combinatorial hierarchy. The construction defines indivisible quantum events with the requisite supraluminal correlations, yet does not allow supraluminal communication. Measurement criteria incorporate c, h-bar, and m/sub p/ or (not ''and'') G. The resulting theory is discrete throughout, contains no infinities, and, as far as we have developed it, is in agreement with quantum mechanical and cosmological fact
Domí nguez, Luis F.; Pistikopoulos, Efstratios N.
2010-01-01
continuous multiparametric programming algorithm is then used to solve the reformulated convex inner problem. The second algorithm addresses the mixed-integer case of the bilevel programming problem where integer and continuous variables of the outer problem
Belmiloudi, A.; Mahé, F.
2014-01-01
International audience; The paper investigates boundary optimal controls and parameter estimates to the well-posedness nonlinear model of dehydration of thermic problems. We summarize the general formulations for the boundary control for initial-boundary value problem for nonlinear partial differential equations modeling the heat transfer and derive necessary optimality conditions, including the adjoint equation, for the optimal set of parameters minimizing objective functions J. Numerical si...
Library of problem-oriented programs for solving problems of atomic and nuclear physics
International Nuclear Information System (INIS)
Kharitonov, Yu.I.
1976-01-01
The Data Centre of the Leningrad Institute of Nuclear Physics (LIYaF) is working on the establishment of a library of problem-oriented computer programs for solving problems of atomic and nuclear physics. This paper lists and describes briefly the programs presently available to the Data Centre. The descriptions include the program code numbers, the program language, the translator for which the program is designed, and the program scope
Group-invariant solutions of nonlinear elastodynamic problems of plates and shells
International Nuclear Information System (INIS)
Dzhupanov, V.A.; Vassilev, V.M.; Dzhondzhorov, P.A.
1993-01-01
Plates and shells are basic structural components in nuclear reactors and their equipment. The prediction of the dynamic response of these components to fast transient loadings (e.g., loadings caused by earthquakes, missile impacts, etc.) is a quite important problem in the general context of the design, reliability and safety of nuclear power stations. Due to the extreme loading conditions a more adequate treatment of the foregoing problem should rest on a suitable nonlinear shell model, which would allow large deflections of the structures regarded to be taken into account. Such a model is provided in the nonlinear Donnell-Mushtari-Vlasov (DMV) theory. The governing system of equations of the DMV theory consists of two coupled nonlinear fourth order partial differential equations in three independent and two dependent variables. It is clear, as the case stands, that the obtaining solutions to this system directly, by using any of the general analytical or numerical techniques, would involve considerable difficulties. In the present paper, the invariance of the governing equations of DMV theory for plates and cylindrical shells relative to local Lie groups of local point transformations will be employed to get some advantages in connection with the aforementioned problem. First, the symmetry of a functional, corresponding to the governing equations of DMV theory for plates and cylindrical shells is studied. Next, the densities in the corresponding conservation laws are determined on the basis of Noether theorem. Finally, we study a class of invariant solutions of the governing equations. As is well known, group-invariant solutions are often intermediate asymptotics for a wider class of solutions of the corresponding equations. When such solutions are considered, the number of the independent variables can be reduced. For the class of invariant solutions studied here, the system of governing equations converts into a system of ordinary differential equations
Directory of Open Access Journals (Sweden)
Chi-Chang Wang
2013-09-01
Full Text Available This paper seeks to use the proposed residual correction method in coordination with the monotone iterative technique to obtain upper and lower approximate solutions of singularly perturbed non-linear boundary value problems. First, the monotonicity of a non-linear differential equation is reinforced using the monotone iterative technique, then the cubic-spline method is applied to discretize and convert the differential equation into the mathematical programming problems of an inequation, and finally based on the residual correction concept, complex constraint solution problems are transformed into simpler questions of equational iteration. As verified by the four examples given in this paper, the method proposed hereof can be utilized to fast obtain the upper and lower solutions of questions of this kind, and to easily identify the error range between mean approximate solutions and exact solutions.
Numerical nonlinear complex geometrical optics algorithm for the 3D Calderón problem
DEFF Research Database (Denmark)
Delbary, Fabrice; Knudsen, Kim
2014-01-01
to the generalized Laplace equation. The 3D problem was solved in theory in late 1980s using complex geometrical optics solutions and a scattering transform. Several approximations to the reconstruction method have been suggested and implemented numerically in the literature, but here, for the first time, a complete...... computer implementation of the full nonlinear algorithm is given. First a boundary integral equation is solved by a Nystrom method for the traces of the complex geometrical optics solutions, second the scattering transform is computed and inverted using fast Fourier transform, and finally a boundary value...
One-dimensional singular problems involving the p-Laplacian and nonlinearities indefinite in sign
Kaufmann, Uriel; Medri, Iván
2015-01-01
Let $\\Omega$ be a bounded open interval, let $p>1$ and $\\gamma>0$, and let $m:\\Omega\\rightarrow\\mathbb{R}$ be a function that may change sign in $\\Omega $. In this article we study the existence and nonexistence of positive solutions for one-dimensional singular problems of the form $-(\\left\\vert u^{\\prime}\\right\\vert ^{p-2}u^{\\prime})^{\\prime}=m\\left( x\\right) u^{-\\gamma}$ in $\\Omega$, $u=0$ on $\\partial\\Omega$. As a consequence we also derive existence results for other related nonlinearities.
A Dynamic Programming Algorithm for the k-Haplotyping Problem
Institute of Scientific and Technical Information of China (English)
Zhen-ping Li; Ling-yun Wu; Yu-ying Zhao; Xiang-sun Zhang
2006-01-01
The Minimum Fragments Removal (MFR) problem is one of the haplotyping problems: given a set of fragments, remove the minimum number of fragments so that the resulting fragments can be partitioned into k classes of non-conflicting subsets. In this paper, we formulate the k-MFR problem as an integer linear programming problem, and develop a dynamic programming approach to solve the k-MFR problem for both the gapless and gap cases.
Directory of Open Access Journals (Sweden)
Jiuping Xu
2012-01-01
Full Text Available The aim of this study is to deal with a minimum cost network flow problem (MCNFP in a large-scale construction project using a nonlinear multiobjective bilevel model with birandom variables. The main target of the upper level is to minimize both direct and transportation time costs. The target of the lower level is to minimize transportation costs. After an analysis of the birandom variables, an expectation multiobjective bilevel programming model with chance constraints is formulated to incorporate decision makers’ preferences. To solve the identified special conditions, an equivalent crisp model is proposed with an additional multiobjective bilevel particle swarm optimization (MOBLPSO developed to solve the model. The Shuibuya Hydropower Project is used as a real-world example to verify the proposed approach. Results and analysis are presented to highlight the performances of the MOBLPSO, which is very effective and efficient compared to a genetic algorithm and a simulated annealing algorithm.
Lima, Ricardo
2016-06-16
This paper addresses the solution of a cardinality Boolean quadratic programming problem using three different approaches. The first transforms the original problem into six mixed-integer linear programming (MILP) formulations. The second approach takes one of the MILP formulations and relies on the specific features of an MILP solver, namely using starting incumbents, polishing, and callbacks. The last involves the direct solution of the original problem by solvers that can accomodate the nonlinear combinatorial problem. Particular emphasis is placed on the definition of the MILP reformulations and their comparison with the other approaches. The results indicate that the data of the problem has a strong influence on the performance of the different approaches, and that there are clear-cut approaches that are better for some instances of the data. A detailed analysis of the results is made to identify the most effective approaches for specific instances of the data. © 2016 Springer Science+Business Media New York
Lima, Ricardo; Grossmann, Ignacio E.
2016-01-01
This paper addresses the solution of a cardinality Boolean quadratic programming problem using three different approaches. The first transforms the original problem into six mixed-integer linear programming (MILP) formulations. The second approach takes one of the MILP formulations and relies on the specific features of an MILP solver, namely using starting incumbents, polishing, and callbacks. The last involves the direct solution of the original problem by solvers that can accomodate the nonlinear combinatorial problem. Particular emphasis is placed on the definition of the MILP reformulations and their comparison with the other approaches. The results indicate that the data of the problem has a strong influence on the performance of the different approaches, and that there are clear-cut approaches that are better for some instances of the data. A detailed analysis of the results is made to identify the most effective approaches for specific instances of the data. © 2016 Springer Science+Business Media New York
K-Minimax Stochastic Programming Problems
Nedeva, C.
2007-10-01
The purpose of this paper is a discussion of a numerical procedure based on the simplex method for stochastic optimization problems with partially known distribution functions. The convergence of this procedure is proved by the condition on dual problems.
Numerical solution of large nonlinear boundary value problems by quadratic minimization techniques
International Nuclear Information System (INIS)
Glowinski, R.; Le Tallec, P.
1984-01-01
The objective of this paper is to describe the numerical treatment of large highly nonlinear two or three dimensional boundary value problems by quadratic minimization techniques. In all the different situations where these techniques were applied, the methodology remains the same and is organized as follows: 1) derive a variational formulation of the original boundary value problem, and approximate it by Galerkin methods; 2) transform this variational formulation into a quadratic minimization problem (least squares methods) or into a sequence of quadratic minimization problems (augmented lagrangian decomposition); 3) solve each quadratic minimization problem by a conjugate gradient method with preconditioning, the preconditioning matrix being sparse, positive definite, and fixed once for all in the iterative process. This paper will illustrate the methodology above on two different examples: the description of least squares solution methods and their application to the solution of the unsteady Navier-Stokes equations for incompressible viscous fluids; the description of augmented lagrangian decomposition techniques and their application to the solution of equilibrium problems in finite elasticity
Bilevel programming problems theory, algorithms and applications to energy networks
Dempe, Stephan; Pérez-Valdés, Gerardo A; Kalashnykova, Nataliya; Kalashnikova, Nataliya
2015-01-01
This book describes recent theoretical findings relevant to bilevel programming in general, and in mixed-integer bilevel programming in particular. It describes recent applications in energy problems, such as the stochastic bilevel optimization approaches used in the natural gas industry. New algorithms for solving linear and mixed-integer bilevel programming problems are presented and explained.
Directory of Open Access Journals (Sweden)
Felix Fritzen
2018-02-01
Full Text Available A novel algorithmic discussion of the methodological and numerical differences of competing parametric model reduction techniques for nonlinear problems is presented. First, the Galerkin reduced basis (RB formulation is presented, which fails at providing significant gains with respect to the computational efficiency for nonlinear problems. Renowned methods for the reduction of the computing time of nonlinear reduced order models are the Hyper-Reduction and the (Discrete Empirical Interpolation Method (EIM, DEIM. An algorithmic description and a methodological comparison of both methods are provided. The accuracy of the predictions of the hyper-reduced model and the (DEIM in comparison to the Galerkin RB is investigated. All three approaches are applied to a simple uncertainty quantification of a planar nonlinear thermal conduction problem. The results are compared to computationally intense finite element simulations.
Yang, Haijian
2016-07-26
Fully implicit methods are drawing more attention in scientific and engineering applications due to the allowance of large time steps in extreme-scale simulations. When using a fully implicit method to solve two-phase flow problems in porous media, one major challenge is the solution of the resultant nonlinear system at each time step. To solve such nonlinear systems, traditional nonlinear iterative methods, such as the class of the Newton methods, often fail to achieve the desired convergent rate due to the high nonlinearity of the system and/or the violation of the boundedness requirement of the saturation. In the paper, we reformulate the two-phase model as a variational inequality that naturally ensures the physical feasibility of the saturation variable. The variational inequality is then solved by an active-set reduced-space method with a nonlinear elimination preconditioner to remove the high nonlinear components that often causes the failure of the nonlinear iteration for convergence. To validate the effectiveness of the proposed method, we compare it with the classical implicit pressure-explicit saturation method for two-phase flow problems with strong heterogeneity. The numerical results show that our nonlinear solver overcomes the often severe limits on the time step associated with existing methods, results in superior convergence performance, and achieves reduction in the total computing time by more than one order of magnitude.
Yang, Haijian; Yang, Chao; Sun, Shuyu
2016-01-01
Fully implicit methods are drawing more attention in scientific and engineering applications due to the allowance of large time steps in extreme-scale simulations. When using a fully implicit method to solve two-phase flow problems in porous media, one major challenge is the solution of the resultant nonlinear system at each time step. To solve such nonlinear systems, traditional nonlinear iterative methods, such as the class of the Newton methods, often fail to achieve the desired convergent rate due to the high nonlinearity of the system and/or the violation of the boundedness requirement of the saturation. In the paper, we reformulate the two-phase model as a variational inequality that naturally ensures the physical feasibility of the saturation variable. The variational inequality is then solved by an active-set reduced-space method with a nonlinear elimination preconditioner to remove the high nonlinear components that often causes the failure of the nonlinear iteration for convergence. To validate the effectiveness of the proposed method, we compare it with the classical implicit pressure-explicit saturation method for two-phase flow problems with strong heterogeneity. The numerical results show that our nonlinear solver overcomes the often severe limits on the time step associated with existing methods, results in superior convergence performance, and achieves reduction in the total computing time by more than one order of magnitude.
Discrete and continuum links to a nonlinear coupled transport problem of interacting populations
Duong, M. H.; Muntean, A.; Richardson, O. M.
2017-07-01
We are interested in exploring interacting particle systems that can be seen as microscopic models for a particular structure of coupled transport flux arising when different populations are jointly evolving. The scenarios we have in mind are inspired by the dynamics of pedestrian flows in open spaces and are intimately connected to cross-diffusion and thermo-diffusion problems holding a variational structure. The tools we use include a suitable structure of the relative entropy controlling TV-norms, the construction of Lyapunov functionals and particular closed-form solutions to nonlinear transport equations, a hydrodynamics limiting procedure due to Philipowski, as well as the construction of numerical approximates to both the continuum limit problem in 2D and to the original interacting particle systems.
Directory of Open Access Journals (Sweden)
Chen Yuming
2011-01-01
Full Text Available Though boundary value problems for fractional differential equations have been extensively studied, most of the studies focus on scalar equations and the fractional order between 1 and 2. On the other hand, delay is natural in practical systems. However, not much has been done for fractional differential equations with delays. Therefore, in this paper, we consider a boundary value problem of a general delayed nonlinear fractional system. With the help of some fixed point theorems and the properties of the Green function, we establish several sets of sufficient conditions on the existence of positive solutions. The obtained results extend and include some existing ones and are illustrated with some examples for their feasibility.
Mathematical and numerical study of nonlinear boundary problems related to plasma physics
International Nuclear Information System (INIS)
Sermange, M.
1982-06-01
After the study of some equations based on the Hodgkin-Huxley model, the work presented here is concerned with nonlinear boundary problems in MHD. They are gathered in two subjects: equilibrium equations and stability equations. The axisymmetric MHD equilibrium equations with free boundary have been studied by different authors, particularly the existence, regularity, unicity and non-unicity. Here, bifurcation, convergence of calculation methods existence of solutions in a discontinuous frame are studied. MHD stability can be determined by the principle of Bernstein et al; the mathematical work concerned here bears on the equivalence, in the case of two-dimensional or axisymmetric stability, between this model and a scalar eigenvalue problem which is introduced. At last, modules for computing MHD equilibrium for the simulation of plasma confinement in a tokamak are described [fr
A limited memory BFGS method for a nonlinear inverse problem in digital breast tomosynthesis
Landi, G.; Loli Piccolomini, E.; Nagy, J. G.
2017-09-01
Digital breast tomosynthesis (DBT) is an imaging technique that allows the reconstruction of a pseudo three-dimensional image of the breast from a finite number of low-dose two-dimensional projections obtained by different x-ray tube angles. An issue that is often ignored in DBT is the fact that an x-ray beam is polyenergetic, i.e. it is composed of photons with different levels of energy. The polyenergetic model requires solving a large-scale, nonlinear inverse problem, which is more expensive than the typically used simplified, linear monoenergetic model. However, the polyenergetic model is much less susceptible to beam hardening artifacts, which show up as dark streaks and cupping (i.e. background nonuniformities) in the reconstructed image. In addition, it has been shown that the polyenergetic model can be exploited to obtain additional quantitative information about the material of the object being imaged. In this paper we consider the multimaterial polyenergetic DBT model, and solve the nonlinear inverse problem with a limited memory BFGS quasi-Newton method. Regularization is enforced at each iteration using a diagonally modified approximation of the Hessian matrix, and by truncating the iterations.
Solution of the nonlinear inverse scattering problem by T-matrix completion. I. Theory.
Levinson, Howard W; Markel, Vadim A
2016-10-01
We propose a conceptually different method for solving nonlinear inverse scattering problems (ISPs) such as are commonly encountered in tomographic ultrasound imaging, seismology, and other applications. The method is inspired by the theory of nonlocality of physical interactions and utilizes the relevant formalism. We formulate the ISP as a problem whose goal is to determine an unknown interaction potential V from external scattering data. Although we seek a local (diagonally dominated) V as the solution to the posed problem, we allow V to be nonlocal at the intermediate stages of iterations. This allows us to utilize the one-to-one correspondence between V and the T matrix of the problem. Here it is important to realize that not every T corresponds to a diagonal V and we, therefore, relax the usual condition of strict diagonality (locality) of V. An iterative algorithm is proposed in which we seek T that is (i) compatible with the measured scattering data and (ii) corresponds to an interaction potential V that is as diagonally dominated as possible. We refer to this algorithm as to the data-compatible T-matrix completion. This paper is Part I in a two-part series and contains theory only. Numerical examples of image reconstruction in a strongly nonlinear regime are given in Part II [H. W. Levinson and V. A. Markel, Phys. Rev. E 94, 043318 (2016)10.1103/PhysRevE.94.043318]. The method described in this paper is particularly well suited for very large data sets that become increasingly available with the use of modern measurement techniques and instrumentation.
M. ZANGIABADI; H. R. MALEKI
2007-01-01
In the real-world optimization problems, coefficients of the objective function are not known precisely and can be interpreted as fuzzy numbers. In this paper we define the concepts of optimality for linear programming problems with fuzzy parameters based on those for multiobjective linear programming problems. Then by using the concept of comparison of fuzzy numbers, we transform a linear programming problem with fuzzy parameters to a multiobjective linear programming problem. To this end, w...
Energy Technology Data Exchange (ETDEWEB)
Delbos, F.
2004-11-01
Reflexion tomography allows the determination of a subsurface velocity model from the travel times of seismic waves. The introduction of a priori information in this inverse problem can lead to the resolution of a constrained non-linear least-squares problem. The goal of the thesis is to improve the resolution techniques of this optimization problem, whose main difficulties are its ill-conditioning, its large scale and an expensive cost function in terms of CPU time. Thanks to a detailed study of the problem and to numerous numerical experiments, we justify the use of a sequential quadratic programming method, in which the tangential quadratic programs are solved by an original augmented Lagrangian method. We show the global linear convergence of the latter. The efficiency and robustness of the approach are demonstrated on several synthetic examples and on two real data cases. (author)
Energy Technology Data Exchange (ETDEWEB)
Delbos, F
2004-11-01
Reflexion tomography allows the determination of a subsurface velocity model from the travel times of seismic waves. The introduction of a priori information in this inverse problem can lead to the resolution of a constrained non-linear least-squares problem. The goal of the thesis is to improve the resolution techniques of this optimization problem, whose main difficulties are its ill-conditioning, its large scale and an expensive cost function in terms of CPU time. Thanks to a detailed study of the problem and to numerous numerical experiments, we justify the use of a sequential quadratic programming method, in which the tangential quadratic programs are solved by an original augmented Lagrangian method. We show the global linear convergence of the latter. The efficiency and robustness of the approach are demonstrated on several synthetic examples and on two real data cases. (author)
Language Program Evaluation: Decisions, Problems, and Solutions.
Brown, James Dean
1995-01-01
Discusses the evaluation of second and foreign language programs, focusing on whether such evaluations should be summative or formative; use outside experts or program staff; emphasize qualitative or quantitative data; and concentrate on the process or the product. An annotated bibliography discusses six important works in the field. (78…
Yin, Sisi; Nishi, Tatsushi
2014-11-01
Quantity discount policy is decision-making for trade-off prices between suppliers and manufacturers while production is changeable due to demand fluctuations in a real market. In this paper, quantity discount models which consider selection of contract suppliers, production quantity and inventory simultaneously are addressed. The supply chain planning problem with quantity discounts under demand uncertainty is formulated as a mixed-integer nonlinear programming problem (MINLP) with integral terms. We apply an outer-approximation method to solve MINLP problems. In order to improve the efficiency of the proposed method, the problem is reformulated as a stochastic model replacing the integral terms by using a normalisation technique. We present numerical examples to demonstrate the efficiency of the proposed method.
International Nuclear Information System (INIS)
Keanini, R.G.
2011-01-01
Research highlights: → Systematic approach for physically probing nonlinear and random evolution problems. → Evolution of vortex sheets corresponds to evolution of an Ornstein-Uhlenbeck process. → Organization of near-molecular scale vorticity mediated by hydrodynamic modes. → Framework allows calculation of vorticity evolution within random strain fields. - Abstract: A framework which combines Green's function (GF) methods and techniques from the theory of stochastic processes is proposed for tackling nonlinear evolution problems. The framework, established by a series of easy-to-derive equivalences between Green's function and stochastic representative solutions of linear drift-diffusion problems, provides a flexible structure within which nonlinear evolution problems can be analyzed and physically probed. As a preliminary test bed, two canonical, nonlinear evolution problems - Burgers' equation and the nonlinear Schroedinger's equation - are first treated. In the first case, the framework provides a rigorous, probabilistic derivation of the well known Cole-Hopf ansatz. Likewise, in the second, the machinery allows systematic recovery of a known soliton solution. The framework is then applied to a fairly extensive exploration of physical features underlying evolution of randomly stretched and advected Burger's vortex sheets. Here, the governing vorticity equation corresponds to the Fokker-Planck equation of an Ornstein-Uhlenbeck process, a correspondence that motivates an investigation of sub-sheet vorticity evolution and organization. Under the assumption that weak hydrodynamic fluctuations organize disordered, near-molecular-scale, sub-sheet vorticity, it is shown that these modes consist of two weakly damped counter-propagating cross-sheet acoustic modes, a diffusive cross-sheet shear mode, and a diffusive cross-sheet entropy mode. Once a consistent picture of in-sheet vorticity evolution is established, a number of analytical results, describing the
Implementation of a multi-layer perception for a non-linear control problem
International Nuclear Information System (INIS)
Lister, J.B.; Schnurrenberger, H.; Marmillod, P.
1990-12-01
We present the practical application of a 1-hidden-layer multilayer perception (MLP) to provide a non-linear continuous multi-variable mapping with 42 inputs and 13 outputs. The problem resolved is one of extracting information from experimental signals with a bandwidth of many kilohertz. We have an exact model of the inverse mapping of this problem, but we have no explicit form of the required forward mapping. This is the typical situation in data interpretation. The MLP was trained to provide this mapping by learning on 500 input-output examples. The success of the off-line solution to this problem using an MLP led us to examine the robustness of the MLP to different noise sources. We found that the MLP is more robust than an approximate linear mapping of the same problem. 12 bits of resolution in the weights are necessary to avoid a significant loss of precision. The practical implementation of large analog weight matrices using DAS-multipliers and a simple segmented sigmoid is also presented. A General Adaptive Recipe (GAR) for improving the performance of conventional back-propagation was developed. The GAR uses an adaptive step length and both the bias terms and the initial weight seeding are determined by the network size. The GAR was found to be robust and much faster than conventional back-propagation. (author) 20 figs., 1 tab., 15 refs
International Nuclear Information System (INIS)
Tran Duc Van
1994-01-01
The notion of global quasi-classical solutions of the Cauchy problems for first-order nonlinear partial differential equations is presented, some uniqueness theorems and a stability result are established by the method based on the theory of differential inclusions. In particular, the answer to an open problem of S.N. Kruzhkov is given. (author). 10 refs, 1 fig
Constraint-based scheduling applying constraint programming to scheduling problems
Baptiste, Philippe; Nuijten, Wim
2001-01-01
Constraint Programming is a problem-solving paradigm that establishes a clear distinction between two pivotal aspects of a problem: (1) a precise definition of the constraints that define the problem to be solved and (2) the algorithms and heuristics enabling the selection of decisions to solve the problem. It is because of these capabilities that Constraint Programming is increasingly being employed as a problem-solving tool to solve scheduling problems. Hence the development of Constraint-Based Scheduling as a field of study. The aim of this book is to provide an overview of the most widely used Constraint-Based Scheduling techniques. Following the principles of Constraint Programming, the book consists of three distinct parts: The first chapter introduces the basic principles of Constraint Programming and provides a model of the constraints that are the most often encountered in scheduling problems. Chapters 2, 3, 4, and 5 are focused on the propagation of resource constraints, which usually are responsibl...
Pasekov, V P
2013-03-01
The paper considers the problems in the adaptive evolution of life-history traits for individuals in the nonlinear Leslie model of age-structured population. The possibility to predict adaptation results as the values of organism's traits (properties) that provide for the maximum of a certain function of traits (optimization criterion) is studied. An ideal criterion of this type is Darwinian fitness as a characteristic of success of an individual's life history. Criticism of the optimization approach is associated with the fact that it does not take into account the changes in the environmental conditions (in a broad sense) caused by evolution, thereby leading to losses in the adequacy of the criterion. In addition, the justification for this criterion under stationary conditions is not usually rigorous. It has been suggested to overcome these objections in terms of the adaptive dynamics theory using the concept of invasive fitness. The reasons are given that favor the application of the average number of offspring for an individual, R(L), as an optimization criterion in the nonlinear Leslie model. According to the theory of quantitative genetics, the selection for fertility (that is, for a set of correlated quantitative traits determined by both multiple loci and the environment) leads to an increase in R(L). In terms of adaptive dynamics, the maximum R(L) corresponds to the evolutionary stability and, in certain cases, convergent stability of the values for traits. The search for evolutionarily stable values on the background of limited resources for reproduction is a problem of linear programming.
Directory of Open Access Journals (Sweden)
U. Filobello-Nino
2015-01-01
Full Text Available We propose an approximate solution of T-F equation, obtained by using the nonlinearities distribution homotopy perturbation method (NDHPM. Besides, we show a table of comparison, between this proposed approximate solution and a numerical of T-F, by establishing the accuracy of the results.
International Nuclear Information System (INIS)
Biffle, J.H.; Blanford, M.L.
1994-05-01
JAC2D is a two-dimensional finite element program designed to solve quasi-static nonlinear mechanics problems. A set of continuum equations describes the nonlinear mechanics involving large rotation and strain. A nonlinear conjugate gradient method is used to solve the equations. The method is implemented in a two-dimensional setting with various methods for accelerating convergence. Sliding interface logic is also implemented. A four-node Lagrangian uniform strain element is used with hourglass stiffness to control the zero-energy modes. This report documents the elastic and isothermal elastic/plastic material model. Other material models, documented elsewhere, are also available. The program is vectorized for efficient performance on Cray computers. Sample problems described are the bending of a thin beam, the rotation of a unit cube, and the pressurization and thermal loading of a hollow sphere
International Nuclear Information System (INIS)
Biffle, J.H.
1993-02-01
JAC3D is a three-dimensional finite element program designed to solve quasi-static nonlinear mechanics problems. A set of continuum equations describes the nonlinear mechanics involving large rotation and strain. A nonlinear conjugate gradient method is used to solve the equation. The method is implemented in a three-dimensional setting with various methods for accelerating convergence. Sliding interface logic is also implemented. An eight-node Lagrangian uniform strain element is used with hourglass stiffness to control the zero-energy modes. This report documents the elastic and isothermal elastic-plastic material model. Other material models, documented elsewhere, are also available. The program is vectorized for efficient performance on Cray computers. Sample problems described are the bending of a thin beam, the rotation of a unit cube, and the pressurization and thermal loading of a hollow sphere
Non-intrusive reduced order modeling of nonlinear problems using neural networks
Hesthaven, J. S.; Ubbiali, S.
2018-06-01
We develop a non-intrusive reduced basis (RB) method for parametrized steady-state partial differential equations (PDEs). The method extracts a reduced basis from a collection of high-fidelity solutions via a proper orthogonal decomposition (POD) and employs artificial neural networks (ANNs), particularly multi-layer perceptrons (MLPs), to accurately approximate the coefficients of the reduced model. The search for the optimal number of neurons and the minimum amount of training samples to avoid overfitting is carried out in the offline phase through an automatic routine, relying upon a joint use of the Latin hypercube sampling (LHS) and the Levenberg-Marquardt (LM) training algorithm. This guarantees a complete offline-online decoupling, leading to an efficient RB method - referred to as POD-NN - suitable also for general nonlinear problems with a non-affine parametric dependence. Numerical studies are presented for the nonlinear Poisson equation and for driven cavity viscous flows, modeled through the steady incompressible Navier-Stokes equations. Both physical and geometrical parametrizations are considered. Several results confirm the accuracy of the POD-NN method and show the substantial speed-up enabled at the online stage as compared to a traditional RB strategy.
Improve Problem Solving Skills through Adapting Programming Tools
Shaykhian, Linda H.; Shaykhian, Gholam Ali
2007-01-01
There are numerous ways for engineers and students to become better problem-solvers. The use of command line and visual programming tools can help to model a problem and formulate a solution through visualization. The analysis of problem attributes and constraints provide insight into the scope and complexity of the problem. The visualization aspect of the problem-solving approach tends to make students and engineers more systematic in their thought process and help them catch errors before proceeding too far in the wrong direction. The problem-solver identifies and defines important terms, variables, rules, and procedures required for solving a problem. Every step required to construct the problem solution can be defined in program commands that produce intermediate output. This paper advocates improved problem solving skills through using a programming tool. MatLab created by MathWorks, is an interactive numerical computing environment and programming language. It is a matrix-based system that easily lends itself to matrix manipulation, and plotting of functions and data. MatLab can be used as an interactive command line or a sequence of commands that can be saved in a file as a script or named functions. Prior programming experience is not required to use MatLab commands. The GNU Octave, part of the GNU project, a free computer program for performing numerical computations, is comparable to MatLab. MatLab visual and command programming are presented here.
Exact multiplicity results for quasilinear boundary-value problems with cubic-like nonlinearities
Directory of Open Access Journals (Sweden)
Idris Addou
2000-01-01
Full Text Available We consider the boundary-value problem $$displaylines{ -(varphi_p (u'' =lambda f(u mbox{ in }(0,1 cr u(0 = u(1 =0,, }$$ where $p>1$, $lambda >0$ and $varphi_p (x =| x|^{p-2}x$. The nonlinearity $f$ is cubic-like with three distinct roots 0=a less than b less than c. By means of a quadrature method, we provide the exact number of solutions for all $lambda >0$. This way we extend a recent result, for $p=2$, by Korman et al. cite{KormanLiOuyang} to the general case $p>1$. We shall prove that when 1less than $pleq 2$ the structure of the solution set is exactly the same as that studied in the case $p=2$ by Korman et al. cite{KormanLiOuyang}, and strictly different in the case $p>2$.
Inexact Newton–Landweber iteration for solving nonlinear inverse problems in Banach spaces
International Nuclear Information System (INIS)
Jin, Qinian
2012-01-01
By making use of duality mappings, we formulate an inexact Newton–Landweber iteration method for solving nonlinear inverse problems in Banach spaces. The method consists of two components: an outer Newton iteration and an inner scheme providing the increments by applying the Landweber iteration in Banach spaces to the local linearized equations. It has the advantage of reducing computational work by computing more cheap steps in each inner scheme. We first prove a convergence result for the exact data case. When the data are given approximately, we terminate the method by a discrepancy principle and obtain a weak convergence result. Finally, we test the method by reporting some numerical simulations concerning the sparsity recovery and the noisy data containing outliers. (paper)
Grolet, Aurelien; Thouverez, Fabrice
2015-02-01
This paper is devoted to the study of vibration of mechanical systems with geometric nonlinearities. The harmonic balance method is used to derive systems of polynomial equations whose solutions give the frequency component of the possible steady states. Groebner basis methods are used for computing all solutions of polynomial systems. This approach allows to reduce the complete system to an unique polynomial equation in one variable driving all solutions of the problem. In addition, in order to decrease the number of variables, we propose to first work on the undamped system, and recover solution of the damped system using a continuation on the damping parameter. The search for multiple solutions is illustrated on a simple system, where the influence of the retained number of harmonic is studied. Finally, the procedure is applied on a simple cyclic system and we give a representation of the multiple states versus frequency.
Regularity of the solutions to a nonlinear boundary problem with indefinite weight
Directory of Open Access Journals (Sweden)
Aomar Anane
2011-01-01
Full Text Available In this paper we study the regularity of the solutions to the problemDelta_p u = |u|^{p−2}u in the bounded smooth domainOmega ⊂ R^N,with|∇u|^{p−2} partial_{nu} u = lambda V (x|u|^{p−2}u + h as a nonlinear boundary condition, where partial Omega is C^{2,beta}, with beta ∈]0, 1[, and V is a weight in L^s(partial Omega and h ∈ L^s(partial Omega for some s ≥ 1. We prove that all solutions are in L^{infty}(Omega cap L^{infty}(Omega, and using the D.Debenedetto’s theorem of regularity in [1] we conclude that those solutions are in C^{1,alpha} overline{Omega} for some alpha ∈ ]0, 1[.
Eigenvalue problem and nonlinear evolution of kink modes in a toroidal plasma
International Nuclear Information System (INIS)
Ogino, T.; Takeda, S.; Sanuki, H.; Kamimura, T.
1979-04-01
The internal kink modes of a cylindrical plasma are investigated by a linear eigen value problem and their nonlinear evolution is studied by 3-dimensional MHD simulation based on the rectangular column model under the fixed boundary condition. The growth rates in two cases, namely uniform and diffused current profiles are analyzed in detail, which agree with the analytical estimation by Shafranov. The time evolution of the m = 1 mode showed that q > 1 is satisfied at the relaxation time (q safety factor), a stable configuration like a horse shoe (a new equilibrium) was formed. Also, the time evolution of the pressure p for the m = 2 mode showed that a stable configuration like a pair of anchors was formed. (author)
Yaparova, N.
2017-10-01
We consider the problem of heating a cylindrical body with an internal thermal source when the main characteristics of the material such as specific heat, thermal conductivity and material density depend on the temperature at each point of the body. We can control the surface temperature and the heat flow from the surface inside the cylinder, but it is impossible to measure the temperature on axis and the initial temperature in the entire body. This problem is associated with the temperature measurement challenge and appears in non-destructive testing, in thermal monitoring of heat treatment and technical diagnostics of operating equipment. The mathematical model of heating is represented as nonlinear parabolic PDE with the unknown initial condition. In this problem, both the Dirichlet and Neumann boundary conditions are given and it is required to calculate the temperature values at the internal points of the body. To solve this problem, we propose the numerical method based on using of finite-difference equations and a regularization technique. The computational scheme involves solving the problem at each spatial step. As a result, we obtain the temperature function at each internal point of the cylinder beginning from the surface down to the axis. The application of the regularization technique ensures the stability of the scheme and allows us to significantly simplify the computational procedure. We investigate the stability of the computational scheme and prove the dependence of the stability on the discretization steps and error level of the measurement results. To obtain the experimental temperature error estimates, computational experiments were carried out. The computational results are consistent with the theoretical error estimates and confirm the efficiency and reliability of the proposed computational scheme.
Refinement from a control problem to program
DEFF Research Database (Denmark)
Schenke, Michael; Ravn, Anders P.
1996-01-01
The distinguishing feature of the presented refinement approach is that it links formalisms from a top level requirements notation down to programs together in a mathematically coherent development trajectory. The approach uses Duration Calculus, a real-time interval logic, to specifyrequirements...
An Approach for Solving Linear Fractional Programming Problems
Andrew Oyakhobo Odior
2012-01-01
Linear fractional programming problems are useful tools in production planning, financial and corporate planning, health care and hospital planning and as such have attracted considerable research interest. The paper presents a new approach for solving a fractional linear programming problem in which the objective function is a linear fractional function, while the constraint functions are in the form of linear inequalities. The approach adopted is based mainly upon solving the problem algebr...
Problem solving and Program design using the TI-92
Ir.ing. Ton Marée; ir Martijn van Dongen
2000-01-01
This textbook is intended for a basic course in problem solving and program design needed by scientists and engineers using the TI-92. The TI-92 is an extremely powerful problem solving tool that can help you manage complicated problems quickly. We assume no prior knowledge of computers or
DEFF Research Database (Denmark)
Hubmer, Simon; Sherina, Ekaterina; Neubauer, Andreas
2018-01-01
. The main result of this paper is the verification of a nonlinearity condition in an infinite dimensional Hilbert space context. This condition guarantees convergence of iterative regularization methods. Furthermore, numerical examples for recovery of the Lam´e parameters from displacement data simulating......We consider a problem of quantitative static elastography, the estimation of the Lam´e parameters from internal displacement field data. This problem is formulated as a nonlinear operator equation. To solve this equation, we investigate the Landweber iteration both analytically and numerically...... a static elastography experiment are presented....
International Nuclear Information System (INIS)
Saitoh, Ayumu; Matsui, Nobuyuki; Itoh, Taku; Kamitani, Atsushi; Nakamura, Hiroaki
2011-01-01
A new method has been proposed for implementing essential boundary conditions to the Element-Free Galerkin Method (EFGM) without using the Lagrange multiplier. Furthermore, the performance of the proposed method has been investigated for a nonlinear Poisson problem. The results of computations show that, as interpolation functions become closer to delta functions, the accuracy of the solution is improved on the boundary. In addition, the accuracy of the proposed method is higher than that of the conventional EFGM. Therefore, it might be concluded that the proposed method is useful for solving the nonlinear Poisson problem. (author)
Memetic Algorithms to Solve a Global Nonlinear Optimization Problem. A Review
Directory of Open Access Journals (Sweden)
M. K. Sakharov
2015-01-01
Full Text Available In recent decades, evolutionary algorithms have proven themselves as the powerful optimization techniques of search engine. Their popularity is due to the fact that they are easy to implement and can be used in all areas, since they are based on the idea of universal evolution. For example, in the problems of a large number of local optima, the traditional optimization methods, usually, fail in finding the global optimum. To solve such problems using a variety of stochastic methods, in particular, the so-called population-based algorithms, which are a kind of evolutionary methods. The main disadvantage of this class of methods is their slow convergence to the exact solution in the neighborhood of the global optimum, as these methods incapable to use the local information about the landscape of the function. This often limits their use in largescale real-world problems where the computation time is a critical factor.One of the promising directions in the field of modern evolutionary computation are memetic algorithms, which can be regarded as a combination of population search of the global optimum and local procedures for verifying solutions, which gives a synergistic effect. In the context of memetic algorithms, the meme is an implementation of the local optimization method to refine solution in the search.The concept of memetic algorithms provides ample opportunities for the development of various modifications of these algorithms, which can vary the frequency of the local search, the conditions of its end, and so on. The practically significant memetic algorithm modifications involve the simultaneous use of different memes. Such algorithms are called multi-memetic.The paper gives statement of the global problem of nonlinear unconstrained optimization, describes the most promising areas of AI modifications, including hybridization and metaoptimization. The main content of the work is the classification and review of existing varieties of
Initial-Boundary Value Problem Solution of the Nonlinear Shallow-water Wave Equations
Kanoglu, U.; Aydin, B.
2014-12-01
The hodograph transformation solutions of the one-dimensional nonlinear shallow-water wave (NSW) equations are usually obtained through integral transform techniques such as Fourier-Bessel transforms. However, the original formulation of Carrier and Greenspan (1958 J Fluid Mech) and its variant Carrier et al. (2003 J Fluid Mech) involve evaluation integrals. Since elliptic integrals are highly singular as discussed in Carrier et al. (2003), this solution methodology requires either approximation of the associated integrands by smooth functions or selection of regular initial/boundary data. It should be noted that Kanoglu (2004 J Fluid Mech) partly resolves this issue by simplifying the resulting integrals in closed form. Here, the hodograph transform approach is coupled with the classical eigenfunction expansion method rather than integral transform techniques and a new analytical model for nonlinear long wave propagation over a plane beach is derived. This approach is based on the solution methodology used in Aydın & Kanoglu (2007 CMES-Comp Model Eng) for wind set-down relaxation problem. In contrast to classical initial- or boundary-value problem solutions, here, the NSW equations are formulated to yield an initial-boundary value problem (IBVP) solution. In general, initial wave profile with nonzero initial velocity distribution is assumed and the flow variables are given in the form of Fourier-Bessel series. The results reveal that the developed method allows accurate estimation of the spatial and temporal variation of the flow quantities, i.e., free-surface height and depth-averaged velocity, with much less computational effort compared to the integral transform techniques such as Carrier et al. (2003), Kanoglu (2004), Tinti & Tonini (2005 J Fluid Mech), and Kanoglu & Synolakis (2006 Phys Rev Lett). Acknowledgments: This work is funded by project ASTARTE- Assessment, STrategy And Risk Reduction for Tsunamis in Europe. Grant 603839, 7th FP (ENV.2013.6.4-3 ENV
Energy Technology Data Exchange (ETDEWEB)
Lorber, A.A.; Carey, G.F.; Bova, S.W.; Harle, C.H. [Univ. of Texas, Austin, TX (United States)
1996-12-31
The connection between the solution of linear systems of equations by iterative methods and explicit time stepping techniques is used to accelerate to steady state the solution of ODE systems arising from discretized PDEs which may involve either physical or artificial transient terms. Specifically, a class of Runge-Kutta (RK) time integration schemes with extended stability domains has been used to develop recursion formulas which lead to accelerated iterative performance. The coefficients for the RK schemes are chosen based on the theory of Chebyshev iteration polynomials in conjunction with a local linear stability analysis. We refer to these schemes as Chebyshev Parameterized Runge Kutta (CPRK) methods. CPRK methods of one to four stages are derived as functions of the parameters which describe an ellipse {Epsilon} which the stability domain of the methods is known to contain. Of particular interest are two-stage, first-order CPRK and four-stage, first-order methods. It is found that the former method can be identified with any two-stage RK method through the correct choice of parameters. The latter method is found to have a wide range of stability domains, with a maximum extension of 32 along the real axis. Recursion performance results are presented below for a model linear convection-diffusion problem as well as non-linear fluid flow problems discretized by both finite-difference and finite-element methods.
WHO Polio Eradication Program: Problems and Solutions
Directory of Open Access Journals (Sweden)
S. M. Kharit
2016-01-01
Full Text Available In 2013 WHO re-evaluated its main goals of the polio eradication program. A modernization program was accepted with regard to the National vaccination calendars worldwide which includes a step-by-step refusal from the living polio vaccine (OPV and a total transition to the inactivated polio vaccine (IPV starting in 2019. Because of the total eradication of the polio type 2 virus, as an intermediate step the 3-valence OPV was substituted with the 2-valence OPV, which does not contain the type 2 polio virus, in April 2016. The aim of the article is to present the history of polio prevention and to state the reasons for the adoption of 3rd edition of the Global Polio Eradication Initiative. The new approaches were defined for eradication of wild polio virus type 1 and vaccine related strains. A new strategy for global switch to inactivated polio vaccine by 2019 was suggested.
THE TRAVELLING SALESMAN PROBLEM IN THE ENGINEERING EDUCATION PROGRAMMING CURRICULUM
Yevgeny Gayev; Vadim Kalmikov
2017-01-01
Objective: To make students familiar with the famous Traveling Salesman Problem (TSP) and suggest the latter to become a common exercise in engineering programming curriculum provided the students master computer science in the easy programming environment MATLAB. Methods: easy programming in MATLAB makes true such modern educational approach as “discovery based” methodology. Results: a MATLAB TSP-program oriented to Ukrainian map is suggested that allows to pictorially demonstrate the proces...
Measurement problem in Program Universe. Revision
International Nuclear Information System (INIS)
Noyes, H.P.; Gefwert, C.; Manthey, M.J.
1985-07-01
The ''measurement problem'' of contemporary physics is in our view an artifact of its philosophical and mathematical underpinnings. We describe a new philosophical view of theory formation, rooted in Wittgenstein, and Bishop's and Martin-Loef's constructivity, which obviates such discussions. We present an unfinished, but very encouraging, theory which is compatible with this philosophical framework. The theory is based on the concepts of counting and combinatorics in the framework provided by the combinatorial hierarchy, a unique hierarchy of bit strings which interact by an operation called discrimination. Measurement criteria incorporate c, h-bar and m/sub p/ or (not ''and'') G. The resulting theory is discrete throughout, contains no infinities, and, as far as we have developed it, is in agreement with quantum mechanical and cosmological fact. 15 refs
Measurement problem in Program Universe. Revision
Noyes, H. P.; Gefwert, C.; Manthey, M. J.
1985-07-01
The measurement problem of contemporary physics is in our view an artifact of its philosophical and mathematical underpinnings. We describe a new philosophical view of theory formation, rooted in Wittgenstein, and Bishop's and Martin-Loef's constructivity, which obviates such discussions. We present an unfinished, but very encouraging, theory which is compatible with this philosophical framework. The theory is based on the concepts of counting and combinatorics in the framework provided by the combinatorial hierarchy, a unique hierarchy of bit strings which interact by an operation called discrimination. Measurement criteria incorporate c, h-bar and m/sub p/ or (not and) G. The resulting theory is discrete throughout, contains no infinities, and, as far as we have developed it, is in agreement with quantum mechanical and cosmological fact.
A nonlinear programming approach to lower bounds for the ground-state energy of helium
International Nuclear Information System (INIS)
Porras, I.; Feldmann, D.M.; King, F.W.
1999-01-01
Lower-bound estimates for the ground-state energy of the helium atom are determined using nonlinear programming techniques. Optimized lower bounds are determined for single-particle, radially correlated, and general correlated wave functions. The local nature of the method employed makes it a very severe test of the accuracy of the wave function
Value Iteration Adaptive Dynamic Programming for Optimal Control of Discrete-Time Nonlinear Systems.
Wei, Qinglai; Liu, Derong; Lin, Hanquan
2016-03-01
In this paper, a value iteration adaptive dynamic programming (ADP) algorithm is developed to solve infinite horizon undiscounted optimal control problems for discrete-time nonlinear systems. The present value iteration ADP algorithm permits an arbitrary positive semi-definite function to initialize the algorithm. A novel convergence analysis is developed to guarantee that the iterative value function converges to the optimal performance index function. Initialized by different initial functions, it is proven that the iterative value function will be monotonically nonincreasing, monotonically nondecreasing, or nonmonotonic and will converge to the optimum. In this paper, for the first time, the admissibility properties of the iterative control laws are developed for value iteration algorithms. It is emphasized that new termination criteria are established to guarantee the effectiveness of the iterative control laws. Neural networks are used to approximate the iterative value function and compute the iterative control law, respectively, for facilitating the implementation of the iterative ADP algorithm. Finally, two simulation examples are given to illustrate the performance of the present method.
Automatic Design of Synthetic Gene Circuits through Mixed Integer Non-linear Programming
Huynh, Linh; Kececioglu, John; Köppe, Matthias; Tagkopoulos, Ilias
2012-01-01
Automatic design of synthetic gene circuits poses a significant challenge to synthetic biology, primarily due to the complexity of biological systems, and the lack of rigorous optimization methods that can cope with the combinatorial explosion as the number of biological parts increases. Current optimization methods for synthetic gene design rely on heuristic algorithms that are usually not deterministic, deliver sub-optimal solutions, and provide no guaranties on convergence or error bounds. Here, we introduce an optimization framework for the problem of part selection in synthetic gene circuits that is based on mixed integer non-linear programming (MINLP), which is a deterministic method that finds the globally optimal solution and guarantees convergence in finite time. Given a synthetic gene circuit, a library of characterized parts, and user-defined constraints, our method can find the optimal selection of parts that satisfy the constraints and best approximates the objective function given by the user. We evaluated the proposed method in the design of three synthetic circuits (a toggle switch, a transcriptional cascade, and a band detector), with both experimentally constructed and synthetic promoter libraries. Scalability and robustness analysis shows that the proposed framework scales well with the library size and the solution space. The work described here is a step towards a unifying, realistic framework for the automated design of biological circuits. PMID:22536398
A novel approach based on preference-based index for interval bilevel linear programming problem.
Ren, Aihong; Wang, Yuping; Xue, Xingsi
2017-01-01
This paper proposes a new methodology for solving the interval bilevel linear programming problem in which all coefficients of both objective functions and constraints are considered as interval numbers. In order to keep as much uncertainty of the original constraint region as possible, the original problem is first converted into an interval bilevel programming problem with interval coefficients in both objective functions only through normal variation of interval number and chance-constrained programming. With the consideration of different preferences of different decision makers, the concept of the preference level that the interval objective function is preferred to a target interval is defined based on the preference-based index. Then a preference-based deterministic bilevel programming problem is constructed in terms of the preference level and the order relation [Formula: see text]. Furthermore, the concept of a preference δ -optimal solution is given. Subsequently, the constructed deterministic nonlinear bilevel problem is solved with the help of estimation of distribution algorithm. Finally, several numerical examples are provided to demonstrate the effectiveness of the proposed approach.
A novel approach based on preference-based index for interval bilevel linear programming problem
Directory of Open Access Journals (Sweden)
Aihong Ren
2017-05-01
Full Text Available Abstract This paper proposes a new methodology for solving the interval bilevel linear programming problem in which all coefficients of both objective functions and constraints are considered as interval numbers. In order to keep as much uncertainty of the original constraint region as possible, the original problem is first converted into an interval bilevel programming problem with interval coefficients in both objective functions only through normal variation of interval number and chance-constrained programming. With the consideration of different preferences of different decision makers, the concept of the preference level that the interval objective function is preferred to a target interval is defined based on the preference-based index. Then a preference-based deterministic bilevel programming problem is constructed in terms of the preference level and the order relation ⪯ m w $\\preceq_{mw}$ . Furthermore, the concept of a preference δ-optimal solution is given. Subsequently, the constructed deterministic nonlinear bilevel problem is solved with the help of estimation of distribution algorithm. Finally, several numerical examples are provided to demonstrate the effectiveness of the proposed approach.
Directory of Open Access Journals (Sweden)
V. S. Zarubin
2016-01-01
in its plane, and in the circular cylinder unlimited in length.An approximate numerical solution of the differential equation that is included in a nonlinear mathematical model of the thermal explosion enables us to obtain quantitative estimates of combination of determining parameters at which the limit state occurs in areas of not only canonical form. A capability to study of the thermal explosion state can be extended in the context of development of mathematical modeling methods, including methods of model analysis to describe the thermal state of solids.To analyse a mathematical model of the thermal explosion in a homogeneous solid the paper uses a variational approach based on the dual variational formulation of the appropriate nonlinear stationary problem of heat conduction in such a body. This formulation contains two alternative functional reaching the matching values in their stationary points corresponding to the true temperature distribution. This functional feature allows you to not only get an approximate quantitative estimate of the combination of parameters that determine the thermal explosion state, but also to find the greatest possible error in such estimation.
THE TRAVELLING SALESMAN PROBLEM IN THE ENGINEERING EDUCATION PROGRAMMING CURRICULUM
Directory of Open Access Journals (Sweden)
Yevgeny Gayev
2017-11-01
Full Text Available Objective: To make students familiar with the famous Traveling Salesman Problem (TSP and suggest the latter to become a common exercise in engineering programming curriculum provided the students master computer science in the easy programming environment MATLAB. Methods: easy programming in MATLAB makes true such modern educational approach as “discovery based” methodology. Results: a MATLAB TSP-program oriented to Ukrainian map is suggested that allows to pictorially demonstrate the process of optimal route search with an option to decelerate or accelerate the demonstration. The program is guessed to be useful both for learning the TSP as one of fundamental logistics problems and as an intriguing programming curriculum excersize. Several sub-programs according to key stone Computer Science Curriculum have also been suggested. This lies in line with recent “discovery based” learning methodology. Discussion: we explain how to create this program for visual discrete optimization, suggest required subprograms belonging to key stone programming algorithms including rather modern graphical user interface (GUI, how to use this MATLAB TSP-program for demonstration the drastical grows of solution time required. Conclusions: easy programming being realized in MATLAB makes dificult curriculum problems attractive to students; it focuses them to main problem’ features, laws and algorithms implementing the “discovery based” methodology in such a way.
Formulated linear programming problems from game theory and its ...
African Journals Online (AJOL)
Formulated linear programming problems from game theory and its computer implementation using Tora package. ... Game theory, a branch of operations research examines the various concepts of decision ... AJOL African Journals Online.
Directory of Open Access Journals (Sweden)
Pratibha Joshi
2014-12-01
Full Text Available In this paper, we have achieved high order solution of a three dimensional nonlinear diffusive-convective problem using modified variational iteration method. The efficiency of this approach has been shown by solving two examples. All computational work has been performed in MATHEMATICA.
International Nuclear Information System (INIS)
Nguyen Buong.
1992-11-01
The purpose of this paper is to investigate convergence rates for an operator version of Tikhonov regularization constructed by dual mapping for nonlinear ill-posed problems involving monotone operators in real reflective Banach spaces. The obtained results are considered in combination with finite-dimensional approximations for the space. An example is considered for illustration. (author). 15 refs
International Nuclear Information System (INIS)
Sokolow, Adam; Sen, Surajit
2007-01-01
An energy pulse refers to a spatially compact energy bundle. In nonlinear pulse propagation, the nonlinearity of the relevant dynamical equations could lead to pulse propagation that is nondispersive or weakly dispersive in space and time. Nonlinear pulse propagation through layered media with widely varying pulse transmission properties is not wave-like and a problem of broad interest in many areas such as optics, geophysics, atmospheric physics and ocean sciences. We study nonlinear pulse propagation through a semi-infinite sequence of layers where the layers can have arbitrary energy transmission properties. By assuming that the layers are rigid, we are able to develop exact expressions for the backscattered energy received at the surface layer. The present study is likely to be relevant in the context of energy transport through soil and similar complex media. Our study reveals a surprising connection between the problem of pulse propagation and the number patterns in the well known Pascal's and Catalan's triangles and hence provides an analytic benchmark in a challenging problem of broad interest. We close with comments on the relationship between this study and the vast body of literature on the problem of wave localization in disordered systems
Directory of Open Access Journals (Sweden)
Mitsuhiro Nakao
2014-01-01
Full Text Available We prove the existence and uniqueness of a global decaying solution to the initial boundary value problem for the quasilinear wave equation with Kelvin-Voigt dissipation and a derivative nonlinearity. To derive the required estimates of the solutions we employ a 'loan' method and use a difference inequality on the energy.
Fulcher, Lewis P.
1979-01-01
Presents an exact solution to the nonlinear Faraday's law problem of a rod sliding on frictionless rails with resistance. Compares the results with perturbation calculations based on the methods of Poisson and Pincare and of Kryloff and Bogoliuboff. (Author/GA)
Non-linear time series extreme events and integer value problems
Turkman, Kamil Feridun; Zea Bermudez, Patrícia
2014-01-01
This book offers a useful combination of probabilistic and statistical tools for analyzing nonlinear time series. Key features of the book include a study of the extremal behavior of nonlinear time series and a comprehensive list of nonlinear models that address different aspects of nonlinearity. Several inferential methods, including quasi likelihood methods, sequential Markov Chain Monte Carlo Methods and particle filters, are also included so as to provide an overall view of the available tools for parameter estimation for nonlinear models. A chapter on integer time series models based on several thinning operations, which brings together all recent advances made in this area, is also included. Readers should have attended a prior course on linear time series, and a good grasp of simulation-based inferential methods is recommended. This book offers a valuable resource for second-year graduate students and researchers in statistics and other scientific areas who need a basic understanding of nonlinear time ...
Linear Programming and Its Application to Pattern Recognition Problems
Omalley, M. J.
1973-01-01
Linear programming and linear programming like techniques as applied to pattern recognition problems are discussed. Three relatively recent research articles on such applications are summarized. The main results of each paper are described, indicating the theoretical tools needed to obtain them. A synopsis of the author's comments is presented with regard to the applicability or non-applicability of his methods to particular problems, including computational results wherever given.
Dynamic Programming Approaches for the Traveling Salesman Problem with Drone
Bouman, Paul; Agatz, Niels; Schmidt, Marie
2017-01-01
markdownabstractA promising new delivery model involves the use of a delivery truck that collaborates with a drone to make deliveries. Effectively combining a drone and a truck gives rise to a new planning problem that is known as the Traveling Salesman Problem with Drone (TSP-D). This paper presents an exact solution approach for the TSP-D based on dynamic programming and present experimental results of different dynamic programming based heuristics. Our numerical experiments show that our a...
Emotion Oriented Programming: Computational Abstractions for AI Problem Solving
Darty , Kevin; Sabouret , Nicolas
2012-01-01
International audience; In this paper, we present a programming paradigm for AI problem solving based on computational concepts drawn from Affective Computing. It is believed that emotions participate in human adaptability and reactivity, in behaviour selection and in complex and dynamic environments. We propose to define a mechanism inspired from this observation for general AI problem solving. To this purpose, we synthesize emotions as programming abstractions that represent the perception ...
Directory of Open Access Journals (Sweden)
Tatiana Kavitova
2012-08-01
Full Text Available We prove a comparison principle for solutions of the Cauchy problem of the nonlinear pseudoparabolic equation $u_t=Delta u_t+ Deltavarphi(u +h(t,u$ with nonnegative bounded initial data. We show stabilization of a maximal solution to a maximal solution of the Cauchy problem for the corresponding ordinary differential equation $vartheta'(t=h(t,vartheta$ as $|x|oinfty$ under certain conditions on an initial datum.
Logo Programming, Problem Solving, and Knowledge-Based Instruction.
Swan, Karen; Black, John B.
The research reported in this paper was designed to investigate the hypothesis that computer programming may support the teaching and learning of problem solving, but that to do so, problem solving must be explicitly taught. Three studies involved students in several grades: 4th, 6th, 8th, 11th, and 12th. Findings collectively show that five…
An approach for solving linear fractional programming problems ...
African Journals Online (AJOL)
The paper presents a new approach for solving a fractional linear programming problem in which the objective function is a linear fractional function, while the constraint functions are in the form of linear inequalities. The approach adopted is based mainly upon solving the problem algebraically using the concept of duality ...
Inverse Tasks In The Tsunami Problem: Nonlinear Regression With Inaccurate Input Data
Lavrentiev, M.; Shchemel, A.; Simonov, K.
A variant of modified training functional that allows considering inaccurate input data is suggested. A limiting case when a part of input data is completely undefined, and, therefore, a problem of reconstruction of hidden parameters should be solved, is also considered. Some numerical experiments are presented. It is assumed that a dependence of known output variables on known input ones should be found is the classic problem definition, which is widely used in the majority of neural nets algorithms. The quality of approximation is evaluated as a performance function. Often the error of the task is evaluated as squared distance between known input data and predicted data multiplied by weighed coefficients. These coefficients may be named "precision coefficients". When inputs are not known exactly, natural generalization of performance function is adding member that responsible for distance between known inputs and shifted inputs, which lessen model's error. It is desirable that the set of variable parameters is compact for training to be con- verging. In the above problem it is possible to choose variants of demands of a priori compactness, which allow meaningful interpretation in the smoothness of the model dependence. Two kinds of regularization was used, first limited squares of coefficients responsible for nonlinearity and second limited multiplication of the above coeffi- cients and linear coefficients. Asymptotic universality of neural net ability to approxi- mate various smooth functions with any accuracy by increase of the number of tunable parameters is often the base for selecting a type of neural net approximation. It is pos- sible to show that used neural net will approach to Fourier integral transform, which approximate abilities are known, with increasing of the number of tunable parameters. In the limiting case, when input data is set with zero precision, the problem of recon- struction of hidden parameters with observed output data appears. The
Some Competition Programming Problems as the Beginning of Artificial Intelligence
Boris MELNIKOV; Elena MELNIKOVA
2007-01-01
We consider in this paper some programming competition problems (which are near to some problems of ACM competitions) of the following subjects: we can make their solution using both Prolog and a classical procedure-oriented language. Moreover, the considered problems are selected that their solution in Prolog and in a classical procedure-oriented language are similar - i.e., in other words, they use the same working mechanism, the same approach to constructing recursive functions etc. Howeve...
Using Problem Solving to Teach a Programming Language.
Milbrandt, George
1995-01-01
Computer studies courses should incorporate as many computer concepts and programming language experiences as possible. A gradual increase in problem difficulty will help the student to understand various computer concepts, and the programming language's syntax and structure. A sidebar provides two examples of how to establish a learning…
Directory of Open Access Journals (Sweden)
Elena Vital'evna Bykova
2011-09-01
Full Text Available This paper describes the concept of energy security and a system of indicators for its monitoring. The indicator system includes more than 40 parameters that reflect the structure and state of fuel and energy complex sectors (fuel, electricity and heat & power, as well as takes into account economic, environmental and social aspects. A brief description of the structure of the computer system to monitor and analyze energy security is given. The complex contains informational, analytical and calculation modules, provides applications for forecasting and modeling energy scenarios, modeling threats and determining levels of energy security. Its application to predict the values of the indicators and methods developed for it are described. This paper presents a method developed by conventional nonlinear mathematical programming needed to address several problems of energy and, in particular, the prediction problem of the security. An example of its use and implementation of this method in the application, "Prognosis", is also given.
Directory of Open Access Journals (Sweden)
Mahmoud Bayat
Full Text Available This review features a survey of some recent developments in asymptotic techniques and new developments, which are valid not only for weakly nonlinear equations, but also for strongly ones. Further, the achieved approximate analytical solutions are valid for the whole solution domain. The limitations of traditional perturbation methods are illustrated, various modified perturbation techniques are proposed, and some mathematical tools such as variational theory, homotopy technology, and iteration technique are introduced to over-come the shortcomings.In this review we have applied different powerful analytical methods to solve high nonlinear problems in engineering vibrations. Some patterns are given to illustrate the effectiveness and convenience of the methodologies.
Linear decomposition approach for a class of nonconvex programming problems.
Shen, Peiping; Wang, Chunfeng
2017-01-01
This paper presents a linear decomposition approach for a class of nonconvex programming problems by dividing the input space into polynomially many grids. It shows that under certain assumptions the original problem can be transformed and decomposed into a polynomial number of equivalent linear programming subproblems. Based on solving a series of liner programming subproblems corresponding to those grid points we can obtain the near-optimal solution of the original problem. Compared to existing results in the literature, the proposed algorithm does not require the assumptions of quasi-concavity and differentiability of the objective function, and it differs significantly giving an interesting approach to solving the problem with a reduced running time.
Czech Academy of Sciences Publication Activity Database
Dilna, N.; Rontó, András
2010-01-01
Roč. 60, č. 3 (2010), s. 327-338 ISSN 0139-9918 R&D Projects: GA ČR(CZ) GA201/06/0254 Institutional research plan: CEZ:AV0Z10190503 Keywords : non-linear boundary value-problem * functional differential equation * non-local condition * unique solvability * differential inequality Subject RIV: BA - General Mathematics Impact factor: 0.316, year: 2010 http://link.springer.com/article/10.2478%2Fs12175-010-0015-9
DEFF Research Database (Denmark)
Ghoreishi, Newsha; Sørensen, Jan Corfixen; Jørgensen, Bo Nørregaard
2015-01-01
Non-trivial real world decision-making processes usually involve multiple parties having potentially conflicting interests over a set of issues. State-of-the-art multi-objective evolutionary algorithms (MOEA) are well known to solve this class of complex real-world problems. In this paper, we...... compare the performance of state-of-the-art multi-objective evolutionary algorithms to solve a non-linear multi-objective multi-issue optimisation problem found in Greenhouse climate control. The chosen algorithms in the study includes NSGAII, eNSGAII, eMOEA, PAES, PESAII and SPEAII. The performance...... of all aforementioned algorithms is assessed and compared using performance indicators to evaluate proximity, diversity and consistency. Our insights to this comparative study enhanced our understanding of MOEAs performance in order to solve a non-linear complex climate control problem. The empirical...
International Nuclear Information System (INIS)
Wilson, G.L.; Rydin, R.A.; Orivuori, S.
1988-01-01
Two highly efficient nonlinear time-dependent heat conduction methodologies, the nonlinear time-dependent nodal integral technique (NTDNT) and IVOHEAT are compared using one- and two-dimensional time-dependent benchmark problems. The NTDNT is completely based on newly developed time-dependent nodal integral methods, whereas IVOHEAT is based on finite elements in space and Crank-Nicholson finite differences in time. IVOHEAT contains the geometric flexibility of the finite element approach, whereas the nodal integral method is constrained at present to Cartesian geometry. For test problems where both methods are equally applicable, the nodal integral method is approximately six times more efficient per dimension than IVOHEAT when a comparable overall accuracy is chosen. This translates to a factor of 200 for a three-dimensional problem having relatively homogeneous regions, and to a smaller advantage as the degree of heterogeneity increases
A "feasible direction" search for Lineal Programming problem solving
Directory of Open Access Journals (Sweden)
Jaime U Malpica Angarita
2003-07-01
Full Text Available The study presents an approach to solve linear programming problems with no artificial variables. A primal linear minimization problem is standard form and its associated dual linear maximization problem are used. Initially, the dual (or a partial dual program is solved by a "feasible direction" search, where the Karush-Kuhn-Tucker conditions help to verify its optimality and then its feasibility. The "feasible direction" search exploits the characteristics of the convex polyhedron (or prototype formed by the dual program constraints to find a starting point and then follows line segments, whose directions are found in afine subspaces defined by boundary hyperplanes of polyhedral faces, to find next points up to the (an optimal one. Them, the remaining dual constraints not satisfaced at that optimal dual point, if there are any, are handled as nonbasic variables of the primal program, which is to be solved by such "feasible direction" search.
The genetic algorithm for the nonlinear programming of water pollution control system
Energy Technology Data Exchange (ETDEWEB)
Wei, J.; Zhang, J. [China University of Geosciences (China)
1999-08-01
In the programming of water pollution control system the combined method of optimization with simulation is used generally. It is not only laborious in calculation, but also the global optimum of the obtained solution is guaranteed difficult. In this paper, the genetic algorithm (GA) used in the nonlinear programming of water pollution control system is given, by which the preferred conception for the programming of waste water system is found in once-through operation. It is more succinct than the conventional method and the global optimum of the obtained solution could be ensured. 6 refs., 4 figs., 3 tabs.
Generalized Nash equilibrium problems, bilevel programming and mpec
Lalitha, CS
2017-01-01
The book discusses three classes of problems: the generalized Nash equilibrium problems, the bilevel problems and the mathematical programming with equilibrium constraints (MPEC). These problems interact through their mathematical analysis as well as their applications. The primary aim of the book is to present the modern tool of variational analysis and optimization, which are used to analyze these three classes of problems. All contributing authors are respected academicians, scientists and researchers from around the globe. These contributions are based on the lectures delivered by experts at CIMPA School, held at the University of Delhi, India, from 25 November–6 December 2013, and peer-reviewed by international experts. The book contains five chapters. Chapter 1 deals with nonsmooth, nonconvex bilevel optimization problems whose feasible set is described by using the graph of the solution set mapping of a parametric optimization problem. Chapter 2 describes a constraint qualification to MPECs considere...
EZLP: An Interactive Computer Program for Solving Linear Programming Problems. Final Report.
Jarvis, John J.; And Others
Designed for student use in solving linear programming problems, the interactive computer program described (EZLP) permits the student to input the linear programming model in exactly the same manner in which it would be written on paper. This report includes a brief review of the development of EZLP; narrative descriptions of program features,…
Introduction to nonlinear finite element analysis
Kim, Nam-Ho
2015-01-01
This book introduces the key concepts of nonlinear finite element analysis procedures. The book explains the fundamental theories of the field and provides instructions on how to apply the concepts to solving practical engineering problems. Instead of covering many nonlinear problems, the book focuses on three representative problems: nonlinear elasticity, elastoplasticity, and contact problems. The book is written independent of any particular software, but tutorials and examples using four commercial programs are included as appendices: ANSYS, NASTRAN, ABAQUS, and MATLAB. In particular, the MATLAB program includes all source codes so that students can develop their own material models, or different algorithms. This book also: · Presents clear explanations of nonlinear finite element analysis for elasticity, elastoplasticity, and contact problems · Includes many informative examples of nonlinear analyses so that students can clearly understand the nonlinear theory · ...
Asinari, Pietro
2010-10-01
.gz Programming language: Tested with Matlab version ⩽6.5. However, in principle, any recent version of Matlab or Octave should work Computer: All supporting Matlab or Octave Operating system: All supporting Matlab or Octave RAM: 300 MBytes Classification: 23 Nature of problem: The problem consists in integrating the homogeneous Boltzmann equation for a generic collisional kernel in case of isotropic symmetry, by a deterministic direct method. Difficulties arise from the multi-dimensionality of the collisional operator and from satisfying the conservation of particle number and energy (momentum is trivial for this test case) as accurately as possible, in order to preserve the late dynamics. Solution method: The solution is based on the method proposed by Aristov (2001) [1], but with two substantial improvements: (a) the original problem is reformulated in terms of particle kinetic energy (this allows one to ensure exact particle number and energy conservation during microscopic collisions) and (b) a DVM-like correction (where DVM stands for Discrete Velocity Model) is adopted for improving the relaxation rates (this allows one to satisfy exactly the conservation laws at macroscopic level, which is particularly important for describing the late dynamics in the relaxation towards the equilibrium). Both these corrections make possible to derive very accurate reference solutions for this test case. Restrictions: The nonlinear Boltzmann equation is extremely challenging from the computational point of view, in particular for deterministic methods, despite the increased computational power of recent hardware. In this work, only the homogeneous isotropic case is considered, for making possible the development of a minimal program (by a simple scripting language) and allowing the user to check the advantages of the proposed improvements beyond Aristov's (2001) method [1]. The initial conditions are supposed parameterized according to a fixed analytical expression, but this can be
Directory of Open Access Journals (Sweden)
J. Gwinner
2013-01-01
Full Text Available The purpose of this paper is twofold. Firstly we consider nonlinear nonsmooth elliptic boundary value problems, and also related parabolic initial boundary value problems that model in a simplified way steady-state unilateral contact with Tresca friction in solid mechanics, respectively, stem from nonlinear transient heat conduction with unilateral boundary conditions. Here a recent duality approach, that augments the classical Babuška-Brezzi saddle point formulation for mixed variational problems to twofold saddle point formulations, is extended to the nonsmooth problems under consideration. This approach leads to variational inequalities of mixed form for three coupled fields as unknowns and to related differential mixed variational inequalities in the time-dependent case. Secondly we are concerned with the stability of the solution set of a general class of differential mixed variational inequalities. Here we present a novel upper set convergence result with respect to perturbations in the data, including perturbations of the associated nonlinear maps, the nonsmooth convex functionals, and the convex constraint set. We employ epiconvergence for the convergence of the functionals and Mosco convergence for set convergence. We impose weak convergence assumptions on the perturbed maps using the monotonicity method of Browder and Minty.
International Nuclear Information System (INIS)
Zhang, Jianyun; Liu, Pei; Zhou, Zhe; Ma, Linwei; Li, Zheng; Ni, Weidou
2014-01-01
Highlights: • Integration of heat streams with HRSG in a polygeneration system is studied. • A mixed-integer nonlinear programming model is proposed to optimize heat network. • Operating parameters and heat network configuration are optimized simultaneously. • The optimized heat network highly depends on the HRSG type and model specification. - Abstract: A large number of heat flows at various temperature and pressure levels exist in a polygeneration plant which co-produces electricity and chemical products. Integration of these external heat flows in a heat recovery steam generator (HRSG) has great potential to further enhance energy efficiency of such a plant; however, it is a challenging problem arising from the large design space of heat exchanger network. In this paper, a mixed-integer nonlinear programming model is developed for the design optimization of a HRSG with consideration of all alternative matches between the HRSG and external heat flows. This model is applied to four polygeneration cases with different HRSG types, and results indicate that the optimized heat network mainly depends on the HRSG type and the model specification
International Nuclear Information System (INIS)
Xu Ruirui; Chen Tianlun; Gao Chengfeng
2006-01-01
Nonlinear time series prediction is studied by using an improved least squares support vector machine (LS-SVM) regression based on chaotic mutation evolutionary programming (CMEP) approach for parameter optimization. We analyze how the prediction error varies with different parameters (σ, γ) in LS-SVM. In order to select appropriate parameters for the prediction model, we employ CMEP algorithm. Finally, Nasdaq stock data are predicted by using this LS-SVM regression based on CMEP, and satisfactory results are obtained.
Tilt stability in nonlinear programming under Mangasarian-Fromovitz constraint qualification
Czech Academy of Sciences Publication Activity Database
Mordukhovich, B. S.; Outrata, Jiří
2013-01-01
Roč. 49, č. 3 (2013), s. 446-464 ISSN 0023-5954 R&D Projects: GA ČR(CZ) GAP201/12/0671 Institutional support: RVO:67985556 Keywords : variational analysis * second-order theory * generalized differentiation * tilt stability Subject RIV: BA - General Mathematics Impact factor: 0.563, year: 2013 http://library.utia.cas.cz/separaty/2013/MTR/outrata-tilt stability in nonlinear programming under mangasarian-fromovitz constraint qualification.pdf
International Nuclear Information System (INIS)
Andrianov, I.V.; Danishevsky, V.V.
1994-01-01
Asymptotic approaches for nonlinear dynamics of continual system are developed well for the infinite in spatial variables. For the systems with finite sizes we have an infinite number of resonance, and Poincare-Lighthill-Go method does riot work. Using of averaging procedure or method of multiple scales leads to the infinite systems of nonlinear algebraic or ordinary differential equations systems and then using truncation method. which does not gives possibility to obtain all important properties of the solutions
Some problems on non-linear semigroups and the blow-up of integral solutions
International Nuclear Information System (INIS)
Pavel, N.H.
1983-07-01
After some introductory remarks, this highly mathematical document considers a unifying approach in the theory of non-linear semigroups. Then a brief survey is given on blow-up of mild solutions from the semilinear case. Finally, the global behavior of solutions to non-linear evolution equations is addressed; it is found that classical results on the behavior of the maximal solution u as t up-arrow tsub(max) hold also for integral solutions
An Improvement for Fuzzy Stochastic Goal Programming Problems
Directory of Open Access Journals (Sweden)
Shu-Cheng Lin
2017-01-01
Full Text Available We examined the solution process for linear programming problems under a fuzzy and random environment to transform fuzzy stochastic goal programming problems into standard linear programming problems. A previous paper that revised the solution process with the lower-side attainment index motivated our work. In this paper, we worked on a revision for both-side attainment index to amend its definition and theorems. Two previous examples were used to examine and demonstrate our improvement over previous results. Our findings not only improve the previous paper with both-side attainment index, but also provide a theoretical extension from lower-side attainment index to the both-side attainment index.
Neilson, Peter D; Neilson, Megan D
2005-09-01
Adaptive model theory (AMT) is a computational theory that addresses the difficult control problem posed by the musculoskeletal system in interaction with the environment. It proposes that the nervous system creates motor maps and task-dependent synergies to solve the problems of redundancy and limited central resources. These lead to the adaptive formation of task-dependent feedback/feedforward controllers able to generate stable, noninteractive control and render nonlinear interactions unobservable in sensory-motor relationships. AMT offers a unified account of how the nervous system might achieve these solutions by forming internal models. This is presented as the design of a simulator consisting of neural adaptive filters based on cerebellar circuitry. It incorporates a new network module that adaptively models (in real time) nonlinear relationships between inputs with changing and uncertain spectral and amplitude probability density functions as is the case for sensory and motor signals.
Needs and Problems of Posbindu Program: Community Health Volunteers Perspective
Putri, S. T.; Andriyani, S.
2018-01-01
Posbindu is a form of public participation to conduct early detection and monitoring of risk factors for non-communicable diseases(NCD), and where it was carried out in as an integrated manner, routine and periodic event. This paper aims to investigates the needs and problems on Posbindu Program based on community health volunteers(CHVs) perspective. This study used descriptive qualitative method by open ended questions. Content analysis using to explicating the result. There are 3 theme finding about elderly needs in Posbindu; medical care, support group community, and health education. We found four theme problems which in Posbindu program: low motivation from elderly, Inadequate of facilities, physical disability, failed communication. To be effective in Posbindu program, all the stakeholders have reached consensus on the Posbindu program as elderly need. CHVs need given wide knowledge about early detection, daily care, control disease continuously so that the elderly keep feeling the advantages of coming to the Posbindu.
Multiobjective fuzzy stochastic linear programming problems with inexact probability distribution
Energy Technology Data Exchange (ETDEWEB)
Hamadameen, Abdulqader Othman [Optimization, Department of Mathematical Sciences, Faculty of Science, UTM (Malaysia); Zainuddin, Zaitul Marlizawati [Department of Mathematical Sciences, Faculty of Science, UTM (Malaysia)
2014-06-19
This study deals with multiobjective fuzzy stochastic linear programming problems with uncertainty probability distribution which are defined as fuzzy assertions by ambiguous experts. The problem formulation has been presented and the two solutions strategies are; the fuzzy transformation via ranking function and the stochastic transformation when α{sup –}. cut technique and linguistic hedges are used in the uncertainty probability distribution. The development of Sen’s method is employed to find a compromise solution, supported by illustrative numerical example.
Optimization of lift gas allocation in a gas lifted oil field as non-linear optimization problem
Directory of Open Access Journals (Sweden)
Roshan Sharma
2012-01-01
Full Text Available Proper allocation and distribution of lift gas is necessary for maximizing total oil production from a field with gas lifted oil wells. When the supply of the lift gas is limited, the total available gas should be optimally distributed among the oil wells of the field such that the total production of oil from the field is maximized. This paper describes a non-linear optimization problem with constraints associated with the optimal distribution of the lift gas. A non-linear objective function is developed using a simple dynamic model of the oil field where the decision variables represent the lift gas flow rate set points of each oil well of the field. The lift gas optimization problem is solved using the emph'fmincon' solver found in MATLAB. As an alternative and for verification, hill climbing method is utilized for solving the optimization problem. Using both of these methods, it has been shown that after optimization, the total oil production is increased by about 4. For multiple oil wells sharing lift gas from a common source, a cascade control strategy along with a nonlinear steady state optimizer behaves as a self-optimizing control structure when the total supply of lift gas is assumed to be the only input disturbance present in the process. Simulation results show that repeated optimization performed after the first time optimization under the presence of the input disturbance has no effect in the total oil production.
A goal programming procedure for solving fuzzy multiobjective fractional linear programming problems
Directory of Open Access Journals (Sweden)
Tunjo Perić
2014-12-01
Full Text Available This paper presents a modification of Pal, Moitra and Maulik's goal programming procedure for fuzzy multiobjective linear fractional programming problem solving. The proposed modification of the method allows simpler solving of economic multiple objective fractional linear programming (MOFLP problems, enabling the obtained solutions to express the preferences of the decision maker defined by the objective function weights. The proposed method is tested on the production planning example.
Managing problem employees: a model program and practical guide.
Miller, Laurence
2010-01-01
This article presents a model program for managing problem employees that includes a description ofthe basic types of problem employees and employee problems, as well as practical recommendations for. (1) selection and screening, (2) education and training, (3) coaching and counseling, (4) discipline, (5) psychological fitness-for-duty evaluations, (6) mental health services, (7) termination, and (8) leadership and administrative strategies. Throughout, the emphasis on balancing the need for order and productivity in the workplace with fairness and concern for employee health and well-being.
International Nuclear Information System (INIS)
Raju, P.P.
1980-05-01
This report summarizes the results of the study program to assess the benefits of nonlinear analysis methods in Light Water Reactor (LWR) component designs. The current study reveals that despite its increased cost and other complexities, nonlinear analysis is a practical and valuable tool for the design of LWR components, especially under ASME Level D service conditions (faulted conditions) and it will greatly assist in the evaluation of ductile fracture potential of pressure boundary components. Since the nonlinear behavior is generally a local phenomenon, the design of complex components can be accomplished through substructuring isolated localized regions and evaluating them in detail using nonlinear analysis methods
Method for nonlinear exponential regression analysis
Junkin, B. G.
1972-01-01
Two computer programs developed according to two general types of exponential models for conducting nonlinear exponential regression analysis are described. Least squares procedure is used in which the nonlinear problem is linearized by expanding in a Taylor series. Program is written in FORTRAN 5 for the Univac 1108 computer.
Quantum algorithms for the ordered search problem via semidefinite programming
International Nuclear Information System (INIS)
Childs, Andrew M.; Landahl, Andrew J.; Parrilo, Pablo A.
2007-01-01
One of the most basic computational problems is the task of finding a desired item in an ordered list of N items. While the best classical algorithm for this problem uses log 2 N queries to the list, a quantum computer can solve the problem using a constant factor fewer queries. However, the precise value of this constant is unknown. By characterizing a class of quantum query algorithms for the ordered search problem in terms of a semidefinite program, we find quantum algorithms for small instances of the ordered search problem. Extending these algorithms to arbitrarily large instances using recursion, we show that there is an exact quantum ordered search algorithm using 4 log 605 N≅0.433 log 2 N queries, which improves upon the previously best known exact algorithm
A nonlinear eigenvalue problem for self-similar spherical force-free magnetic fields
Energy Technology Data Exchange (ETDEWEB)
Lerche, I. [Institut für Geowissenschaften, Naturwissenschaftliche Fakultät III, Martin-Luther Universität, D-06099 Halle (Germany); Low, B. C. [High Altitude Observatory, National Center for Atmospheric Research, Boulder, Colorado 80307 (United States)
2014-10-15
An axisymmetric force-free magnetic field B(r, θ) in spherical coordinates is defined by a function r sin θB{sub φ}=Q(A) relating its azimuthal component to its poloidal flux-function A. The power law r sin θB{sub φ}=aA|A|{sup 1/n}, n a positive constant, admits separable fields with A=(A{sub n}(θ))/(r{sup n}) , posing a nonlinear boundary-value problem for the constant parameter a as an eigenvalue and A{sub n}(θ) as its eigenfunction [B. C. Low and Y. Q Lou, Astrophys. J. 352, 343 (1990)]. A complete analysis is presented of the eigenvalue spectrum for a given n, providing a unified understanding of the eigenfunctions and the physical relationship between the field's degree of multi-polarity and rate of radial decay via the parameter n. These force-free fields, self-similar on spheres of constant r, have basic astrophysical applications. As explicit solutions they have, over the years, served as standard benchmarks for testing 3D numerical codes developed to compute general force-free fields in the solar corona. The study presented includes a set of illustrative multipolar field solutions to address the magnetohydrodynamics (MHD) issues underlying the observation that the solar corona has a statistical preference for negative and positive magnetic helicities in its northern and southern hemispheres, respectively; a hemispherical effect, unchanging as the Sun's global field reverses polarity in successive eleven-year cycles. Generalizing these force-free fields to the separable form B=(H(θ,φ))/(r{sup n+2}) promises field solutions of even richer topological varieties but allowing for φ-dependence greatly complicates the governing equations that have remained intractable. The axisymmetric results obtained are discussed in relation to this generalization and the Parker Magnetostatic Theorem. The axisymmetric solutions are mathematically related to a family of 3D time-dependent ideal MHD solutions for a polytropic fluid of index γ = 4
A property of assignment type mixed integer linear programming problems
Benders, J.F.; van Nunen, J.A.E.E.
1982-01-01
In this paper we will proof that rather tight upper bounds can be given for the number of non-unique assignments that are achieved after solving the linear programming relaxation of some types of mixed integer linear assignment problems. Since in these cases the number of splitted assignments is
Directory of Open Access Journals (Sweden)
M. Pattnaik
2013-08-01
Full Text Available In this paper the concept of fuzzy Non-Linear Programming Technique is applied to solve an economic order quantity (EOQ model under restricted space. Since various types of uncertainties and imprecision are inherent in real inventory problems they are classically modeled using the approaches from the probability theory. However, there are uncertainties that cannot be appropriately treated by usual probabilistic models. The questions how to define inventory optimization tasks in such environment how to interpret optimal solutions arise. This paper allows the modification of the Single item EOQ model in presence of fuzzy decision making process where demand is related to the unit price and the setup cost varies with the quantity produced/Purchased. This paper considers the modification of objective function and storage area in the presence of imprecisely estimated parameters. The model is developed for the problem by employing different modeling approaches over an infinite planning horizon. It incorporates all concepts of a fuzzy arithmetic approach, the quantity ordered and the demand per unit compares both fuzzy non linear and other models. Investigation of the properties of an optimal solution allows developing an algorithm whose validity is illustrated through an example problem and ugh MATLAB (R2009a version software, the two and three dimensional diagrams are represented to the application. Sensitivity analysis of the optimal solution is also studied with respect to changes in different parameter values and to draw managerial insights of the decision problem.
Polymorphic Uncertain Linear Programming for Generalized Production Planning Problems
Directory of Open Access Journals (Sweden)
Xinbo Zhang
2014-01-01
Full Text Available A polymorphic uncertain linear programming (PULP model is constructed to formulate a class of generalized production planning problems. In accordance with the practical environment, some factors such as the consumption of raw material, the limitation of resource and the demand of product are incorporated into the model as parameters of interval and fuzzy subsets, respectively. Based on the theory of fuzzy interval program and the modified possibility degree for the order of interval numbers, a deterministic equivalent formulation for this model is derived such that a robust solution for the uncertain optimization problem is obtained. Case study indicates that the constructed model and the proposed solution are useful to search for an optimal production plan for the polymorphic uncertain generalized production planning problems.
INTRODUCTION OF UNIVERSAL HEALTH PROGRAM IN GEORGIA: PROBLEMS AND PERSPECTIVES.
Verulava, T; Jorbenadze, R; Barkalaia, T
2017-01-01
Since 2013, Georgia enacted Universal Healthcare (UHC) program. Inclusion of uninsured population in the UHC program will have a positive impact on their financial accessibility to the health services. The study aims to analyze the referral rate of the beneficiaries to the health service providers before introduction and after application of the UHC program, particularly, how much it increased the recently uninsured population referral to primary health care units, and also to study the level of satisfaction with the UHC program. Research was conducted by qualitative and quantitative methods. The target groups' (program beneficiaries, physicians, personnel of the Social Service Agency) opinions were identified by means of face-to-face interviews. Enactment of the UHC programs significantly raised the population refferal to the family physicians, and the specialists. Insignificantly, but also increased the frequency of laboratory and diagnostic services. Despite the serious positive changes caused by UHC program implementation there still remain the problems in the primary healthcare system. Also, it is desirable to raise the financial availability of those medical services, which may cause catastrophic costs. In this respect, such medical services must be involved in the universal healthcare program and been expanded their scale. For the purpose of effective usage of the limited funds allocated for health care services provision, the private health insurance companies should be involved in UHC programs. This, together with the reduction of health care costs will increase a competition in the medical market, and enhance the quality of health service.
Energy Technology Data Exchange (ETDEWEB)
Lee, Sang Jin; Lee, Hong Pyo; Seo, Jeong Moon [Korea Atomic Energy Research Institute, Taejeon (Korea)
2002-03-01
The maim goal of this research is to develop a nonlinear finite element analysis program NUCAS to accurately predict global and local failure modes of containment building subjected to internal pressure. In this report, we describe the techniques we developed throught this research. An adequate model to the analysis of containment building such as microscopic material model is adopted and it applied into the development Reissner-Mindlin degenerated shell element. To avoid finite element deficiencies, the substitute strains based on the assumed strain method is used in the shell formulation. Arc-length control method is also adopted to fully trace the peak load-displacement path due to crack formation. In addition, a benchmark test suite is developed to investigate the performance of NUCAS and proposed as the future benchmark tests for nonlinear analysis of reinforced concrete. Finally, the input format of NUCAS and the examples of input/output file are described. 39 refs., 65 figs., 8 tabs. (Author)
Liu, Derong; Huang, Yuzhu; Wang, Ding; Wei, Qinglai
2013-09-01
In this paper, an observer-based optimal control scheme is developed for unknown nonlinear systems using adaptive dynamic programming (ADP) algorithm. First, a neural-network (NN) observer is designed to estimate system states. Then, based on the observed states, a neuro-controller is constructed via ADP method to obtain the optimal control. In this design, two NN structures are used: a three-layer NN is used to construct the observer which can be applied to systems with higher degrees of nonlinearity and without a priori knowledge of system dynamics, and a critic NN is employed to approximate the value function. The optimal control law is computed using the critic NN and the observer NN. Uniform ultimate boundedness of the closed-loop system is guaranteed. The actor, critic, and observer structures are all implemented in real-time, continuously and simultaneously. Finally, simulation results are presented to demonstrate the effectiveness of the proposed control scheme.
Directory of Open Access Journals (Sweden)
Yurii M. Streliaiev
2016-06-01
Full Text Available Three-dimensional quasistatic contact problem of two linearly elastic bodies' interaction with Coulomb friction taken into account is considered. The boundary conditions of the problem have been simplified by the modification of the Coulomb's law of friction. This modification is based on the introducing of a delay in normal contact tractions that bound tangent contact tractions in the Coulomb's law of friction expressions. At this statement the problem is reduced to a sequence of similar systems of nonlinear integral equations describing bodies' interaction at each step of loading. A method for an approximate solution of the integral equations system corresponded to each step of loading is applied. This method consists of system regularization, discretization of regularized system and iterative process application for solving the discretized system. A numerical solution of a contact problem of an elastic sphere with an elastic half-space interaction under increasing and subsequently decreasing normal compressive force has been obtained.
Zhang, Chenglong; Zhang, Fan; Guo, Shanshan; Liu, Xiao; Guo, Ping
2018-01-01
An inexact nonlinear mλ-measure fuzzy chance-constrained programming (INMFCCP) model is developed for irrigation water allocation under uncertainty. Techniques of inexact quadratic programming (IQP), mλ-measure, and fuzzy chance-constrained programming (FCCP) are integrated into a general optimization framework. The INMFCCP model can deal with not only nonlinearities in the objective function, but also uncertainties presented as discrete intervals in the objective function, variables and left-hand side constraints and fuzziness in the right-hand side constraints. Moreover, this model improves upon the conventional fuzzy chance-constrained programming by introducing a linear combination of possibility measure and necessity measure with varying preference parameters. To demonstrate its applicability, the model is then applied to a case study in the middle reaches of Heihe River Basin, northwest China. An interval regression analysis method is used to obtain interval crop water production functions in the whole growth period under uncertainty. Therefore, more flexible solutions can be generated for optimal irrigation water allocation. The variation of results can be examined by giving different confidence levels and preference parameters. Besides, it can reflect interrelationships among system benefits, preference parameters, confidence levels and the corresponding risk levels. Comparison between interval crop water production functions and deterministic ones based on the developed INMFCCP model indicates that the former is capable of reflecting more complexities and uncertainties in practical application. These results can provide more reliable scientific basis for supporting irrigation water management in arid areas.
Multi-objective genetic algorithm for solving N-version program design problem
International Nuclear Information System (INIS)
Yamachi, Hidemi; Tsujimura, Yasuhiro; Kambayashi, Yasushi; Yamamoto, Hisashi
2006-01-01
N-version programming (NVP) is a programming approach for constructing fault tolerant software systems. Generally, an optimization model utilized in NVP selects the optimal set of versions for each module to maximize the system reliability and to constrain the total cost to remain within a given budget. In such a model, while the number of versions included in the obtained solution is generally reduced, the budget restriction may be so rigid that it may fail to find the optimal solution. In order to ameliorate this problem, this paper proposes a novel bi-objective optimization model that maximizes the system reliability and minimizes the system total cost for designing N-version software systems. When solving multi-objective optimization problem, it is crucial to find Pareto solutions. It is, however, not easy to obtain them. In this paper, we propose a novel bi-objective optimization model that obtains many Pareto solutions efficiently. We formulate the optimal design problem of NVP as a bi-objective 0-1 nonlinear integer programming problem. In order to overcome this problem, we propose a Multi-objective genetic algorithm (MOGA), which is a powerful, though time-consuming, method to solve multi-objective optimization problems. When implementing genetic algorithm (GA), the use of an appropriate genetic representation scheme is one of the most important issues to obtain good performance. We employ random-key representation in our MOGA to find many Pareto solutions spaced as evenly as possible along the Pareto frontier. To pursue improve further performance, we introduce elitism, the Pareto-insertion and the Pareto-deletion operations based on distance between Pareto solutions in the selection process. The proposed MOGA obtains many Pareto solutions along the Pareto frontier evenly. The user of the MOGA can select the best compromise solution among the candidates by controlling the balance between the system reliability and the total cost
Multi-objective genetic algorithm for solving N-version program design problem
Energy Technology Data Exchange (ETDEWEB)
Yamachi, Hidemi [Department of Computer and Information Engineering, Nippon Institute of Technology, Miyashiro, Saitama 345-8501 (Japan) and Department of Production and Information Systems Engineering, Tokyo Metropolitan Institute of Technology, Hino, Tokyo 191-0065 (Japan)]. E-mail: yamachi@nit.ac.jp; Tsujimura, Yasuhiro [Department of Computer and Information Engineering, Nippon Institute of Technology, Miyashiro, Saitama 345-8501 (Japan)]. E-mail: tujimr@nit.ac.jp; Kambayashi, Yasushi [Department of Computer and Information Engineering, Nippon Institute of Technology, Miyashiro, Saitama 345-8501 (Japan)]. E-mail: yasushi@nit.ac.jp; Yamamoto, Hisashi [Department of Production and Information Systems Engineering, Tokyo Metropolitan Institute of Technology, Hino, Tokyo 191-0065 (Japan)]. E-mail: yamamoto@cc.tmit.ac.jp
2006-09-15
N-version programming (NVP) is a programming approach for constructing fault tolerant software systems. Generally, an optimization model utilized in NVP selects the optimal set of versions for each module to maximize the system reliability and to constrain the total cost to remain within a given budget. In such a model, while the number of versions included in the obtained solution is generally reduced, the budget restriction may be so rigid that it may fail to find the optimal solution. In order to ameliorate this problem, this paper proposes a novel bi-objective optimization model that maximizes the system reliability and minimizes the system total cost for designing N-version software systems. When solving multi-objective optimization problem, it is crucial to find Pareto solutions. It is, however, not easy to obtain them. In this paper, we propose a novel bi-objective optimization model that obtains many Pareto solutions efficiently. We formulate the optimal design problem of NVP as a bi-objective 0-1 nonlinear integer programming problem. In order to overcome this problem, we propose a Multi-objective genetic algorithm (MOGA), which is a powerful, though time-consuming, method to solve multi-objective optimization problems. When implementing genetic algorithm (GA), the use of an appropriate genetic representation scheme is one of the most important issues to obtain good performance. We employ random-key representation in our MOGA to find many Pareto solutions spaced as evenly as possible along the Pareto frontier. To pursue improve further performance, we introduce elitism, the Pareto-insertion and the Pareto-deletion operations based on distance between Pareto solutions in the selection process. The proposed MOGA obtains many Pareto solutions along the Pareto frontier evenly. The user of the MOGA can select the best compromise solution among the candidates by controlling the balance between the system reliability and the total cost.
Energy Technology Data Exchange (ETDEWEB)
Philip, Bobby, E-mail: philipb@ornl.gov [Oak Ridge National Laboratory, One Bethel Valley Road, Oak Ridge, TN 37831 (United States); Berrill, Mark A.; Allu, Srikanth; Hamilton, Steven P.; Sampath, Rahul S.; Clarno, Kevin T. [Oak Ridge National Laboratory, One Bethel Valley Road, Oak Ridge, TN 37831 (United States); Dilts, Gary A. [Los Alamos National Laboratory, PO Box 1663, Los Alamos, NM 87545 (United States)
2015-04-01
This paper describes an efficient and nonlinearly consistent parallel solution methodology for solving coupled nonlinear thermal transport problems that occur in nuclear reactor applications over hundreds of individual 3D physical subdomains. Efficiency is obtained by leveraging knowledge of the physical domains, the physics on individual domains, and the couplings between them for preconditioning within a Jacobian Free Newton Krylov method. Details of the computational infrastructure that enabled this work, namely the open source Advanced Multi-Physics (AMP) package developed by the authors is described. Details of verification and validation experiments, and parallel performance analysis in weak and strong scaling studies demonstrating the achieved efficiency of the algorithm are presented. Furthermore, numerical experiments demonstrate that the preconditioner developed is independent of the number of fuel subdomains in a fuel rod, which is particularly important when simulating different types of fuel rods. Finally, we demonstrate the power of the coupling methodology by considering problems with couplings between surface and volume physics and coupling of nonlinear thermal transport in fuel rods to an external radiation transport code.
Directory of Open Access Journals (Sweden)
Suheel Abdullah Malik
2014-01-01
Full Text Available We present a hybrid heuristic computing method for the numerical solution of nonlinear singular boundary value problems arising in physiology. The approximate solution is deduced as a linear combination of some log sigmoid basis functions. A fitness function representing the sum of the mean square error of the given nonlinear ordinary differential equation (ODE and its boundary conditions is formulated. The optimization of the unknown adjustable parameters contained in the fitness function is performed by the hybrid heuristic computation algorithm based on genetic algorithm (GA, interior point algorithm (IPA, and active set algorithm (ASA. The efficiency and the viability of the proposed method are confirmed by solving three examples from physiology. The obtained approximate solutions are found in excellent agreement with the exact solutions as well as some conventional numerical solutions.
Solving seismological problems using sgraph program: II-waveform modeling
International Nuclear Information System (INIS)
Abdelwahed, Mohamed F.
2012-01-01
One of the seismological programs to manipulate seismic data is SGRAPH program. It consists of integrated tools to perform advanced seismological techniques. SGRAPH is considered a new system for maintaining and analyze seismic waveform data in a stand-alone Windows-based application that manipulate a wide range of data formats. SGRAPH was described in detail in the first part of this paper. In this part, I discuss the advanced techniques including in the program and its applications in seismology. Because of the numerous tools included in the program, only SGRAPH is sufficient to perform the basic waveform analysis and to solve advanced seismological problems. In the first part of this paper, the application of the source parameters estimation and hypocentral location was given. Here, I discuss SGRAPH waveform modeling tools. This paper exhibits examples of how to apply the SGRAPH tools to perform waveform modeling for estimating the focal mechanism and crustal structure of local earthquakes.
Irmeilyana, Puspita, Fitri Maya; Indrawati
2016-02-01
The pricing for wireless networks is developed by considering linearity factors, elasticity price and price factors. Mixed Integer Nonlinear Programming of wireless pricing model is proposed as the nonlinear programming problem that can be solved optimally using LINGO 13.0. The solutions are expected to give some information about the connections between the acceptance factor and the price. Previous model worked on the model that focuses on bandwidth as the QoS attribute. The models attempt to maximize the total price for a connection based on QoS parameter. The QoS attributes used will be the bandwidth and the end to end delay that affect the traffic. The maximum goal to maximum price is achieved when the provider determine the requirement for the increment or decrement of price change due to QoS change and amount of QoS value.
Stochastic programming problems with generalized integrated chance constraints
Czech Academy of Sciences Publication Activity Database
Branda, Martin
2012-01-01
Roč. 61, č. 8 (2012), s. 949-968 ISSN 0233-1934 R&D Projects: GA ČR GAP402/10/1610 Grant - others:SVV(CZ) 261315/2010 Institutional support: RVO:67985556 Keywords : chance constraints * integrated chance constraints * penalty functions * sample approximations * blending problem Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 0.707, year: 2012 http://library.utia.cas.cz/separaty/2012/E/branda-stochastic programming problems with generalized integrated.pdf
Optimality Conditions for Nondifferentiable Multiobjective Semi-Infinite Programming Problems
Directory of Open Access Journals (Sweden)
D. Barilla
2016-01-01
Full Text Available We have considered a multiobjective semi-infinite programming problem with a feasible set defined by inequality constraints. First we studied a Fritz-John type necessary condition. Then, we introduced two constraint qualifications and derive the weak and strong Karush-Kuhn-Tucker (KKT in brief types necessary conditions for an efficient solution of the considered problem. Finally an extension of a Caristi-Ferrara-Stefanescu result for the (Φ,ρ-invexity is proved, and some sufficient conditions are presented under this weak assumption. All results are given in terms of Clark subdifferential.
Trajectory Planning of Satellite Formation Flying using Nonlinear Programming and Collocation
Directory of Open Access Journals (Sweden)
Hyung-Chu Lim
2008-12-01
Full Text Available Recently, satellite formation flying has been a topic of significant research interest in aerospace society because it provides potential benefits compared to a large spacecraft. Some techniques have been proposed to design optimal formation trajectories minimizing fuel consumption in the process of formation configuration or reconfiguration. In this study, a method is introduced to build fuel-optimal trajectories minimizing a cost function that combines the total fuel consumption of all satellites and assignment of fuel consumption rate for each satellite. This approach is based on collocation and nonlinear programming to solve constraints for collision avoidance and the final configuration. New constraints of nonlinear equality or inequality are derived for final configuration, and nonlinear inequality constraints are established for collision avoidance. The final configuration constraints are that three or more satellites should form a projected circular orbit and make an equilateral polygon in the horizontal plane. Example scenarios, including these constraints and the cost function, are simulated by the method to generate optimal trajectories for the formation configuration and reconfiguration of multiple satellites.
Lu, Zhao; Sun, Jing; Butts, Kenneth
2014-05-01
Support vector regression for approximating nonlinear dynamic systems is more delicate than the approximation of indicator functions in support vector classification, particularly for systems that involve multitudes of time scales in their sampled data. The kernel used for support vector learning determines the class of functions from which a support vector machine can draw its solution, and the choice of kernel significantly influences the performance of a support vector machine. In this paper, to bridge the gap between wavelet multiresolution analysis and kernel learning, the closed-form orthogonal wavelet is exploited to construct new multiscale asymmetric orthogonal wavelet kernels for linear programming support vector learning. The closed-form multiscale orthogonal wavelet kernel provides a systematic framework to implement multiscale kernel learning via dyadic dilations and also enables us to represent complex nonlinear dynamics effectively. To demonstrate the superiority of the proposed multiscale wavelet kernel in identifying complex nonlinear dynamic systems, two case studies are presented that aim at building parallel models on benchmark datasets. The development of parallel models that address the long-term/mid-term prediction issue is more intricate and challenging than the identification of series-parallel models where only one-step ahead prediction is required. Simulation results illustrate the effectiveness of the proposed multiscale kernel learning.
Rosenberg, D. E.; Alafifi, A.
2016-12-01
Water resources systems analysis often focuses on finding optimal solutions. Yet an optimal solution is optimal only for the modelled issues and managers often seek near-optimal alternatives that address un-modelled objectives, preferences, limits, uncertainties, and other issues. Early on, Modelling to Generate Alternatives (MGA) formalized near-optimal as the region comprising the original problem constraints plus a new constraint that allowed performance within a specified tolerance of the optimal objective function value. MGA identified a few maximally-different alternatives from the near-optimal region. Subsequent work applied Markov Chain Monte Carlo (MCMC) sampling to generate a larger number of alternatives that span the near-optimal region of linear problems or select portions for non-linear problems. We extend the MCMC Hit-And-Run method to generate alternatives that span the full extent of the near-optimal region for non-linear, non-convex problems. First, start at a feasible hit point within the near-optimal region, then run a random distance in a random direction to a new hit point. Next, repeat until generating the desired number of alternatives. The key step at each iterate is to run a random distance along the line in the specified direction to a new hit point. If linear equity constraints exist, we construct an orthogonal basis and use a null space transformation to confine hits and runs to a lower-dimensional space. Linear inequity constraints define the convex bounds on the line that runs through the current hit point in the specified direction. We then use slice sampling to identify a new hit point along the line within bounds defined by the non-linear inequity constraints. This technique is computationally efficient compared to prior near-optimal alternative generation techniques such MGA, MCMC Metropolis-Hastings, evolutionary, or firefly algorithms because search at each iteration is confined to the hit line, the algorithm can move in one
Computational Performance Analysis of Nonlinear Dynamic Systems using Semi-infinite Programming
Directory of Open Access Journals (Sweden)
Tor A. Johansen
2001-01-01
Full Text Available For nonlinear systems that satisfy certain regularity conditions it is shown that upper and lower bounds on the performance (cost function can be computed using linear or quadratic programming. The performance conditions derived from Hamilton-Jacobi inequalities are formulated as linear inequalities defined pointwise by discretizing the state-space when assuming a linearly parameterized class of functions representing the candidate performance bounds. Uncertainty with respect to some system parameters can be incorporated by also gridding the parameter set. In addition to performance analysis, the method can also be used to compute Lyapunov functions that guarantees uniform exponential stability.
Fleming, P.
1983-01-01
A design technique is proposed for linear regulators in which a feedback controller of fixed structure is chosen to minimize an integral quadratic objective function subject to the satisfaction of integral quadratic constraint functions. Application of a nonlinear programming algorithm to this mathematically tractable formulation results in an efficient and useful computer aided design tool. Particular attention is paid to computational efficiency and various recommendations are made. Two design examples illustrate the flexibility of the approach and highlight the special insight afforded to the designer. One concerns helicopter longitudinal dynamics and the other the flight dynamics of an aerodynamically unstable aircraft.
Directory of Open Access Journals (Sweden)
Qiying Wei
2009-01-01
Full Text Available By using the well-known Schauder fixed point theorem and upper and lower solution method, we present some existence criteria for positive solution of an -point singular -Laplacian dynamic equation on time scales with the sign changing nonlinearity. These results are new even for the corresponding differential (=ℝ and difference equations (=ℤ, as well as in general time scales setting. As an application, an example is given to illustrate the results.
1987-07-01
fields (see also Chapter 4 of Ref. 22). Like our investigation, theirs is based on the Khokhlov-Zabolotskaya-Kuznetsov ( KZK ) equa- tion [23,24...25,26], also based on the KZK e(iualiou, is limited to weakly nonlinear systems. However, the practical case of a focused circular source with gain of...iment. The demonstrated abihty of the KZK equation to accurately model focused sound fields from reahstic sources [i.e., having abrupt edges and
Some problems in the acceptability of implementing radiation protection programs
International Nuclear Information System (INIS)
Neill, R.H.
1997-01-01
The three fundamentals that radiation protection programs are based upon are; 1) establishing a quantitative correlation between radiation exposure and biological effects in people; 2) determining a level of acceptable risk of exposure; and 3) establishing systems to measure the radiation dose to insure compliance with the regulations or criteria. The paper discusses the interrelationship of these fundamentals, difficulties in obtaining a consensus of acceptable risk and gives some examples of problems in identifying the most critical population-at-risk and in measuring dose. Despite such problems, it is recommended that we proceed with the existing conservative structure of radiation protection programs based upon a linear no threshold model for low radiation doses to insure public acceptability of various potential radiation risks. Voluntary compliance as well as regulatory requirements should continue to be pursued to maintain minimal exposure to ionizing radiation. (author)
A Compromise Programming Model for Highway Maintenance Resources Allocation Problem
Directory of Open Access Journals (Sweden)
Hui Xiong
2012-01-01
Full Text Available This paper formulates a bilevel compromise programming model for allocating resources between pavement and bridge deck maintenances. The first level of the model aims to solve the resource allocation problems for pavement management and bridge deck maintenance, without considering resource sharing between them. At the second level, the model uses the results from the first step as an input and generates the final solution to the resource-sharing problem. To solve the model, the paper applies genetic algorithms to search for the optimal solution. We use a combination of two digits to represent different maintenance types. Results of numerical examples show that the conditions of both pavements and bridge decks are improved significantly by applying compromise programming, rather than conventional methods. Resources are also utilized more efficiently when the proposed method is applied.
International Nuclear Information System (INIS)
Manakov, S V; Santini, P M
2008-01-01
We have recently solved the inverse scattering problem for one-parameter families of vector fields, and used this result to construct the formal solution of the Cauchy problem for a class of integrable nonlinear partial differential equations in multidimensions, including the second heavenly equation of Plebanski and the dispersionless Kadomtsev-Petviashvili (dKP) equation. We showed, in particular, that the associated inverse problems can be expressed in terms of nonlinear Riemann-Hilbert problems on the real axis. In this paper, we make use of the nonlinear Riemann-Hilbert problem of dKP (i) to construct the longtime behaviour of the solutions of its Cauchy problem; (ii) to characterize a class of implicit solutions; (iii) to elucidate the spectral mechanism causing the gradient catastrophe of localized solutions of dKP, at finite time as well as in the longtime regime, and the corresponding universal behaviours near breaking
Energy Technology Data Exchange (ETDEWEB)
Manakov, S V [Landau Institute for Theoretical Physics, Moscow (Russian Federation); Santini, P M [Dipartimento di Fisica, Universita di Roma ' La Sapienza' , and Istituto Nazionale di Fisica Nucleare, Sezione di Roma 1, Piazz.le Aldo Moro 2, I-00185 Rome (Italy)
2008-02-08
We have recently solved the inverse scattering problem for one-parameter families of vector fields, and used this result to construct the formal solution of the Cauchy problem for a class of integrable nonlinear partial differential equations in multidimensions, including the second heavenly equation of Plebanski and the dispersionless Kadomtsev-Petviashvili (dKP) equation. We showed, in particular, that the associated inverse problems can be expressed in terms of nonlinear Riemann-Hilbert problems on the real axis. In this paper, we make use of the nonlinear Riemann-Hilbert problem of dKP (i) to construct the longtime behaviour of the solutions of its Cauchy problem; (ii) to characterize a class of implicit solutions; (iii) to elucidate the spectral mechanism causing the gradient catastrophe of localized solutions of dKP, at finite time as well as in the longtime regime, and the corresponding universal behaviours near breaking.
DEFF Research Database (Denmark)
Stolpe, Mathias; Bendsøe, Martin P.
2007-01-01
This paper present some initial results pertaining to a search for globally optimal solutions to a challenging benchmark example proposed by Zhou and Rozvany. This means that we are dealing with global optimization of the classical single load minimum compliance topology design problem with a fixed...... finite element discretization and with discrete design variables. Global optimality is achieved by the implementation of some specially constructed convergent nonlinear branch and cut methods, based on the use of natural relaxations and by applying strengthening constraints (linear valid inequalities...
1986-03-31
Martins, J.A.C. and Campos , L.T. [1986], "Existence and Local Uniqueness of Solutions to Contact Problems in Elasticity with Nonlinear Friction...noisy and ttoubl esome vibt.t4ons. If the sound generated by the friction-induced oscillations of Rviolin strings may be the delight of all music lovers...formulation. See 0den and Martins - [1985] and Rabier, Martins, Oden and Campos [1986]. - It is now simple to show, in a 6o’uman manner, that, for
International Nuclear Information System (INIS)
Vasileva, D.P.
1993-01-01
Blow-up and global time self-similar solutions of a boundary problem for a nonlinear equation u t = Δ u σ+1 + u β are found in the case β = σ + 1. It is shown that they describe the asymptotic behavior of a wide class of initial perturbations. A numerical investigation of the solutions in the case β>σ + 1 is also made. A hypothesis is done that the behavior for large times of global time solutions is described by the self-similar solutions of the equation without source.(author). 20 refs.; 9 figs
DEFF Research Database (Denmark)
Stolpe, Mathias; Bendsøe, Martin P.
2007-01-01
This paper present some initial results pertaining to a search for globally optimal solutions to a challenging benchmark example proposed by Zhou and Rozvany. This means that we are dealing with global optimization of the classical single load minimum compliance topology design problem with a fixed...... finite element discretization and with discrete design variables. Global optimality is achieved by the implementation of some specially constructed convergent nonlinear branch and cut methods, based on the use of natural relaxations and by applying strengthening constraints (linear valid inequalities......) and cuts....
An inertia-free filter line-search algorithm for large-scale nonlinear programming
Energy Technology Data Exchange (ETDEWEB)
Chiang, Nai-Yuan; Zavala, Victor M.
2016-02-15
We present a filter line-search algorithm that does not require inertia information of the linear system. This feature enables the use of a wide range of linear algebra strategies and libraries, which is essential to tackle large-scale problems on modern computing architectures. The proposed approach performs curvature tests along the search step to detect negative curvature and to trigger convexification. We prove that the approach is globally convergent and we implement the approach within a parallel interior-point framework to solve large-scale and highly nonlinear problems. Our numerical tests demonstrate that the inertia-free approach is as efficient as inertia detection via symmetric indefinite factorizations. We also demonstrate that the inertia-free approach can lead to reductions in solution time because it reduces the amount of convexification needed.
DEFF Research Database (Denmark)
Ommen, Torben Schmidt; Markussen, Wiebke Brix; Elmegaard, Brian
2014-01-01
In the paper, three frequently used operation optimisation methods are examined with respect to their impact on operation management of the combined utility technologies for electric power and DH (district heating) of eastern Denmark. The investigation focusses on individual plant operation...... differences and differences between the solution found by each optimisation method. One of the investigated approaches utilises LP (linear programming) for optimisation, one uses LP with binary operation constraints, while the third approach uses NLP (non-linear programming). The LP model is used...... as a benchmark, as this type is frequently used, and has the lowest amount of constraints of the three. A comparison of the optimised operation of a number of units shows significant differences between the three methods. Compared to the reference, the use of binary integer variables, increases operation...
Dong, Lu; Zhong, Xiangnan; Sun, Changyin; He, Haibo
2017-07-01
This paper presents the design of a novel adaptive event-triggered control method based on the heuristic dynamic programming (HDP) technique for nonlinear discrete-time systems with unknown system dynamics. In the proposed method, the control law is only updated when the event-triggered condition is violated. Compared with the periodic updates in the traditional adaptive dynamic programming (ADP) control, the proposed method can reduce the computation and transmission cost. An actor-critic framework is used to learn the optimal event-triggered control law and the value function. Furthermore, a model network is designed to estimate the system state vector. The main contribution of this paper is to design a new trigger threshold for discrete-time systems. A detailed Lyapunov stability analysis shows that our proposed event-triggered controller can asymptotically stabilize the discrete-time systems. Finally, we test our method on two different discrete-time systems, and the simulation results are included.
Shen, Peiping; Zhang, Tongli; Wang, Chunfeng
2017-01-01
This article presents a new approximation algorithm for globally solving a class of generalized fractional programming problems (P) whose objective functions are defined as an appropriate composition of ratios of affine functions. To solve this problem, the algorithm solves an equivalent optimization problem (Q) via an exploration of a suitably defined nonuniform grid. The main work of the algorithm involves checking the feasibility of linear programs associated with the interesting grid points. It is proved that the proposed algorithm is a fully polynomial time approximation scheme as the ratio terms are fixed in the objective function to problem (P), based on the computational complexity result. In contrast to existing results in literature, the algorithm does not require the assumptions on quasi-concavity or low-rank of the objective function to problem (P). Numerical results are given to illustrate the feasibility and effectiveness of the proposed algorithm.
General purpose nonlinear analysis program FINAS for elevated temperature design of FBR components
International Nuclear Information System (INIS)
Iwata, K.; Atsumo, H.; Kano, T.; Takeda, H.
1982-01-01
This paper presents currently available capabilities of a general purpose finite element nonlinear analysis program FINAS (FBR Inelastic Structural Analysis System) which has been developed at Power Reactor and Nuclear Fuel Development Corporation (PNC) since 1976 to support structural design of fast breeder reactor (FBR) components in Japan. This program is capable of treating inelastic responses of arbitrary complex structures subjected to static and dynamic load histories. Various types of finite element covering rods, beams, pipes, axisymmetric, two and three dimensional solids, plates and shells, are implemented in the program. The thermal elastic-plastic creep analysis is possible for each element type, with primary emphasis on the application to FBR components subjected to sustained or cyclic loads at elevated temperature. The program permits large deformation, buckling, fracture mechanics, and dynamic analyses for some of the element types and provides a number of options for automatic mesh generation and computer graphics. Some examples including elevated temperature effects are shown to demonstrate the accuracy and the efficiency of the program
Energy Technology Data Exchange (ETDEWEB)
Biffle, J.H.
1993-02-01
JAC3D is a three-dimensional finite element program designed to solve quasi-static nonlinear mechanics problems. A set of continuum equations describes the nonlinear mechanics involving large rotation and strain. A nonlinear conjugate gradient method is used to solve the equation. The method is implemented in a three-dimensional setting with various methods for accelerating convergence. Sliding interface logic is also implemented. An eight-node Lagrangian uniform strain element is used with hourglass stiffness to control the zero-energy modes. This report documents the elastic and isothermal elastic-plastic material model. Other material models, documented elsewhere, are also available. The program is vectorized for efficient performance on Cray computers. Sample problems described are the bending of a thin beam, the rotation of a unit cube, and the pressurization and thermal loading of a hollow sphere.
Energy Technology Data Exchange (ETDEWEB)
Biffle, J.H.; Blanford, M.L.
1994-05-01
JAC2D is a two-dimensional finite element program designed to solve quasi-static nonlinear mechanics problems. A set of continuum equations describes the nonlinear mechanics involving large rotation and strain. A nonlinear conjugate gradient method is used to solve the equations. The method is implemented in a two-dimensional setting with various methods for accelerating convergence. Sliding interface logic is also implemented. A four-node Lagrangian uniform strain element is used with hourglass stiffness to control the zero-energy modes. This report documents the elastic and isothermal elastic/plastic material model. Other material models, documented elsewhere, are also available. The program is vectorized for efficient performance on Cray computers. Sample problems described are the bending of a thin beam, the rotation of a unit cube, and the pressurization and thermal loading of a hollow sphere.
DEFF Research Database (Denmark)
Bendtsen, Claus; Nielsen, Ole Holm; Hansen, Lars Bruno
2001-01-01
The quantum mechanical ground state of electrons is described by Density Functional Theory, which leads to large minimization problems. An efficient minimization method uses a self-consistent field (SCF) solution of large eigenvalue problems. The iterative Davidson algorithm is often used, and we...
Continuous Dependence on Modeling in the Cauchy Problem for Nonlinear Elliptic Equations.
1987-04-01
problema di Cauchy per le equazione di tipo ellitico, Ann. Mat. Pura Appl., 46 (1958), pp. 131-153 [18] P. W. Schaefer, On the Cauchy problem for an...Continued) PP 438 PP 448 Fletcher, Jean W. Supply Problems in the Naval Reserve, Cymrot, Donald J., Military Retiremnt and Social Security: A 14 pp
Neural network for solving convex quadratic bilevel programming problems.
He, Xing; Li, Chuandong; Huang, Tingwen; Li, Chaojie
2014-03-01
In this paper, using the idea of successive approximation, we propose a neural network to solve convex quadratic bilevel programming problems (CQBPPs), which is modeled by a nonautonomous differential inclusion. Different from the existing neural network for CQBPP, the model has the least number of state variables and simple structure. Based on the theory of nonsmooth analysis, differential inclusions and Lyapunov-like method, the limit equilibrium points sequence of the proposed neural networks can approximately converge to an optimal solution of CQBPP under certain conditions. Finally, simulation results on two numerical examples and the portfolio selection problem show the effectiveness and performance of the proposed neural network. Copyright © 2013 Elsevier Ltd. All rights reserved.
International Nuclear Information System (INIS)
Huang, C.-H.; Li, J.-X.
2006-01-01
A non-linear optimal control algorithm is examined in this study for the diffusion process of semiconductor materials. The purpose of this algorithm is to estimate an optimal control function such that the homogeneity of the concentration can be controlled during the diffusion process and the diffusion-induced stresses for the semiconductor materials can thus be reduced. The validation of this optimal control analysis utilizing the conjugate gradient method of minimization is analysed by using numerical experiments. Three different diffusion processing times are given and the corresponding optimal control functions are to be determined. Results show that the diffusion time can be shortened significantly by applying the optimal control function at the boundary and the homogeneity of the concentration is also guaranteed. This control function can be obtained within a very short CPU time on a Pentium III 600 MHz PC
Motivating programming students by Problem Based Learning and LEGO robots
DEFF Research Database (Denmark)
Lykke, Marianne; Coto Chotto, Mayela; Mora, Sonia
2014-01-01
. For this reason the school is focusing on different teaching methods to help their students master these skills. This paper introduces an experimental, controlled comparison study of three learning designs, involving a problem based learning (PBL) approach in connection with the use of LEGO Mindstorms to improve...... students programming skills and motivation for learning in an introductory programming course. The paper reports the results related with one of the components of the study - the experiential qualities of the three learning designs. The data were collected through a questionnaire survey with 229 students...... from three groups exposed to different learning designs and through six qualitative walk-alongs collecting data from these groups by informal interviews and observations. Findings from the three studies were discussed in three focus group interviews with 10 students from the three experimental groups....
Solving cyclical nurse scheduling problem using preemptive goal programming
Sundari, V. E.; Mardiyati, S.
2017-07-01
Nurse scheduling system in a hospital is being modeled as a preemptive goal programming problem that is solved by using LINGO software with the objective function to minimize deviation variable at each goal. The scheduling is done cyclically, so every nurse is treated fairly since they have the same work shift portion with the other nurses. By paying attention to the hospital's rules regarding nursing work shift cyclically, it can be obtained that numbers of nurse needed in every ward are 18 nurses and the numbers of scheduling periods are 18 periods where every period consists of 21 days.
A recurrent neural network for solving bilevel linear programming problem.
He, Xing; Li, Chuandong; Huang, Tingwen; Li, Chaojie; Huang, Junjian
2014-04-01
In this brief, based on the method of penalty functions, a recurrent neural network (NN) modeled by means of a differential inclusion is proposed for solving the bilevel linear programming problem (BLPP). Compared with the existing NNs for BLPP, the model has the least number of state variables and simple structure. Using nonsmooth analysis, the theory of differential inclusions, and Lyapunov-like method, the equilibrium point sequence of the proposed NNs can approximately converge to an optimal solution of BLPP under certain conditions. Finally, the numerical simulations of a supply chain distribution model have shown excellent performance of the proposed recurrent NNs.
LDRD report nonlinear model reduction
Energy Technology Data Exchange (ETDEWEB)
Segalman, D.; Heinstein, M.
1997-09-01
The very general problem of model reduction of nonlinear systems was made tractable by focusing on the very large subclass consisting of linear subsystems connected by nonlinear interfaces. Such problems constitute a large part of the nonlinear structural problems encountered in addressing the Sandia missions. A synthesis approach to this class of problems was developed consisting of: detailed modeling of the interface mechanics; collapsing the interface simulation results into simple nonlinear interface models; constructing system models by assembling model approximations of the linear subsystems and the nonlinear interface models. These system models, though nonlinear, would have very few degrees of freedom. A paradigm problem, that of machine tool vibration, was selected for application of the reduction approach outlined above. Research results achieved along the way as well as the overall modeling of a specific machine tool have been very encouraging. In order to confirm the interface models resulting from simulation, it was necessary to develop techniques to deduce interface mechanics from experimental data collected from the overall nonlinear structure. A program to develop such techniques was also pursued with good success.
A Semismooth Newton Method for Nonlinear Parameter Identification Problems with Impulsive Noise
Clason, Christian; Jin, Bangti
2012-01-01
-order condition. The convergence of the solution to the approximating problem as the smoothing parameter goes to zero is shown. A strategy for adaptively selecting the regularization parameter based on a balancing principle is suggested. The efficiency
International Nuclear Information System (INIS)
Dmitriy Y. Anistratov; Adrian Constantinescu; Loren Roberts; William Wieselquist
2007-01-01
This is a project in the field of fundamental research on numerical methods for solving the particle transport equation. Numerous practical problems require to use unstructured meshes, for example, detailed nuclear reactor assembly-level calculations, large-scale reactor core calculations, radiative hydrodynamics problems, where the mesh is determined by hydrodynamic processes, and well-logging problems in which the media structure has very complicated geometry. Currently this is an area of very active research in numerical transport theory. main issues in developing numerical methods for solving the transport equation are the accuracy of the numerical solution and effectiveness of iteration procedure. The problem in case of unstructured grids is that it is very difficult to derive an iteration algorithm that will be unconditionally stable
Solution for Nonlinear Three-Dimensional Intercept Problem with Minimum Energy
Directory of Open Access Journals (Sweden)
Henzeh Leeghim
2013-01-01
a minimum-energy application, which then generates both the desired initial interceptor velocity and the TOF for the minimum-energy transfer. The optimization problem is formulated by using the classical Lagrangian f and g coefficients, which map initial position and velocity vectors to future times, and a universal time variable x. A Newton-Raphson iteration algorithm is introduced for iteratively solving the problem. A generalized problem formulation is introduced for minimizing the TOF as part of the optimization problem. Several examples are presented, and the results are compared with the Hohmann transfer solution approaches. The resulting minimum-energy intercept solution algorithm is expected to be broadly useful as a starting iterative for applications spanning: targeting, rendezvous, interplanetary trajectory design, and so on.
Path selection and bandwidth allocation in MPLS networks: a nonlinear programming approach
Burns, J. E.; Ott, Teunis J.; de Kock, Johan M.; Krzesinski, Anthony E.
2001-07-01
Multi-protocol Label Switching extends the IPv4 destination-based routing protocols to provide new and scalable routing capabilities in connectionless networks using relatively simple packet forwarding mechanisms. MPLS networks carry traffic on virtual connections called label switched paths. This paper considers path selection and bandwidth allocation in MPLS networks in order to optimize the network quality of service. The optimization is based upon the minimization of a non-linear objective function which under light load simplifies to OSPF routing with link metrics equal to the link propagation delays. The behavior under heavy load depends on the choice of certain parameters: It can essentially be made to minimize maximal expected utilization, or to maximize minimal expected weighted slacks (both over all links). Under certain circumstances it can be made to minimize the probability that a link has an instantaneous offered load larger than its transmission capacity. We present a model of an MPLS network and an algorithm to find and capacitate optimal LSPs. The algorithm is an improvement of the well-known flow deviation non-linear programming method. The algorithm is applied to compute optimal LSPs for several test networks carrying a single traffic class.
Periaux, J.
1979-01-01
The numerical simulation of the transonic flows of idealized fluids and of incompressible viscous fluids, by the nonlinear least squares methods is presented. The nonlinear equations, the boundary conditions, and the various constraints controlling the two types of flow are described. The standard iterative methods for solving a quasi elliptical nonlinear equation with partial derivatives are reviewed with emphasis placed on two examples: the fixed point method applied to the Gelder functional in the case of compressible subsonic flows and the Newton method used in the technique of decomposition of the lifting potential. The new abstract least squares method is discussed. It consists of substituting the nonlinear equation by a problem of minimization in a H to the minus 1 type Sobolev functional space.
Solution of large nonlinear time-dependent problems using reduced coordinates
International Nuclear Information System (INIS)
Mish, K.D.
1987-01-01
This research is concerned with the idea of reducing a large time-dependent problem, such as one obtained from a finite-element discretization, down to a more manageable size while preserving the most-important physical behavior of the solution. This reduction process is motivated by the concept of a projection operator on a Hilbert Space, and leads to the Lanczos Algorithm for generation of approximate eigenvectors of a large symmetric matrix. The Lanczos Algorithm is then used to develop a reduced form of the spatial component of a time-dependent problem. The solution of the remaining temporal part of the problem is considered from the standpoint of numerical-integration schemes in the time domain. All of these theoretical results are combined to motivate the proposed reduced coordinate algorithm. This algorithm is then developed, discussed, and compared to related methods from the mechanics literature. The proposed reduced coordinate method is then applied to the solution of some representative problems in mechanics. The results of these problems are discussed, conclusions are drawn, and suggestions are made for related future research
Gardner, Robin P.; Xu, Libai
2009-10-01
The Center for Engineering Applications of Radioisotopes (CEAR) has been working for over a decade on the Monte Carlo library least-squares (MCLLS) approach for treating non-linear radiation analyzer problems including: (1) prompt gamma-ray neutron activation analysis (PGNAA) for bulk analysis, (2) energy-dispersive X-ray fluorescence (EDXRF) analyzers, and (3) carbon/oxygen tool analysis in oil well logging. This approach essentially consists of using Monte Carlo simulation to generate the libraries of all the elements to be analyzed plus any other required background libraries. These libraries are then used in the linear library least-squares (LLS) approach with unknown sample spectra to analyze for all elements in the sample. Iterations of this are used until the LLS values agree with the composition used to generate the libraries. The current status of the methods (and topics) necessary to implement the MCLLS approach is reported. This includes: (1) the Monte Carlo codes such as CEARXRF, CEARCPG, and CEARCO for forward generation of the necessary elemental library spectra for the LLS calculation for X-ray fluorescence, neutron capture prompt gamma-ray analyzers, and carbon/oxygen tools; (2) the correction of spectral pulse pile-up (PPU) distortion by Monte Carlo simulation with the code CEARIPPU; (3) generation of detector response functions (DRF) for detectors with linear and non-linear responses for Monte Carlo simulation of pulse-height spectra; and (4) the use of the differential operator (DO) technique to make the necessary iterations for non-linear responses practical. In addition to commonly analyzed single spectra, coincidence spectra or even two-dimensional (2-D) coincidence spectra can also be used in the MCLLS approach and may provide more accurate results.
On the Reliability of Nonlinear Modeling using Enhanced Genetic Programming Techniques
Winkler, S. M.; Affenzeller, M.; Wagner, S.
The use of genetic programming (GP) in nonlinear system identification enables the automated search for mathematical models that are evolved by an evolutionary process using the principles of selection, crossover and mutation. Due to the stochastic element that is intrinsic to any evolutionary process, GP cannot guarantee the generation of similar or even equal models in each GP process execution; still, if there is a physical model underlying to the data that are analyzed, then GP is expected to find these structures and produce somehow similar results. In this paper we define a function for measuring the syntactic similarity of mathematical models represented as structure trees; using this similarity function we compare the results produced by GP techniques for a data set representing measurement data of a BMW Diesel engine.
Hamiltonian-Driven Adaptive Dynamic Programming for Continuous Nonlinear Dynamical Systems.
Yang, Yongliang; Wunsch, Donald; Yin, Yixin
2017-08-01
This paper presents a Hamiltonian-driven framework of adaptive dynamic programming (ADP) for continuous time nonlinear systems, which consists of evaluation of an admissible control, comparison between two different admissible policies with respect to the corresponding the performance function, and the performance improvement of an admissible control. It is showed that the Hamiltonian can serve as the temporal difference for continuous-time systems. In the Hamiltonian-driven ADP, the critic network is trained to output the value gradient. Then, the inner product between the critic and the system dynamics produces the value derivative. Under some conditions, the minimization of the Hamiltonian functional is equivalent to the value function approximation. An iterative algorithm starting from an arbitrary admissible control is presented for the optimal control approximation with its convergence proof. The implementation is accomplished by a neural network approximation. Two simulation studies demonstrate the effectiveness of Hamiltonian-driven ADP.
NEWBOX: A computer program for parameter estimation in diffusion problems
International Nuclear Information System (INIS)
Nestor, C.W. Jr.; Godbee, H.W.; Joy, D.S.
1989-01-01
In the analysis of experiments to determine amounts of material transferred form 1 medium to another (e.g., the escape of chemically hazardous and radioactive materials from solids), there are at least 3 important considerations. These are (1) is the transport amenable to treatment by established mass transport theory; (2) do methods exist to find estimates of the parameters which will give a best fit, in some sense, to the experimental data; and (3) what computational procedures are available for evaluating the theoretical expressions. The authors have made the assumption that established mass transport theory is an adequate model for the situations under study. Since the solutions of the diffusion equation are usually nonlinear in some parameters (diffusion coefficient, reaction rate constants, etc.), use of a method of parameter adjustment involving first partial derivatives can be complicated and prone to errors in the computation of the derivatives. In addition, the parameters must satisfy certain constraints; for example, the diffusion coefficient must remain positive. For these reasons, a variant of the constrained simplex method of M. J. Box has been used to estimate parameters. It is similar, but not identical, to the downhill simplex method of Nelder and Mead. In general, they calculate the fraction of material transferred as a function of time from expressions obtained by the inversion of the Laplace transform of the fraction transferred, rather than by taking derivatives of a calculated concentration profile. With the above approaches to the 3 considerations listed at the outset, they developed a computer program NEWBOX, usable on a personal computer, to calculate the fractional release of material from 4 different geometrical shapes (semi-infinite medium, finite slab, finite circular cylinder, and sphere), accounting for several different boundary conditions
International Nuclear Information System (INIS)
Nixon, J.D.
2016-01-01
This paper presents a method for optimising the design parameters of an anaerobic digestion (AD) system by using first-order kinetics and multi-objective non-linear goal programming. A model is outlined that determines the ideal operating tank temperature and hydraulic retention time, based on objectives for minimising levelised cost of electricity, and maximising energy potential and feedstock mass reduction. The model is demonstrated for a continuously stirred tank reactor processing food waste in two case study locations. These locations are used to investigate the influence of different environmental and economic climates on optimal conditions. A sensitivity analysis is performed to further examine the variation in optimal results for different financial assumptions and objective weightings. The results identify the conditions for the preferred tank temperature to be in the psychrophilic, mesophilic or thermophilic range. For a tank temperature of 35 °C, ideal hydraulic retention times, in terms of achieving a minimum levelised electricity cost, were found to range from 29.9 to 33 days. Whilst there is a need for more detailed information on rate constants for use in first-order models, multi-objective optimisation modelling is considered to be a promising option for AD design. - Highlights: • Nonlinear goal programming is used to optimise anaerobic digestion systems. • Multiple objectives are set including minimising the levelised cost of electricity. • A model is developed and applied to case studies for the UK and India. • Optimal decisions are made for tank temperature and retention time. • A sensitivity analysis is carried out to investigate different model objectives.
Atluri, S. N.; Nakagaki, M.; Kathiresan, K.
1980-01-01
In this paper, efficient numerical methods for the analysis of crack-closure effects on fatigue-crack-growth-rates, in plane stress situations, and for the solution of stress-intensity factors for arbitrary shaped surface flaws in pressure vessels, are presented. For the former problem, an elastic-plastic finite element procedure valid for the case of finite deformation gradients is developed and crack growth is simulated by the translation of near-crack-tip elements with embedded plastic singularities. For the latter problem, an embedded-elastic-singularity hybrid finite element method, which leads to a direct evaluation of K-factors, is employed.
Nonlinear Elliptic Differential Equations with Multivalued Nonlinearities
Indian Academy of Sciences (India)
In this paper we study nonlinear elliptic boundary value problems with monotone and nonmonotone multivalued nonlinearities. First we consider the case of monotone nonlinearities. In the first result we assume that the multivalued nonlinearity is defined on all R R . Assuming the existence of an upper and of a lower ...
Directory of Open Access Journals (Sweden)
Hongjian Wang
2014-01-01
Full Text Available We present a support vector regression-based adaptive divided difference filter (SVRADDF algorithm for improving the low state estimation accuracy of nonlinear systems, which are typically affected by large initial estimation errors and imprecise prior knowledge of process and measurement noises. The derivative-free SVRADDF algorithm is significantly simpler to compute than other methods and is implemented using only functional evaluations. The SVRADDF algorithm involves the use of the theoretical and actual covariance of the innovation sequence. Support vector regression (SVR is employed to generate the adaptive factor to tune the noise covariance at each sampling instant when the measurement update step executes, which improves the algorithm’s robustness. The performance of the proposed algorithm is evaluated by estimating states for (i an underwater nonmaneuvering target bearing-only tracking system and (ii maneuvering target bearing-only tracking in an air-traffic control system. The simulation results show that the proposed SVRADDF algorithm exhibits better performance when compared with a traditional DDF algorithm.
Solving applied mathematical problems with Matlab
Xue, Dingyu
2008-01-01
Computer Mathematics Language-An Overview. Fundamentals of MATLAB Programming. Calculus Problems. MATLAB Computations of Linear Algebra Problems. Integral Transforms and Complex Variable Functions. Solutions to Nonlinear Equations and Optimization Problems. MATLAB Solutions to Differential Equation Problems. Solving Interpolations and Approximations Problems. Solving Probability and Mathematical Statistics Problems. Nontraditional Solution Methods for Mathematical Problems.
The transportation management division institutional program: Networking and problem solving
International Nuclear Information System (INIS)
McGinnis, K.A.; Peterson, J.M.
1989-06-01
The US Department of Energy (DOE) has several programs related to transportation. While these programs may have differing missions and legislative authority, the required activities are frequently similar. To ensure a DOE-wide perspective in developing transportation policies and procedures, a DOE Transportation Institutional Task Force (Task Force) has been formed, which is the primary focus of this paper. The Task Force, composed of representatives from each of the major DOE transportation programs, meets periodically to exchange experiences and insights on institutional issues related to Departmental shipping. The primary purpose of the group is to identify opportunities for productive interactions with the transportation community, including interested and affected members of the public. This paper will also focus sharply on the networking of DOE with the State, Tribal, and local officials in fostering better understanding and in solving problems. An example of such activity is the DOE's cooperative agreement with the Energy Task Force of the Urban Consortium. A major effort is to encourage cooperative action in identifying, addressing, and resolving issues that could impede the transportation of radioactive materials
Hall, Philip
1989-01-01
Goertler vortices are thought to be the cause of transition in many fluid flows of practical importance. A review of the different stages of vortex growth is given. In the linear regime, nonparallel effects completely govern this growth, and parallel flow theories do not capture the essential features of the development of the vortices. A detailed comparison between the parallel and nonparallel theories is given and it is shown that at small vortex wavelengths, the parallel flow theories have some validity; otherwise nonparallel effects are dominant. New results for the receptivity problem for Goertler vortices are given; in particular vortices induced by free stream perturbations impinging on the leading edge of the walls are considered. It is found that the most dangerous mode of this type can be isolated and it's neutral curve is determined. This curve agrees very closely with the available experimental data. A discussion of the different regimes of growth of nonlinear vortices is also given. Again it is shown that, unless the vortex wavelength is small, nonparallel effects are dominant. Some new results for nonlinear vortices of 0(1) wavelengths are given and compared to experimental observations.
Czech Academy of Sciences Publication Activity Database
Mukhigulashvili, Sulkhan
-, č. 35 (2015), s. 23-50 ISSN 1126-8042 Institutional support: RVO:67985840 Keywords : higher order functional differential equations * Dirichlet boundary value problem * strong singularity Subject RIV: BA - General Mathematics http://ijpam.uniud.it/online_issue/201535/03-Mukhigulashvili.pdf
Primal and Dual Penalty Methods for Contact Problems with Geometrical Non-linearities
Czech Academy of Sciences Publication Activity Database
Vondrák, V.; Dostál, Z.; Dobiáš, Jiří; Pták, Svatopluk
-, č. 5 (2005), s. 449-450 ISSN 1617-7061. [GAMM Annual Meeting 2005. Luxembourg, 28.03.2005-01.04.2005] R&D Projects: GA ČR(CZ) GA101/05/0423 Institutional research plan: CEZ:AV0Z20760514 Keywords : primal penalty * dual penalty * contact problem Subject RIV: BA - General Mathematics
Combined effects of changing-sign potential and critical nonlinearities in Kirchhoff type problems
Directory of Open Access Journals (Sweden)
Gao-Sheng Liu
2016-08-01
Full Text Available In this article, we study the existence and multiplicity of positive solutions for a class of Kirchhoff type problems involving changing-sign potential and critical growth terms. Using the concentration compactness principle and Nehari manifold, we obtain the existence and multiplicity of nonzero non-negative solutions.
BNL NONLINEAR PRE TEST SEISMIC ANALYSIS FOR THE NUPEC ULTIMATE STRENGTH PIPING TEST PROGRAM
International Nuclear Information System (INIS)
DEGRASSI, G.; HOFMAYER, C.; MURPHY, C.; SUZUKI, K.; NAMITA, Y.
2003-01-01
The Nuclear Power Engineering Corporation (NUPEC) of Japan has been conducting a multi-year research program to investigate the behavior of nuclear power plant piping systems under large seismic loads. The objectives of the program are: to develop a better understanding of the elasto-plastic response and ultimate strength of nuclear piping; to ascertain the seismic safety margin of current piping design codes; and to assess new piping code allowable stress rules. Under this program, NUPEC has performed a large-scale seismic proving test of a representative nuclear power plant piping system. In support of the proving test, a series of materials tests, static and dynamic piping component tests, and seismic tests of simplified piping systems have also been performed. As part of collaborative efforts between the United States and Japan on seismic issues, the US Nuclear Regulatory Commission (USNRC) and its contractor, the Brookhaven National Laboratory (BNL), are participating in this research program by performing pre-test and post-test analyses, and by evaluating the significance of the program results with regard to safety margins. This paper describes BNL's pre-test analysis to predict the elasto-plastic response for one of NUPEC's simplified piping system seismic tests. The capability to simulate the anticipated ratcheting response of the system was of particular interest. Analyses were performed using classical bilinear and multilinear kinematic hardening models as well as a nonlinear kinematic hardening model. Comparisons of analysis results for each plasticity model against test results for a static cycling elbow component test and for a simplified piping system seismic test are presented in the paper
Gasinski, Leszek
2005-01-01
Hausdorff Measures and Capacity. Lebesgue-Bochner and Sobolev Spaces. Nonlinear Operators and Young Measures. Smooth and Nonsmooth Analysis and Variational Principles. Critical Point Theory. Eigenvalue Problems and Maximum Principles. Fixed Point Theory.
Energy Technology Data Exchange (ETDEWEB)
Cobb, J.W.
1995-02-01
There is an increasing need for more accurate numerical methods for large-scale nonlinear magneto-fluid turbulence calculations. These methods should not only increase the current state of the art in terms of accuracy, but should also continue to optimize other desired properties such as simplicity, minimized computation, minimized memory requirements, and robust stability. This includes the ability to stably solve stiff problems with long time-steps. This work discusses a general methodology for deriving higher-order numerical methods. It also discusses how the selection of various choices can affect the desired properties. The explicit discussion focuses on third-order Runge-Kutta methods, including general solutions and five examples. The study investigates the linear numerical analysis of these methods, including their accuracy, general stability, and stiff stability. Additional appendices discuss linear multistep methods, discuss directions for further work, and exhibit numerical analysis results for some other commonly used lower-order methods.
Non-linear singular problems in p-adic analysis: associative algebras of p-adic distributions
International Nuclear Information System (INIS)
Albeverio, S; Khrennikov, A Yu; Shelkovich, V M
2005-01-01
We propose an algebraic theory which can be used for solving both linear and non-linear singular problems of p-adic analysis related to p-adic distributions (generalized functions). We construct the p-adic Colombeau-Egorov algebra of generalized functions, in which Vladimirov's pseudo-differential operator plays the role of differentiation. This algebra is closed under Fourier transformation and associative convolution. Pointvalues of generalized functions are defined, and it turns out that any generalized function is uniquely determined by its pointvalues. We also construct an associative algebra of asymptotic distributions, which is generated by the linear span of the set of associated homogeneous p-adic distributions. This algebra is embedded in the Colombeau-Egorov algebra as a subalgebra. In addition, a new technique for constructing weak asymptotics is developed
International Nuclear Information System (INIS)
Gardner, R.P.; Guo, P.; Sood, A.; Mayo, C.W.; Dobbs, C.L.
1998-01-01
A review of our work on the application of the PGNAA method as applied to five industrial applications is given. Some introductory material is first given on the importance and use of Monte Carlo simulation in this area, some comments on the place of PGNAA in elemental analysis, and a brief description of the Monte Carlo - Library Least-Squares (MCLLS) approach to the nonlinear inverse PGNAA analysis problem. Then the applications of PGNAA are discussed for: (1) on-line bulk coal analysis, (2) nuclear oil well logging, (3) vitrified waste, (4) the analysis of sodium and aluminium in 'green liquor' in the presence of chlorine, and (5) the conveyor belt sorting of aluminum alloy samples. It is concluded that PGNAA is a rapidly emerging important new technology and measurement approach. (author)
Young, Katherine C.; Sobieszczanski-Sobieski, Jaroslaw
1988-01-01
This project has two objectives. The first is to determine whether linear programming techniques can improve performance when handling design optimization problems with a large number of design variables and constraints relative to the feasible directions algorithm. The second purpose is to determine whether using the Kreisselmeier-Steinhauser (KS) function to replace the constraints with one constraint will reduce the cost of total optimization. Comparisons are made using solutions obtained with linear and non-linear methods. The results indicate that there is no cost saving using the linear method or in using the KS function to replace constraints.
Umbarkar, A. J.; Balande, U. T.; Seth, P. D.
2017-06-01
The field of nature inspired computing and optimization techniques have evolved to solve difficult optimization problems in diverse fields of engineering, science and technology. The firefly attraction process is mimicked in the algorithm for solving optimization problems. In Firefly Algorithm (FA) sorting of fireflies is done by using sorting algorithm. The original FA is proposed with bubble sort for ranking the fireflies. In this paper, the quick sort replaces bubble sort to decrease the time complexity of FA. The dataset used is unconstrained benchmark functions from CEC 2005 [22]. The comparison of FA using bubble sort and FA using quick sort is performed with respect to best, worst, mean, standard deviation, number of comparisons and execution time. The experimental result shows that FA using quick sort requires less number of comparisons but requires more execution time. The increased number of fireflies helps to converge into optimal solution whereas by varying dimension for algorithm performed better at a lower dimension than higher dimension.
Efficient Non-Linear Finite Element Implementation of Elasto-Plasticity for Geotechnical Problems
DEFF Research Database (Denmark)
Clausen, Johan
-Coulomb yield criterion and the corresponding plastic potential possess corners and an apex, which causes numerical difficulties. A simple, elegant and efficient solution to these problems is presented in this thesis. The solution is based on a transformation into principal stress space and is valid for all...... linear isotropic plasticity models in which corners and apexes are encountered. The validity and merits of the proposed solution are examined in relation to the Mohr-Coulomb and the Modified Mohr-Coulomb material models. It is found that the proposed method compares well with existing methods......-Brown material. The efficiency and validity are demonstrated by comparing the finite-element results with well-known solutions for simple geometries. A common geotechnical problem is the assessment of slope stability. For slopes with simple geometries and consisting of a linear Mohr-Coulomb material, this can...
A nonlinear free boundary problem with a self-driven Bernoulli condition
Dipierro, Serena; Karakhanyan, Aram; Valdinoci, Enrico
2017-01-01
We study a Bernoulli type free boundary problem with two phases J[u]=∫Ω|∇u(x)|2dx+Φ(M−(u),M+(u)),u−u¯∈W1,20(Ω), where u¯∈W1,2(Ω) is a given boundary datum. Here, M1 and M2 are weighted volumes of {u≤0}∩Ω and {u>0}∩Ω, respectively, and Φ is a nonnegative function of two real variables. We show that, for this problem, the Bernoulli constant, which determines the gradient jump condition across the free boundary, is of global type and it is indeed determined by the weighted volumes of the phas...
A program package for solving linear optimization problems
International Nuclear Information System (INIS)
Horikami, Kunihiko; Fujimura, Toichiro; Nakahara, Yasuaki
1980-09-01
Seven computer programs for the solution of linear, integer and quadratic programming (four programs for linear programming, one for integer programming and two for quadratic programming) have been prepared and tested on FACOM M200 computer, and auxiliary programs have been written to make it easy to use the optimization program package. The characteristics of each program are explained and the detailed input/output descriptions are given in order to let users know how to use them. (author)
On Algorithms for Nonlinear Minimax and Min-Max-Min Problems and Their Efficiency
2011-03-01
dissertation is complete, I can finally stay home after dinner to play Wii with you. LET’S GO Mario and Yellow Mushroom... xv THIS PAGE INTENTIONALLY... balance the accuracy of the approximation with problem ill-conditioning. The sim- plest smoothing algorithm creates an accurate smooth approximating...sizing in electronic circuit boards (Chen & Fan, 1998), obstacle avoidance for robots (Kirjner- Neto & Polak, 1998), optimal design centering
Problem area descriptions : motor vehicle crashes - data analysis and IVI program analysis
In general, the IVI program focuses on the more significant safety problem categories as : indicated by statistical analyses of crash data. However, other factors were considered in setting : program priorities and schedules. For some problem areas, ...
International Nuclear Information System (INIS)
Diaz, J. I.; Galiano, G.; Padial, J. F.
1999-01-01
We study the uniqueness of solutions of a semilinear elliptic problem obtained from an inverse formulation when the nonlinear terms of the equation are prescribed in a general class of real functions. The inverse problem arises in the modeling of the magnetic confinement of a plasma in a Stellarator device. The uniqueness proof relies on an L ∞ -estimate on the solution of an auxiliary nonlocal problem formulated in terms of the relative rearrangement of a datum with respect to the solution
Dynamics and vibrations progress in nonlinear analysis
Kachapi, Seyed Habibollah Hashemi
2014-01-01
Dynamical and vibratory systems are basically an application of mathematics and applied sciences to the solution of real world problems. Before being able to solve real world problems, it is necessary to carefully study dynamical and vibratory systems and solve all available problems in case of linear and nonlinear equations using analytical and numerical methods. It is of great importance to study nonlinearity in dynamics and vibration; because almost all applied processes act nonlinearly, and on the other hand, nonlinear analysis of complex systems is one of the most important and complicated tasks, especially in engineering and applied sciences problems. There are probably a handful of books on nonlinear dynamics and vibrations analysis. Some of these books are written at a fundamental level that may not meet ambitious engineering program requirements. Others are specialized in certain fields of oscillatory systems, including modeling and simulations. In this book, we attempt to strike a balance between th...
Classical Lie Point Symmetry Analysis of a Steady Nonlinear One-Dimensional Fin Problem
Directory of Open Access Journals (Sweden)
R. J. Moitsheki
2012-01-01
Full Text Available We consider the one-dimensional steady fin problem with the Dirichlet boundary condition at one end and the Neumann boundary condition at the other. Both the thermal conductivity and the heat transfer coefficient are given as arbitrary functions of temperature. We perform preliminary group classification to determine forms of the arbitrary functions appearing in the considered equation for which the principal Lie algebra is extended. Some invariant solutions are constructed. The effects of thermogeometric fin parameter and the exponent on temperature are studied. Also, the fin efficiency is analyzed.
The inverse problem of determining several coefficients in a nonlinear Lotka–Volterra system
International Nuclear Information System (INIS)
Roques, Lionel; Cristofol, Michel
2012-01-01
In this paper, we prove a uniqueness result in the inverse problem of determining several non-constant coefficients of a system of two parabolic equations, which corresponds to a Lotka–Volterra competition model. Our result gives a sufficient condition for the uniqueness of the determination of four coefficients of the system. This sufficient condition only involves pointwise measurements of the solution (u, v) of the system and of the spatial derivative ∂u/∂x or ∂v/∂x of one component at a single point x 0 , during a time interval (0, ε). Our results are illustrated by numerical computations. (paper)
Blow up of solutions to ordinary differential equations arising in nonlinear dispersive problems
Directory of Open Access Journals (Sweden)
Milena Dimova
2018-03-01
Full Text Available We study a new class of ordinary differential equations with blow up solutions. Necessary and sufficient conditions for finite blow up time are proved. Based on the new differential equation, a revised version of the concavity method of Levine is proposed. As an application we investigate the non-existence of global solutions to the Cauchy problem of Klein-Gordon, and to the double dispersive equations. We obtain necessary and sufficient condition for finite time blow up with arbitrary positive energy. A very general sufficient condition for blow up is also given.
Strictly positive solutions for one-dimensional nonlinear problems involving the p-Laplacian
Kaufmann, Uriel; Medri, Ivan
2013-01-01
Let $\\Omega$ be a bounded open interval, and let $p>1$ and $q\\in\\left(0,p-1\\right) $. Let $m\\in L^{p^{\\prime}}\\left(\\Omega\\right) $ and $0\\leq c\\in L^{\\infty}\\left(\\Omega\\right) $. We study existence of strictly positive solutions for elliptic problems of the form $-\\left(\\left\\| u^{\\prime}\\right\\|^{p-2}u^{\\prime}\\right) ^{\\prime}+c\\left(x\\right) u^{p-1}=m\\left(x\\right) u^{q}$ in $\\Omega$, $u=0$ on $\\partial\\Omega$. We mention that our results are new even in the case $c\\equiv0$.
Modeling nonlinear problems in the mechanics of strings and rods the role of the balance laws
O'Reilly, Oliver M
2017-01-01
This book presents theories of deformable elastic strings and rods and their application to broad classes of problems. Readers will gain insights into the formulation and analysis of models for mechanical and biological systems. Emphasis is placed on how the balance laws interplay with constitutive relations to form a set of governing equations. For certain classes of problems, it is shown how a balance of material momentum can play a key role in forming the equations of motion. The first half of the book is devoted to the purely mechanical theory of a string and its applications. The second half of the book is devoted to rod theories, including Euler’s theory of the elastica, Kirchhoff ’s theory of an elastic rod, and a range of Cosserat rod theories. A variety of classic and recent applications of these rod theories are examined. Two supplemental chapters, the first on continuum mechanics of three-dimensional continua and the second on methods from variational calculus, are included to provide relevant ...
Directory of Open Access Journals (Sweden)
Renata Melo e Silva de Oliveira
2015-03-01
Full Text Available Scheduling is a key factor for operations management as well as for business success. From industrial Job-shop Scheduling problems (JSSP, many optimization challenges have emerged since de 1960s when improvements have been continuously required such as bottlenecks allocation, lead-time reductions and reducing response time to requests. With this in perspective, this work aims to discuss 3 different optimization models for minimizing Makespan. Those 3 models were applied on 17 classical problems of examples JSSP and produced different outputs. The first model resorts on Mixed and Integer Programming (MIP and it resulted on optimizing 60% of the studied problems. The other models were based on Constraint Programming (CP and approached the problem in two different ways: a model CP1 is a standard IBM algorithm whereof restrictions have an interval structure that fail to solve 53% of the proposed instances, b Model CP-2 approaches the problem with disjunctive constraints and optimized 88% of the instances. In this work, each model is individually analyzed and then compared considering: i Optimization success performance, ii Computational processing time, iii Greatest Resource Utilization and, iv Minimum Work-in-process Inventory. Results demonstrated that CP-2 presented best results on criteria i and ii, but MIP was superior on criteria iii and iv and those findings are discussed at the final section of this work.
DEFF Research Database (Denmark)
Sorokin, Vladislav; Thomsen, Jon Juel
2015-01-01
Parametrically excited systems appear in many fields of science and technology, intrinsically or imposed purposefully; e.g. spatially periodic structures represent an important class of such systems [4]. When the parametric excitation can be considered weak, classical asymptotic methods like...... the method of averaging [2] or multiple scales [6] can be applied. However, with many practically important applications this simplification is inadequate, e.g. with spatially periodic structures it restricts the possibility to affect their effective dynamic properties by a structural parameter modulation...... of considerable magnitude. Approximate methods based on Floquet theory [4] for analyzing problems involving parametric excitation, e.g. the classical Hill’s method of infinite determinants [3,4], can be employed also in cases of strong excitation; however, with Floquet theory being applicable only for linear...
Xu, Y; Li, N
2014-09-01
Biological species have produced many simple but efficient rules in their complex and critical survival activities such as hunting and mating. A common feature observed in several biological motion strategies is that the predator only moves along paths in a carefully selected or iteratively refined subspace (or manifold), which might be able to explain why these motion strategies are effective. In this paper, a unified linear algebraic formulation representing such a predator-prey relationship is developed to simplify the construction and refinement process of the subspace (or manifold). Specifically, the following three motion strategies are studied and modified: motion camouflage, constant absolute target direction and local pursuit. The framework constructed based on this varying subspace concept could significantly reduce the computational cost in solving a class of nonlinear constrained optimal trajectory planning problems, particularly for the case with severe constraints. Two non-trivial examples, a ground robot and a hypersonic aircraft trajectory optimization problem, are used to show the capabilities of the algorithms in this new computational framework.
International Nuclear Information System (INIS)
Xu, Y; Li, N
2014-01-01
Biological species have produced many simple but efficient rules in their complex and critical survival activities such as hunting and mating. A common feature observed in several biological motion strategies is that the predator only moves along paths in a carefully selected or iteratively refined subspace (or manifold), which might be able to explain why these motion strategies are effective. In this paper, a unified linear algebraic formulation representing such a predator–prey relationship is developed to simplify the construction and refinement process of the subspace (or manifold). Specifically, the following three motion strategies are studied and modified: motion camouflage, constant absolute target direction and local pursuit. The framework constructed based on this varying subspace concept could significantly reduce the computational cost in solving a class of nonlinear constrained optimal trajectory planning problems, particularly for the case with severe constraints. Two non-trivial examples, a ground robot and a hypersonic aircraft trajectory optimization problem, are used to show the capabilities of the algorithms in this new computational framework. (paper)
Hamilton, Mark F.
1989-08-01
Four projects are discussed in this annual summary report, all of which involve basic research in nonlinear acoustics: Scattering of Sound by Sound, a theoretical study of two nonconlinear Gaussian beams which interact to produce sum and difference frequency sound; Parametric Receiving Arrays, a theoretical study of parametric reception in a reverberant environment; Nonlinear Effects in Asymmetric Sound Beams, a numerical study of two dimensional finite amplitude sound fields; and Pulsed Finite Amplitude Sound Beams, a numerical time domain solution of the KZK equation.
Data-driven non-linear elasticity: constitutive manifold construction and problem discretization
Ibañez, Ruben; Borzacchiello, Domenico; Aguado, Jose Vicente; Abisset-Chavanne, Emmanuelle; Cueto, Elias; Ladeveze, Pierre; Chinesta, Francisco
2017-11-01
The use of constitutive equations calibrated from data has been implemented into standard numerical solvers for successfully addressing a variety problems encountered in simulation-based engineering sciences (SBES). However, the complexity remains constantly increasing due to the need of increasingly detailed models as well as the use of engineered materials. Data-Driven simulation constitutes a potential change of paradigm in SBES. Standard simulation in computational mechanics is based on the use of two very different types of equations. The first one, of axiomatic character, is related to balance laws (momentum, mass, energy,\\ldots ), whereas the second one consists of models that scientists have extracted from collected, either natural or synthetic, data. Data-driven (or data-intensive) simulation consists of directly linking experimental data to computers in order to perform numerical simulations. These simulations will employ laws, universally recognized as epistemic, while minimizing the need of explicit, often phenomenological, models. The main drawback of such an approach is the large amount of required data, some of them inaccessible from the nowadays testing facilities. Such difficulty can be circumvented in many cases, and in any case alleviated, by considering complex tests, collecting as many data as possible and then using a data-driven inverse approach in order to generate the whole constitutive manifold from few complex experimental tests, as discussed in the present work.
Mixed gradient-Tikhonov methods for solving nonlinear ill-posed problems in Banach spaces
International Nuclear Information System (INIS)
Margotti, Fábio
2016-01-01
Tikhonov regularization is a very useful and widely used method for finding stable solutions of ill-posed problems. A good choice of the penalization functional as well as a careful selection of the topologies of the involved spaces is fundamental to the quality of the reconstructions. These choices can be combined with some a priori information about the solution in order to preserve desired characteristics like sparsity constraints for example. To prove convergence and stability properties of this method, one usually has to assume that a minimizer of the Tikhonov functional is known. In practical situations however, the exact computation of a minimizer is very difficult and even finding an approximation can be a very challenging and expensive task if the involved spaces have poor convexity or smoothness properties. In this paper we propose a method to attenuate this gap between theory and practice, applying a gradient-like method to a Tikhonov functional in order to approximate a minimizer. Using only available information, we explicitly calculate a maximal step-size which ensures a monotonically decreasing error. The resulting algorithm performs only finitely many steps and terminates using the discrepancy principle. In particular the knowledge of a minimizer or even its existence does not need to be assumed. Under standard assumptions, we prove convergence and stability results in relatively general Banach spaces, and subsequently, test its performance numerically, reconstructing conductivities with sparsely located inclusions and different kinds of noise in the 2D electrical impedance tomography. (paper)
Zhai, Chengbo; Hao, Mengru
2014-01-01
By using Krasnoselskii's fixed point theorem, we study the existence of at least one or two positive solutions to a system of fractional boundary value problems given by -D(0+)(ν1)y1(t) = λ1a1(t)f(y1(t), y2(t)), - D(0+)(ν2)y2(t) = λ2a2(t)g(y1(t), y2(t)), where D(0+)(ν) is the standard Riemann-Liouville fractional derivative, ν1, ν2 ∈ (n - 1, n] for n > 3 and n ∈ N, subject to the boundary conditions y1((i))(0) = 0 = y ((i))(0), for 0 ≤ i ≤ n - 2, and [D(0+)(α)y1(t)] t=1 = 0 = [D(0+ (α)y2(t)] t=1, for 1 ≤ α ≤ n - 2, or y1((i))(0) = 0 = y ((i))(0), for 0 ≤ i ≤ n - 2, and [D(0+)(α)y1(t)] t=1 = ϕ1(y1), [D(0+)(α)y2(t)] t=1 = ϕ2(y2), for 1 ≤ α ≤ n - 2, ϕ1, ϕ2 ∈ C([0,1], R). Our results are new and complement previously known results. As an application, we also give an example to demonstrate our result.
Bricolage Programming and Problem Solving Ability in Young Children : an Exploratory Study
Rose, Simon
2016-01-01
Visual programming environments, such as Scratch, are increasingly being used by schools to teach problem solving and computational thinking skills. However, academic research is divided on the effect that visual programming has on problem solving in a computational context. This paper focuses on the role of bricolage programming in this debate; a bottom-up programming approach that arises when using block-style programming interfaces. Bricolage programming was a term originally used to descr...
El-Qulity, Said Ali; Mohamed, Ali Wagdy
2016-01-01
This paper proposes a nonlinear integer goal programming model (NIGPM) for solving the general problem of admission capacity planning in a country as a whole. The work aims to satisfy most of the required key objectives of a country related to the enrollment problem for higher education. The system general outlines are developed along with the solution methodology for application to the time horizon in a given plan. The up-to-date data for Saudi Arabia is used as a case study and a novel evolutionary algorithm based on modified differential evolution (DE) algorithm is used to solve the complexity of the NIGPM generated for different goal priorities. The experimental results presented in this paper show their effectiveness in solving the admission capacity for higher education in terms of final solution quality and robustness.
A Linear Programming Reformulation of the Standard Quadratic Optimization Problem
de Klerk, E.; Pasechnik, D.V.
2005-01-01
The problem of minimizing a quadratic form over the standard simplex is known as the standard quadratic optimization problem (SQO).It is NPhard, and contains the maximum stable set problem in graphs as a special case.In this note we show that the SQO problem may be reformulated as an (exponentially
Lachhwani, Kailash; Poonia, Mahaveer Prasad
2012-08-01
In this paper, we show a procedure for solving multilevel fractional programming problems in a large hierarchical decentralized organization using fuzzy goal programming approach. In the proposed method, the tolerance membership functions for the fuzzily described numerator and denominator part of the objective functions of all levels as well as the control vectors of the higher level decision makers are respectively defined by determining individual optimal solutions of each of the level decision makers. A possible relaxation of the higher level decision is considered for avoiding decision deadlock due to the conflicting nature of objective functions. Then, fuzzy goal programming approach is used for achieving the highest degree of each of the membership goal by minimizing negative deviational variables. We also provide sensitivity analysis with variation of tolerance values on decision vectors to show how the solution is sensitive to the change of tolerance values with the help of a numerical example.
Tunjo Perić; Željko Mandić
2017-01-01
This paper presents the production plan optimization in the metal industry considered as a multi-criteria programming problem. We first provided the definition of the multi-criteria programming problem and classification of the multicriteria programming methods. Then we applied two multi-criteria programming methods (the STEM method and the PROMETHEE method) in solving a problem of multi-criteria optimization production plan in a company from the metal industry. The obtained resul...
Directory of Open Access Journals (Sweden)
Luisa Toscano
2016-01-01
Full Text Available A new result of solvability for a wide class of systems of variational equations depending on parameters and governed by nonmonotone operators is found in a Banach real and reflexive space with applications to Dirichlet and Neumann problems related to nonlinear elliptic systems.
Directory of Open Access Journals (Sweden)
Shihuang Hong
2009-01-01
Full Text Available We present sufficient conditions for the existence of at least twin or triple positive solutions of a nonlinear four-point singular boundary value problem with a p-Laplacian dynamic equation on a time scale. Our results are obtained via some new multiple fixed point theorems.
International Nuclear Information System (INIS)
Koteras, J.R.
1996-01-01
The prediction of stresses and displacements around tunnels buried deep within the earth is an important class of geomechanics problems. The material behavior immediately surrounding the tunnel is typically nonlinear. The surrounding mass, even if it is nonlinear, can usually be characterized by a simple linear elastic model. The finite element method is best suited for modeling nonlinear materials of limited volume, while the boundary element method is well suited for modeling large volumes of linear elastic material. A computational scheme that couples the finite element and boundary element methods would seem particularly useful for geomechanics problems. A variety of coupling schemes have been proposed, but they rely on direct solution methods. Direct solution techniques have large storage requirements that become cumbersome for large-scale three-dimensional problems. An alternative to direct solution methods is iterative solution techniques. A scheme has been developed for coupling the finite element and boundary element methods that uses an iterative solution method. This report shows that this coupling scheme is valid for problems where nonlinear material behavior occurs in the finite element region
Teaching Introductory Programming to IS Students: Java Problems and Pitfalls
Pendergast, Mark O.
2006-01-01
This paper examines the impact the use of the Java programming language has had on the way our students learn to program and the success they achieve. The importance of a properly constructed first course in programming cannot be overstated. A course well experienced will leave students with good programming habits, the ability to learn on their…
International Nuclear Information System (INIS)
Ikushima, Takeshi
1988-10-01
A nonlinear impact analysis computer program DYNA2D, which was developed by Hallquist, has been introduced from Lawrence Livermore National Laboratory for the purpose of using impact analysis of nuclear fuel transport casks. DYNA2D has been built in CASKETSS code system (CASKETSS means a modular code system for CASK Evaluation code system for Thermal and Structural Safety). Main features of DYNA2D are as follows; (1) This program has been programmed to provide near optimal speed on vector processing computers. (2) An explicit time integration method is used for fast calculation. (3) Many material models are available in the program. (4) A contact-impact algorithm permits gap and sliding along structural interfaces. (5) A rezoner has been embedded in the program. (6) The graphic program for representations of calculation is provided. In the paper, brief illustration of calculation method, input data and sample calculations are presented. (author)
Integrating packing and distribution problems and optimization through mathematical programming
Directory of Open Access Journals (Sweden)
Fabio Miguel
2016-06-01
Full Text Available This paper analyzes the integration of two combinatorial problems that frequently arise in production and distribution systems. One is the Bin Packing Problem (BPP problem, which involves finding an ordering of some objects of different volumes to be packed into the minimal number of containers of the same or different size. An optimal solution to this NP-Hard problem can be approximated by means of meta-heuristic methods. On the other hand, we consider the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW, which is a variant of the Travelling Salesman Problem (again a NP-Hard problem with extra constraints. Here we model those two problems in a single framework and use an evolutionary meta-heuristics to solve them jointly. Furthermore, we use data from a real world company as a test-bed for the method introduced here.
Sengupta, Tapan K.; Sharma, Nidhi; Sengupta, Aditi
2018-05-01
An enstrophy-based non-linear instability analysis of the Navier-Stokes equation for two-dimensional (2D) flows is presented here, using the Taylor-Green vortex (TGV) problem as an example. This problem admits a time-dependent analytical solution as the base flow, whose instability is traced here. The numerical study of the evolution of the Taylor-Green vortices shows that the flow becomes turbulent, but an explanation for this transition has not been advanced so far. The deviation of the numerical solution from the analytical solution is studied here using a high accuracy compact scheme on a non-uniform grid (NUC6), with the fourth-order Runge-Kutta method. The stream function-vorticity (ψ, ω) formulation of the governing equations is solved here in a periodic square domain with four vortices at t = 0. Simulations performed at different Reynolds numbers reveal that numerical errors in computations induce a breakdown of symmetry and simultaneous fragmentation of vortices. It is shown that the actual physical instability is triggered by the growth of disturbances and is explained by the evolution of disturbance mechanical energy and enstrophy. The disturbance evolution equations have been traced by looking at (a) disturbance mechanical energy of the Navier-Stokes equation, as described in the work of Sengupta et al., "Vortex-induced instability of an incompressible wall-bounded shear layer," J. Fluid Mech. 493, 277-286 (2003), and (b) the creation of rotationality via the enstrophy transport equation in the work of Sengupta et al., "Diffusion in inhomogeneous flows: Unique equilibrium state in an internal flow," Comput. Fluids 88, 440-451 (2013).
34 CFR 356.11 - What types of problems may be researched under the fellowship program?
2010-07-01
... 34 Education 2 2010-07-01 2010-07-01 false What types of problems may be researched under the... (Continued) OFFICE OF SPECIAL EDUCATION AND REHABILITATIVE SERVICES, DEPARTMENT OF EDUCATION DISABILITY AND... Program? § 356.11 What types of problems may be researched under the fellowship program? Problems...
Cafieri , Sonia; Omheni , Riadh
2016-01-01
International audience; We consider the problem of aircraft conflict avoidance in Air Traffic Management systems. Given an initial configuration of a number of aircraft sharing the same airspace, the main goal of conflict avoidance is to guarantee that a minimum safety distance between each pair of aircraft is always respected during their flights. We consider aircraft separation achieved by heading angle deviations, and propose a mixed 0-1 nonlinear optimization model, that is then combined ...
Energy Technology Data Exchange (ETDEWEB)
Mulione, G. [Catania, Univ. (Italy). Dip. di Matematica; Rionero, S. [Napoli, Univ. (Italy). Dip. di Matematica e applicazioni
1998-07-01
The Lyapunov direct method is applied to study nonlinear stability of a basic motionless state to imposed linear temperature and concentration fields of a binary fluid mixture heated and salted from below, in the Oberbeck-Boussinesq scheme. Stress-free and rigid surfaces are considered and absence of Hopf bifurcation is assumed. We prove the coincidence of the linear and (unconditional) nonlinear critical stability limits, when the ratio between the Schmidt and the Prandtl numbers is less or equal to 1. Precisely, we obtain necessary and sufficient conditions of unconditional nonlinear exponential stability of the basic motionless state. [Italian] Si applica il metodo diretto di Lyapunov allo studio della stabilita' non lineare esponenziale della soluzione di conduzione-diffusione di una miscela fluida binaria riscaldata e salata da sotto, nello schema di Oberbeck-Boussinesq. Si considerano superfici rigide e 'stress-free'; si supponeche non ci sia biforcazione di Hpf. Supposto che il rapporto fra i numeri di Schmidt e di Prandtl e' minore o uguale a 1, si prova la coincidenza tra i paramentri critici della stabilita' lineare e non lineare. Si ottengono condizioni necessarie e sufficienti di stabilita' non lineare esponenziale del moto base.
Model-based problem solving through symbolic regression via pareto genetic programming
Vladislavleva, E.
2008-01-01
Pareto genetic programming methodology is extended by additional generic model selection and generation strategies that (1) drive the modeling engine to creation of models of reduced non-linearity and increased generalization capabilities, and (2) improve the effectiveness of the search for robust
Zörnig, Peter
2015-08-01
We present integer programming models for some variants of the farthest string problem. The number of variables and constraints is substantially less than that of the integer linear programming models known in the literature. Moreover, the solution of the linear programming-relaxation contains only a small proportion of noninteger values, which considerably simplifies the rounding process. Numerical tests have shown excellent results, especially when a small set of long sequences is given.
Parallel Nonlinear Optimization for Astrodynamic Navigation, Phase I
National Aeronautics and Space Administration — CU Aerospace proposes the development of a new parallel nonlinear program (NLP) solver software package. NLPs allow the solution of complex optimization problems,...
Hamilton, Mark F.
1990-12-01
This report discusses five projects all of which involve basic theoretical research in nonlinear acoustics: (1) pulsed finite amplitude sound beams are studied with a recently developed time domain computer algorithm that solves the KZK nonlinear parabolic wave equation; (2) nonlinear acoustic wave propagation in a liquid layer is a study of harmonic generation and acoustic soliton information in a liquid between a rigid and a free surface; (3) nonlinear effects in asymmetric cylindrical sound beams is a study of source asymmetries and scattering of sound by sound at high intensity; (4) effects of absorption on the interaction of sound beams is a completed study of the role of absorption in second harmonic generation and scattering of sound by sound; and (5) parametric receiving arrays is a completed study of parametric reception in a reverberant environment.
Sitek, Paweł; Wikarek, Jarosław
2016-01-01
This paper proposes a hybrid programming framework for modeling and solving of constraint satisfaction problems (CSPs) and constraint optimization problems (COPs). Two paradigms, CLP (constraint logic programming) and MP (mathematical programming), are integrated in the framework. The integration is supplemented with the original method of problem transformation, used in the framework as a presolving method. The transformation substantially reduces the feasible solution space. The framework a...
de Klerk, E.; Sotirov, R.
2007-01-01
We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the best known lower bounds for several instances of quadratic assignment problems from the problem library: [R.E. Burkard,
CSR, Inc., Washington, DC.
This handbook is for administrators of programs in higher education settings which deal with alcohol and other drug (AOD) related problems. Chapter 1, "Defining the Problem, Issues, and Trends" examines the problem from various perspectives and presents the latest statistics on the extent of AOD use on campuses, specific problems affecting…
Portfolio selection problem: a comparison of fuzzy goal programming and linear physical programming
Directory of Open Access Journals (Sweden)
Fusun Kucukbay
2016-04-01
Full Text Available Investors have limited budget and they try to maximize their return with minimum risk. Therefore this study aims to deal with the portfolio selection problem. In the study two criteria are considered which are expected return, and risk. In this respect, linear physical programming (LPP technique is applied on Bist 100 stocks to be able to find out the optimum portfolio. The analysis covers the period April 2009- March 2015. This period is divided into two; April 2009-March 2014 and April 2014 – March 2015. April 2009-March 2014 period is used as data to find an optimal solution. April 2014-March 2015 period is used to test the real performance of portfolios. The performance of the obtained portfolio is compared with that obtained from fuzzy goal programming (FGP. Then the performances of both method, LPP and FGP are compared with BIST 100 in terms of their Sharpe Indexes. The findings reveal that LPP for portfolio selection problem is a good alternative to FGP.
Specific problems of beginners at study of programming and possibilities of their solution
Procházková, Petra
2017-01-01
This thesis deals with the problems of beginners in the study of programming at University of Economics in Prague, Faculty of Informatics and Statistics. This applies particularly to students who are studying the subject Programming in Java.
Dynamic Programming Approaches for the Traveling Salesman Problem with Drone
P. Bouman (Paul); N.A.H. Agatz (Niels); M.E. Schmidt (Marie)
2017-01-01
markdownabstractA promising new delivery model involves the use of a delivery truck that collaborates with a drone to make deliveries. Effectively combining a drone and a truck gives rise to a new planning problem that is known as the Traveling Salesman Problem with Drone (TSP-D). This paper
Dynamic Programming Approaches for the Traveling Salesman Problem with Drone
P. Bouman (Paul); N.A.H. Agatz (Niels); M.E. Schmidt (Marie)
2017-01-01
markdownabstractA promising new delivery model involves the use of a delivery truck that collaborates with a drone to make deliveries. Effectively combining a truck and a drone gives rise to a new planning problem that is known as the Traveling Salesman Problem with Drone (TSP-D). This paper
Directory of Open Access Journals (Sweden)
Tunjo Perić
2017-09-01
Full Text Available This paper presents the production plan optimization in the metal industry considered as a multi-criteria programming problem. We first provided the definition of the multi-criteria programming problem and classification of the multicriteria programming methods. Then we applied two multi-criteria programming methods (the STEM method and the PROMETHEE method in solving a problem of multi-criteria optimization production plan in a company from the metal industry. The obtained results indicate a high efficiency of the applied methods in solving the problem.
Zhao, Yingfeng; Liu, Sanyang
2016-01-01
We present a practical branch and bound algorithm for globally solving generalized linear multiplicative programming problem with multiplicative constraints. To solve the problem, a relaxation programming problem which is equivalent to a linear programming is proposed by utilizing a new two-phase relaxation technique. In the algorithm, lower and upper bounds are simultaneously obtained by solving some linear relaxation programming problems. Global convergence has been proved and results of some sample examples and a small random experiment show that the proposed algorithm is feasible and efficient.
International Nuclear Information System (INIS)
Yun, Sung Hwan
2004-02-01
Radiative transfer is a complex phenomenon in which radiation field interacts with material. This thermal radiative transfer phenomenon is composed of two equations which are the balance equation of photons and the material energy balance equation. The two equations involve non-linearity due to the temperature and that makes the radiative transfer equation more difficult to solve. During the last several years, there have been many efforts to solve the non-linear radiative transfer problems by Monte Carlo method. Among them, it is known that Semi-Analog Monte Carlo (SMC) method developed by Ahrens and Larsen is accurate regard-less of the time step size in low temperature region. But their works are limited to one-dimensional, low temperature problems. In this thesis, we suggest some method to remove their limitations in the SMC method and apply to the more realistic problems. An initially cold problem was solved over entire temperature region by using piecewise linear interpolation of the heat capacity, while heat capacity is still fitted as a cubic curve within the lowest temperature region. If we assume the heat capacity to be linear in each temperature region, the non-linearity still remains in the radiative transfer equations. We then introduce the first-order Taylor expansion to linearize the non-linear radiative transfer equations. During the linearization procedure, absorption-reemission phenomena may be described by a conventional reemission time sampling scheme which is similar to the repetitive sampling scheme in particle transport Monte Carlo method. But this scheme causes significant stochastic errors, which necessitates many histories. Thus, we present a new reemission time sampling scheme which reduces stochastic errors by storing the information of absorption times. The results of the comparison of the two schemes show that the new scheme has less stochastic errors. Therefore, the improved SMC method is able to solve more realistic problems with
Energy Technology Data Exchange (ETDEWEB)
NONE
1980-07-01
The main topics treated in this report are: I) Existence of generalized Lagrangians. II) Conserved densities for odd-order polynomial evolution equations and linear evolution systems. III ) Conservation laws for Klein-Gordon, Di rae and Maxwell equations. IV) Stability conditions for finite-energy solutions of a non-linear Klein-Gordon equation. V) Hamiltonian approach to non-linear evolution equations and Backlund transformations. VI) Anharmonic vibrations: Status of results and new possible approaches. (Author) 83 refs.
Directory of Open Access Journals (Sweden)
Wei Han
2008-01-01
Full Text Available Several existence theorems of twin positive solutions are established for a nonlinear m-point boundary value problem of third-order p-Laplacian dynamic equations on time scales by using a fixed point theorem. We present two theorems and four corollaries which generalize the results of related literature. As an application, an example to demonstrate our results is given. The obtained conditions are different from some known results.
Dijkstra's interpretation of the approach to solving a problem of program correctness
Directory of Open Access Journals (Sweden)
Markoski Branko
2010-01-01
Full Text Available Proving the program correctness and designing the correct programs are two connected theoretical problems, which are of great practical importance. The first is solved within program analysis, and the second one in program synthesis, although intertwining of these two processes is often due to connection between the analysis and synthesis of programs. Nevertheless, having in mind the automated methods of proving correctness and methods of automatic program synthesis, the difference is easy to tell. This paper presents denotative interpretation of programming calculation explaining semantics by formulae φ and ψ, in such a way that they can be used for defining state sets for program P.
SOLUTION OF A MULTIVARIATE STRATIFIED SAMPLING PROBLEM THROUGH CHEBYSHEV GOAL PROGRAMMING
Directory of Open Access Journals (Sweden)
Mohd. Vaseem Ismail
2010-12-01
Full Text Available In this paper, we consider the problem of minimizing the variances for the various characters with fixed (given budget. Each convex objective function is first linearised at its minimal point where it meets the linear cost constraint. The resulting multiobjective linear programming problem is then solved by Chebyshev goal programming. A numerical example is given to illustrate the procedure.
Stacked Deck: An Effective, School-Based Program for the Prevention of Problem Gambling
Williams, Robert J.; Wood, Robert T.; Currie, Shawn R.
2010-01-01
School-based prevention programs are an important component of problem gambling prevention, but empirically effective programs are lacking. Stacked Deck is a set of 5-6 interactive lessons that teach about the history of gambling; the true odds and "house edge"; gambling fallacies; signs, risk factors, and causes of problem gambling; and…
Developing Student Programming and Problem-Solving Skills with Visual Basic
Siegle, Del
2009-01-01
Although most computer users will never need to write a computer program, many students enjoy the challenge of creating one. Computer programming enhances students' problem solving by forcing students to break a problem into its component pieces and reassemble it in a generic format that can be understood by a nonsentient entity. It promotes…
Sensitivity analysis of linear programming problem through a recurrent neural network
Das, Raja
2017-11-01
In this paper we study the recurrent neural network for solving linear programming problems. To achieve optimality in accuracy and also in computational effort, an algorithm is presented. We investigate the sensitivity analysis of linear programming problem through the neural network. A detailed example is also presented to demonstrate the performance of the recurrent neural network.
Fundamental solution of the problem of linear programming and method of its determination
Petrunin, S. V.
1978-01-01
The idea of a fundamental solution to a problem in linear programming is introduced. A method of determining the fundamental solution and of applying this method to the solution of a problem in linear programming is proposed. Numerical examples are cited.
Explicit Nonlinear Model Predictive Control Theory and Applications
Grancharova, Alexandra
2012-01-01
Nonlinear Model Predictive Control (NMPC) has become the accepted methodology to solve complex control problems related to process industries. The main motivation behind explicit NMPC is that an explicit state feedback law avoids the need for executing a numerical optimization algorithm in real time. The benefits of an explicit solution, in addition to the efficient on-line computations, include also verifiability of the implementation and the possibility to design embedded control systems with low software and hardware complexity. This book considers the multi-parametric Nonlinear Programming (mp-NLP) approaches to explicit approximate NMPC of constrained nonlinear systems, developed by the authors, as well as their applications to various NMPC problem formulations and several case studies. The following types of nonlinear systems are considered, resulting in different NMPC problem formulations: Ø Nonlinear systems described by first-principles models and nonlinear systems described by black-box models; �...
The Coin Problem and Pseudorandomness for Branching Programs
DEFF Research Database (Denmark)
Brody, Joshua; Verbin, Elad
2010-01-01
in the model of emph{read-once width-$w$ branching programs}. We prove that in order to succeed in this model, $beta$ must be at least $1/ (log n)^{Theta(w)}$. For constant $w$ this is tight by considering the recursive tribes function, and for other values of $w$ this is nearly tight by considering other read...... be distinguished by small-width read-once branching programs. We suggest one application for this kind of theorems: we prove that Nisan's Generator fools width-$w$ read-once emph{regular} branching programs, using seed length $O(w^4 log n log log n + log n log (1/eps))$. For $w=eps=Theta(1)$, this seed length...
Energy Technology Data Exchange (ETDEWEB)
Blumstein, Carl (Univ. of California, Energy Institute (United States))
2009-07-01
This paper addresses the nexus between the evaluation of energy-efficiency programs and incentive payments based on performance for program administrators in California. The paper describes problems that arise when evaluators are asked to measure program performance by answering the counterfactual question, what would have happened in the absence of the program? Then some ways of addressing these problems are examined. Key conclusions are that 1) program evaluation cannot precisely and accurately determine the counterfactual, there will always be substantial uncertainty, 2) given the current state of knowledge, the decision to tie all of the incentive to program outcomes is misguided, and 3) incentive programs should be regularly reviewed and revised so that they can be adapted to new conditions.
Energy Technology Data Exchange (ETDEWEB)
Blumstein, Carl, E-mail: blumstei@berkeley.ed [University of California Energy Institute, 2547 Channing Way, Berkeley, CA 94720 (United States)
2010-10-15
This paper addresses the nexus between evaluation of energy-efficiency programs and incentive payments based on performance for program administrators in California. The paper describes the problems that arise when evaluators are asked to measure program performance by answering the counterfactual question-what would have happened in the absence of the program? Then the paper examines some ways of addressing these problems. Key conclusions are (1) program evaluation cannot precisely and accurately determine the counterfactual, there will always be substantial uncertainty, (2) given the current state of knowledge, the decision to tie all incentives to program outcomes is misguided, and (3) incentive programs should be regularly reviewed and revised so that they can be adapted to new conditions.
Energy Technology Data Exchange (ETDEWEB)
Blumstein, Carl [University of California Energy Institute, 2547 Channing Way, Berkeley, CA 94720 (United States)
2010-10-15
This paper addresses the nexus between evaluation of energy-efficiency programs and incentive payments based on performance for program administrators in California. The paper describes the problems that arise when evaluators are asked to measure program performance by answering the counterfactual question - what would have happened in the absence of the program? Then the paper examines some ways of addressing these problems. Key conclusions are (1) program evaluation cannot precisely and accurately determine the counterfactual, there will always be substantial uncertainty, (2) given the current state of knowledge, the decision to tie all incentives to program outcomes is misguided, and (3) incentive programs should be regularly reviewed and revised so that they can be adapted to new conditions. (author)
International Nuclear Information System (INIS)
Blumstein, Carl
2010-01-01
This paper addresses the nexus between evaluation of energy-efficiency programs and incentive payments based on performance for program administrators in California. The paper describes the problems that arise when evaluators are asked to measure program performance by answering the counterfactual question-what would have happened in the absence of the program? Then the paper examines some ways of addressing these problems. Key conclusions are (1) program evaluation cannot precisely and accurately determine the counterfactual, there will always be substantial uncertainty, (2) given the current state of knowledge, the decision to tie all incentives to program outcomes is misguided, and (3) incentive programs should be regularly reviewed and revised so that they can be adapted to new conditions.
Integer programming for the generalized high school timetabling problem
DEFF Research Database (Denmark)
Kristiansen, Simon; Sørensen, Matias; Stidsen, Thomas Riis
2015-01-01
, the XHSTT format serves as a common ground for researchers within this area. This paper describes the first exact method capable of handling an arbitrary instance of the XHSTT format. The method is based on a mixed-integer linear programming (MIP) model, which is solved in two steps with a commercial...
Using metrics in stability of stochastic programming problems
Czech Academy of Sciences Publication Activity Database
Houda, Michal
2005-01-01
Roč. 13, č. 1 (2005), s. 128-134 ISSN 0572-3043 R&D Projects: GA ČR(CZ) GA402/04/1294 Institutional research plan: CEZ:AV0Z10750506 Keywords : stochastic programming * quantitative stability * Wasserstein metrics * Kolmogorov metrics * simulation study Subject RIV: BB - Applied Statistics, Operational Research
A novel approach based on preference-based index for interval bilevel linear programming problem
Aihong Ren; Yuping Wang; Xingsi Xue
2017-01-01
This paper proposes a new methodology for solving the interval bilevel linear programming problem in which all coefficients of both objective functions and constraints are considered as interval numbers. In order to keep as much uncertainty of the original constraint region as possible, the original problem is first converted into an interval bilevel programming problem with interval coefficients in both objective functions only through normal variation of interval number and chance-constrain...
Method for solving fully fuzzy linear programming problems using deviation degree measure
Institute of Scientific and Technical Information of China (English)
Haifang Cheng; Weilai Huang; Jianhu Cai
2013-01-01
A new ful y fuzzy linear programming (FFLP) prob-lem with fuzzy equality constraints is discussed. Using deviation degree measures, the FFLP problem is transformed into a crispδ-parametric linear programming (LP) problem. Giving the value of deviation degree in each constraint, the δ-fuzzy optimal so-lution of the FFLP problem can be obtained by solving this LP problem. An algorithm is also proposed to find a balance-fuzzy optimal solution between two goals in conflict: to improve the va-lues of the objective function and to decrease the values of the deviation degrees. A numerical example is solved to il ustrate the proposed method.
A new neural network model for solving random interval linear programming problems.
Arjmandzadeh, Ziba; Safi, Mohammadreza; Nazemi, Alireza
2017-05-01
This paper presents a neural network model for solving random interval linear programming problems. The original problem involving random interval variable coefficients is first transformed into an equivalent convex second order cone programming problem. A neural network model is then constructed for solving the obtained convex second order cone problem. Employing Lyapunov function approach, it is also shown that the proposed neural network model is stable in the sense of Lyapunov and it is globally convergent to an exact satisfactory solution of the original problem. Several illustrative examples are solved in support of this technique. Copyright © 2017 Elsevier Ltd. All rights reserved.
DESIGN OF EDUCATIONAL PROBLEMS ON LINEAR PROGRAMMING USING SYSTEMS OF COMPUTER MATHEMATICS
Directory of Open Access Journals (Sweden)
Volodymyr M. Mykhalevych
2013-11-01
Full Text Available From a perspective of the theory of educational problems a problem of substitution in the conditions of ICT use of one discipline by an educational problem of another discipline is represented. Through the example of mathematical problems of linear programming it is showed that a student’s method of operation in the course of an educational problem solving is determinant in the identification of an educational problem in relation to a specific discipline: linear programming, informatics, mathematical modeling, methods of optimization, automatic control theory, calculus etc. It is substantiated the necessity of linear programming educational problems renovation with the purpose of making students free of bulky similar arithmetic calculations and notes which often becomes a barrier to a deeper understanding of key ideas taken as a basis of algorithms used by them.
Formalev, V. F.; Kolesnik, S. A.
2017-11-01
The authors are the first to present a closed procedure for numerical solution of inverse coefficient problems of heat conduction in anisotropic materials used as heat-shielding ones in rocket and space equipment. The reconstructed components of the thermal-conductivity tensor depend on temperature (are nonlinear). The procedure includes the formation of experimental data, the implicit gradient-descent method, the economical absolutely stable method of numerical solution of parabolic problems containing mixed derivatives, the parametric identification, construction, and numerical solution of the problem for elements of sensitivity matrices, the development of a quadratic residual functional and regularizing functionals, and also the development of algorithms and software systems. The implicit gradient-descent method permits expanding the quadratic functional in a Taylor series with retention of the linear terms for the increments of the sought functions. This substantially improves the exactness and stability of solution of the inverse problems. Software systems are developed with account taken of the errors in experimental data and disregarding them. On the basis of a priori assumptions of the qualitative behavior of the functional dependences of the components of the thermal-conductivity tensor on temperature, regularizing functionals are constructed by means of which one can reconstruct the components of the thermal-conductivity tensor with an error no higher than the error of the experimental data. Results of the numerical solution of the inverse coefficient problems on reconstruction of nonlinear components of the thermal-conductivity tensor have been obtained and are discussed.
Chen, Chiu-Jung; Liu, Pei-Lin
2007-01-01
This study evaluated the effects of a personalized computer-assisted mathematics problem-solving program on the performance and attitude of Taiwanese fourth grade students. The purpose of this study was to determine whether the personalized computer-assisted program improved student performance and attitude over the nonpersonalized program.…
How Does Early Feedback in an Online Programming Course Change Problem Solving?
Ebrahimi, Alireza
2012-01-01
How does early feedback change the programming problem solving in an online environment and help students choose correct approaches? This study was conducted in a sample of students learning programming in an online course entitled Introduction to C++ and OOP (Object Oriented Programming) using the ANGEL learning management system platform. My…
Fleming, P.
1985-01-01
A design technique is proposed for linear regulators in which a feedback controller of fixed structure is chosen to minimize an integral quadratic objective function subject to the satisfaction of integral quadratic constraint functions. Application of a non-linear programming algorithm to this mathematically tractable formulation results in an efficient and useful computer-aided design tool. Particular attention is paid to computational efficiency and various recommendations are made. Two design examples illustrate the flexibility of the approach and highlight the special insight afforded to the designer.
Depandent samples in empirical estimation of stochastic programming problems
Czech Academy of Sciences Publication Activity Database
Kaňková, Vlasta; Houda, Michal
2006-01-01
Roč. 35, 2/3 (2006), s. 271-279 ISSN 1026-597X R&D Projects: GA ČR GA402/04/1294; GA ČR GD402/03/H057; GA ČR GA402/05/0115 Institutional research plan: CEZ:AV0Z10750506 Keywords : stochastic programming * stability * probability metrics * Wasserstein metric * Kolmogorov metric * simulations Subject RIV: BB - Applied Statistics , Operational Research
Some nonlinear space decomposition algorithms
Energy Technology Data Exchange (ETDEWEB)
Tai, Xue-Cheng; Espedal, M. [Univ. of Bergen (Norway)
1996-12-31
Convergence of a space decomposition method is proved for a general convex programming problem. The space decomposition refers to methods that decompose a space into sums of subspaces, which could be a domain decomposition or a multigrid method for partial differential equations. Two algorithms are proposed. Both can be used for linear as well as nonlinear elliptic problems and they reduce to the standard additive and multiplicative Schwarz methods for linear elliptic problems. Two {open_quotes}hybrid{close_quotes} algorithms are also presented. They converge faster than the additive one and have better parallelism than the multiplicative method. Numerical tests with a two level domain decomposition for linear, nonlinear and interface elliptic problems are presented for the proposed algorithms.
International Nuclear Information System (INIS)
Zhidkov, P.E.
1996-01-01
First, the eigenvalue problem on the segment [0,1] for the Sturm-Liouville operator with a potential depending on the spectral parameter with the zero Dirichlet boundary conditions is considered. For this problem, under some hypotheses on the potential, it is proved that the necessary and sufficient condition for an arbitrary system of eigenfunctions, possessing a unique function with n roots in the interval (0,1) for an arbitrary non-negative integer number n, being complete in the space L 2 (0,1) is the linear independence of the functions from this system in the space L 2 (0,1). Then, this result is applied to the investigation of an eigenvalue problem for a nonlinear operator on the Sturm-Liouville type. For this problem, the completeness of the system of its eigenfunctions in the space L 2 (0,1) is proved. (author). 12 refs
Probabilistic Quadratic Programming Problems with Some Fuzzy Parameters
Directory of Open Access Journals (Sweden)
S. K. Barik
2012-01-01
making problem by using some specified random variables and fuzzy numbers. In the present paper, randomness is characterized by Weibull random variables and fuzziness is characterized by triangular and trapezoidal fuzzy number. A defuzzification method has been introduced for finding the crisp values of the fuzzy numbers using the proportional probability density function associated with the membership functions of these fuzzy numbers. An equivalent deterministic crisp model has been established in order to solve the proposed model. Finally, a numerical example is presented to illustrate the solution procedure.
International Nuclear Information System (INIS)
Stanco, L.; Vaccaro, V.G.; Funk, U.; Krueger, U.; Mika, K.; Wuestefeld, G.
1982-03-01
In the first part of this report a physical model is presented, which describes the deforming of a bunch in a storage ring influenced only by its own space charge field. A system of two differential equations for the density and the momentum of the particles is set up, which is independent of any special machine parameter. Due to the sign of the inductance of the chamber walls and the sign of the dispersion of the revolution frequency, we distinguish between a de-bunching and a self-bunching situation. The de-bunching corresponds to a nonlinear hyperbolic propagation problem well-known in gas dynamics, and the self-bunching to a nonlinear elliptic initial value problem. The second part deals with a mathematical and numerical treatment of an approximate equation for the hyperbolic case. For this nonlinear second order partial differential equation we first present three particular integrals: the solution by separating the variables, the similarity solution, and the solution for a parabolic initial distribution of the density. For a more realistic initial condition, we must resort to other methods: Results are obtained in three different ways, first from a highly accurate Taylor series expansion, second from a common finite difference method, and thirdly from the numerical method of characteristics. The appearance of a shock discontinuity is furthermore established in each of these cases. (orig.)
An introduction to fuzzy linear programming problems theory, methods and applications
Kaur, Jagdeep
2016-01-01
The book presents a snapshot of the state of the art in the field of fully fuzzy linear programming. The main focus is on showing current methods for finding the fuzzy optimal solution of fully fuzzy linear programming problems in which all the parameters and decision variables are represented by non-negative fuzzy numbers. It presents new methods developed by the authors, as well as existing methods developed by others, and their application to real-world problems, including fuzzy transportation problems. Moreover, it compares the outcomes of the different methods and discusses their advantages/disadvantages. As the first work to collect at one place the most important methods for solving fuzzy linear programming problems, the book represents a useful reference guide for students and researchers, providing them with the necessary theoretical and practical knowledge to deal with linear programming problems under uncertainty.
Directory of Open Access Journals (Sweden)
Weihua Jin
2013-01-01
Full Text Available This paper proposes a genetic-algorithms-based approach as an all-purpose problem-solving method for operation programming problems under uncertainty. The proposed method was applied for management of a municipal solid waste treatment system. Compared to the traditional interactive binary analysis, this approach has fewer limitations and is able to reduce the complexity in solving the inexact linear programming problems and inexact quadratic programming problems. The implementation of this approach was performed using the Genetic Algorithm Solver of MATLAB (trademark of MathWorks. The paper explains the genetic-algorithms-based method and presents details on the computation procedures for each type of inexact operation programming problems. A comparison of the results generated by the proposed method based on genetic algorithms with those produced by the traditional interactive binary analysis method is also presented.