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.
Takabe, Satoshi; Hukushima, Koji
2016-05-01
Typical behavior of the linear programming (LP) problem is studied as a relaxation of the minimum vertex cover (min-VC), a type of integer programming (IP) problem. A lattice-gas model on the Erdös-Rényi random graphs of α-uniform hyperedges is proposed to express both the LP and IP problems of the min-VC in the common statistical mechanical model with a one-parameter family. Statistical mechanical analyses reveal for α=2 that the LP optimal solution is typically equal to that given by the IP below the critical average degree c=e in the thermodynamic limit. The critical threshold for good accuracy of the relaxation extends the mathematical result c=1 and coincides with the replica symmetry-breaking threshold of the IP. The LP relaxation for the minimum hitting sets with α≥3, minimum vertex covers on α-uniform random graphs, is also studied. Analytic and numerical results strongly suggest that the LP relaxation fails to estimate optimal values above the critical average degree c=e/(α-1) where the replica symmetry is broken.
Takabe, Satoshi; Hukushima, Koji
2016-05-01
Typical behavior of the linear programming (LP) problem is studied as a relaxation of the minimum vertex cover (min-VC), a type of integer programming (IP) problem. A lattice-gas model on the Erdös-Rényi random graphs of α -uniform hyperedges is proposed to express both the LP and IP problems of the min-VC in the common statistical mechanical model with a one-parameter family. Statistical mechanical analyses reveal for α =2 that the LP optimal solution is typically equal to that given by the IP below the critical average degree c =e in the thermodynamic limit. The critical threshold for good accuracy of the relaxation extends the mathematical result c =1 and coincides with the replica symmetry-breaking threshold of the IP. The LP relaxation for the minimum hitting sets with α ≥3 , minimum vertex covers on α -uniform random graphs, is also studied. Analytic and numerical results strongly suggest that the LP relaxation fails to estimate optimal values above the critical average degree c =e /(α -1 ) where the replica symmetry is broken.
Regularized Label Relaxation Linear Regression.
Fang, Xiaozhao; Xu, Yong; Li, Xuelong; Lai, Zhihui; Wong, Wai Keung; Fang, Bingwu
2018-04-01
Linear regression (LR) and some of its variants have been widely used for classification problems. Most of these methods assume that during the learning phase, the training samples can be exactly transformed into a strict binary label matrix, which has too little freedom to fit the labels adequately. To address this problem, in this paper, we propose a novel regularized label relaxation LR method, which has the following notable characteristics. First, the proposed method relaxes the strict binary label matrix into a slack variable matrix by introducing a nonnegative label relaxation matrix into LR, which provides more freedom to fit the labels and simultaneously enlarges the margins between different classes as much as possible. Second, the proposed method constructs the class compactness graph based on manifold learning and uses it as the regularization item to avoid the problem of overfitting. The class compactness graph is used to ensure that the samples sharing the same labels can be kept close after they are transformed. Two different algorithms, which are, respectively, based on -norm and -norm loss functions are devised. These two algorithms have compact closed-form solutions in each iteration so that they are easily implemented. Extensive experiments show that these two algorithms outperform the state-of-the-art algorithms in terms of the classification accuracy and running time.
SOCP relaxation bounds for the optimal subset selection problem applied to robust linear regression
Flores, Salvador
2015-01-01
This paper deals with the problem of finding the globally optimal subset of h elements from a larger set of n elements in d space dimensions so as to minimize a quadratic criterion, with an special emphasis on applications to computing the Least Trimmed Squares Estimator (LTSE) for robust regression. The computation of the LTSE is a challenging subset selection problem involving a nonlinear program with continuous and binary variables, linked in a highly nonlinear fashion. The selection of a ...
Semidefinite linear complementarity problems
International Nuclear Information System (INIS)
Eckhardt, U.
1978-04-01
Semidefinite linear complementarity problems arise by discretization of variational inequalities describing e.g. elastic contact problems, free boundary value problems etc. In the present paper linear complementarity problems are introduced and the theory as well as the numerical treatment of them are described. In the special case of semidefinite linear complementarity problems a numerical method is presented which combines the advantages of elimination and iteration methods without suffering from their drawbacks. This new method has very attractive properties since it has a high degree of invariance with respect to the representation of the set of all feasible solutions of a linear complementarity problem by linear inequalities. By means of some practical applications the properties of the new method are demonstrated. (orig.) [de
Perturbed asymptotically linear problems
Bartolo, R.; Candela, A. M.; Salvatore, A.
2012-01-01
The aim of this paper is investigating the existence of solutions of some semilinear elliptic problems on open bounded domains when the nonlinearity is subcritical and asymptotically linear at infinity and there is a perturbation term which is just continuous. Also in the case when the problem has not a variational structure, suitable procedures and estimates allow us to prove that the number of distinct crtitical levels of the functional associated to the unperturbed problem is "stable" unde...
Non-linear calculation of PCRV using dynamic relaxation
International Nuclear Information System (INIS)
Schnellenbach, G.
1979-01-01
A brief review is presented of a numerical method called the dynamic relaxation method for stress analysis of the concrete in prestressed concrete pressure vessels. By this method the three-dimensional elliptic differential equations of the continuum are changed into the four-dimensional hyperbolic differential equations known as wave equations. The boundary value problem of the static system is changed into an initial and boundary value problem for which a solution exists if the physical system is defined at time t=0. The effect of non-linear stress-strain behaviour of the material as well as creep and cracking are considered
Optimality Bounds for a Variational Relaxation of the Image Partitioning Problem
Lellmann, Jan; Lenzen, Frank; Schnö rr, Christoph
2012-01-01
We consider a variational convex relaxation of a class of optimal partitioning and multiclass labeling problems, which has recently proven quite successful and can be seen as a continuous analogue of Linear Programming (LP) relaxation methods
Strong Relaxations for the Train Timetabling Problem Using Connected Configurations
Fischer, Frank; Schlechte, Thomas
2017-01-01
The task of the train timetabling problem or track allocation problem is to find conflict free schedules for a set of trains with predefined routes in a railway network. Especially for non-periodic instances models based on time expanded networks are often used. Unfortunately, the linear programming relaxation of these models is often extremely weak because these models do not describe combinatorial relations like overtaking possibilities very well. In this paper we extend the model by so cal...
A Global Optimization Algorithm for Sum of Linear Ratios Problem
Yuelin Gao; Siqiao Jin
2013-01-01
We equivalently transform the sum of linear ratios programming problem into bilinear programming problem, then by using the linear characteristics of convex envelope and concave envelope of double variables product function, linear relaxation programming of the bilinear programming problem is given, which can determine the lower bound of the optimal value of original problem. Therefore, a branch and bound algorithm for solving sum of linear ratios programming problem is put forward, and the c...
Modern problems of relaxation gas dynamics
International Nuclear Information System (INIS)
Losev, S.A.; Osipov, A.I.
1985-01-01
Some of the dynamical characteristics of relaxation processes are studied. Unfortunately, many dynamical characteristics of relaxation processes, necessary for the solution of important scientific and applied problems, are not known. These problems require further development of experimental methods of the study of nonequilibrium gas. It is known, that gas systems are shifted from the equilibrium by different methods: by acoustic and shock wav es, by means of gas expansion in nozzles and jets, by powerful radiations (laser, first of all), by electric discharges, in burning and combustion devices, etc. Non-equilibrium gas is produced in installations of continuum, impulse and periodic regime. Molecular beams, shock tubes (especially with nozzles), flow and jet installations, aerodynamical tubes, plasmatrons, vessels with a gas, influenced by the strong radiation, burners and combustion devices, where the study of non-euilibrium gas is helpful to solve the problems of the determination of kinetic equations and constants of physico-chemical kinetics
Relaxations to Sparse Optimization Problems and Applications
Skau, Erik West
Parsimony is a fundamental property that is applied to many characteristics in a variety of fields. Of particular interest are optimization problems that apply rank, dimensionality, or support in a parsimonious manner. In this thesis we study some optimization problems and their relaxations, and focus on properties and qualities of the solutions of these problems. The Gramian tensor decomposition problem attempts to decompose a symmetric tensor as a sum of rank one tensors.We approach the Gramian tensor decomposition problem with a relaxation to a semidefinite program. We study conditions which ensure that the solution of the relaxed semidefinite problem gives the minimal Gramian rank decomposition. Sparse representations with learned dictionaries are one of the leading image modeling techniques for image restoration. When learning these dictionaries from a set of training images, the sparsity parameter of the dictionary learning algorithm strongly influences the content of the dictionary atoms.We describe geometrically the content of trained dictionaries and how it changes with the sparsity parameter.We use statistical analysis to characterize how the different content is used in sparse representations. Finally, a method to control the structure of the dictionaries is demonstrated, allowing us to learn a dictionary which can later be tailored for specific applications. Variations of dictionary learning can be broadly applied to a variety of applications.We explore a pansharpening problem with a triple factorization variant of coupled dictionary learning. Another application of dictionary learning is computer vision. Computer vision relies heavily on object detection, which we explore with a hierarchical convolutional dictionary learning model. Data fusion of disparate modalities is a growing topic of interest.We do a case study to demonstrate the benefit of using social media data with satellite imagery to estimate hazard extents. In this case study analysis we
A Global Optimization Algorithm for Sum of Linear Ratios Problem
Directory of Open Access Journals (Sweden)
Yuelin Gao
2013-01-01
Full Text Available We equivalently transform the sum of linear ratios programming problem into bilinear programming problem, then by using the linear characteristics of convex envelope and concave envelope of double variables product function, linear relaxation programming of the bilinear programming problem is given, which can determine the lower bound of the optimal value of original problem. Therefore, a branch and bound algorithm for solving sum of linear ratios programming problem is put forward, and the convergence of the algorithm is proved. Numerical experiments are reported to show the effectiveness of the proposed algorithm.
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
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.
Directory of Open Access Journals (Sweden)
Agarwal RaviP
2009-01-01
Full Text Available We glance at recent advances to the general theory of maximal (set-valued monotone mappings and their role demonstrated to examine the convex programming and closely related field of nonlinear variational inequalities. We focus mostly on applications of the super-relaxed ( -proximal point algorithm to the context of solving a class of nonlinear variational inclusion problems, based on the notion of maximal ( -monotonicity. Investigations highlighted in this communication are greatly influenced by the celebrated work of Rockafellar (1976, while others have played a significant part as well in generalizing the proximal point algorithm considered by Rockafellar (1976 to the case of the relaxed proximal point algorithm by Eckstein and Bertsekas (1992. Even for the linear convergence analysis for the overrelaxed (or super-relaxed ( -proximal point algorithm, the fundamental model for Rockafellar's case does the job. Furthermore, we attempt to explore possibilities of generalizing the Yosida regularization/approximation in light of maximal ( -monotonicity, and then applying to first-order evolution equations/inclusions.
Relaxation Methods for Strictly Convex Regularizations of Piecewise Linear Programs
International Nuclear Information System (INIS)
Kiwiel, K. C.
1998-01-01
We give an algorithm for minimizing the sum of a strictly convex function and a convex piecewise linear function. It extends several dual coordinate ascent methods for large-scale linearly constrained problems that occur in entropy maximization, quadratic programming, and network flows. In particular, it may solve exact penalty versions of such (possibly inconsistent) problems, and subproblems of bundle methods for nondifferentiable optimization. It is simple, can exploit sparsity, and in certain cases is highly parallelizable. Its global convergence is established in the recent framework of B -functions (generalized Bregman functions)
Optimal overlapping of waveform relaxation method for linear differential equations
International Nuclear Information System (INIS)
Yamada, Susumu; Ozawa, Kazufumi
2000-01-01
Waveform relaxation (WR) method is extremely suitable for solving large systems of ordinary differential equations (ODEs) on parallel computers, but the convergence of the method is generally slow. In order to accelerate the convergence, the methods which decouple the system into many subsystems with overlaps some of the components between the adjacent subsystems have been proposed. The methods, in general, converge much faster than the ones without overlapping, but the computational cost per iteration becomes larger due to the increase of the dimension of each subsystem. In this research, the convergence of the WR method for solving constant coefficients linear ODEs is investigated and the strategy to determine the number of overlapped components which minimizes the cost of the parallel computations is proposed. Numerical experiments on an SR2201 parallel computer show that the estimated number of the overlapped components by the proposed strategy is reasonable. (author)
Relaxations of semiring constraint satisfaction problems
CSIR Research Space (South Africa)
Leenen, L
2007-03-01
Full Text Available The Semiring Constraint Satisfaction Problem (SCSP) framework is a popular approach for the representation of partial constraint satisfaction problems. In this framework preferences can be associated with tuples of values of the variable domains...
Efficient decomposition and linearization methods for the stochastic transportation problem
International Nuclear Information System (INIS)
Holmberg, K.
1993-01-01
The stochastic transportation problem can be formulated as a convex transportation problem with nonlinear objective function and linear constraints. We compare several different methods based on decomposition techniques and linearization techniques for this problem, trying to find the most efficient method or combination of methods. We discuss and test a separable programming approach, the Frank-Wolfe method with and without modifications, the new technique of mean value cross decomposition and the more well known Lagrangian relaxation with subgradient optimization, as well as combinations of these approaches. Computational tests are presented, indicating that some new combination methods are quite efficient for large scale problems. (authors) (27 refs.)
RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM
Umetani, Shunji; Yagiura, Mutsunori; 柳浦, 睦憲
2007-01-01
The set covering problem (SCP) is one of representative combinatorial optimization problems, which has many practical applications. The continuous development of mathematical programming has derived a number of impressive heuristic algorithms as well as exact branch-and-bound algorithms, which can solve huge SCP instances of bus, railway and airline crew scheduling problems. We survey heuristic algorithms for SCP focusing mainly on contributions of mathematical programming techniques to heuri...
Application of the expansion in Maxwellians to the solution of temperature relaxation problems
International Nuclear Information System (INIS)
Ender, A.Y.; Ender, I.A.
1985-01-01
This paper discusses the temperature relaxation problem: it is assumed that at an initial moment in a spatially uniform rarefied gas the distribution function is given in the form of two Maxwellians with arbitrary temperatures. It is required to determine the velocity distribution function for all moments of time. In the linear version of the problem at the initial time only one Maxwellian is considered whose temperature may differ by any amount from the background temperature. The authors note that in treating temperature relaxation problems it is not sufficient to determine the time dependence of energy assuming that the distribution function is a Maxwellian one at all times
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.
Templates for Linear Algebra Problems
Bai, Z.; Day, D.; Demmel, J.; Dongarra, J.; Gu, M.; Ruhe, A.; Vorst, H.A. van der
1995-01-01
The increasing availability of advanced-architecture computers is having a very signicant eect on all spheres of scientic computation, including algorithm research and software development in numerical linear algebra. Linear algebra {in particular, the solution of linear systems of equations and
Hypothesis of linear relaxation and ion mobility in neutral gases
International Nuclear Information System (INIS)
Naudy, Michel
1980-01-01
The objective of this research thesis is to propose a theory of ion mobility in neutral gases, based on the hypothesis of linear relaxation, in order to obtain simple formula and a good agreement with experiment. The author first presents some generalities on ion mobility such as history and values of interest, and some notions about the way experimental results are obtained, and then theories proposed from 1903 to 1976. He reports two tests. The first one, based on the Boltzmann equation, is based on a method of moments, and requires the use of a computer, but does not give results in good agreement with the experiment. Thus, for the second test, the author used a kinetic equation similar to one used for the study of neutral gas viscosity. This kinetic equation is used for the study of ion mobility in neutral gases, and the author shows that, with a Sutherland potential, a simple formula can be obtained, the results of which can be obtained with a pocket calculator. Moreover, these results are in agreement with experimental values over a portion of the experimental range. In order to reach an agreement over the whole experimental range, a possibility has been to use, in some cases, a more realistic interaction potential. However, a computer was then necessary [fr
Relaxation cracking in the process industry, an underestimated problem
Energy Technology Data Exchange (ETDEWEB)
Wortel, J.C. van [TNO Institute of Industrial Technology, Apeldoorn (Netherlands)
1998-12-31
Austenitic components, operating between 500 and 750 deg C, can fail within 1 year service while the ordinary mechanical properties after failure are still within the code requirements. The intergranular brittle failures are situated in the welded or cold deformed areas. This type of cracking has many names, showing the uncertainty concerning the mechanism for the (catastrophical) failures. A just finished investigation showed that it is a relaxation crack problem, introduced by manufacturing processes, especially welding and cold rolling. Cracking/failures can be expected after only 0.1- 0.2 % relaxation strain. These low strain values can already be generated during relaxation of the welding stresses. Especially coarse grained `age hardening` materials are susceptible. Stabilising and Postweld Heat Treatments are very effective to avoid relaxation crack problems during operation. After these heat treatments the components can withstand more than 2 % relaxation strain. At temperatures between 500 and 750 deg C relaxation cracking is the predominant factor for the safety and lifetime of welded austenitic components. (orig.) 12 refs.
Relaxation cracking in the process industry, an underestimated problem
Energy Technology Data Exchange (ETDEWEB)
Wortel, J.C. van [TNO Institute of Industrial Technology, Apeldoorn (Netherlands)
1999-12-31
Austenitic components, operating between 500 and 750 deg C, can fail within 1 year service while the ordinary mechanical properties after failure are still within the code requirements. The intergranular brittle failures are situated in the welded or cold deformed areas. This type of cracking has many names, showing the uncertainty concerning the mechanism for the (catastrophical) failures. A just finished investigation showed that it is a relaxation crack problem, introduced by manufacturing processes, especially welding and cold rolling. Cracking/failures can be expected after only 0.1- 0.2 % relaxation strain. These low strain values can already be generated during relaxation of the welding stresses. Especially coarse grained `age hardening` materials are susceptible. Stabilising and Postweld Heat Treatments are very effective to avoid relaxation crack problems during operation. After these heat treatments the components can withstand more than 2 % relaxation strain. At temperatures between 500 and 750 deg C relaxation cracking is the predominant factor for the safety and lifetime of welded austenitic components. (orig.) 12 refs.
Optimality Bounds for a Variational Relaxation of the Image Partitioning Problem
Lellmann, Jan
2012-11-09
We consider a variational convex relaxation of a class of optimal partitioning and multiclass labeling problems, which has recently proven quite successful and can be seen as a continuous analogue of Linear Programming (LP) relaxation methods for finite-dimensional problems. While for the latter several optimality bounds are known, to our knowledge no such bounds exist in the infinite-dimensional setting. We provide such a bound by analyzing a probabilistic rounding method, showing that it is possible to obtain an integral solution of the original partitioning problem from a solution of the relaxed problem with an a priori upper bound on the objective. The approach has a natural interpretation as an approximate, multiclass variant of the celebrated coarea formula. © 2012 Springer Science+Business Media New York.
Directory of Open Access Journals (Sweden)
Minghua Xu
2014-01-01
Full Text Available We consider the problem of seeking a symmetric positive semidefinite matrix in a closed convex set to approximate a given matrix. This problem may arise in several areas of numerical linear algebra or come from finance industry or statistics and thus has many applications. For solving this class of matrix optimization problems, many methods have been proposed in the literature. The proximal alternating direction method is one of those methods which can be easily applied to solve these matrix optimization problems. Generally, the proximal parameters of the proximal alternating direction method are greater than zero. In this paper, we conclude that the restriction on the proximal parameters can be relaxed for solving this kind of matrix optimization problems. Numerical experiments also show that the proximal alternating direction method with the relaxed proximal parameters is convergent and generally has a better performance than the classical proximal alternating direction method.
Stochastic Linear Quadratic Optimal Control Problems
International Nuclear Information System (INIS)
Chen, S.; Yong, J.
2001-01-01
This paper is concerned with the stochastic linear quadratic optimal control problem (LQ problem, for short) for which the coefficients are allowed to be random and the cost functional is allowed to have a negative weight on the square of the control variable. Some intrinsic relations among the LQ problem, the stochastic maximum principle, and the (linear) forward-backward stochastic differential equations are established. Some results involving Riccati equation are discussed as well
Numerical algorithms for contact problems in linear elastostatics
International Nuclear Information System (INIS)
Barbosa, H.J.C.; Feijoo, R.A.
1984-01-01
In this work contact problems in linear elasticity are analysed by means of Finite Elements and Mathematical Programming Techniques. The principle of virtual work leads in this case to a variational inequality which in turn is equivalent, for Hookean materials and infinitesimal strains, to the minimization of the total potential energy over the set of all admissible virtual displacements. The use of Gauss-Seidel algorithm with relaxation and projection and also Lemke's algorithm and Uzawa's algorithm for solving the minimization problem is discussed. Finally numerical examples are presented. (Author) [pt
International Nuclear Information System (INIS)
Wong, P.K.
1989-01-01
This paper reports on a study to obtain the creep compliance, the relaxation modulus and the complex compliance derived from the concept of mechanical resistance for the constitutive equation of a class of linear viscoelastic, homogeneous, isotropic materials
Perturbation analysis of linear control problems
International Nuclear Information System (INIS)
Petkov, Petko; Konstantinov, Mihail
2017-01-01
The paper presents a brief overview of the technique of splitting operators, proposed by the authors and intended for perturbation analysis of control problems involving unitary and orthogonal matrices. Combined with the technique of Lyapunov majorants and the implementation of the Banach and Schauder fixed point principles, it allows to obtain rigorous non-local perturbation bounds for a set of sensitivity analysis problems. Among them are the reduction of linear systems into orthogonal canonical forms, the feedback synthesis problem and pole assignment problem in particular, as well as other important problems in control theory and linear algebra. Key words: perturbation analysis, canonical forms, feedback synthesis
Pettermann, Heinz E.; DeSimone, Antonio
2017-09-01
A constitutive material law for linear thermo-viscoelasticity in the time domain is presented. The time-dependent relaxation formulation is given for full anisotropy, i.e., both the elastic and the viscous properties are anisotropic. Thereby, each element of the relaxation tensor is described by its own and independent Prony series expansion. Exceeding common viscoelasticity, time-dependent thermal expansion relaxation/creep is treated as inherent material behavior. The pertinent equations are derived and an incremental, implicit time integration scheme is presented. The developments are implemented into an implicit FEM software for orthotropic material symmetry under plane stress assumption. Even if this is a reduced problem, all essential features are present and allow for the entire verification and validation of the approach. Various simulations on isotropic and orthotropic problems are carried out to demonstrate the material behavior under investigation.
Non-linear effects in the Snoek relaxation of Nb-O
International Nuclear Information System (INIS)
Hermida, E.B.; Povolo, F.
1996-01-01
Internal friction peaks measured as a function of temperature or frequency have been associated to non-linear processes only after studying how the amplitude of the applied stress affects the relaxation process. Here it is demonstrated that the partial derivative of the internal friction with respect to the frequency at constant temperature is a useful tool to determine that non-linear effects are involved. This analysis applied to actual data of the Snoek relaxation in Nb-O, reveals that at high interstitial contents non-linear effects appear. (orig.)
Convex variational problems linear, nearly linear and anisotropic growth conditions
Bildhauer, Michael
2003-01-01
The author emphasizes a non-uniform ellipticity condition as the main approach to regularity theory for solutions of convex variational problems with different types of non-standard growth conditions. This volume first focuses on elliptic variational problems with linear growth conditions. Here the notion of a "solution" is not obvious and the point of view has to be changed several times in order to get some deeper insight. Then the smoothness properties of solutions to convex anisotropic variational problems with superlinear growth are studied. In spite of the fundamental differences, a non-uniform ellipticity condition serves as the main tool towards a unified view of the regularity theory for both kinds of problems.
Students’ difficulties in solving linear equation problems
Wati, S.; Fitriana, L.; Mardiyana
2018-03-01
A linear equation is an algebra material that exists in junior high school to university. It is a very important material for students in order to learn more advanced mathematics topics. Therefore, linear equation material is essential to be mastered. However, the result of 2016 national examination in Indonesia showed that students’ achievement in solving linear equation problem was low. This fact became a background to investigate students’ difficulties in solving linear equation problems. This study used qualitative descriptive method. An individual written test on linear equation tasks was administered, followed by interviews. Twenty-one sample students of grade VIII of SMPIT Insan Kamil Karanganyar did the written test, and 6 of them were interviewed afterward. The result showed that students with high mathematics achievement donot have difficulties, students with medium mathematics achievement have factual difficulties, and students with low mathematics achievement have factual, conceptual, operational, and principle difficulties. Based on the result there is a need of meaningfulness teaching strategy to help students to overcome difficulties in solving linear equation problems.
Inverse problems in linear transport theory
International Nuclear Information System (INIS)
Dressler, K.
1988-01-01
Inverse problems for a class of linear kinetic equations are investigated. The aim is to identify the scattering kernel of a transport equation (corresponding to the structure of a background medium) by observing the 'albedo' part of the solution operator for the corresponding direct initial boundary value problem. This means to get information on some integral operator in an integrodifferential equation through on overdetermined boundary value problem. We first derive a constructive method for solving direct halfspace problems and prove a new factorization theorem for the solutions. Using this result we investigate stationary inverse problems with respect to well posedness (e.g. reduce them to classical ill-posed problems, such as integral equations of first kind). In the time-dependent case we show that a quite general inverse problem is well posed and solve it constructively. (orig.)
Invariant imbedding equations for linear scattering problems
International Nuclear Information System (INIS)
Apresyan, L.
1988-01-01
A general form of the invariant imbedding equations is investigated for the linear problem of scattering by a bounded scattering volume. The conditions for the derivability of such equations are described. It is noted that the possibility of the explicit representation of these equations for a sphere and for a layer involves the separation of variables in the unperturbed wave equation
Quantization of the Linearized Kepler Problem
Guerrero, Julio; Perez, Jose Miguel
2003-01-01
The linearized Kepler problem is considered, as obtained from the Kustaanheimo-Stiefel (K-S)transformation, both for negative and positive energies. The symmetry group for the Kepler problem turns out to be SU(2,2). For negative energies, the Hamiltonian of Kepler problem can be realized as the sum of the energies of four harmonic oscillator with the same frequency, with a certain constrain. For positive energies, it can be realized as the sum of the energies of four repulsive oscillator with...
About the role of constraints in the linear relaxational behaviour of thermodynamic systems
Jongschaap, R.J.J.
1978-01-01
A formalism is presented by which the linear relaxational behaviour of thermodynamic systems can be described. Instead of using the concept of internal variables of state a set of so-called constraint equations is introduced. These equations represent structural properties of the system and turn out
Identification problems in linear transformation system
International Nuclear Information System (INIS)
Delforge, Jacques.
1975-01-01
An attempt was made to solve the theoretical and numerical difficulties involved in the identification problem relative to the linear part of P. Delattre's theory of transformation systems. The theoretical difficulties are due to the very important problem of the uniqueness of the solution, which must be demonstrated in order to justify the value of the solution found. Simple criteria have been found when measurements are possible on all the equivalence classes, but the problem remains imperfectly solved when certain evolution curves are unknown. The numerical difficulties are of two kinds: a slow convergence of iterative methods and a strong repercussion of numerical and experimental errors on the solution. In the former case a fast convergence was obtained by transformation of the parametric space, while in the latter it was possible, from sensitivity functions, to estimate the errors, to define and measure the conditioning of the identification problem then to minimize this conditioning as a function of the experimental conditions [fr
Stability problems for linear hyperbolic systems
International Nuclear Information System (INIS)
Eckhoff, K.S.
1975-05-01
The stability properties for the trivial solution of a general linear hyperbolic system of partial differential equations of the first order are studied. It is shown that results may be obtained by studying the stability properties of certain systems of ordinary differential equations which can be constructed from the hyperbolic system (the so-called transport equations). In some cases the associated stability problem for the transport equations can in fact be shown to be equivalent to the stability problem for the hyperbolic system, but in general the transport equations will only give the necessary conditions for stability. (Auth.)
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.
An Entropic Estimator for Linear Inverse Problems
Directory of Open Access Journals (Sweden)
Amos Golan
2012-05-01
Full Text Available In this paper we examine an Information-Theoretic method for solving noisy linear inverse estimation problems which encompasses under a single framework a whole class of estimation methods. Under this framework, the prior information about the unknown parameters (when such information exists, and constraints on the parameters can be incorporated in the statement of the problem. The method builds on the basics of the maximum entropy principle and consists of transforming the original problem into an estimation of a probability density on an appropriate space naturally associated with the statement of the problem. This estimation method is generic in the sense that it provides a framework for analyzing non-normal models, it is easy to implement and is suitable for all types of inverse problems such as small and or ill-conditioned, noisy data. First order approximation, large sample properties and convergence in distribution are developed as well. Analytical examples, statistics for model comparisons and evaluations, that are inherent to this method, are discussed and complemented with explicit examples.
Solving fault diagnosis problems linear synthesis techniques
Varga, Andreas
2017-01-01
This book addresses fault detection and isolation topics from a computational perspective. Unlike most existing literature, it bridges the gap between the existing well-developed theoretical results and the realm of reliable computational synthesis procedures. The model-based approach to fault detection and diagnosis has been the subject of ongoing research for the past few decades. While the theoretical aspects of fault diagnosis on the basis of linear models are well understood, most of the computational methods proposed for the synthesis of fault detection and isolation filters are not satisfactory from a numerical standpoint. Several features make this book unique in the fault detection literature: Solution of standard synthesis problems in the most general setting, for both continuous- and discrete-time systems, regardless of whether they are proper or not; consequently, the proposed synthesis procedures can solve a specific problem whenever a solution exists Emphasis on the best numerical algorithms to ...
Numerical stability in problems of linear algebra.
Babuska, I.
1972-01-01
Mathematical problems are introduced as mappings from the space of input data to that of the desired output information. Then a numerical process is defined as a prescribed recurrence of elementary operations creating the mapping of the underlying mathematical problem. The ratio of the error committed by executing the operations of the numerical process (the roundoff errors) to the error introduced by perturbations of the input data (initial error) gives rise to the concept of lambda-stability. As examples, several processes are analyzed from this point of view, including, especially, old and new processes for solving systems of linear algebraic equations with tridiagonal matrices. In particular, it is shown how such a priori information can be utilized as, for instance, a knowledge of the row sums of the matrix. Information of this type is frequently available where the system arises in connection with the numerical solution of differential equations.
Parametrices and exact paralinearization of semi-linear boundary problems
DEFF Research Database (Denmark)
Johnsen, Jon
2008-01-01
The subject is parametrices for semi-linear problems, based on parametrices for linear boundary problems and on non-linearities that decompose into solution-dependent linear operators acting on the solutions. Non-linearities of product type are shown to admit this via exact paralinearization...... of homogeneous distributions, tensor products and halfspace extensions have been revised. Examples include the von Karman equation....
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...
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,
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).
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...
The linear ordering problem: an algorithm for the optimal solution ...
African Journals Online (AJOL)
In this paper we describe and implement an algorithm for the exact solution of the Linear Ordering problem. Linear Ordering is the problem of finding a linear order of the nodes of a graph such that the sum of the weights which are consistent with this order is as large as possible. It is an NP - Hard combinatorial optimisation ...
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 ...
Producing Satisfactory Solutions to Scheduling Problems: An Iterative Constraint Relaxation Approach
Chien, S.; Gratch, J.
1994-01-01
One drawback to using constraint-propagation in planning and scheduling systems is that when a problem has an unsatisfiable set of constraints such algorithms typically only show that no solution exists. While, technically correct, in practical situations, it is desirable in these cases to produce a satisficing solution that satisfies the most important constraints (typically defined in terms of maximizing a utility function). This paper describes an iterative constraint relaxation approach in which the scheduler uses heuristics to progressively relax problem constraints until the problem becomes satisfiable. We present empirical results of applying these techniques to the problem of scheduling spacecraft communications for JPL/NASA antenna resources.
Microlocal analysis of a seismic linearized inverse problem
Stolk, C.C.
1999-01-01
The seismic inverse problem is to determine the wavespeed c x in the interior of a medium from measurements at the boundary In this paper we analyze the linearized inverse problem in general acoustic media The problem is to nd a left inverse of the linearized forward map F or equivalently to nd the
Health physics problems encountered in the Saclay linear accelerator
International Nuclear Information System (INIS)
Delsaut, R.
1979-01-01
The safety and health physics problems specific to the Saclay linear accelerator are presented: activation (of gases, dust, water, structural materials, targets); individual dosimetry; the safety engineering [fr
Two-relaxation-time lattice Boltzmann method for the anisotropic dispersive Henry problem
Servan-Camas, Borja; Tsai, Frank T.-C.
2010-02-01
This study develops a lattice Boltzmann method (LBM) with a two-relaxation-time collision operator (TRT) to cope with anisotropic heterogeneous hydraulic conductivity and anisotropic velocity-dependent hydrodynamic dispersion in the saltwater intrusion problem. The directional-speed-of-sound technique is further developed to address anisotropic hydraulic conductivity and dispersion tensors. Forcing terms are introduced in the LBM to correct numerical errors that arise during the recovery procedure and to describe the sink/source terms in the flow and transport equations. In order to facilitate the LBM implementation, the forcing terms are combined with the equilibrium distribution functions (EDFs) to create pseudo-EDFs. This study performs linear stability analysis and derives LBM stability domains to solve the anisotropic advection-dispersion equation. The stability domains are used to select the time step at which the lattice Boltzmann method provides stable solutions to the numerical examples. The LBM was implemented for the anisotropic dispersive Henry problem with high ratios of longitudinal to transverse dispersivities, and the results compared well to the solutions in the work of Abarca et al. (2007).
Students' errors in solving linear equation word problems: Case ...
African Journals Online (AJOL)
The study examined errors students make in solving linear equation word problems with a view to expose the nature of these errors and to make suggestions for classroom teaching. A diagnostic test comprising 10 linear equation word problems, was administered to a sample (n=130) of senior high school first year Home ...
An Optimal Linear Coding for Index Coding Problem
Pezeshkpour, Pouya
2015-01-01
An optimal linear coding solution for index coding problem is established. Instead of network coding approach by focus on graph theoric and algebraic methods a linear coding program for solving both unicast and groupcast index coding problem is presented. The coding is proved to be the optimal solution from the linear perspective and can be easily utilize for any number of messages. The importance of this work is lying mostly on the usage of the presented coding in the groupcast index coding ...
International Nuclear Information System (INIS)
Wolnik, Barbara; Dembowski, Marcin; Bołt, Witold; Baetens, Jan M; De Baets, Bernard
2017-01-01
The focus of this paper is on the density classification problem in the context of affine continuous cellular automata. Although such cellular automata cannot solve this problem in the classical sense, most density-conserving affine continuous cellular automata with a unit neighborhood radius are valid solutions of a slightly relaxed version of this problem. This result follows from a detailed study of the dynamics of the density-conserving affine continuous cellular automata that we introduce. (paper)
The regular indefinite linear-quadratic problem with linear endpoint constraints
Soethoudt, J.M.; Trentelman, H.L.
1989-01-01
This paper deals with the infinite horizon linear-quadratic problem with indefinite cost. Given a linear system, a quadratic cost functional and a subspace of the state space, we consider the problem of minimizing the cost functional over all inputs for which the state trajectory converges to that
Turnpike theory of continuous-time linear optimal control problems
Zaslavski, Alexander J
2015-01-01
Individual turnpike results are of great interest due to their numerous applications in engineering and in economic theory; in this book the study is focused on new results of turnpike phenomenon in linear optimal control problems. The book is intended for engineers as well as for mathematicians interested in the calculus of variations, optimal control, and in applied functional analysis. Two large classes of problems are studied in more depth. The first class studied in Chapter 2 consists of linear control problems with periodic nonsmooth convex integrands. Chapters 3-5 consist of linear control problems with autonomous nonconvex and nonsmooth integrands. Chapter 6 discusses a turnpike property for dynamic zero-sum games with linear constraints. Chapter 7 examines genericity results. In Chapter 8, the description of structure of variational problems with extended-valued integrands is obtained. Chapter 9 ends the exposition with a study of turnpike phenomenon for dynamic games with extended value integran...
LinvPy : a Python package for linear inverse problems
Beaud, Guillaume François Paul
2016-01-01
The goal of this project is to make a Python package including the tau-estimator algorithm to solve linear inverse problems. The package must be distributed, well documented, easy to use and easy to extend for future developers.
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.
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
Experiences with linear solvers for oil reservoir simulation problems
Energy Technology Data Exchange (ETDEWEB)
Joubert, W.; Janardhan, R. [Los Alamos National Lab., NM (United States); Biswas, D.; Carey, G.
1996-12-31
This talk will focus on practical experiences with iterative linear solver algorithms used in conjunction with Amoco Production Company`s Falcon oil reservoir simulation code. The goal of this study is to determine the best linear solver algorithms for these types of problems. The results of numerical experiments will be presented.
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.
Solution of linear ill-posed problems using overcomplete dictionaries
Pensky, Marianna
2016-01-01
In the present paper we consider application of overcomplete dictionaries to solution of general ill-posed linear inverse problems. Construction of an adaptive optimal solution for such problems usually relies either on a singular value decomposition or representation of the solution via an orthonormal basis. The shortcoming of both approaches lies in the fact that, in many situations, neither the eigenbasis of the linear operator nor a standard orthonormal basis constitutes an appropriate co...
Global optimization of truss topology with discrete bar areas—Part I: Theory of relaxed problems
DEFF Research Database (Denmark)
Achtziger, Wolfgang; Stolpe, Mathias
2008-01-01
the case of discrete areas. This problem is of major practical relevance if the truss must be built from pre-produced bars with given areas. As a special case, we consider the design problem for a single bar area, i.e., a 0/1-problem. In contrast to heuristic methods considered in other approaches, Part I....... The main issue of the paper and of the approach lies in the fact that the relaxed nonlinear optimization problem can be formulated as a quadratic program (QP). Here the paper generalizes and extends the available theory from the literature. Although the Hessian of this QP is indefinite, it is possible...
Essential linear algebra with applications a problem-solving approach
Andreescu, Titu
2014-01-01
This textbook provides a rigorous introduction to linear algebra in addition to material suitable for a more advanced course while emphasizing the subject’s interactions with other topics in mathematics such as calculus and geometry. A problem-based approach is used to develop the theoretical foundations of vector spaces, linear equations, matrix algebra, eigenvectors, and orthogonality. Key features include: • a thorough presentation of the main results in linear algebra along with numerous examples to illustrate the theory; • over 500 problems (half with complete solutions) carefully selected for their elegance and theoretical significance; • an interleaved discussion of geometry and linear algebra, giving readers a solid understanding of both topics and the relationship between them. Numerous exercises and well-chosen examples make this text suitable for advanced courses at the junior or senior levels. It can also serve as a source of supplementary problems for a sophomore-level course. ...
Inverse Modelling Problems in Linear Algebra Undergraduate Courses
Martinez-Luaces, Victor E.
2013-01-01
This paper will offer an analysis from a theoretical point of view of mathematical modelling, applications and inverse problems of both causation and specification types. Inverse modelling problems give the opportunity to establish connections between theory and practice and to show this fact, a simple linear algebra example in two different…
Students' errors in solving linear equation word problems: Case ...
African Journals Online (AJOL)
kofi.mereku
Development in most areas of life is based on effective knowledge of science and ... Problem solving, as used in mathematics education literature, refers ... word problems, on the other hand, are those linear equation tasks or ... taught LEWPs in the junior high school, many of them reach the senior high school without a.
Directory of Open Access Journals (Sweden)
Yi-hua Zhong
2013-01-01
Full Text Available Recently, various methods have been developed for solving linear programming problems with fuzzy number, such as simplex method and dual simplex method. But their computational complexities are exponential, which is not satisfactory for solving large-scale fuzzy linear programming problems, especially in the engineering field. A new method which can solve large-scale fuzzy number linear programming problems is presented in this paper, which is named a revised interior point method. Its idea is similar to that of interior point method used for solving linear programming problems in crisp environment before, but its feasible direction and step size are chosen by using trapezoidal fuzzy numbers, linear ranking function, fuzzy vector, and their operations, and its end condition is involved in linear ranking function. Their correctness and rationality are proved. Moreover, choice of the initial interior point and some factors influencing the results of this method are also discussed and analyzed. The result of algorithm analysis and example study that shows proper safety factor parameter, accuracy parameter, and initial interior point of this method may reduce iterations and they can be selected easily according to the actual needs. Finally, the method proposed in this paper is an alternative method for solving fuzzy number linear programming problems.
Shivokhin, Maksim E.
2017-05-30
We propose and verify methods based on the slip-spring (SSp) model [ Macromolecules 2005, 38, 14 ] for predicting the effect of any monodisperse, binary, or ternary environment of topological constraints on the relaxation of the end-to-end vector of a linear probe chain. For this purpose we first validate the ability of the model to consistently predict both the viscoelastic and dielectric response of monodisperse and binary mixtures of type A polymers, based on published experimental data. We also report the synthesis of new binary and ternary polybutadiene systems, the measurement of their linear viscoelastic response, and the prediction of these data by the SSp model. We next clarify the relaxation mechanisms of probe chains in these constraint release (CR) environments by analyzing a set of "toy" SSp models with simplified constraint release rates, by examining fluctuations of the end-to-end vector. In our analysis, the longest relaxation time of the probe chain is determined by a competition between the longest relaxation times of the effective CR motions of the fat and thin tubes and the motion of the chain itself in the thin tube. This picture is tested by the analysis of four model systems designed to separate and estimate every single contribution involved in the relaxation of the probe\\'s end-to-end vector in polydisperse systems. We follow the CR picture of Viovy et al. [ Macromolecules 1991, 24, 3587 ] and refine the effective chain friction in the thin and fat tubes based on Read et al. [ J. Rheol. 2012, 56, 823 ]. The derived analytical equations form a basis for generalizing the proposed methodology to polydisperse mixtures of linear and branched polymers. The consistency between the SSp model and tube model predictions is a strong indicator of the compatibility between these two distinct mesoscopic frameworks.
Perfect, Michelle M.; Elkins, Gary R.
2014-01-01
Inadequate sleep among adolescents frequently contributes to obesity and reduced academic performance, along with symptoms of anxiety, depression, fatigue, and attention deficits. The etiological bases of sleep quality has been associated with both stress and sleep habits. These problems tend to be especially important for adolescents with diabetes as the effects of poor sleep complicate health outcomes. This case example concerns a 14-year-old adolescent girl with a history of type I diabetes and stress-related sleep difficulties. Treatment included cognitive–behavioral methods and hypnotic relaxation therapy. Results of this case example and other controlled research suggest that hypnotic relaxation therapy is well accepted, results in good compliance, and serves as a useful adjunctive to cognitive–behavioral intervention for sleep problems. PMID:20865769
Particle swarm optimization - Genetic algorithm (PSOGA) on linear transportation problem
Rahmalia, Dinita
2017-08-01
Linear Transportation Problem (LTP) is the case of constrained optimization where we want to minimize cost subject to the balance of the number of supply and the number of demand. The exact method such as northwest corner, vogel, russel, minimal cost have been applied at approaching optimal solution. In this paper, we use heurisitic like Particle Swarm Optimization (PSO) for solving linear transportation problem at any size of decision variable. In addition, we combine mutation operator of Genetic Algorithm (GA) at PSO to improve optimal solution. This method is called Particle Swarm Optimization - Genetic Algorithm (PSOGA). The simulations show that PSOGA can improve optimal solution resulted by PSO.
An improved Lagrangian relaxation and dual ascent approach to facility location problems
DEFF Research Database (Denmark)
Jörnsten, Kurt; Klose, Andreas
2016-01-01
not be reduced to the same extent as in the case of ordinary semi-Lagrangian relaxation. Hence, an effective method for optimizing the Lagrangian dual function is of utmost importance for obtaining a computational advantage from the simplified Lagrangian dual function. In this paper, we suggest a new dual ascent...... method for optimizing both the semi-Lagrangian dual function as well as its simplified form for the case of a generic discrete facility location problem and apply the method to the uncapacitated facility location problem. Our computational results show that the method generally only requires a very few...
One-Dimensional Problem of a Conducting Viscous Fluid with One Relaxation Time
Directory of Open Access Journals (Sweden)
Angail A. Samaan
2011-01-01
Full Text Available We introduce a magnetohydrodynamic model of boundary-layer equations for conducting viscous fluids. This model is applied to study the effects of free convection currents with thermal relaxation time on the flow of a viscous conducting fluid. The method of the matrix exponential formulation for these equations is introduced. The resulting formulation together with the Laplace transform technique is applied to a variety problems. The effects of a plane distribution of heat sources on the whole and semispace are studied. Numerical results are given and illustrated graphically for the problem.
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.
On a linear-quadratic problem with Caputo derivative
Directory of Open Access Journals (Sweden)
Dariusz Idczak
2016-01-01
Full Text Available In this paper, we study a linear-quadratic optimal control problem with a fractional control system containing a Caputo derivative of unknown function. First, we derive the formulas for the differential and gradient of the cost functional under given constraints. Next, we prove an existence result and derive a maximum principle. Finally, we describe the gradient and projection of the gradient methods for the problem under consideration.
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.
Bochev, Mikhail A.; Oseledets, I.V.; Tyrtyshnikov, E.E.
2013-01-01
The aim of this paper is two-fold. First, we propose an efficient implementation of the continuous time waveform relaxation method based on block Krylov subspaces. Second, we compare this new implementation against Krylov subspace methods combined with the shift and invert technique.
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.
Beam dynamics problems for next generation linear colliders
International Nuclear Information System (INIS)
Yokoya, Kaoru
1990-01-01
The most critical issue for the feasibility of high-energy e + e - linear colliders is obviously the development of intense microwave power sources. Remaining problems, however, are not trivial and in fact some of them require several order-of-magnitude improvement from the existing SLC parameters. The present report summarizes the study status of the beam dynamics problems of high energy linear colliders with an exaggeration on the beam-beam phenomenon at the interaction region. There are four laboratories having linear collider plans, SLAC, CERN, Novosibirsk-Protovino, and KEK. The parameters of these projects scatter in some range but seem to converge slowly if one recalls the status five years ago. The beam energy will be below 500GeV. The basic requirements to the damping ring are the short damping time and small equilibrium emittance. All the proposed designs make use of tight focusing optics and strong wiggler magnets to meet these requirements and seem to have no major problems at least compared with other problems in the colliders. One of the major problems in the linac is the transverse beam blow-up due to the wake field created by the head of the bunch and, in the case of multiple bunches per pulse, by the preceeding bunches. (N.K.)
Linear finite element method for one-dimensional diffusion problems
Energy Technology Data Exchange (ETDEWEB)
Brandao, Michele A.; Dominguez, Dany S.; Iglesias, Susana M., E-mail: micheleabrandao@gmail.com, E-mail: dany@labbi.uesc.br, E-mail: smiglesias@uesc.br [Universidade Estadual de Santa Cruz (LCC/DCET/UESC), Ilheus, BA (Brazil). Departamento de Ciencias Exatas e Tecnologicas. Laboratorio de Computacao Cientifica
2011-07-01
We describe in this paper the fundamentals of Linear Finite Element Method (LFEM) applied to one-speed diffusion problems in slab geometry. We present the mathematical formulation to solve eigenvalue and fixed source problems. First, we discretized a calculus domain using a finite set of elements. At this point, we obtain the spatial balance equations for zero order and first order spatial moments inside each element. Then, we introduce the linear auxiliary equations to approximate neutron flux and current inside the element and architect a numerical scheme to obtain the solution. We offer numerical results for fixed source typical model problems to illustrate the method's accuracy for coarse-mesh calculations in homogeneous and heterogeneous domains. Also, we compare the accuracy and computational performance of LFEM formulation with conventional Finite Difference Method (FDM). (author)
Oscillatory solutions of the Cauchy problem for linear differential equations
Directory of Open Access Journals (Sweden)
Gro Hovhannisyan
2015-06-01
Full Text Available We consider the Cauchy problem for second and third order linear differential equations with constant complex coefficients. We describe necessary and sufficient conditions on the data for the existence of oscillatory solutions. It is known that in the case of real coefficients the oscillatory behavior of solutions does not depend on initial values, but we show that this is no longer true in the complex case: hence in practice it is possible to control oscillatory behavior by varying the initial conditions. Our Proofs are based on asymptotic analysis of the zeros of solutions, represented as linear combinations of exponential functions.
Problems of linear electron (polaron) transport theory in semiconductors
Klinger, M I
1979-01-01
Problems of Linear Electron (Polaron) Transport Theory in Semiconductors summarizes and discusses the development of areas in electron transport theory in semiconductors, with emphasis on the fundamental aspects of the theory and the essential physical nature of the transport processes. The book is organized into three parts. Part I focuses on some general topics in the theory of transport phenomena: the general dynamical theory of linear transport in dissipative systems (Kubo formulae) and the phenomenological theory. Part II deals with the theory of polaron transport in a crystalline semicon
Towards an ideal preconditioner for linearized Navier-Stokes problems
Energy Technology Data Exchange (ETDEWEB)
Murphy, M.F. [Univ. of Bristol (United Kingdom)
1996-12-31
Discretizing certain linearizations of the steady-state Navier-Stokes equations gives rise to nonsymmetric linear systems with indefinite symmetric part. We show that for such systems there exists a block diagonal preconditioner which gives convergence in three GMRES steps, independent of the mesh size and viscosity parameter (Reynolds number). While this {open_quotes}ideal{close_quotes} preconditioner is too expensive to be used in practice, it provides a useful insight into the problem. We then consider various approximations to the ideal preconditioner, and describe the eigenvalues of the preconditioned systems. Finally, we compare these preconditioners numerically, and present our conclusions.
Directory of Open Access Journals (Sweden)
Manuel Offidani
2018-05-01
Full Text Available We present a unified theoretical framework for the study of spin dynamics and relativistic transport phenomena in disordered two-dimensional Dirac systems with pseudospin-spin coupling. The formalism is applied to the paradigmatic case of graphene with uniform Bychkov-Rashba interaction and shown to capture spin relaxation processes and associated charge-to-spin interconversion phenomena in response to generic external perturbations, including spin density fluctuations and electric fields. A controlled diagrammatic evaluation of the generalized spin susceptibility in the diffusive regime of weak spin-orbit interaction allows us to show that the spin and momentum lifetimes satisfy the standard Dyakonov-Perel relation for both weak (Gaussian and resonant (unitary nonmagnetic disorder. Finally, we demonstrate that the spin relaxation rate can be derived in the zero-frequency limit by exploiting the SU(2 covariant conservation laws for the spin observables. Our results set the stage for a fully quantum-mechanical description of spin relaxation in both pristine graphene samples with weak spin-orbit fields and in graphene heterostructures with enhanced spin-orbital effects currently attracting much attention.
Regularization Techniques for Linear Least-Squares Problems
Suliman, Mohamed
2016-04-01
Linear estimation is a fundamental branch of signal processing that deals with estimating the values of parameters from a corrupted measured data. Throughout the years, several optimization criteria have been used to achieve this task. The most astonishing attempt among theses is the linear least-squares. Although this criterion enjoyed a wide popularity in many areas due to its attractive properties, it appeared to suffer from some shortcomings. Alternative optimization criteria, as a result, have been proposed. These new criteria allowed, in one way or another, the incorporation of further prior information to the desired problem. Among theses alternative criteria is the regularized least-squares (RLS). In this thesis, we propose two new algorithms to find the regularization parameter for linear least-squares problems. In the constrained perturbation regularization algorithm (COPRA) for random matrices and COPRA for linear discrete ill-posed problems, an artificial perturbation matrix with a bounded norm is forced into the model matrix. This perturbation is introduced to enhance the singular value structure of the matrix. As a result, the new modified model is expected to provide a better stabilize substantial solution when used to estimate the original signal through minimizing the worst-case residual error function. Unlike many other regularization algorithms that go in search of minimizing the estimated data error, the two new proposed algorithms are developed mainly to select the artifcial perturbation bound and the regularization parameter in a way that approximately minimizes the mean-squared error (MSE) between the original signal and its estimate under various conditions. The first proposed COPRA method is developed mainly to estimate the regularization parameter when the measurement matrix is complex Gaussian, with centered unit variance (standard), and independent and identically distributed (i.i.d.) entries. Furthermore, the second proposed COPRA
A linear programming approach to max-sum problem: a review.
Werner, Tomás
2007-07-01
The max-sum labeling problem, defined as maximizing a sum of binary (i.e., pairwise) functions of discrete variables, is a general NP-hard optimization problem with many applications, such as computing the MAP configuration of a Markov random field. We review a not widely known approach to the problem, developed by Ukrainian researchers Schlesinger et al. in 1976, and show how it contributes to recent results, most importantly, those on the convex combination of trees and tree-reweighted max-product. In particular, we review Schlesinger et al.'s upper bound on the max-sum criterion, its minimization by equivalent transformations, its relation to the constraint satisfaction problem, the fact that this minimization is dual to a linear programming relaxation of the original problem, and the three kinds of consistency necessary for optimality of the upper bound. We revisit problems with Boolean variables and supermodular problems. We describe two algorithms for decreasing the upper bound. We present an example application for structural image analysis.
Directory of Open Access Journals (Sweden)
Shuo Wang
Full Text Available Random effect in cellular systems is an important topic in systems biology and often simulated with Gillespie's stochastic simulation algorithm (SSA. Abridgment refers to model reduction that approximates a group of reactions by a smaller group with fewer species and reactions. This paper presents a theoretical analysis, based on comparison of the first exit time, for the abridgment on a linear chain reaction model motivated by systems with multiple phosphorylation sites. The analysis shows that if the relaxation time of the fast subsystem is much smaller than the mean firing time of the slow reactions, the abridgment can be applied with little error. This analysis is further verified with numerical experiments for models of bistable switch and oscillations in which linear chain system plays a critical role.
Energy Technology Data Exchange (ETDEWEB)
Bizarri, G.; Moses, W.W. [Lawrence Berkeley Laboratory, Berkeley, CA 94720-8119 (United States); Singh, J. [Faculty of EHS, B-41, Charles Darwin University, Darwin NT 0909 (Australia); Vasil' ev, A.N., E-mail: anvasiliev@rambler.r [Institute of Nuclear Physics, Moscow State University, Moscow 119991 (Russian Federation); Williams, R.T. [Department of Physics, Wake Forest University, Winston-Salem, NC 27109 (United States)
2009-12-15
The non-proportional dependence of a scintillator's light yield on primary particle energy is believed to be influenced crucially by the interplay of non-linear kinetic terms in the radiative and non-radiative decay of excitations versus locally deposited excitation density. A calculation of energy deposition, -dE/dx, along the electron track for NaI is presented for an energy range from several electron-volt to 1 MeV. Such results can be used to specify an initial excitation distribution, if diffusion is neglected. An exactly solvable two-channel (exciton and hole(electron)) model containing 1st and 2nd order kinetic terms is constructed and used to illustrate important features seen in non-proportional light-yield curves, including a dependence on pulse shaping (detection gate width).
International Nuclear Information System (INIS)
Bizarri, G.; Moses, W.W.; Singh, J.; Vasil'ev, A.N.; Williams, R.T.
2009-01-01
The non-proportional dependence of a scintillator's light yield on primary particle energy is believed to be influenced crucially by the interplay of non-linear kinetic terms in the radiative and non-radiative decay of excitations versus locally deposited excitation density. A calculation of energy deposition, -dE/dx, along the electron track for NaI is presented for an energy range from several electron-volt to 1 MeV. Such results can be used to specify an initial excitation distribution, if diffusion is neglected. An exactly solvable two-channel (exciton and hole(electron)) model containing 1st and 2nd order kinetic terms is constructed and used to illustrate important features seen in non-proportional light-yield curves, including a dependence on pulse shaping (detection gate width).
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.
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.
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
Description of All Solutions of a Linear Complementarity Problem
Czech Academy of Sciences Publication Activity Database
Rohn, Jiří
2009-01-01
Roč. 18, - (2009), s. 246-252 E-ISSN 1081-3810 R&D Projects: GA ČR GA201/09/1957; GA ČR GC201/08/J020 Institutional research plan: CEZ:AV0Z10300504 Keywords : linear complementarity problem * Moore-Penrose inverse * verified solution * absolute value equation Subject RIV: BA - General Mathematics Impact factor: 0.892, year: 2009 http://www.math.technion.ac.il/iic/ ela / ela -articles/articles/vol18_pp246-252.pdf
DEFF Research Database (Denmark)
Shabbir, Aamir; Javakhishvili, Irakli; Cerveny, Silvina
2016-01-01
Supramolecular polymers possess versatile mechanical properties and a unique ability to respond to external stimuli. Understanding the rich dynamics of such associative polymers is essential for tailoring user-defined properties in many products. Linear copolymers of 2-methoxyethyl acrylate (MEA)...
Convergence diagnostics for Eigenvalue problems with linear regression model
International Nuclear Information System (INIS)
Shi, Bo; Petrovic, Bojan
2011-01-01
Although the Monte Carlo method has been extensively used for criticality/Eigenvalue problems, a reliable, robust, and efficient convergence diagnostics method is still desired. Most methods are based on integral parameters (multiplication factor, entropy) and either condense the local distribution information into a single value (e.g., entropy) or even disregard it. We propose to employ the detailed cycle-by-cycle local flux evolution obtained by using mesh tally mechanism to assess the source and flux convergence. By applying a linear regression model to each individual mesh in a mesh tally for convergence diagnostics, a global convergence criterion can be obtained. We exemplify this method on two problems and obtain promising diagnostics results. (author)
Bounds and estimates for the linearly perturbed eigenvalue problem
International Nuclear Information System (INIS)
Raddatz, W.D.
1983-01-01
This thesis considers the problem of bounding and estimating the discrete portion of the spectrum of a linearly perturbed self-adjoint operator, M(x). It is supposed that one knows an incomplete set of data consisting in the first few coefficients of the Taylor series expansions of one or more of the eigenvalues of M(x) about x = 0. The foundations of the variational study of eigen-values are first presented. These are then used to construct the best possible upper bounds and estimates using various sets of given information. Lower bounds are obtained by estimating the error in the upper bounds. The extension of these bounds and estimates to the eigenvalues of the doubly-perturbed operator M(x,y) is discussed. The results presented have numerous practical application in the physical sciences, including problems in atomic physics and the theory of vibrations of acoustical and mechanical systems
Instrumentation problems in the measurement of relaxation time T1 in MRI
International Nuclear Information System (INIS)
Leroy-Willig, A.; Roucayrol, J.C.; Bittoun, J.; Courtieu, J.
1986-01-01
Longitudinal relaxation (T 1 ) of protons is a sensitive though non specific tool of tissue characterization. T 1 measurement from magnetic resonance images is unprecise, due to several phenomena that we review: time intervals shorter than in spectroscopic sequences; flip angle inhomogeneity; slice selection and spin echoes. In vivo the molecular inhomogeneity can prevent to measure a true T 1 ; motion and blood flow are important causes of errors. The relative effects of these factors are examined from in vitro and in vivo images acquired at 1.5 T. From a mono-echo single-slice saturation sequence reliable values of T 1 are obtained in vitro, the measurement time being compatible with clinical imaging. In vivo, problems due to various causes of motions are still unresolved [fr
Point source reconstruction principle of linear inverse problems
International Nuclear Information System (INIS)
Terazono, Yasushi; Matani, Ayumu; Fujimaki, Norio; Murata, Tsutomu
2010-01-01
Exact point source reconstruction for underdetermined linear inverse problems with a block-wise structure was studied. In a block-wise problem, elements of a source vector are partitioned into blocks. Accordingly, a leadfield matrix, which represents the forward observation process, is also partitioned into blocks. A point source is a source having only one nonzero block. An example of such a problem is current distribution estimation in electroencephalography and magnetoencephalography, where a source vector represents a vector field and a point source represents a single current dipole. In this study, the block-wise norm, a block-wise extension of the l p -norm, was defined as the family of cost functions of the inverse method. The main result is that a set of three conditions was found to be necessary and sufficient for block-wise norm minimization to ensure exact point source reconstruction for any leadfield matrix that admit such reconstruction. The block-wise norm that satisfies the conditions is the sum of the cost of all the observations of source blocks, or in other words, the block-wisely extended leadfield-weighted l 1 -norm. Additional results are that minimization of such a norm always provides block-wisely sparse solutions and that its solutions form cones in source space
On the non-linear dynamics of potential relaxation oscillations in bounded plasmas
International Nuclear Information System (INIS)
Krssak, M.; Skalny, J.D.; Gyergyek, T.; Cercek, M.
2007-01-01
Plasma in a 1-dimensional diode is studied theoretically and the computer simulations are used for verification of the theoretical model. When collector in the diode is biased positively, a double-layer is created in the system and consequently, we are able to observe oscillations of the potential, density and other plasma parameters. When external periodic forcing is applied, spectra of these oscillations are changed and effects of synchronisation and periodic pulling can be observed. Both of these effects are of non-linear nature and a good explanation is found using the analogy with Van der Pol oscillators. Following [1] and [2] approximate analytical solutions are found and then compared with computer simulations obtained using a 1-dimensional particle-in-cell code XPDP1. (author)
An improved partial bundle method for linearly constrained minimax problems
Directory of Open Access Journals (Sweden)
Chunming Tang
2016-02-01
Full Text Available In this paper, we propose an improved partial bundle method for solving linearly constrained minimax problems. In order to reduce the number of component function evaluations, we utilize a partial cutting-planes model to substitute for the traditional one. At each iteration, only one quadratic programming subproblem needs to be solved to obtain a new trial point. An improved descent test criterion is introduced to simplify the algorithm. The method produces a sequence of feasible trial points, and ensures that the objective function is monotonically decreasing on the sequence of stability centers. Global convergence of the algorithm is established. Moreover, we utilize the subgradient aggregation strategy to control the size of the bundle and therefore overcome the difficulty of computation and storage. Finally, some preliminary numerical results show that the proposed method is effective.
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...
Directory of Open Access Journals (Sweden)
Tunjo Perić
2017-01-01
Full Text Available This paper presents and analyzes the applicability of three linearization techniques used for solving multi-objective linear fractional programming problems using the goal programming method. The three linearization techniques are: (1 Taylor’s polynomial linearization approximation, (2 the method of variable change, and (3 a modification of the method of variable change proposed in [20]. All three linearization techniques are presented and analyzed in two variants: (a using the optimal value of the objective functions as the decision makers’ aspirations, and (b the decision makers’ aspirations are given by the decision makers. As the criteria for the analysis we use the efficiency of the obtained solutions and the difficulties the analyst comes upon in preparing the linearization models. To analyze the applicability of the linearization techniques incorporated in the linear goal programming method we use an example of a financial structure optimization problem.
de Oliveira, Luciana Renata; Bazzani, Armando; Giampieri, Enrico; Castellani, Gastone C
2014-08-14
We propose a non-equilibrium thermodynamical description in terms of the Chemical Master Equation (CME) to characterize the dynamics of a chemical cycle chain reaction among m different species. These systems can be closed or open for energy and molecules exchange with the environment, which determines how they relax to the stationary state. Closed systems reach an equilibrium state (characterized by the detailed balance condition (D.B.)), while open systems will reach a non-equilibrium steady state (NESS). The principal difference between D.B. and NESS is due to the presence of chemical fluxes. In the D.B. condition the fluxes are absent while for the NESS case, the chemical fluxes are necessary for the state maintaining. All the biological systems are characterized by their "far from equilibrium behavior," hence the NESS is a good candidate for a realistic description of the dynamical and thermodynamical properties of living organisms. In this work we consider a CME written in terms of a discrete Kolmogorov forward equation, which lead us to write explicitly the non-equilibrium chemical fluxes. For systems in NESS, we show that there is a non-conservative "external vector field" whose is linearly proportional to the chemical fluxes. We also demonstrate that the modulation of these external fields does not change their stationary distributions, which ensure us to study the same system and outline the differences in the system's behavior when it switches from the D.B. regime to NESS. We were interested to see how the non-equilibrium fluxes influence the relaxation process during the reaching of the stationary distribution. By performing analytical and numerical analysis, our central result is that the presence of the non-equilibrium chemical fluxes reduces the characteristic relaxation time with respect to the D.B. condition. Within a biochemical and biological perspective, this result can be related to the "plasticity property" of biological systems and to their
International Nuclear Information System (INIS)
Oliveira, Luciana Renata de; Bazzani, Armando; Giampieri, Enrico; Castellani, Gastone C.
2014-01-01
We propose a non-equilibrium thermodynamical description in terms of the Chemical Master Equation (CME) to characterize the dynamics of a chemical cycle chain reaction among m different species. These systems can be closed or open for energy and molecules exchange with the environment, which determines how they relax to the stationary state. Closed systems reach an equilibrium state (characterized by the detailed balance condition (D.B.)), while open systems will reach a non-equilibrium steady state (NESS). The principal difference between D.B. and NESS is due to the presence of chemical fluxes. In the D.B. condition the fluxes are absent while for the NESS case, the chemical fluxes are necessary for the state maintaining. All the biological systems are characterized by their “far from equilibrium behavior,” hence the NESS is a good candidate for a realistic description of the dynamical and thermodynamical properties of living organisms. In this work we consider a CME written in terms of a discrete Kolmogorov forward equation, which lead us to write explicitly the non-equilibrium chemical fluxes. For systems in NESS, we show that there is a non-conservative “external vector field” whose is linearly proportional to the chemical fluxes. We also demonstrate that the modulation of these external fields does not change their stationary distributions, which ensure us to study the same system and outline the differences in the system's behavior when it switches from the D.B. regime to NESS. We were interested to see how the non-equilibrium fluxes influence the relaxation process during the reaching of the stationary distribution. By performing analytical and numerical analysis, our central result is that the presence of the non-equilibrium chemical fluxes reduces the characteristic relaxation time with respect to the D.B. condition. Within a biochemical and biological perspective, this result can be related to the “plasticity property” of biological
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...
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....
Ramaswamy, Rajesh; Sbalzarini, Ivo F; González-Segredo, Nélido
2011-01-01
Stochastic effects from correlated noise non-trivially modulate the kinetics of non-linear chemical reaction networks. This is especially important in systems where reactions are confined to small volumes and reactants are delivered in bursts. We characterise how the two noise sources confinement and burst modulate the relaxation kinetics of a non-linear reaction network around a non-equilibrium steady state. We find that the lifetimes of species change with burst input and confinement. Confi...
Masuda, Hiroshi; Kanda, Yutaro; Okamoto, Yoshifumi; Hirono, Kazuki; Hoshino, Reona; Wakao, Shinji; Tsuburaya, Tomonori
2017-12-01
It is very important to design electrical machineries with high efficiency from the point of view of saving energy. Therefore, topology optimization (TO) is occasionally used as a design method for improving the performance of electrical machinery under the reasonable constraints. Because TO can achieve a design with much higher degree of freedom in terms of structure, there is a possibility for deriving the novel structure which would be quite different from the conventional structure. In this paper, topology optimization using sequential linear programming using move limit based on adaptive relaxation is applied to two models. The magnetic shielding, in which there are many local minima, is firstly employed as firstly benchmarking for the performance evaluation among several mathematical programming methods. Secondly, induction heating model is defined in 2-D axisymmetric field. In this model, the magnetic energy stored in the magnetic body is maximized under the constraint on the volume of magnetic body. Furthermore, the influence of the location of the design domain on the solutions is investigated.
Directory of Open Access Journals (Sweden)
Yang Xiao-Jun
2017-01-01
Full Text Available In this paper, we address a class of the fractional derivatives of constant and variable orders for the first time. Fractional-order relaxation equations of constants and variable orders in the sense of Caputo type are modeled from mathematical view of point. The comparative results of the anomalous relaxation among the various fractional derivatives are also given. They are very efficient in description of the complex phenomenon arising in heat transfer.
Estimates for a general fractional relaxation equation and application to an inverse source problem
Bazhlekova, Emilia
2018-01-01
A general fractional relaxation equation is considered with a convolutional derivative in time introduced by A. Kochubei (Integr. Equ. Oper. Theory 71 (2011), 583-600). This equation generalizes the single-term, multi-term and distributed-order fractional relaxation equations. The fundamental and the impulse-response solutions are studied in detail. Properties such as analyticity and subordination identities are established and employed in the proof of an upper and a lower bound. The obtained...
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
A local-global problem for linear differential equations
Put, Marius van der; Reversat, Marc
2008-01-01
An inhomogeneous linear differential equation Ly = f over a global differential field can have a formal solution for each place without having a global solution. The vector space lgl(L) measures this phenomenon. This space is interpreted in terms of cohomology of linear algebraic groups and is
A local-global problem for linear differential equations
Put, Marius van der; Reversat, Marc
An inhomogeneous linear differential equation Ly = f over a global differential field can have a formal solution for each place without having a global solution. The vector space lgl(L) measures this phenomenon. This space is interpreted in terms of cohomology of linear algebraic groups and is
Smirnovsky, Alexander A.; Eliseeva, Viktoria O.
2018-05-01
The study of the film flow occurred under the influence of a gas slug flow is of definite interest in heat and mass transfer during the motion of a coolant in the second circuit of a nuclear water-water reactor. Thermohydraulic codes are usually used for analysis of the such problems in which the motion of the liquid film and the vapor is modeled on the basis of a one-dimensional balance equations. Due to a greater inertia of the liquid film motion, film flow parameters changes with a relaxation compared with gas flow. We consider a model problem of film flow under the influence of friction from gas slug flow neglecting such effects as wave formation, droplet breakage and deposition on the film surface, evaporation and condensation. Such a problem is analogous to the well-known problems of Couette and Stokes flows. An analytical solution has been obtained for laminar flow. Numerical RANS-based simulation of turbulent flow was performed using OpenFOAM. It is established that the relaxation process is almost self-similar. This fact opens a possibility of obtaining valuable correlations for the relaxation time.
Generalized W1;1-Young Measures and Relaxation of Problems with Linear Growth
Czech Academy of Sciences Publication Activity Database
Baia, M.; Krömer, Stefan; Kružík, Martin
2018-01-01
Roč. 50, č. 1 (2018), s. 1076-1119 ISSN 0036-1410 R&D Projects: GA ČR GA14-15264S; GA ČR(CZ) GF16-34894L Institutional support: RVO:67985556 Keywords : lower semicontinuity * quasiconvexity * Young measures Subject RIV: BA - General Mathematics OBOR OECD: Pure mathematics Impact factor: 1.648, year: 2016 http://library.utia.cas.cz/2018/MTR/kruzik-0487019.pdf
The intelligence of dual simplex method to solve linear fractional fuzzy transportation problem.
Narayanamoorthy, S; Kalyani, S
2015-01-01
An approach is presented to solve a fuzzy transportation problem with linear fractional fuzzy objective function. In this proposed approach the fractional fuzzy transportation problem is decomposed into two linear fuzzy transportation problems. The optimal solution of the two linear fuzzy transportations is solved by dual simplex method and the optimal solution of the fractional fuzzy transportation problem is obtained. The proposed method is explained in detail with an example.
The Intelligence of Dual Simplex Method to Solve Linear Fractional Fuzzy Transportation Problem
Directory of Open Access Journals (Sweden)
S. Narayanamoorthy
2015-01-01
Full Text Available An approach is presented to solve a fuzzy transportation problem with linear fractional fuzzy objective function. In this proposed approach the fractional fuzzy transportation problem is decomposed into two linear fuzzy transportation problems. The optimal solution of the two linear fuzzy transportations is solved by dual simplex method and the optimal solution of the fractional fuzzy transportation problem is obtained. The proposed method is explained in detail with an example.
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)
Burgers' turbulence problem with linear or quadratic external potential
DEFF Research Database (Denmark)
Barndorff-Nielsen, Ole Eiler; Leonenko, N.N.
2005-01-01
We consider solutions of Burgers' equation with linear or quadratic external potential and stationary random initial conditions of Ornstein-Uhlenbeck type. We study a class of limit laws that correspond to a scale renormalization of the solutions.......We consider solutions of Burgers' equation with linear or quadratic external potential and stationary random initial conditions of Ornstein-Uhlenbeck type. We study a class of limit laws that correspond to a scale renormalization of the solutions....
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)
Dirichlet problem for quasi-linear elliptic equations
Directory of Open Access Journals (Sweden)
Azeddine Baalal
2002-10-01
Full Text Available We study the Dirichlet Problem associated to the quasilinear elliptic problem $$ -sum_{i=1}^{n}frac{partial }{partial x_i}mathcal{A}_i(x,u(x, abla u(x+mathcal{B}(x,u(x,abla u(x=0. $$ Then we define a potential theory related to this problem and we show that the sheaf of continuous solutions satisfies the Bauer axiomatic theory. Submitted April 9, 2002. Published October 2, 2002. Math Subject Classifications: 31C15, 35B65, 35J60. Key Words: Supersolution; Dirichlet problem; obstacle problem; nonlinear potential theory.
On nonlocal semi linear elliptic problem with an indefinite term
International Nuclear Information System (INIS)
Yechoui, Akila
2007-08-01
The aim of this paper is to investigate the existence of solutions of a nonlocal semi linear elliptic equation with an indefinite term. The monotone method, the method of upper and lower solutions and the classical maximum principle are used to obtain our results. (author)
Preconditioned Iterative Methods for Solving Weighted Linear Least Squares Problems
Czech Academy of Sciences Publication Activity Database
Bru, R.; Marín, J.; Mas, J.; Tůma, Miroslav
2014-01-01
Roč. 36, č. 4 (2014), A2002-A2022 ISSN 1064-8275 Institutional support: RVO:67985807 Keywords : preconditioned iterative methods * incomplete decompositions * approximate inverses * linear least squares Subject RIV: BA - General Mathematics Impact factor: 1.854, year: 2014
Hybrid Method for Solving Inventory Problems with a Linear ...
African Journals Online (AJOL)
Osagiede and Omosigho (2004) proposed a direct search method for identifying the number of replenishment when the demand pattern is linearly increasing. The main computational task in this direct search method was associated with finding the optimal number of replenishments. To accelerate the use of this method, the ...
Answers to selected problems in multivariable calculus with linear algebra and series
Trench, William F
1972-01-01
Answers to Selected Problems in Multivariable Calculus with Linear Algebra and Series contains the answers to selected problems in linear algebra, the calculus of several variables, and series. Topics covered range from vectors and vector spaces to linear matrices and analytic geometry, as well as differential calculus of real-valued functions. Theorems and definitions are included, most of which are followed by worked-out illustrative examples.The problems and corresponding solutions deal with linear equations and matrices, including determinants; vector spaces and linear transformations; eig
Energy Technology Data Exchange (ETDEWEB)
Dupuis, M [Commissariat a l' Energie Atomique, 91 - Saclay (France). Centre d' Etudes Nucleaires, departement de physico-chimie, services des isotopes stables
1971-07-01
Two analytical representations of the Laplace transform of the time autocorrelation of a dynamical variable, namely the moment expansion and Mori's continued fraction expansion, are investigated from the point of view of structure and convergence properties, and the relation between them is established. The general theory is applied first to a dynamical model exactly solvable, the isotopic impurity in a linear chain of coupled harmonic oscillators, and then to two stochastic models recently introduced by Gordon for the rotational diffusion of molecules. In the latter case, the continued fraction expansion yields simple analytical expressions for the infrared absorption band shapes, showing that these models contain all the features of observed shapes in compressed gases, liquids and solutions. (author) [French] Deux representations analytiques de la transformee de Laplace de la fonction d'autocorrelation temporelle d'une variable dynamique, le developpement en moments et le developpement en fraction continue recemment introduit par Mori, sont etudiees du point de vue de leurs proprietes de structure et de convergence, en meme temps que la relation qui existe entre elles est etablie. La theorie generale est appliquee, d'une part, a un modele dynamique exactement soluble, celui d'une particule isotopique dans une chaine lineaire d'oscillateurs harmoniques couples, et, d'autre part, a deux modeles stochastiques recemment proposes par Gordon pour la diffusion rotationnelle des molecules. Dans ce dernier cas, la voie de la fraction continue fournit des expressions analytiques simples pour les formes de bande d'absorption infrarouge, montrant que ces modeles possedent les caracteristiques des formes observees dans les gaz comprimes, les liquides ou les solutions. (auteur)
The Tree Inclusion Problem: In Linear Space and Faster
DEFF Research Database (Denmark)
Bille, Philip; Gørtz, Inge Li
2011-01-01
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been recognized as an important query primitive in XML databases. Kilpel äinen and Mannila [1995] presented the first....... This is particularly important in practical applications, such as XML databases, where the space is likely to be a bottleneck. © 2011 ACM....
Some mathematical problems in non-linear Physics
International Nuclear Information System (INIS)
1983-01-01
The main results contained in this report are the following: I) A general analysis of non-autonomous conserved densities for simple linear evolution systems. II) Partial differential systems within a wide class are converted into Lagrange an form. III) Rigorous criteria for existence of integrating factor matrices. IV) Isolation of all third-order evolution equations with high order symmetries and conservation laws. (Author) 3 refs
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...
Delayed Stochastic Linear-Quadratic Control Problem and Related Applications
Directory of Open Access Journals (Sweden)
Li Chen
2012-01-01
stochastic differential equations (FBSDEs with Itô’s stochastic delay equations as forward equations and anticipated backward stochastic differential equations as backward equations. Especially, we present the optimal feedback regulator for the time delay system via a new type of Riccati equations and also apply to a population optimal control problem.
(AJST) THE LINEAR ORDERING PROBLEM: AN ALGORITHM FOR ...
African Journals Online (AJOL)
ABSTRACT:- In this paper we describe and implement an algorithm for the exact ... of the solutions space which grows exponentially with ... terms of the formulation of the problem, these are the ... Definition: A digraph D = (V, A) is called a k-fence if it has the following ... (iv) If two dicycles Ci and Cj, 2
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
Directory of Open Access Journals (Sweden)
Hongchun Sun
2012-01-01
Full Text Available For the extended mixed linear complementarity problem (EML CP, we first present the characterization of the solution set for the EMLCP. Based on this, its global error bound is also established under milder conditions. The results obtained in this paper can be taken as an extension for the classical linear complementarity problems.
Linear problems and Baecklund transformations for the Hirota-Ohta system
International Nuclear Information System (INIS)
Adler, V.E.; Postnikov, V.V.
2011-01-01
The auxiliary linear problems are presented for all discretization levels of the Hirota-Ohta system. The structure of these linear problems coincides essentially with the structure of Nonlinear Schroedinger hierarchy. The squared eigenfunction constraints are found which relate Hirota-Ohta and Kulish-Sklyanin vectorial NLS hierarchies.
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.
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
Goldbeck, Lutz; Schmid, Katharina
2003-09-01
To investigate the effectiveness of autogenic relaxation training in a mildly disturbed outpatient population of children and adolescents with mostly internalizing symptoms, and/or some aggressive, impulsive, or attention deficit symptoms. Fifty children and adolescents from southern Germany (mean age 10.2 years; range 6-15 years; mostly intact middle class family background) participated in a group intervention program. Fifteen patients were randomly assigned to a waiting-list control group. Behavior symptoms (Child Behavior Checklist), psychosomatic complaints (Giessen Complaint List), and level of stress were assessed before and after the intervention or after the waiting phase. Individual goal attainment was evaluated at the end of the intervention and in a 3-month follow-up. The parent report on CBCL reflected reduced symptoms compared with control. The child report indicated reduced stress and psychosomatic complaints both in the intervention and control group, and no significant group x time interaction effects occurred on these scales. Effect sizes of 0.49 in the CBCL and 0.36 in the complaint list indicated clinically relevant effects of the intervention compared with the control group. At the end of the intervention, 56% of the children and 55% of the parents reported partial goal attainment, 38% of the children and 30% of the parents reported complete goal attainment; 71% of the parents confirmed partial goal attainment 3 months postintervention. Autogenic relaxation training is an effective broadband method for children and adolescents.
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 ...
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...
Numerical Methods for Solution of the Extended Linear Quadratic Control Problem
DEFF Research Database (Denmark)
Jørgensen, John Bagterp; Frison, Gianluca; Gade-Nielsen, Nicolai Fog
2012-01-01
In this paper we present the extended linear quadratic control problem, its efficient solution, and a discussion of how it arises in the numerical solution of nonlinear model predictive control problems. The extended linear quadratic control problem is the optimal control problem corresponding...... to the Karush-Kuhn-Tucker system that constitute the majority of computational work in constrained nonlinear and linear model predictive control problems solved by efficient MPC-tailored interior-point and active-set algorithms. We state various methods of solving the extended linear quadratic control problem...... and discuss instances in which it arises. The methods discussed in the paper have been implemented in efficient C code for both CPUs and GPUs for a number of test examples....
Energy Technology Data Exchange (ETDEWEB)
El Ghazi, Haddou, E-mail: hadghazi@gmail.com [LPS, Faculty of Science, Dhar El Mehrez, BP 1796 Fes-Atlas (Morocco); Special Mathematics, CPGE My Youssef, Rabat (Morocco); Jorio, Anouar [LPS, Faculty of Science, Dhar El Mehrez, BP 1796 Fes-Atlas (Morocco)
2014-10-01
By means of a combination of Quantum Genetic Algorithm and Hartree–Fock–Roothaan method, the changes in linear, third-order nonlinear and total refractive index associated with intra-conduction band transition are investigated with and without shallow-donor impurity in wurtzite (In,Ga)N–GaN spherical quantum dot. For both cases with and without impurity, the calculation is performed within the framework of single band effective-mass and parabolic band approximations. Impurity's position and relaxation time effects are investigated. It is found that the modulation of the refractive index changes, suitable for good performance optical modulators and various infra-red optical device applications can be easily obtained by tailoring the relaxation time and the position of the impurity.
International Nuclear Information System (INIS)
El Ghazi, Haddou; Jorio, Anouar
2014-01-01
By means of a combination of Quantum Genetic Algorithm and Hartree–Fock–Roothaan method, the changes in linear, third-order nonlinear and total refractive index associated with intra-conduction band transition are investigated with and without shallow-donor impurity in wurtzite (In,Ga)N–GaN spherical quantum dot. For both cases with and without impurity, the calculation is performed within the framework of single band effective-mass and parabolic band approximations. Impurity's position and relaxation time effects are investigated. It is found that the modulation of the refractive index changes, suitable for good performance optical modulators and various infra-red optical device applications can be easily obtained by tailoring the relaxation time and the position of the impurity
Towards Resolving the Crab Sigma-Problem: A Linear Accelerator?
Contopoulos, Ioannis; Kazanas, Demosthenes; White, Nicholas E. (Technical Monitor)
2002-01-01
Using the exact solution of the axisymmetric pulsar magnetosphere derived in a previous publication and the conservation laws of the associated MHD flow, we show that the Lorentz factor of the outflowing plasma increases linearly with distance from the light cylinder. Therefore, the ratio of the Poynting to particle energy flux, generically referred to as sigma, decreases inversely proportional to distance, from a large value (typically approx. greater than 10(exp 4)) near the light cylinder to sigma approx. = 1 at a transition distance R(sub trans). Beyond this distance the inertial effects of the outflowing plasma become important and the magnetic field geometry must deviate from the almost monopolar form it attains between R(sub lc), and R(sub trans). We anticipate that this is achieved by collimation of the poloidal field lines toward the rotation axis, ensuring that the magnetic field pressure in the equatorial region will fall-off faster than 1/R(sup 2) (R being the cylindrical radius). This leads both to a value sigma = a(sub s) much less than 1 at the nebular reverse shock at distance R(sub s) (R(sub s) much greater than R(sub trans)) and to a component of the flow perpendicular to the equatorial component, as required by observation. The presence of the strong shock at R = R(sub s) allows for the efficient conversion of kinetic energy into radiation. We speculate that the Crab pulsar is unique in requiring sigma(sub s) approx. = 3 x 10(exp -3) because of its small translational velocity, which allowed for the shock distance R(sub s) to grow to values much greater than R(sub trans).
Directory of Open Access Journals (Sweden)
Sahbi Marrouchi
2018-02-01
Full Text Available Solving the Unit Commitment problem (UCP optimizes the combination of production units operations and determines the appropriate operational scheduling of each production units to satisfy the expected consumption which varies from one day to one month. Besides, each production unit is conducted to constraints that render this problem complex, combinatorial and nonlinear. In this paper, we proposed a new strategy based on the combination three optimization methods: Tabu search, Particle swarm optimization and Lagrangian relaxation methods in order to develop a proper unit commitment scheduling of the production units while reducing the production cost during a definite period. The proposed strategy has been implemented on a the IEEE 9 bus test system containing 3 production unit and the results were promising compared to strategies based on meta-heuristic and deterministic methods.
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.
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.
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.
International Nuclear Information System (INIS)
Gene Golub; Kwok Ko
2009-01-01
The solutions of sparse eigenvalue problems and linear systems constitute one of the key computational kernels in the discretization of partial differential equations for the modeling of linear accelerators. The computational challenges faced by existing techniques for solving those sparse eigenvalue problems and linear systems call for continuing research to improve on the algorithms so that ever increasing problem size as required by the physics application can be tackled. Under the support of this award, the filter algorithm for solving large sparse eigenvalue problems was developed at Stanford to address the computational difficulties in the previous methods with the goal to enable accelerator simulations on then the world largest unclassified supercomputer at NERSC for this class of problems. Specifically, a new method, the Hemitian skew-Hemitian splitting method, was proposed and researched as an improved method for solving linear systems with non-Hermitian positive definite and semidefinite matrices.
Bruhn, Peter; Geyer-Schulz, Andreas
2002-01-01
In this paper, we introduce genetic programming over context-free languages with linear constraints for combinatorial optimization, apply this method to several variants of the multidimensional knapsack problem, and discuss its performance relative to Michalewicz's genetic algorithm with penalty functions. With respect to Michalewicz's approach, we demonstrate that genetic programming over context-free languages with linear constraints improves convergence. A final result is that genetic programming over context-free languages with linear constraints is ideally suited to modeling complementarities between items in a knapsack problem: The more complementarities in the problem, the stronger the performance in comparison to its competitors.
Lagrangian relaxation technique in power systems operation planning: Multipliers updating problem
Energy Technology Data Exchange (ETDEWEB)
Ruzic, S. [Electric Power Utility of Serbia, Belgrade (Yugoslavia)
1995-11-01
All Lagrangian relaxation based approaches to the power systems operation planning have an important common part: the Lagrangian multipliers correction procedure. It is the subject of this paper. Different approaches presented in the literature are discussed and an original method for the Lagrangian multipliers updating is proposed. The basic idea of this new method is to update Lagrangian multipliers trying to satisfy Khun-Tucker optimality conditions. Instead of the dual function maximization the `distance of optimality function` is defined and minimized. If Khun-Tucker optimality conditions are satisfied the value of this function is in range (-1,0); otherwise the function has a big positive value. This method called `the distance of optimality method` takes into account future changes in planning generations due to the Lagrangian multipliers updating. The influence of changes in a multiplier associated to one system constraint to the satisfaction of some other system requirements is also considered. The numerical efficiency of the proposed method is analyzed and compared with results obtained using the sub-gradient technique. 20 refs, 2 tabs
Stepanov, F. I.
2018-04-01
The mechanical properties of a material which is modeled by an exponential creep kernel characterized by a spectrum of relaxation and retardation times are studied. The research is carried out considering a contact problem for a solid indenter sliding over a viscoelastic half-space. The contact pressure, indentation depth of the indenter, and the deformation component of the friction coefficient are analyzed with respect to the case of half-space material modeled by single relaxation and retardation times.
Fuzzy Multi Objective Linear Programming Problem with Imprecise Aspiration Level and Parameters
Directory of Open Access Journals (Sweden)
Zahra Shahraki
2015-07-01
Full Text Available This paper considers the multi-objective linear programming problems with fuzzygoal for each of the objective functions and constraints. Most existing works deal withlinear membership functions for fuzzy goals. In this paper, exponential membershipfunction is used.
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...
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,…
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.
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.
Nasiri, Saeideh; Kordi, Masoumeh; Gharavi, Morteza Modares
2015-01-01
Self-esteem is a determinant factor of mental health. Individuals with low self-esteem have depression, and low self-esteem is one of main symptoms of depression. Aim of this study is to compare the effects of problem-solving skills and relaxation on the score of self-esteem in women with postpartum depression. This clinical trial was performed on 80 women. Sampling was done in Mashhad healthy centers from December 2009 to June 2010. Women were randomly divided and assigned to problem-solving skills (n = 26), relaxation (n = 26), and control groups (n = 28). Interventions were implemented for 6 weeks and the subjects again completed Eysenck self-esteem scale 9 weeks after delivery. Data analysis was done by descriptive statistics, Kruskal-Wallis test, and analysis of variance (ANOVA) test by SPSS software. The findings showed that the mean of self-esteem scale scores was 117.9 ± 9.7 after intervention in the problem-solving group, 117.0 ± 11.8 in the relaxation group, and 113.5 ± 10.4 in the control group and there was significant difference between the groups of relaxation and problem solving, and also between intervention groups and control group. According to the results, problem-solving skills and relaxation can be used to prevent and recover from postpartum depression.
Shivokhin, Maksim E.; Read, Daniel J.; Kouloumasis, Dimitris; Kocen, Rok; Zhuge, Flanco; Bailly, Christian; Hadjichristidis, Nikolaos; Likhtman, Alexei E.
2017-01-01
of a linear probe chain. For this purpose we first validate the ability of the model to consistently predict both the viscoelastic and dielectric response of monodisperse and binary mixtures of type A polymers, based on published experimental data. We
Relaxing the weak scale: A new approach to the hierarchy problem
CERN. Geneva
2015-01-01
Recently, a new mechanism to generate a naturally small electroweak scale has been proposed. This is based on the idea that a dynamical evolution during the early universe can drive the Higgs mass to a value much smaller than the UV cutoff of the SM. In this talk I will present this idea, its explicit realizations, potential problems, and experimental consequences.
de Klerk, E.; Laurent, M.
2011-01-01
The Lasserre hierarchy of semidefinite programming approximations to convex polynomial optimization problems is known to converge finitely under some assumptions. [J. B. Lasserre, Convexity in semialgebraic geometry and polynomial optimization, SIAM J. Optim., 19 (2009), pp. 1995–2014]. We give a
Effective linear two-body method for many-body problems in atomic and nuclear physics
International Nuclear Information System (INIS)
Kim, Y.E.; Zubarev, A.L.
2000-01-01
We present an equivalent linear two-body method for the many body problem, which is based on an approximate reduction of the many-body Schroedinger equation by the use of a variational principle. The method is applied to several problems in atomic and nuclear physics. (author)
International Nuclear Information System (INIS)
Xunjing, L.
1981-12-01
The vector-valued measure defined by the well-posed linear boundary value problems is discussed. The maximum principle of the optimal control problem with non-convex constraint is proved by using the vector-valued measure. Especially, the necessary conditions of the optimal control of elliptic systems is derived without the convexity of the control domain and the cost function. (author)
International Nuclear Information System (INIS)
Sergienko, I.V.; Golodnikov, A.N.
1984-01-01
This article applies the methods of decompositions, which are used to solve continuous linear problems, to integer and partially integer problems. The fall-vector method is used to solve the obtained coordinate problems. An algorithm of the fall-vector is described. The Kornai-Liptak decomposition principle is used to reduce the integer linear programming problem to integer linear programming problems of a smaller dimension and to a discrete coordinate problem with simple constraints
Single-machine common/slack due window assignment problems with linear decreasing processing times
Zhang, Xingong; Lin, Win-Chin; Wu, Wen-Hsiang; Wu, Chin-Chia
2017-08-01
This paper studies linear non-increasing processing times and the common/slack due window assignment problems on a single machine, where the actual processing time of a job is a linear non-increasing function of its starting time. The aim is to minimize the sum of the earliness cost, tardiness cost, due window location and due window size. Some optimality results are discussed for the common/slack due window assignment problems and two O(n log n) time algorithms are presented to solve the two problems. Finally, two examples are provided to illustrate the correctness of the corresponding algorithms.
Zeb, Salman; Yousaf, Muhammad
2017-01-01
In this article, we present a QR updating procedure as a solution approach for linear least squares problem with equality constraints. We reduce the constrained problem to unconstrained linear least squares and partition it into a small subproblem. The QR factorization of the subproblem is calculated and then we apply updating techniques to its upper triangular factor R to obtain its solution. We carry out the error analysis of the proposed algorithm to show that it is backward stable. We also illustrate the implementation and accuracy of the proposed algorithm by providing some numerical experiments with particular emphasis on dense problems.
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...
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.
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.
The Core Problem within a Linear Approximation Problem $AX/approx B$ with Multiple Right-Hand Sides
Czech Academy of Sciences Publication Activity Database
Hnětynková, Iveta; Plešinger, Martin; Strakoš, Z.
2013-01-01
Roč. 34, č. 3 (2013), s. 917-931 ISSN 0895-4798 R&D Projects: GA ČR GA13-06684S Grant - others:GA ČR(CZ) GA201/09/0917; GA MŠk(CZ) EE2.3.09.0155; GA MŠk(CZ) EE2.3.30.0065 Program:GA Institutional support: RVO:67985807 Keywords : total least squares problem * multiple right-hand sides * core problem * linear approximation problem * error-in-variables modeling * orthogonal regression * singular value decomposition Subject RIV: BA - General Mathematics Impact factor: 1.806, year: 2013
Averaging and Linear Programming in Some Singularly Perturbed Problems of Optimal Control
Energy Technology Data Exchange (ETDEWEB)
Gaitsgory, Vladimir, E-mail: vladimir.gaitsgory@mq.edu.au [Macquarie University, Department of Mathematics (Australia); Rossomakhine, Sergey, E-mail: serguei.rossomakhine@flinders.edu.au [Flinders University, Flinders Mathematical Sciences Laboratory, School of Computer Science, Engineering and Mathematics (Australia)
2015-04-15
The paper aims at the development of an apparatus for analysis and construction of near optimal solutions of singularly perturbed (SP) optimal controls problems (that is, problems of optimal control of SP systems) considered on the infinite time horizon. We mostly focus on problems with time discounting criteria but a possibility of the extension of results to periodic optimization problems is discussed as well. Our consideration is based on earlier results on averaging of SP control systems and on linear programming formulations of optimal control problems. The idea that we exploit is to first asymptotically approximate a given problem of optimal control of the SP system by a certain averaged optimal control problem, then reformulate this averaged problem as an infinite-dimensional linear programming (LP) problem, and then approximate the latter by semi-infinite LP problems. We show that the optimal solution of these semi-infinite LP problems and their duals (that can be found with the help of a modification of an available LP software) allow one to construct near optimal controls of the SP system. We demonstrate the construction with two numerical examples.
A Fast Condensing Method for Solution of Linear-Quadratic Control Problems
DEFF Research Database (Denmark)
Frison, Gianluca; Jørgensen, John Bagterp
2013-01-01
consider a condensing (or state elimination) method to solve an extended version of the LQ control problem, and we show how to exploit the structure of this problem to both factorize the dense Hessian matrix and solve the system. Furthermore, we present two efficient implementations. The first......In both Active-Set (AS) and Interior-Point (IP) algorithms for Model Predictive Control (MPC), sub-problems in the form of linear-quadratic (LQ) control problems need to be solved at each iteration. The solution of these sub-problems is usually the main computational effort. In this paper we...... implementation is formally identical to the Riccati recursion based solver and has a computational complexity that is linear in the control horizon length and cubic in the number of states. The second implementation has a computational complexity that is quadratic in the control horizon length as well...
Solutions to estimation problems for scalar hamilton-jacobi equations using linear programming
Claudel, Christian G.; Chamoin, Timothee; Bayen, Alexandre M.
2014-01-01
This brief presents new convex formulations for solving estimation problems in systems modeled by scalar Hamilton-Jacobi (HJ) equations. Using a semi-analytic formula, we show that the constraints resulting from a HJ equation are convex, and can be written as a set of linear inequalities. We use this fact to pose various (and seemingly unrelated) estimation problems related to traffic flow-engineering as a set of linear programs. In particular, we solve data assimilation and data reconciliation problems for estimating the state of a system when the model and measurement constraints are incompatible. We also solve traffic estimation problems, such as travel time estimation or density estimation. For all these problems, a numerical implementation is performed using experimental data from the Mobile Century experiment. In the context of reproducible research, the code and data used to compute the results presented in this brief have been posted online and are accessible to regenerate the results. © 2013 IEEE.
An improved error bound for linear complementarity problems for B-matrices
Directory of Open Access Journals (Sweden)
Lei Gao
2017-06-01
Full Text Available Abstract A new error bound for the linear complementarity problem when the matrix involved is a B-matrix is presented, which improves the corresponding result in (Li et al. in Electron. J. Linear Algebra 31(1:476-484, 2016. In addition some sufficient conditions such that the new bound is sharper than that in (García-Esnaola and Peña in Appl. Math. Lett. 22(7:1071-1075, 2009 are provided.
An analogue of Morse theory for planar linear networks and the generalized Steiner problem
International Nuclear Information System (INIS)
Karpunin, G A
2000-01-01
A study is made of the generalized Steiner problem: the problem of finding all the locally minimal networks spanning a given boundary set (terminal set). It is proposed to solve this problem by using an analogue of Morse theory developed here for planar linear networks. The space K of all planar linear networks spanning a given boundary set is constructed. The concept of a critical point and its index is defined for the length function l of a planar linear network. It is shown that locally minimal networks are local minima of l on K and are critical points of index 1. The theorem is proved that the sum of the indices of all the critical points is equal to χ(K)=1. This theorem is used to find estimates for the number of locally minimal networks spanning a given boundary set
Cichocki, A; Unbehauen, R
1994-01-01
In this paper a new class of simplified low-cost analog artificial neural networks with on chip adaptive learning algorithms are proposed for solving linear systems of algebraic equations in real time. The proposed learning algorithms for linear least squares (LS), total least squares (TLS) and data least squares (DLS) problems can be considered as modifications and extensions of well known algorithms: the row-action projection-Kaczmarz algorithm and/or the LMS (Adaline) Widrow-Hoff algorithms. The algorithms can be applied to any problem which can be formulated as a linear regression problem. The correctness and high performance of the proposed neural networks are illustrated by extensive computer simulation results.
Parallel Implementation of Riccati Recursion for Solving Linear-Quadratic Control Problems
DEFF Research Database (Denmark)
Frison, Gianluca; Jørgensen, John Bagterp
2013-01-01
In both Active-Set (AS) and Interior-Point (IP) algorithms for Model Predictive Control (MPC), sub-problems in the form of linear-quadratic (LQ) control problems need to be solved at each iteration. The solution of these sub-problems is usually the main computational effort. In this paper...... an alternative version of the Riccati recursion solver for LQ control problems is presented. The performance of both the classical and the alternative version is analyzed from a theoretical as well as a numerical point of view, and the alternative version is found to be approximately 50% faster than...
Multigrid for the Galerkin least squares method in linear elasticity: The pure displacement problem
Energy Technology Data Exchange (ETDEWEB)
Yoo, Jaechil [Univ. of Wisconsin, Madison, WI (United States)
1996-12-31
Franca and Stenberg developed several Galerkin least squares methods for the solution of the problem of linear elasticity. That work concerned itself only with the error estimates of the method. It did not address the related problem of finding effective methods for the solution of the associated linear systems. In this work, we prove the convergence of a multigrid (W-cycle) method. This multigrid is robust in that the convergence is uniform as the parameter, v, goes to 1/2 Computational experiments are included.
A Compensatory Approach to Multiobjective Linear Transportation Problem with Fuzzy Cost Coefficients
Directory of Open Access Journals (Sweden)
Hale Gonce Kocken
2011-01-01
Full Text Available This paper deals with the Multiobjective Linear Transportation Problem that has fuzzy cost coefficients. In the solution procedure, many objectives may conflict with each other; therefore decision-making process becomes complicated. And also due to the fuzziness in the costs, this problem has a nonlinear structure. In this paper, fuzziness in the objective functions is handled with a fuzzy programming technique in the sense of multiobjective approach. And then we present a compensatory approach to solve Multiobjective Linear Transportation Problem with fuzzy cost coefficients by using Werner's and operator. Our approach generates compromise solutions which are both compensatory and Pareto optimal. A numerical example has been provided to illustrate the problem.
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.)
Mixed problems for linear symmetric hyperbolic systems with characteristic boundary conditions
International Nuclear Information System (INIS)
Secchi, P.
1994-01-01
We consider the initial-boundary value problem for symmetric hyperbolic systems with characteristic boundary of constant multiplicity. In the linear case we give some results about the existence of regular solutions in suitable functions spaces which take in account the loss of regularity in the normal direction to the characteristic boundary. We also consider the equations of ideal magneto-hydrodynamics under perfectly conducting wall boundary conditions and give some results about the solvability of such mixed problem. (author). 16 refs
Stress-constrained truss topology optimization problems that can be solved by linear programming
DEFF Research Database (Denmark)
Stolpe, Mathias; Svanberg, Krister
2004-01-01
We consider the problem of simultaneously selecting the material and determining the area of each bar in a truss structure in such a way that the cost of the structure is minimized subject to stress constraints under a single load condition. We show that such problems can be solved by linear...... programming to give the global optimum, and that two different materials are always sufficient in an optimal structure....
Fuzzy solution of the linear programming problem with interval coefficients in the constraints
Dorota Kuchta
2005-01-01
A fuzzy concept of solving the linear programming problem with interval coefficients is proposed. For each optimism level of the decision maker (where the optimism concerns the certainty that no errors have been committed in the estimation of the interval coefficients and the belief that optimistic realisations of the interval coefficients will occur) another interval solution of the problem will be generated and the decision maker will be able to choose the final solution having a complete v...
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)
Rajesh Ramaswamy
2011-01-01
Full Text Available Stochastic effects from correlated noise non-trivially modulate the kinetics of non-linear chemical reaction networks. This is especially important in systems where reactions are confined to small volumes and reactants are delivered in bursts. We characterise how the two noise sources confinement and burst modulate the relaxation kinetics of a non-linear reaction network around a non-equilibrium steady state. We find that the lifetimes of species change with burst input and confinement. Confinement increases the lifetimes of all species that are involved in any non-linear reaction as a reactant. Burst monotonically increases or decreases lifetimes. Competition between burst-induced and confinement-induced modulation may hence lead to a non-monotonic modulation. We quantify lifetime as the integral of the time autocorrelation function (ACF of concentration fluctuations around a non-equilibrium steady state of the reaction network. Furthermore, we look at the first and second derivatives of the ACF, each of which is affected in opposite ways by burst and confinement. This allows discriminating between these two noise sources. We analytically derive the ACF from the linear Fokker-Planck approximation of the chemical master equation in order to establish a baseline for the burst-induced modulation at low confinement. Effects of higher confinement are then studied using a partial-propensity stochastic simulation algorithm. The results presented here may help understand the mechanisms that deviate stochastic kinetics from its deterministic counterpart. In addition, they may be instrumental when using fluorescence-lifetime imaging microscopy (FLIM or fluorescence-correlation spectroscopy (FCS to measure confinement and burst in systems with known reaction rates, or, alternatively, to correct for the effects of confinement and burst when experimentally measuring reaction rates.
Ramaswamy, Rajesh; Sbalzarini, Ivo F; González-Segredo, Nélido
2011-01-28
Stochastic effects from correlated noise non-trivially modulate the kinetics of non-linear chemical reaction networks. This is especially important in systems where reactions are confined to small volumes and reactants are delivered in bursts. We characterise how the two noise sources confinement and burst modulate the relaxation kinetics of a non-linear reaction network around a non-equilibrium steady state. We find that the lifetimes of species change with burst input and confinement. Confinement increases the lifetimes of all species that are involved in any non-linear reaction as a reactant. Burst monotonically increases or decreases lifetimes. Competition between burst-induced and confinement-induced modulation may hence lead to a non-monotonic modulation. We quantify lifetime as the integral of the time autocorrelation function (ACF) of concentration fluctuations around a non-equilibrium steady state of the reaction network. Furthermore, we look at the first and second derivatives of the ACF, each of which is affected in opposite ways by burst and confinement. This allows discriminating between these two noise sources. We analytically derive the ACF from the linear Fokker-Planck approximation of the chemical master equation in order to establish a baseline for the burst-induced modulation at low confinement. Effects of higher confinement are then studied using a partial-propensity stochastic simulation algorithm. The results presented here may help understand the mechanisms that deviate stochastic kinetics from its deterministic counterpart. In addition, they may be instrumental when using fluorescence-lifetime imaging microscopy (FLIM) or fluorescence-correlation spectroscopy (FCS) to measure confinement and burst in systems with known reaction rates, or, alternatively, to correct for the effects of confinement and burst when experimentally measuring reaction rates.
Analysis of junior high school students' attempt to solve a linear inequality problem
Taqiyuddin, Muhammad; Sumiaty, Encum; Jupri, Al
2017-08-01
Linear inequality is one of fundamental subjects within junior high school mathematics curricula. Several studies have been conducted to asses students' perform on linear inequality. However, it can hardly be found that linear inequality problems are in the form of "ax + b condition leads to the research questions concerning students' attempt on solving a simple linear inequality problem in this form. In order to do so, the written test was administered to 58 students from two schools in Bandung followed by interviews. The other sources of the data are from teachers' interview and mathematics books used by students. After that, the constant comparative method was used to analyse the data. The result shows that the majority approached the question by doing algebraic operations. Interestingly, most of them did it incorrectly. In contrast, algebraic operations were correctly used by some of them. Moreover, the others performed expected-numbers solution, rewriting the question, translating the inequality into words, and blank answer. Furthermore, we found that there is no one who was conscious of the existence of all-numbers solution. It was found that this condition is reasonably due to how little the learning components concern about why a procedure of solving a linear inequality works and possibilities of linear inequality solution.
Efficient Implementation of the Riccati Recursion for Solving Linear-Quadratic Control Problems
DEFF Research Database (Denmark)
Frison, Gianluca; Jørgensen, John Bagterp
2013-01-01
In both Active-Set (AS) and Interior-Point (IP) algorithms for Model Predictive Control (MPC), sub-problems in the form of linear-quadratic (LQ) control problems need to be solved at each iteration. The solution of these sub-problems is typically the main computational effort at each iteration....... In this paper, we compare a number of solvers for an extended formulation of the LQ control problem: a Riccati recursion based solver can be considered the best choice for the general problem with dense matrices. Furthermore, we present a novel version of the Riccati solver, that makes use of the Cholesky...... factorization of the Pn matrices to reduce the number of flops. When combined with regularization and mixed precision, this algorithm can solve large instances of the LQ control problem up to 3 times faster than the classical Riccati solver....
International Nuclear Information System (INIS)
Sentis, R.
1984-07-01
The radiative transfer equations may be approximated by a non linear diffusion equation (called Rosseland equation) when the mean free paths of the photons are small with respect to the size of the medium. Some technical assomptions are made, namely about the initial conditions, to avoid any problem of initial layer terms
Visual, Algebraic and Mixed Strategies in Visually Presented Linear Programming Problems.
Shama, Gilli; Dreyfus, Tommy
1994-01-01
Identified and classified solution strategies of (n=49) 10th-grade students who were presented with linear programming problems in a predominantly visual setting in the form of a computerized game. Visual strategies were developed more frequently than either algebraic or mixed strategies. Appendix includes questionnaires. (Contains 11 references.)…
Remark on periodic boundary-value problem for second-order linear ordinary differential equations
Czech Academy of Sciences Publication Activity Database
Dosoudilová, M.; Lomtatidze, Alexander
2018-01-01
Roč. 2018, č. 13 (2018), s. 1-7 ISSN 1072-6691 Institutional support: RVO:67985840 Keywords : second-order linear equation * periodic boundary value problem * unique solvability Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics Impact factor: 0.954, year: 2016 https://ejde.math.txstate.edu/Volumes/2018/13/abstr.html
Kent, James; Holdaway, Daniel
2015-01-01
A number of geophysical applications require the use of the linearized version of the full model. One such example is in numerical weather prediction, where the tangent linear and adjoint versions of the atmospheric model are required for the 4DVAR inverse problem. The part of the model that represents the resolved scale processes of the atmosphere is known as the dynamical core. Advection, or transport, is performed by the dynamical core. It is a central process in many geophysical applications and is a process that often has a quasi-linear underlying behavior. However, over the decades since the advent of numerical modelling, significant effort has gone into developing many flavors of high-order, shape preserving, nonoscillatory, positive definite advection schemes. These schemes are excellent in terms of transporting the quantities of interest in the dynamical core, but they introduce nonlinearity through the use of nonlinear limiters. The linearity of the transport schemes used in Goddard Earth Observing System version 5 (GEOS-5), as well as a number of other schemes, is analyzed using a simple 1D setup. The linearized version of GEOS-5 is then tested using a linear third order scheme in the tangent linear version.
Minimization of Linear Functionals Defined on| Solutions of Large-Scale Discrete Ill-Posed Problems
DEFF Research Database (Denmark)
Elden, Lars; Hansen, Per Christian; Rojas, Marielba
2003-01-01
The minimization of linear functionals de ned on the solutions of discrete ill-posed problems arises, e.g., in the computation of con dence intervals for these solutions. In 1990, Elden proposed an algorithm for this minimization problem based on a parametric-programming reformulation involving...... the solution of a sequence of trust-region problems, and using matrix factorizations. In this paper, we describe MLFIP, a large-scale version of this algorithm where a limited-memory trust-region solver is used on the subproblems. We illustrate the use of our algorithm in connection with an inverse heat...
Directory of Open Access Journals (Sweden)
Animesh Biswas
2016-04-01
Full Text Available This paper deals with fuzzy goal programming approach to solve fuzzy linear bilevel integer programming problems with fuzzy probabilistic constraints following Pareto distribution and Frechet distribution. In the proposed approach a new chance constrained programming methodology is developed from the view point of managing those probabilistic constraints in a hybrid fuzzy environment. A method of defuzzification of fuzzy numbers using ?-cut has been adopted to reduce the problem into a linear bilevel integer programming problem. The individual optimal value of the objective of each DM is found in isolation to construct the fuzzy membership goals. Finally, fuzzy goal programming approach is used to achieve maximum degree of each of the membership goals by minimizing under deviational variables in the decision making environment. To demonstrate the efficiency of the proposed approach, a numerical example is provided.
A primal-dual exterior point algorithm for linear programming problems
Directory of Open Access Journals (Sweden)
Samaras Nikolaos
2009-01-01
Full Text Available The aim of this paper is to present a new simplex type algorithm for the Linear Programming Problem. The Primal - Dual method is a Simplex - type pivoting algorithm that generates two paths in order to converge to the optimal solution. The first path is primal feasible while the second one is dual feasible for the original problem. Specifically, we use a three-phase-implementation. The first two phases construct the required primal and dual feasible solutions, using the Primal Simplex algorithm. Finally, in the third phase the Primal - Dual algorithm is applied. Moreover, a computational study has been carried out, using randomly generated sparse optimal linear problems, to compare its computational efficiency with the Primal Simplex algorithm and also with MATLAB's Interior Point Method implementation. The algorithm appears to be very promising since it clearly shows its superiority to the Primal Simplex algorithm as well as its robustness over the IPM algorithm.
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.
A Mixed Integer Linear Programming Approach to Electrical Stimulation Optimization Problems.
Abouelseoud, Gehan; Abouelseoud, Yasmine; Shoukry, Amin; Ismail, Nour; Mekky, Jaidaa
2018-02-01
Electrical stimulation optimization is a challenging problem. Even when a single region is targeted for excitation, the problem remains a constrained multi-objective optimization problem. The constrained nature of the problem results from safety concerns while its multi-objectives originate from the requirement that non-targeted regions should remain unaffected. In this paper, we propose a mixed integer linear programming formulation that can successfully address the challenges facing this problem. Moreover, the proposed framework can conclusively check the feasibility of the stimulation goals. This helps researchers to avoid wasting time trying to achieve goals that are impossible under a chosen stimulation setup. The superiority of the proposed framework over alternative methods is demonstrated through simulation examples.
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.
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.
On the problem of linear calibration for a reading system of measuring devices
International Nuclear Information System (INIS)
Shigaev, V.N.
1978-01-01
The problem of gauging the frame of reference of a measuring device has been giVen a general approach which consists in finding an approximated inverse transformation on the basis of a partial diagram of a direct transformation which is defined on a given set, D, within the limits of the device measuring range. The following linear models of frame of reference are discussed: a general oblique system; a rectangular system with axes having different scales; a rectangular system with similar scale axes. Linear distortion for two rectangular models has been assessed. It is pointed out that the best approximation to the reduction operation should be found over the D set
APPLYING ROBUST RANKING METHOD IN TWO PHASE FUZZY OPTIMIZATION LINEAR PROGRAMMING PROBLEMS (FOLPP
Directory of Open Access Journals (Sweden)
Monalisha Pattnaik
2014-12-01
Full Text Available Background: This paper explores the solutions to the fuzzy optimization linear program problems (FOLPP where some parameters are fuzzy numbers. In practice, there are many problems in which all decision parameters are fuzzy numbers, and such problems are usually solved by either probabilistic programming or multi-objective programming methods. Methods: In this paper, using the concept of comparison of fuzzy numbers, a very effective method is introduced for solving these problems. This paper extends linear programming based problem in fuzzy environment. With the problem assumptions, the optimal solution can still be theoretically solved using the two phase simplex based method in fuzzy environment. To handle the fuzzy decision variables can be initially generated and then solved and improved sequentially using the fuzzy decision approach by introducing robust ranking technique. Results and conclusions: The model is illustrated with an application and a post optimal analysis approach is obtained. The proposed procedure was programmed with MATLAB (R2009a version software for plotting the four dimensional slice diagram to the application. Finally, numerical example is presented to illustrate the effectiveness of the theoretical results, and to gain additional managerial insights.
Directory of Open Access Journals (Sweden)
Nurdan Cetin
2014-01-01
Full Text Available We consider a multiobjective linear fractional transportation problem (MLFTP with several fractional criteria, such as, the maximization of the transport profitability like profit/cost or profit/time, and its two properties are source and destination. Our aim is to introduce MLFTP which has not been studied in literature before and to provide a fuzzy approach which obtain a compromise Pareto-optimal solution for this problem. To do this, first, we present a theorem which shows that MLFTP is always solvable. And then, reducing MLFTP to the Zimmermann’s “min” operator model which is the max-min problem, we construct Generalized Dinkelbach’s Algorithm for solving the obtained problem. Furthermore, we provide an illustrative numerical example to explain this fuzzy approach.
Problems of systems dataware using optoelectronic measuring means of linear displacement
Bazykin, S. N.; Bazykina, N. A.; Samohina, K. S.
2017-10-01
Problems of the dataware of the systems with the use of optoelectronic means of the linear displacement are considered in the article. The classification of the known physical effects, realized by the means of information-measuring systems, is given. The organized analysis of information flows in technical systems from the standpoint of determination of inaccuracies of measurement and management was conducted. In spite of achieved successes in automation of machine-building and instruments-building equipment in the field of dataware of the technical systems, there are unresolved problems, concerning the qualitative aspect of the production process. It was shown that the given problem can be solved using optoelectronic lazer information-measuring systems. Such information-measuring systems are capable of not only executing the measuring functions, but also solving the problems of management and control during processing, thereby guaranteeing the quality of final products.
International Nuclear Information System (INIS)
Jian Jinbao; Li Jianling; Mo Xingde
2006-01-01
This paper discusses a kind of optimization problem with linear complementarity constraints, and presents a sequential quadratic programming (SQP) algorithm for solving a stationary point of the problem. The algorithm is a modification of the SQP algorithm proposed by Fukushima et al. [Computational Optimization and Applications, 10 (1998),5-34], and is based on a reformulation of complementarity condition as a system of linear equations. At each iteration, one quadratic programming and one system of equations needs to be solved, and a curve search is used to yield the step size. Under some appropriate assumptions, including the lower-level strict complementarity, but without the upper-level strict complementarity for the inequality constraints, the algorithm is proved to possess strong convergence and superlinear convergence. Some preliminary numerical results are reported
A class of singular Ro-matrices and extensions to semidefinite linear complementarity problems
Directory of Open Access Journals (Sweden)
Sivakumar K.C.
2013-01-01
Full Text Available For ARnxn and qRn, the linear complementarity problem LCP(A, q is to determine if there is xRn such that x ≥ 0; y = Ax + q ≥ 0 and xT y = 0. Such an x is called a solution of LCP(A,q. A is called an Ro-matrix if LCP(A,0 has zero as the only solution. In this article, the class of R0-matrices is extended to include typically singular matrices, by requiring in addition that the solution x above belongs to a subspace of Rn. This idea is then extended to semidefinite linear complementarity problems, where a characterization is presented for the multplicative transformation.
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 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.
Mixed integer linear programming model for dynamic supplier selection problem considering discounts
Directory of Open Access Journals (Sweden)
Adi Wicaksono Purnawan
2018-01-01
Full Text Available Supplier selection is one of the most important elements in supply chain management. This function involves evaluation of many factors such as, material costs, transportation costs, quality, delays, supplier capacity, storage capacity and others. Each of these factors varies with time, therefore, supplier identified for one period is not necessarily be same for the next period to supply the same product. So, mixed integer linear programming (MILP was developed to overcome the dynamic supplier selection problem (DSSP. In this paper, a mixed integer linear programming model is built to solve the lot-sizing problem with multiple suppliers, multiple periods, multiple products and quantity discounts. The buyer has to make a decision for some products which will be supplied by some suppliers for some periods cosidering by discount. To validate the MILP model with randomly generated data. The model is solved by Lingo 16.
A Class of Optimal Portfolio Liquidation Problems with a Linear Decreasing Impact
Directory of Open Access Journals (Sweden)
Jiangming Ma
2017-01-01
Full Text Available A problem of an optimal liquidation is investigated by using the Almgren-Chriss market impact model on the background that the n agents liquidate assets completely. The impact of market is divided into three components: unaffected price process, permanent impact, and temporary impact. The key element is that the variable temporary market impact is analyzed. When the temporary market impact is decreasing linearly, the optimal problem is described by a Nash equilibrium in finite time horizon. The stochastic component of the price process is eliminated from the mean-variance. Mathematically, the Nash equilibrium is considered as the second-order linear differential equation with variable coefficients. We prove the existence and uniqueness of solutions for the differential equation with two boundaries and find the closed-form solutions in special situations. The numerical examples and properties of the solution are given. The corresponding finance phenomenon is interpreted.
On an Optimal -Control Problem in Coefficients for Linear Elliptic Variational Inequality
Directory of Open Access Journals (Sweden)
Olha P. Kupenko
2013-01-01
Full Text Available We consider optimal control problems for linear degenerate elliptic variational inequalities with homogeneous Dirichlet boundary conditions. We take the matrix-valued coefficients in the main part of the elliptic operator as controls in . Since the eigenvalues of such matrices may vanish and be unbounded in , it leads to the “noncoercivity trouble.” Using the concept of convergence in variable spaces and following the direct method in the calculus of variations, we establish the solvability of the optimal control problem in the class of the so-called -admissible solutions.
An investigation on the solutions for the linear inverse problem in gamma ray tomography
International Nuclear Information System (INIS)
Araujo, Bruna G.M.; Dantas, Carlos C.; Santos, Valdemir A. dos; Finkler, Christine L.L.; Oliveira, Eric F. de; Melo, Silvio B.; Santos, M. Graca dos
2009-01-01
This paper the results obtained in single beam gamma ray tomography are investigated according to direct problem formulation and the applied solution for the linear system of equations. By image reconstruction based algebraic computational algorithms are used. The sparse under and over-determined linear system of equations was analyzed. Build in functions of Matlab software were applied and optimal solutions were investigate. Experimentally a section of the tube is scanned from various positions and at different angles. The solution, to find the vector of coefficients μ, from the vector of measured p values through the W matrix inversion, constitutes an inverse problem. A industrial tomography process requires a numerical solution of the system of equations. The definition of inverse problem according to Hadmard's is considered and as well the requirement of a well posed problem to find stable solutions. The formulation of the basis function and the computational algorithm to structure the weight matrix W were analyzed. For W full rank matrix the obtained solution is unique as expected. Total Least Squares was implemented which theory and computation algorithm gives adequate treatment for the problems due to non-unique solutions of the system of equations. Stability of the solution was investigating by means of a regularization technique and the comparison shows that it improves the results. An optimal solution as a function of the image quality, computation time and minimum residuals were quantified. The corresponding reconstructed images are shown in 3D graphics in order to compare with the solution. (author)
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.
Directory of Open Access Journals (Sweden)
Wanfang Shen
2012-01-01
Full Text Available The mathematical formulation for a quadratic optimal control problem governed by a linear quasiparabolic integrodifferential equation is studied. The control constrains are given in an integral sense: Uad={u∈X;∫ΩUu⩾0, t∈[0,T]}. Then the a posteriori error estimates in L∞(0,T;H1(Ω-norm and L2(0,T;L2(Ω-norm for both the state and the control approximation are given.
Multi-point boundary value problems for linear functional-differential equations
Czech Academy of Sciences Publication Activity Database
Domoshnitsky, A.; Hakl, Robert; Půža, Bedřich
2017-01-01
Roč. 24, č. 2 (2017), s. 193-206 ISSN 1072-947X Institutional support: RVO:67985840 Keywords : boundary value problems * linear functional- differential equations * functional- differential inequalities Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics Impact factor: 0.290, year: 2016 https://www.degruyter.com/view/j/gmj.2017.24.issue-2/gmj-2016-0076/gmj-2016-0076.xml
Multi-point boundary value problems for linear functional-differential equations
Czech Academy of Sciences Publication Activity Database
Domoshnitsky, A.; Hakl, Robert; Půža, Bedřich
2017-01-01
Roč. 24, č. 2 (2017), s. 193-206 ISSN 1072-947X Institutional support: RVO:67985840 Keywords : boundary value problems * linear functional-differential equations * functional-differential inequalities Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics Impact factor: 0.290, year: 2016 https://www.degruyter.com/view/j/gmj.2017.24.issue-2/gmj-2016-0076/gmj-2016-0076. xml
Ito, Kazufumi; Teglas, Russell
1987-01-01
The numerical scheme based on the Legendre-tau approximation is proposed to approximate the feedback solution to the linear quadratic optimal control problem for hereditary differential systems. The convergence property is established using Trotter ideas. The method yields very good approximations at low orders and provides an approximation technique for computing closed-loop eigenvalues of the feedback system. A comparison with existing methods (based on averaging and spline approximations) is made.
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.
Ito, K.; Teglas, R.
1984-01-01
The numerical scheme based on the Legendre-tau approximation is proposed to approximate the feedback solution to the linear quadratic optimal control problem for hereditary differential systems. The convergence property is established using Trotter ideas. The method yields very good approximations at low orders and provides an approximation technique for computing closed-loop eigenvalues of the feedback system. A comparison with existing methods (based on averaging and spline approximations) is made.
FUNDAMENTAL MATRIX OF LINEAR CONTINUOUS SYSTEM IN THE PROBLEM OF ESTIMATING ITS TRANSPORT DELAY
Directory of Open Access Journals (Sweden)
N. A. Dudarenko
2014-09-01
Full Text Available The paper deals with the problem of quantitative estimation for transport delay of linear continuous systems. The main result is received by means of fundamental matrix of linear differential equations solutions specified in the normal Cauchy form for the cases of SISO and MIMO systems. Fundamental matrix has the dual property. It means that the weight function of the system can be formed as a free motion of systems. Last one is generated by the vector of initial system conditions, which coincides with the matrix input of the system being researched. Thus, using the properties of the system- solving for fundamental matrix has given the possibility to solve the problem of estimating transport linear continuous system delay without the use of derivation procedure in hardware environment and without formation of exogenous Dirac delta function. The paper is illustrated by examples. The obtained results make it possible to solve the problem of modeling the pure delay links using consecutive chain of aperiodic links of the first order with the equal time constants. Modeling results have proved the correctness of obtained computations. Knowledge of transport delay can be used when configuring multi- component technological complexes and in the diagnosis of their possible functional degeneration.
Stability of multi-objective bi-level linear programming problems under fuzziness
Directory of Open Access Journals (Sweden)
Abo-Sinna Mahmoud A.
2013-01-01
Full Text Available This paper deals with multi-objective bi-level linear programming problems under fuzzy environment. In the proposed method, tentative solutions are obtained and evaluated by using the partial information on preference of the decision-makers at each level. The existing results concerning the qualitative analysis of some basic notions in parametric linear programming problems are reformulated to study the stability of multi-objective bi-level linear programming problems. An algorithm for obtaining any subset of the parametric space, which has the same corresponding Pareto optimal solution, is presented. Also, this paper established the model for the supply-demand interaction in the age of electronic commerce (EC. First of all, the study uses the individual objectives of both parties as the foundation of the supply-demand interaction. Subsequently, it divides the interaction, in the age of electronic commerce, into the following two classifications: (i Market transactions, with the primary focus on the supply demand relationship in the marketplace; and (ii Information service, with the primary focus on the provider and the user of information service. By applying the bi-level programming technique of interaction process, the study will develop an analytical process to explain how supply-demand interaction achieves a compromise or why the process fails. Finally, a numerical example of information service is provided for the sake of illustration.
A parallel algorithm for solving linear equations arising from one-dimensional network problems
International Nuclear Information System (INIS)
Mesina, G.L.
1991-01-01
One-dimensional (1-D) network problems, such as those arising from 1- D fluid simulations and electrical circuitry, produce systems of sparse linear equations which are nearly tridiagonal and contain a few non-zero entries outside the tridiagonal. Most direct solution techniques for such problems either do not take advantage of the special structure of the matrix or do not fully utilize parallel computer architectures. We describe a new parallel direct linear equation solution algorithm, called TRBR, which is especially designed to take advantage of this structure on MIMD shared memory machines. The new method belongs to a family of methods which split the coefficient matrix into the sum of a tridiagonal matrix T and a matrix comprised of the remaining coefficients R. Efficient tridiagonal methods are used to algebraically simplify the linear system. A smaller auxiliary subsystem is created and solved and its solution is used to calculate the solution of the original system. The newly devised BR method solves the subsystem. The serial and parallel operation counts are given for the new method and related earlier methods. TRBR is shown to have the smallest operation count in this class of direct methods. Numerical results are given. Although the algorithm is designed for one-dimensional networks, it has been applied successfully to three-dimensional problems as well. 20 refs., 2 figs., 4 tabs
Scilab software as an alternative low-cost computing in solving the linear equations problem
Agus, Fahrul; Haviluddin
2017-02-01
Numerical computation packages are widely used both in teaching and research. These packages consist of license (proprietary) and open source software (non-proprietary). One of the reasons to use the package is a complexity of mathematics function (i.e., linear problems). Also, number of variables in a linear or non-linear function has been increased. The aim of this paper was to reflect on key aspects related to the method, didactics and creative praxis in the teaching of linear equations in higher education. If implemented, it could be contribute to a better learning in mathematics area (i.e., solving simultaneous linear equations) that essential for future engineers. The focus of this study was to introduce an additional numerical computation package of Scilab as an alternative low-cost computing programming. In this paper, Scilab software was proposed some activities that related to the mathematical models. In this experiment, four numerical methods such as Gaussian Elimination, Gauss-Jordan, Inverse Matrix, and Lower-Upper Decomposition (LU) have been implemented. The results of this study showed that a routine or procedure in numerical methods have been created and explored by using Scilab procedures. Then, the routine of numerical method that could be as a teaching material course has exploited.
Directory of Open Access Journals (Sweden)
S. K. Roy-Choudhuri
1990-01-01
Full Text Available In the present paper we consider the magneto-thermo-elastic wave produced by a thermal shock in a perfectly conducting elastic half-space. Here the Lord-Shulman theory of thermoelasticity [1] is used to account for the interaction between the elastic and thermal fields. The solution obtained in analytical form reduces to those of Kaliski and Nowacki [2] when the coupling between the temperature and strain fields and the relaxation time are neglected. The results also agree with those of Massalas and DaLamangas [3] in absence of the thermal relaxation time.
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
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.
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...
IESIP - AN IMPROVED EXPLORATORY SEARCH TECHNIQUE FOR PURE INTEGER LINEAR PROGRAMMING PROBLEMS
Fogle, F. R.
1994-01-01
IESIP, an Improved Exploratory Search Technique for Pure Integer Linear Programming Problems, addresses the problem of optimizing an objective function of one or more variables subject to a set of confining functions or constraints by a method called discrete optimization or integer programming. Integer programming is based on a specific form of the general linear programming problem in which all variables in the objective function and all variables in the constraints are integers. While more difficult, integer programming is required for accuracy when modeling systems with small numbers of components such as the distribution of goods, machine scheduling, and production scheduling. IESIP establishes a new methodology for solving pure integer programming problems by utilizing a modified version of the univariate exploratory move developed by Robert Hooke and T.A. Jeeves. IESIP also takes some of its technique from the greedy procedure and the idea of unit neighborhoods. A rounding scheme uses the continuous solution found by traditional methods (simplex or other suitable technique) and creates a feasible integer starting point. The Hook and Jeeves exploratory search is modified to accommodate integers and constraints and is then employed to determine an optimal integer solution from the feasible starting solution. The user-friendly IESIP allows for rapid solution of problems up to 10 variables in size (limited by DOS allocation). Sample problems compare IESIP solutions with the traditional branch-and-bound approach. IESIP is written in Borland's TURBO Pascal for IBM PC series computers and compatibles running DOS. Source code and an executable are provided. The main memory requirement for execution is 25K. This program is available on a 5.25 inch 360K MS DOS format diskette. IESIP was developed in 1990. IBM is a trademark of International Business Machines. TURBO Pascal is registered by Borland International.
Comments on the comparison of global methods for linear two-point boundary value problems
International Nuclear Information System (INIS)
de Boor, C.; Swartz, B.
1977-01-01
A more careful count of the operations involved in solving the linear system associated with collocation of a two-point boundary value problem using a rough splines reverses results recently reported by others in this journal. In addition, it is observed that the use of the technique of ''condensation of parameters'' can decrease the computer storage required. Furthermore, the use of a particular highly localized basis can also reduce the setup time when the mesh is irregular. Finally, operation counts are roughly estimated for the solution of certain linear system associated with two competing collocation methods; namely, collocation with smooth splines and collocation of the equivalent first order system with continuous piecewise polynomials
Li, Yanning
2013-10-01
This article presents a new robust control framework for transportation problems in which the state is modeled by a first order scalar conservation law. Using an equivalent formulation based on a Hamilton-Jacobi equation, we pose the problem of controlling the state of the system on a network link, using boundary flow control, as a Linear Program. Unlike many previously investigated transportation control schemes, this method yields a globally optimal solution and is capable of handling shocks (i.e. discontinuities in the state of the system). We also demonstrate that the same framework can handle robust control problems, in which the uncontrollable components of the initial and boundary conditions are encoded in intervals on the right hand side of inequalities in the linear program. The lower bound of the interval which defines the smallest feasible solution set is used to solve the robust LP (or MILP if the objective function depends on boolean variables). Since this framework leverages the intrinsic properties of the Hamilton-Jacobi equation used to model the state of the system, it is extremely fast. Several examples are given to demonstrate the performance of the robust control solution and the trade-off between the robustness and the optimality. © 2013 IEEE.
Li, Yanning; Canepa, Edward S.; Claudel, Christian G.
2013-01-01
This article presents a new robust control framework for transportation problems in which the state is modeled by a first order scalar conservation law. Using an equivalent formulation based on a Hamilton-Jacobi equation, we pose the problem of controlling the state of the system on a network link, using boundary flow control, as a Linear Program. Unlike many previously investigated transportation control schemes, this method yields a globally optimal solution and is capable of handling shocks (i.e. discontinuities in the state of the system). We also demonstrate that the same framework can handle robust control problems, in which the uncontrollable components of the initial and boundary conditions are encoded in intervals on the right hand side of inequalities in the linear program. The lower bound of the interval which defines the smallest feasible solution set is used to solve the robust LP (or MILP if the objective function depends on boolean variables). Since this framework leverages the intrinsic properties of the Hamilton-Jacobi equation used to model the state of the system, it is extremely fast. Several examples are given to demonstrate the performance of the robust control solution and the trade-off between the robustness and the optimality. © 2013 IEEE.
Directory of Open Access Journals (Sweden)
Horacio Hideki Yanasse
2013-01-01
Full Text Available Neste trabalho revemos alguns modelos lineares e não lineares inteiros para gerar padrões de corte bidimensionais guilhotinados de 2 estágios, incluindo os casos exato e não exato e restrito e irrestrito. Esses problemas são casos particulares do problema da mochila bidimensional. Apresentamos também novos modelos para gerar esses padrões de corte, baseados em adaptações ou extensões de modelos para gerar padrões de corte bidimensionais restritos 1-grupo. Padrões 2 estágios aparecem em diferentes processos de corte, como, por exemplo, em indústrias de móveis e de chapas de madeira. Os modelos são úteis para a pesquisa e o desenvolvimento de métodos de solução mais eficientes, explorando estruturas particulares, a decomposição do modelo, relaxações do modelo etc. Eles também são úteis para a avaliação do desempenho de heurísticas, já que permitem (pelo menos para problemas de tamanho moderado uma estimativa do gap de otimalidade de soluções obtidas por heurísticas. Para ilustrar a aplicação dos modelos, analisamos os resultados de alguns experimentos computacionais com exemplos da literatura e outros gerados aleatoriamente. Os resultados foram produzidos usando um software comercial conhecido e mostram que o esforço computacional necessário para resolver os modelos pode ser bastante diferente.In this work we review some linear and nonlinear integer models to generate two stage two-dimensional guillotine cutting patterns, including the constrained, non constrained, exact and non exact cases. These problems are particular cases of the two dimensional knapsack problems. We also present new models to generate these cutting patterns, based on adaptations and extensions of models that generate one-group constrained two dimensional cutting patterns. Two stage patterns arise in different cutting processes like, for instance, in the furniture industry and wooden hardboards. The models are useful for the research and
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.
Boundary value problems of the circular cylinders in the strain-gradient theory of linear elasticity
International Nuclear Information System (INIS)
Kao, B.G.
1979-11-01
Three boundary value problems in the strain-gradient theory of linear elasticity are solved for circular cylinders. They are the twisting of circular cylinder, uniformly pressuring of concentric circular cylinder, and pure-bending of simply connected cylinder. The comparisons of these solutions with the solutions in classical elasticity and in couple-stress theory reveal the differences in the stress fields as well as the apparent stress fields due to the influences of the strain-gradient. These aspects of the strain-gradient theory could be important in modeling the failure behavior of structural materials
DEFF Research Database (Denmark)
Cetin, Bilge Kartal; Prasad, Neeli R.; Prasad, Ramjee
2011-01-01
In wireless sensor networks, one of the key challenge is to achieve minimum energy consumption in order to maximize network lifetime. In fact, lifetime depends on many parameters: the topology of the sensor network, the data aggregation regime in the network, the channel access schemes, the routing...... protocols, and the energy model for transmission. In this paper, we tackle the routing challenge for maximum lifetime of the sensor network. We introduce a novel linear programming approach to the maximum lifetime routing problem. To the best of our knowledge, this is the first mathematical programming...
International Nuclear Information System (INIS)
Noack, K.
1982-01-01
The perturbation source method may be a powerful Monte-Carlo means to calculate small effects in a particle field. In a preceding paper we have formulated this methos in inhomogeneous linear particle transport problems describing the particle fields by solutions of Fredholm integral equations and have derived formulae for the second moment of the difference event point estimator. In the present paper we analyse the general structure of its variance, point out the variance peculiarities, discuss the dependence on certain transport games and on generation procedures of the auxiliary particles and draw conclusions to improve this method
Solving the linear radiation problem using a volume method on an overset grid
DEFF Research Database (Denmark)
Read, Robert; Bingham, Harry B.
2012-01-01
of numerical results with established analytical solutions. The linear radiation problem is considered in this paper. A two-dimensional computational tool has been developed to calculate the force applied to a floating body of arbitrary form in response to a prescribed displacement. Fourier transforms......This paper describes recent progress towards the development of a computational tool, based on potential ow theory, that can accurately and effciently simulate wave-induced loadings on marine structures. Engsig-Karup et al. (2009) have successfully developed an arbitrary-order, finite...
Pseudoinverse preconditioners and iterative methods for large dense linear least-squares problems
Directory of Open Access Journals (Sweden)
Oskar Cahueñas
2013-05-01
Full Text Available We address the issue of approximating the pseudoinverse of the coefficient matrix for dynamically building preconditioning strategies for the numerical solution of large dense linear least-squares problems. The new preconditioning strategies are embedded into simple and well-known iterative schemes that avoid the use of the, usually ill-conditioned, normal equations. We analyze a scheme to approximate the pseudoinverse, based on Schulz iterative method, and also different iterative schemes, based on extensions of Richardson's method, and the conjugate gradient method, that are suitable for preconditioning strategies. We present preliminary numerical results to illustrate the advantages of the proposed schemes.
Directory of Open Access Journals (Sweden)
Xia Xiong
2018-03-01
Full Text Available Three isostructural cyano-bridged 3d–4f linear heterotrinuclear compounds, (H2.5O4{Ln[TM(CN5(CNH0.5]2(HMPA4} (Ln = YIII, TM = [FeIII]LS (1; Ln = DyIII, TM = [FeIII]LS (2; Ln = DyIII, TM = CoIII (3, have been synthesized and characterized by single-crystal X-ray diffraction. Due to the steric effect of the HMPA ligands, the central lanthanide ions in these compounds possess a low coordination number, six-coordinate, exhibiting a coordination geometry of an axially elongated octahedron with a perfect D4h symmetry. Four HMPA ligands situate in the equatorial plane around the central lanthanide ions, and two [TM(CN5(CNH0.5]2.5− entities occupy the apical positions to form a cyano-bridged 3d–4f linear heterotrinuclear structure. The static magnetic analysis of the three compounds indicated a paramagnetic behavior of compounds 1 and 3, and possible small magnetic interactions between the intramolecular DyIII and [FeIII]LS ions in compound 2. Under zero dc field, the ac magnetic measurements on 2 and 3 revealed the in-phase component (χ′ of the ac susceptibility without frequency dependence and silent out-of-phase component (χ″, which was attributed to the QTM effect induced by the coordination geometry of an axially elongated octahedron for the DyIII ion. Even under a 1 kOe applied dc field, the χ″ components of 2 were revealed frequency dependence without peaks above 2 K. And under a 2 kOe and 3 kOe dc field, the χ″ components of 3 exhibited weak frequency dependence below 4 K with the absence of well-shaped peaks, which confirmed the poor single-ion magnetic relaxation behavior of the six-coordinate DyIII ion excluding any influence from the neighboring [FeIII]LS ions as that in the analogue 2.
Aihong Ren
2016-01-01
This paper is concerned with a class of fully fuzzy bilevel linear programming problems where all the coefficients and decision variables of both objective functions and the constraints are fuzzy numbers. A new approach based on deviation degree measures and a ranking function method is proposed to solve these problems. We first introduce concepts of the feasible region and the fuzzy optimal solution of a fully fuzzy bilevel linear programming problem. In order to obtain a fuzzy optimal solut...
International Nuclear Information System (INIS)
Huang Zhenghai; Gu Weizhe
2008-01-01
In this paper, we construct an augmented system of the standard monotone linear complementarity problem (LCP), and establish the relations between the augmented system and the LCP. We present a smoothing-type algorithm for solving the augmented system. The algorithm is shown to be globally convergent without assuming any prior knowledge of feasibility/infeasibility of the problem. In particular, if the LCP has a solution, then the algorithm either generates a maximal complementary solution of the LCP or detects correctly solvability of the LCP, and in the latter case, an existing smoothing-type algorithm can be directly applied to solve the LCP without any additional assumption and it generates a maximal complementary solution of the LCP; and that if the LCP is infeasible, then the algorithm detect correctly infeasibility of the LCP. To the best of our knowledge, such properties have not appeared in the existing literature for smoothing-type algorithms
Interior point decoding for linear vector channels
International Nuclear Information System (INIS)
Wadayama, T
2008-01-01
In this paper, a novel decoding algorithm for low-density parity-check (LDPC) codes based on convex optimization is presented. The decoding algorithm, called interior point decoding, is designed for linear vector channels. The linear vector channels include many practically important channels such as inter-symbol interference channels and partial response channels. It is shown that the maximum likelihood decoding (MLD) rule for a linear vector channel can be relaxed to a convex optimization problem, which is called a relaxed MLD problem
Interior point decoding for linear vector channels
Energy Technology Data Exchange (ETDEWEB)
Wadayama, T [Nagoya Institute of Technology, Gokiso, Showa-ku, Nagoya, Aichi, 466-8555 (Japan)], E-mail: wadayama@nitech.ac.jp
2008-01-15
In this paper, a novel decoding algorithm for low-density parity-check (LDPC) codes based on convex optimization is presented. The decoding algorithm, called interior point decoding, is designed for linear vector channels. The linear vector channels include many practically important channels such as inter-symbol interference channels and partial response channels. It is shown that the maximum likelihood decoding (MLD) rule for a linear vector channel can be relaxed to a convex optimization problem, which is called a relaxed MLD problem.
Perturbation-Based Regularization for Signal Estimation in Linear Discrete Ill-posed Problems
Suliman, Mohamed Abdalla Elhag; Ballal, Tarig; Al-Naffouri, Tareq Y.
2016-01-01
Estimating the values of unknown parameters from corrupted measured data faces a lot of challenges in ill-posed problems. In such problems, many fundamental estimation methods fail to provide a meaningful stabilized solution. In this work, we propose a new regularization approach and a new regularization parameter selection approach for linear least-squares discrete ill-posed problems. The proposed approach is based on enhancing the singular-value structure of the ill-posed model matrix to acquire a better solution. Unlike many other regularization algorithms that seek to minimize the estimated data error, the proposed approach is developed to minimize the mean-squared error of the estimator which is the objective in many typical estimation scenarios. The performance of the proposed approach is demonstrated by applying it to a large set of real-world discrete ill-posed problems. Simulation results demonstrate that the proposed approach outperforms a set of benchmark regularization methods in most cases. In addition, the approach also enjoys the lowest runtime and offers the highest level of robustness amongst all the tested benchmark regularization methods.
Perturbation-Based Regularization for Signal Estimation in Linear Discrete Ill-posed Problems
Suliman, Mohamed Abdalla Elhag
2016-11-29
Estimating the values of unknown parameters from corrupted measured data faces a lot of challenges in ill-posed problems. In such problems, many fundamental estimation methods fail to provide a meaningful stabilized solution. In this work, we propose a new regularization approach and a new regularization parameter selection approach for linear least-squares discrete ill-posed problems. The proposed approach is based on enhancing the singular-value structure of the ill-posed model matrix to acquire a better solution. Unlike many other regularization algorithms that seek to minimize the estimated data error, the proposed approach is developed to minimize the mean-squared error of the estimator which is the objective in many typical estimation scenarios. The performance of the proposed approach is demonstrated by applying it to a large set of real-world discrete ill-posed problems. Simulation results demonstrate that the proposed approach outperforms a set of benchmark regularization methods in most cases. In addition, the approach also enjoys the lowest runtime and offers the highest level of robustness amongst all the tested benchmark regularization methods.
Ruggeri, Fabrizio
2016-05-12
In this work we develop a Bayesian setting to infer unknown parameters in initial-boundary value problems related to linear parabolic partial differential equations. We realistically assume that the boundary data are noisy, for a given prescribed initial condition. We show how to derive the joint likelihood function for the forward problem, given some measurements of the solution field subject to Gaussian noise. Given Gaussian priors for the time-dependent Dirichlet boundary values, we analytically marginalize the joint likelihood using the linearity of the equation. Our hierarchical Bayesian approach is fully implemented in an example that involves the heat equation. In this example, the thermal diffusivity is the unknown parameter. We assume that the thermal diffusivity parameter can be modeled a priori through a lognormal random variable or by means of a space-dependent stationary lognormal random field. Synthetic data are used to test the inference. We exploit the behavior of the non-normalized log posterior distribution of the thermal diffusivity. Then, we use the Laplace method to obtain an approximated Gaussian posterior and therefore avoid costly Markov Chain Monte Carlo computations. Expected information gains and predictive posterior densities for observable quantities are numerically estimated using Laplace approximation for different experimental setups.
Directory of Open Access Journals (Sweden)
Rubio Gerardo
2011-03-01
Full Text Available We consider the Cauchy problem in ℝd for a class of semilinear parabolic partial differential equations that arises in some stochastic control problems. We assume that the coefficients are unbounded and locally Lipschitz, not necessarily differentiable, with continuous data and local uniform ellipticity. We construct a classical solution by approximation with linear parabolic equations. The linear equations involved can not be solved with the traditional results. Therefore, we construct a classical solution to the linear Cauchy problem under the same hypotheses on the coefficients for the semilinear equation. Our approach is using stochastic differential equations and parabolic differential equations in bounded domains. Finally, we apply the results to a stochastic optimal consumption problem. Nous considérons le problème de Cauchy dans ℝd pour une classe d’équations aux dérivées partielles paraboliques semi linéaires qui se pose dans certains problèmes de contrôle stochastique. Nous supposons que les coefficients ne sont pas bornés et sont localement Lipschitziennes, pas nécessairement différentiables, avec des données continues et ellipticité local uniforme. Nous construisons une solution classique par approximation avec les équations paraboliques linéaires. Les équations linéaires impliquées ne peuvent être résolues avec les résultats traditionnels. Par conséquent, nous construisons une solution classique au problème de Cauchy linéaire sous les mêmes hypothèses sur les coefficients pour l’équation semi-linéaire. Notre approche utilise les équations différentielles stochastiques et les équations différentielles paraboliques dans les domaines bornés. Enfin, nous appliquons les résultats à un problème stochastique de consommation optimale.
Guliyev, Namig J.
2008-01-01
International audience; Inverse problems of recovering the coefficients of Sturm–Liouville problems with the eigenvalue parameter linearly contained in one of the boundary conditions are studied: 1) from the sequences of eigenvalues and norming constants; 2) from two spectra. Necessary and sufficient conditions for the solvability of these inverse problems are obtained.
Nasiri, Saeideh; Kordi, Masoumeh; Gharavi, Morteza Modares
2015-01-01
Background: Self-esteem is a determinant factor of mental health. Individuals with low self-esteem have depression, and low self-esteem is one of main symptoms of depression. Aim of this study is to compare the effects of problem-solving skills and relaxation on the score of self-esteem in women with postpartum depression. Materials and Methods: This clinical trial was performed on 80 women. Sampling was done in Mashhad healthy centers from December 2009 to June 2010. Women were randomly divi...
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.
An improved exploratory search technique for pure integer linear programming problems
Fogle, F. R.
1990-01-01
The development is documented of a heuristic method for the solution of pure integer linear programming problems. The procedure draws its methodology from the ideas of Hooke and Jeeves type 1 and 2 exploratory searches, greedy procedures, and neighborhood searches. It uses an efficient rounding method to obtain its first feasible integer point from the optimal continuous solution obtained via the simplex method. Since this method is based entirely on simple addition or subtraction of one to each variable of a point in n-space and the subsequent comparison of candidate solutions to a given set of constraints, it facilitates significant complexity improvements over existing techniques. It also obtains the same optimal solution found by the branch-and-bound technique in 44 of 45 small to moderate size test problems. Two example problems are worked in detail to show the inner workings of the method. Furthermore, using an established weighted scheme for comparing computational effort involved in an algorithm, a comparison of this algorithm is made to the more established and rigorous branch-and-bound method. A computer implementation of the procedure, in PC compatible Pascal, is also presented and discussed.
Directory of Open Access Journals (Sweden)
G. M. Behery
2009-01-01
Full Text Available This paper presents an automatic system of neural networks (NNs that has the ability to simulate and predict many of applied problems. The system architectures are automatically reorganized and the experimental process starts again, if the required performance is not reached. This processing is continued until the performance obtained. This system is first applied and tested on the two spiral problem; it shows that excellent generalization performance obtained by classifying all points of the two-spirals correctly. After that, it is applied and tested on the shear stress and the pressure drop problem across the short orifice die as a function of shear rate at different mean pressures for linear low-density polyethylene copolymer (LLDPE at 190∘C. The system shows a better agreement with an experimental data of the two cases: shear stress and pressure drop. The proposed system has been also designed to simulate other distributions not presented in the training set (predicted and matched them effectively.
Energy Technology Data Exchange (ETDEWEB)
Dotti, Gustavo; Gleiser, Reinaldo J [Facultad de Matematica, AstronomIa y Fisica (FaMAF), Universidad Nacional de Cordoba, Ciudad Universitaria, 5000 Cordoba (Argentina)
2009-11-07
The coupled equations for the scalar modes of the linearized Einstein equations around Schwarzschild's spacetime were reduced by Zerilli to a (1+1) wave equation partial deriv{sup 2}PSI{sub z} /partial derivt{sup 2} +HPSI{sub z} =0, where H= -partial deriv{sup 2} /partial derivx{sup 2} + V(x) is the Zerilli 'Hamiltonian' and x is the tortoise radial coordinate. From its definition, for smooth metric perturbations the field PSI{sub z} is singular at r{sub s} = -6M/(l - 1)(l +2), with l being the mode harmonic number. The equation PSI{sub z} obeys is also singular, since V has a second-order pole at r{sub s}. This is irrelevant to the black hole exterior stability problem, where r > 2M > 0, and r{sub s} < 0, but it introduces a non-trivial problem in the naked singular case where M < 0, then r{sub s} > 0, and the singularity appears in the relevant range of r (0 < r < infinity). We solve this problem by developing a new approach to the evolution of the even mode, based on a new gauge invariant function, PSI-circumflex, that is a regular function of the metric perturbation for any value of M. The relation of PSI-circumflex to PSI{sub z} is provided by an intertwiner operator. The spatial pieces of the (1 + 1) wave equations that PSI-circumflex and PSI{sub z} obey are related as a supersymmetric pair of quantum Hamiltonians H and H-circumflex. For M < 0,H-circumflex has a regular potential and a unique self-adjoint extension in a domain D defined by a physically motivated boundary condition at r = 0. This allows us to address the issue of evolution of gravitational perturbations in this non-globally hyperbolic background. This formulation is used to complete the proof of the linear instability of the Schwarzschild naked singularity, by showing that a previously found unstable mode belongs to a complete basis of H-circumflex in D, and thus is excitable by generic initial data. This is further illustrated by numerically solving the linearized equations for
Banks, H. T.; Ito, K.
1991-01-01
A hybrid method for computing the feedback gains in linear quadratic regulator problem is proposed. The method, which combines use of a Chandrasekhar type system with an iteration of the Newton-Kleinman form with variable acceleration parameter Smith schemes, is formulated to efficiently compute directly the feedback gains rather than solutions of an associated Riccati equation. The hybrid method is particularly appropriate when used with large dimensional systems such as those arising in approximating infinite-dimensional (distributed parameter) control systems (e.g., those governed by delay-differential and partial differential equations). Computational advantages of the proposed algorithm over the standard eigenvector (Potter, Laub-Schur) based techniques are discussed, and numerical evidence of the efficacy of these ideas is presented.
Optimal Stochastic Control Problem for General Linear Dynamical Systems in Neuroscience
Directory of Open Access Journals (Sweden)
Yan Chen
2017-01-01
Full Text Available This paper considers a d-dimensional stochastic optimization problem in neuroscience. Suppose the arm’s movement trajectory is modeled by high-order linear stochastic differential dynamic system in d-dimensional space, the optimal trajectory, velocity, and variance are explicitly obtained by using stochastic control method, which allows us to analytically establish exact relationships between various quantities. Moreover, the optimal trajectory is almost a straight line for a reaching movement; the optimal velocity bell-shaped and the optimal variance are consistent with the experimental Fitts law; that is, the longer the time of a reaching movement, the higher the accuracy of arriving at the target position, and the results can be directly applied to designing a reaching movement performed by a robotic arm in a more general environment.
On the global "two-sided" characteristic Cauchy problem for linear wave equations on manifolds
Lupo, Umberto
2018-04-01
The global characteristic Cauchy problem for linear wave equations on globally hyperbolic Lorentzian manifolds is examined, for a class of smooth initial value hypersurfaces satisfying favourable global properties. First it is shown that, if geometrically well-motivated restrictions are placed on the supports of the (smooth) initial datum and of the (smooth) inhomogeneous term, then there exists a continuous global solution which is smooth "on each side" of the initial value hypersurface. A uniqueness result in Sobolev regularity H^{1/2+ɛ }_{loc} is proved among solutions supported in the union of the causal past and future of the initial value hypersurface, and whose product with the indicator function of the causal future (resp. past) of the hypersurface is past compact (resp. future compact). An explicit representation formula for solutions is obtained, which prominently features an invariantly defined, densitised version of the null expansion of the hypersurface. Finally, applications to quantum field theory on curved spacetimes are briefly discussed.
Constraints to solve parallelogram grid problems in 2D non separable linear canonical transform
Zhao, Liang; Healy, John J.; Muniraj, Inbarasan; Cui, Xiao-Guang; Malallah, Ra'ed; Ryle, James P.; Sheridan, John T.
2017-05-01
The 2D non-separable linear canonical transform (2D-NS-LCT) can model a range of various paraxial optical systems. Digital algorithms to evaluate the 2D-NS-LCTs are important in modeling the light field propagations and also of interest in many digital signal processing applications. In [Zhao 14] we have reported that a given 2D input image with rectangular shape/boundary, in general, results in a parallelogram output sampling grid (generally in an affine coordinates rather than in a Cartesian coordinates) thus limiting the further calculations, e.g. inverse transform. One possible solution is to use the interpolation techniques; however, it reduces the speed and accuracy of the numerical approximations. To alleviate this problem, in this paper, some constraints are derived under which the output samples are located in the Cartesian coordinates. Therefore, no interpolation operation is required and thus the calculation error can be significantly eliminated.
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...
First-order system least squares for the pure traction problem in planar linear elasticity
Energy Technology Data Exchange (ETDEWEB)
Cai, Z.; Manteuffel, T.; McCormick, S.; Parter, S.
1996-12-31
This talk will develop two first-order system least squares (FOSLS) approaches for the solution of the pure traction problem in planar linear elasticity. Both are two-stage algorithms that first solve for the gradients of displacement, then for the displacement itself. One approach, which uses L{sup 2} norms to define the FOSLS functional, is shown under certain H{sup 2} regularity assumptions to admit optimal H{sup 1}-like performance for standard finite element discretization and standard multigrid solution methods that is uniform in the Poisson ratio for all variables. The second approach, which is based on H{sup -1} norms, is shown under general assumptions to admit optimal uniform performance for displacement flux in an L{sup 2} norm and for displacement in an H{sup 1} norm. These methods do not degrade as other methods generally do when the material properties approach the incompressible limit.
A linear programming model for protein inference problem in shotgun proteomics.
Huang, Ting; He, Zengyou
2012-11-15
Assembling peptides identified from tandem mass spectra into a list of proteins, referred to as protein inference, is an important issue in shotgun proteomics. The objective of protein inference is to find a subset of proteins that are truly present in the sample. Although many methods have been proposed for protein inference, several issues such as peptide degeneracy still remain unsolved. In this article, we present a linear programming model for protein inference. In this model, we use a transformation of the joint probability that each peptide/protein pair is present in the sample as the variable. Then, both the peptide probability and protein probability can be expressed as a formula in terms of the linear combination of these variables. Based on this simple fact, the protein inference problem is formulated as an optimization problem: minimize the number of proteins with non-zero probabilities under the constraint that the difference between the calculated peptide probability and the peptide probability generated from peptide identification algorithms should be less than some threshold. This model addresses the peptide degeneracy issue by forcing some joint probability variables involving degenerate peptides to be zero in a rigorous manner. The corresponding inference algorithm is named as ProteinLP. We test the performance of ProteinLP on six datasets. Experimental results show that our method is competitive with the state-of-the-art protein inference algorithms. The source code of our algorithm is available at: https://sourceforge.net/projects/prolp/. zyhe@dlut.edu.cn. Supplementary data are available at Bioinformatics Online.
Directory of Open Access Journals (Sweden)
Makswell Seyiti Kawashima
2015-01-01
Full Text Available En este artículo nosotros exploramos una formulación de flujo multiproductos para el Problema del Agente Viajero Asimétrico (ATSP en la obtención de cotas duales de este problema. El procedimiento empleado es una variante del método relax and cut propuesto en la literatura que computa los multiplicadores lagrangianos asociados a las restricciones de eliminación de subrutas preservando la optimalidad de los multiplicadores asociados a las restricciones de asignación. Los resultados obtenidos con la experimentación computacional son alentadores y muestran que el algoritmo propuesto genera buenas cotas duales con un tiempo de ejecución bajo.
Sugiyanto, S.; Hardyanto, W.; Marwoto, P.
2018-03-01
Transport phenomena are found in many problems in many engineering and industrial sectors. We analyzed a Lattice Boltzmann method with Two-Relaxation Time (LTRT) collision operators for simulation of pollutant moving through the medium as a two-dimensional (2D) transport problem in a rectangular region model. This model consists of a 2D rectangular region with 54 length (x), 27 width (y), and it has isotropic homogeneous medium. Initially, the concentration is zero and is distributed evenly throughout the region of interest. A concentration of 1 is maintained at 9 < y < 18, whereas the concentration of zero is maintained at 0 < y < 9 and 18 < y < 27. A specific discharge (Darcy velocity) of 1.006 is assumed. A diffusion coefficient of 0.8333 is distributed uniformly with a uniform porosity of 0.35. A computer program is written in MATLAB to compute the concentration of pollutant at any specified place and time. The program shows that LTRT solution with quadratic equilibrium distribution functions (EDFs) and relaxation time τa=1.0 are in good agreement result with other numerical solutions methods such as 3DLEWASTE (Hybrid Three-dimensional Lagrangian-Eulerian Finite Element Model of Waste Transport Through Saturated-Unsaturated Media) obtained by Yeh and 3DFEMWATER-LHS (Three-dimensional Finite Element Model of Water Flow Through Saturated-Unsaturated Media with Latin Hypercube Sampling) obtained by Hardyanto.
Interpolation problem for the solutions of linear elasticity equations based on monogenic functions
Grigor'ev, Yuri; Gürlebeck, Klaus; Legatiuk, Dmitrii
2017-11-01
Interpolation is an important tool for many practical applications, and very often it is beneficial to interpolate not only with a simple basis system, but rather with solutions of a certain differential equation, e.g. elasticity equation. A typical example for such type of interpolation are collocation methods widely used in practice. It is known, that interpolation theory is fully developed in the framework of the classical complex analysis. However, in quaternionic analysis, which shows a lot of analogies to complex analysis, the situation is more complicated due to the non-commutative multiplication. Thus, a fundamental theorem of algebra is not available, and standard tools from linear algebra cannot be applied in the usual way. To overcome these problems, a special system of monogenic polynomials the so-called Pseudo Complex Polynomials, sharing some properties of complex powers, is used. In this paper, we present an approach to deal with the interpolation problem, where solutions of elasticity equations in three dimensions are used as an interpolation basis.
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
Kuchment, Peter
2015-05-10
© 2015, Springer Basel. In the previous paper (Kuchment and Steinhauer in Inverse Probl 28(8):084007, 2012), the authors introduced a simple procedure that allows one to detect whether and explain why internal information arising in several novel coupled physics (hybrid) imaging modalities could turn extremely unstable techniques, such as optical tomography or electrical impedance tomography, into stable, good-resolution procedures. It was shown that in all cases of interest, the Fréchet derivative of the forward mapping is a pseudo-differential operator with an explicitly computable principal symbol. If one can set up the imaging procedure in such a way that the symbol is elliptic, this would indicate that the problem was stabilized. In the cases when the symbol is not elliptic, the technique suggests how to change the procedure (e.g., by adding extra measurements) to achieve ellipticity. In this article, we consider the situation arising in acousto-optical tomography (also called ultrasound modulated optical tomography), where the internal data available involves the Green’s function, and thus depends globally on the unknown parameter(s) of the equation and its solution. It is shown that the technique of (Kuchment and Steinhauer in Inverse Probl 28(8):084007, 2012) can be successfully adopted to this situation as well. A significant part of the article is devoted to results on generic uniqueness for the linearized problem in a variety of situations, including those arising in acousto-electric and quantitative photoacoustic tomography.
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.
Greedy algorithms for high-dimensional non-symmetric linear problems***
Directory of Open Access Journals (Sweden)
Cancès E.
2013-12-01
Full Text Available In this article, we present a family of numerical approaches to solve high-dimensional linear non-symmetric problems. The principle of these methods is to approximate a function which depends on a large number of variates by a sum of tensor product functions, each term of which is iteratively computed via a greedy algorithm ? . There exists a good theoretical framework for these methods in the case of (linear and nonlinear symmetric elliptic problems. However, the convergence results are not valid any more as soon as the problems under consideration are not symmetric. We present here a review of the main algorithms proposed in the literature to circumvent this difficulty, together with some new approaches. The theoretical convergence results and the practical implementation of these algorithms are discussed. Their behaviors are illustrated through some numerical examples. Dans cet article, nous présentons une famille de méthodes numériques pour résoudre des problèmes linéaires non symétriques en grande dimension. Le principe de ces approches est de représenter une fonction dépendant d’un grand nombre de variables sous la forme d’une somme de fonctions produit tensoriel, dont chaque terme est calculé itérativement via un algorithme glouton ? . Ces méthodes possèdent de bonnes propriétés théoriques dans le cas de problèmes elliptiques symétriques (linéaires ou non linéaires, mais celles-ci ne sont plus valables dès lors que les problèmes considérés ne sont plus symétriques. Nous présentons une revue des principaux algorithmes proposés dans la littérature pour contourner cette difficulté ainsi que de nouvelles approches que nous proposons. Les résultats de convergence théoriques et la mise en oeuvre pratique de ces algorithmes sont détaillés et leur comportement est illustré au travers d’exemples numériques.
International Nuclear Information System (INIS)
Luyt, P.C.B.; Theron, N.J.; Pietra, F.
2017-01-01
It is well known that gasket creep-relaxation results in a reduction of contact pressure between the surface of a gasket and the face of a flange over an extended period of time. This reduction may result in the subsequent failure of the circular bolted flange connection due to leakage. In this paper a pair of flat and raised face integral flanges, PN 10 DN 50 (in accordance with the European EN 1092-1 standard), with non-asbestos compressed fibre ring gaskets with aramid and a nitrile rubber binder were considered. Finite element modelling and analyses were done, for both the circular bolted flange configurations, during the seating condition. The results of the finite element analyses were experimentally validated. It was found that the number of bolt tightening increments as well as the time between the bolt tightening increments had a significant impact on the effect which gasket creep-relaxation had after the seating condition. An increase in either the number of bolting increments or the time between the bolting increments will reduce the effect which gasket creep-relaxation has once the bolts had been fastened. Based on these results it is possible to develop an optimisation scheme to minimize the effect which gasket creep-relaxation has on the contact pressure between the face of the flange and the gasket, after seating, by either increasing or decreasing the number of bolt tightening increments or the time between the bolt tightening increments. - Highlights: • Number of bolt tightening increments and time between bolt tightening increments had significant impact on effect of gasket creep-relaxation after the seating condition. • Impact of gasket creep-relaxation during seating and operating phases investigated by means of finite element analysis and experimentally verified. • Possible to develop optimisation scheme to minimize effect ofh gasket creep-relaxation on contact pressure between flange face and gasket. • Knowing the contact pressure is
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.
Relaxed Binaural LCMV Beamforming
Koutrouvelis, A.; Hendriks, R.C.; Heusdens, R.; Jensen, Jesper Rindom
2017-01-01
In this paper, we propose a new binaural beamforming technique, which can be seen as a relaxation of the linearly constrained minimum variance (LCMV) framework. The proposed method can achieve simultaneous noise reduction and exact binaural cue preservation of the target source, similar to the
Cartesian Mesh Linearized Euler Equations Solver for Aeroacoustic Problems around Full Aircraft
Directory of Open Access Journals (Sweden)
Yuma Fukushima
2015-01-01
Full Text Available The linearized Euler equations (LEEs solver for aeroacoustic problems has been developed on block-structured Cartesian mesh to address complex geometry. Taking advantage of the benefits of Cartesian mesh, we employ high-order schemes for spatial derivatives and for time integration. On the other hand, the difficulty of accommodating curved wall boundaries is addressed by the immersed boundary method. The resulting LEEs solver is robust to complex geometry and numerically efficient in a parallel environment. The accuracy and effectiveness of the present solver are validated by one-dimensional and three-dimensional test cases. Acoustic scattering around a sphere and noise propagation from the JT15D nacelle are computed. The results show good agreement with analytical, computational, and experimental results. Finally, noise propagation around fuselage-wing-nacelle configurations is computed as a practical example. The results show that the sound pressure level below the over-the-wing nacelle (OWN configuration is much lower than that of the conventional DLR-F6 aircraft configuration due to the shielding effect of the OWN configuration.
Error Analysis Of Students Working About Word Problem Of Linear Program With NEA Procedure
Santoso, D. A.; Farid, A.; Ulum, B.
2017-06-01
Evaluation and assessment is an important part of learning. In evaluation process of learning, written test is still commonly used. However, the tests usually do not following-up by further evaluation. The process only up to grading stage not to evaluate the process and errors which done by students. Whereas if the student has a pattern error and process error, actions taken can be more focused on the fault and why is that happen. NEA procedure provides a way for educators to evaluate student progress more comprehensively. In this study, students’ mistakes in working on some word problem about linear programming have been analyzed. As a result, mistakes are often made students exist in the modeling phase (transformation) and process skills (process skill) with the overall percentage distribution respectively 20% and 15%. According to the observations, these errors occur most commonly due to lack of precision of students in modeling and in hastiness calculation. Error analysis with students on this matter, it is expected educators can determine or use the right way to solve it in the next lesson.
Lyubetsky, Vassily; Gershgorin, Roman; Gorbunov, Konstantin
2017-12-06
Chromosome structure is a very limited model of the genome including the information about its chromosomes such as their linear or circular organization, the order of genes on them, and the DNA strand encoding a gene. Gene lengths, nucleotide composition, and intergenic regions are ignored. Although highly incomplete, such structure can be used in many cases, e.g., to reconstruct phylogeny and evolutionary events, to identify gene synteny, regulatory elements and promoters (considering highly conserved elements), etc. Three problems are considered; all assume unequal gene content and the presence of gene paralogs. The distance problem is to determine the minimum number of operations required to transform one chromosome structure into another and the corresponding transformation itself including the identification of paralogs in two structures. We use the DCJ model which is one of the most studied combinatorial rearrangement models. Double-, sesqui-, and single-operations as well as deletion and insertion of a chromosome region are considered in the model; the single ones comprise cut and join. In the reconstruction problem, a phylogenetic tree with chromosome structures in the leaves is given. It is necessary to assign the structures to inner nodes of the tree to minimize the sum of distances between terminal structures of each edge and to identify the mutual paralogs in a fairly large set of structures. A linear algorithm is known for the distance problem without paralogs, while the presence of paralogs makes it NP-hard. If paralogs are allowed but the insertion and deletion operations are missing (and special constraints are imposed), the reduction of the distance problem to integer linear programming is known. Apparently, the reconstruction problem is NP-hard even in the absence of paralogs. The problem of contigs is to find the optimal arrangements for each given set of contigs, which also includes the mutual identification of paralogs. We proved that these
Dujardin, G. M.
2009-08-12
This paper deals with the asymptotic behaviour of the solutions of linear initial boundary value problems with constant coefficients on the half-line and on finite intervals. We assume that the boundary data are periodic in time and we investigate whether the solution becomes time-periodic after sufficiently long time. Using Fokas\\' transformation method, we show that, for the linear Schrödinger equation, the linear heat equation and the linearized KdV equation on the half-line, the solutions indeed become periodic for large time. However, for the same linear Schrödinger equation on a finite interval, we show that the solution, in general, is not asymptotically periodic; actually, the asymptotic behaviour of the solution depends on the commensurability of the time period T of the boundary data with the square of the length of the interval over. © 2009 The Royal Society.
Ber analysis of the box relaxation for BPSK signal recovery
Thrampoulidis, Christos; Abbasi, Ehsan; Xu, Weiyu; Hassibi, Babak
2016-01-01
We study the problem of recovering an n-dimensional BPSK signal from m linear noise-corrupted measurements using the box relaxation method which relaxes the discrete set {±1}n to the convex set [-1,1]n to obtain a convex optimization algorithm followed by hard thresholding. When the noise and measurement matrix have iid standard normal entries, we obtain an exact expression for the bit-wise probability of error Pe in the limit of n and m growing and m/n fixed. At high SNR our result shows that the Pe of box relaxation is within 3dB of the matched filter bound (MFB) for square systems, and that it approaches the (MFB) as m grows large compared to n. Our results also indicate that as m, n → ∞, for any fixed set of size k, the error events of the corresponding k bits in the box relaxation method are independent.
Ber analysis of the box relaxation for BPSK signal recovery
Thrampoulidis, Christos
2016-06-24
We study the problem of recovering an n-dimensional BPSK signal from m linear noise-corrupted measurements using the box relaxation method which relaxes the discrete set {±1}n to the convex set [-1,1]n to obtain a convex optimization algorithm followed by hard thresholding. When the noise and measurement matrix have iid standard normal entries, we obtain an exact expression for the bit-wise probability of error Pe in the limit of n and m growing and m/n fixed. At high SNR our result shows that the Pe of box relaxation is within 3dB of the matched filter bound (MFB) for square systems, and that it approaches the (MFB) as m grows large compared to n. Our results also indicate that as m, n → ∞, for any fixed set of size k, the error events of the corresponding k bits in the box relaxation method are independent.
Directory of Open Access Journals (Sweden)
Nelson Maculan
2003-01-01
Full Text Available We present integer linear models with a polynomial number of variables and constraints for combinatorial optimization problems in graphs: optimum elementary cycles, optimum elementary paths and optimum tree problems.Apresentamos modelos lineares inteiros com um número polinomial de variáveis e restrições para problemas de otimização combinatória em grafos: ciclos elementares ótimos, caminhos elementares ótimos e problemas em árvores ótimas.
Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
S. Kim (Sunyoung); M. Kojima; H. Waki (Hayato)
2008-01-01
htmlabstract A sensor network localization problem can be formulated as a quadratic optimization problem (QOP). For quadratic optimization problems, semidefinite programming (SDP) relaxation by Lasserre with relaxation order 1 for general polynomial optimization problems (POPs) is known to be
Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
S. Kim (Sunyoung); M. Kojima; H. Waki (Hayato)
2009-01-01
htmlabstract A sensor network localization problem can be formulated as a quadratic optimization problem (QOP). For quadratic optimization problems, semidefinite programming (SDP) relaxation by Lasserre with relaxation order 1 for general polynomial optimization problems (POPs) is known to be
Directory of Open Access Journals (Sweden)
Faridah Hani Mohamed Salleh
2017-01-01
Full Text Available Gene regulatory network (GRN reconstruction is the process of identifying regulatory gene interactions from experimental data through computational analysis. One of the main reasons for the reduced performance of previous GRN methods had been inaccurate prediction of cascade motifs. Cascade error is defined as the wrong prediction of cascade motifs, where an indirect interaction is misinterpreted as a direct interaction. Despite the active research on various GRN prediction methods, the discussion on specific methods to solve problems related to cascade errors is still lacking. In fact, the experiments conducted by the past studies were not specifically geared towards proving the ability of GRN prediction methods in avoiding the occurrences of cascade errors. Hence, this research aims to propose Multiple Linear Regression (MLR to infer GRN from gene expression data and to avoid wrongly inferring of an indirect interaction (A → B → C as a direct interaction (A → C. Since the number of observations of the real experiment datasets was far less than the number of predictors, some predictors were eliminated by extracting the random subnetworks from global interaction networks via an established extraction method. In addition, the experiment was extended to assess the effectiveness of MLR in dealing with cascade error by using a novel experimental procedure that had been proposed in this work. The experiment revealed that the number of cascade errors had been very minimal. Apart from that, the Belsley collinearity test proved that multicollinearity did affect the datasets used in this experiment greatly. All the tested subnetworks obtained satisfactory results, with AUROC values above 0.5.
Salleh, Faridah Hani Mohamed; Zainudin, Suhaila; Arif, Shereena M
2017-01-01
Gene regulatory network (GRN) reconstruction is the process of identifying regulatory gene interactions from experimental data through computational analysis. One of the main reasons for the reduced performance of previous GRN methods had been inaccurate prediction of cascade motifs. Cascade error is defined as the wrong prediction of cascade motifs, where an indirect interaction is misinterpreted as a direct interaction. Despite the active research on various GRN prediction methods, the discussion on specific methods to solve problems related to cascade errors is still lacking. In fact, the experiments conducted by the past studies were not specifically geared towards proving the ability of GRN prediction methods in avoiding the occurrences of cascade errors. Hence, this research aims to propose Multiple Linear Regression (MLR) to infer GRN from gene expression data and to avoid wrongly inferring of an indirect interaction (A → B → C) as a direct interaction (A → C). Since the number of observations of the real experiment datasets was far less than the number of predictors, some predictors were eliminated by extracting the random subnetworks from global interaction networks via an established extraction method. In addition, the experiment was extended to assess the effectiveness of MLR in dealing with cascade error by using a novel experimental procedure that had been proposed in this work. The experiment revealed that the number of cascade errors had been very minimal. Apart from that, the Belsley collinearity test proved that multicollinearity did affect the datasets used in this experiment greatly. All the tested subnetworks obtained satisfactory results, with AUROC values above 0.5.
Heinkenschloss, Matthias
2005-01-01
We study a class of time-domain decomposition-based methods for the numerical solution of large-scale linear quadratic optimal control problems. Our methods are based on a multiple shooting reformulation of the linear quadratic optimal control problem as a discrete-time optimal control (DTOC) problem. The optimality conditions for this DTOC problem lead to a linear block tridiagonal system. The diagonal blocks are invertible and are related to the original linear quadratic optimal control problem restricted to smaller time-subintervals. This motivates the application of block Gauss-Seidel (GS)-type methods for the solution of the block tridiagonal systems. Numerical experiments show that the spectral radii of the block GS iteration matrices are larger than one for typical applications, but that the eigenvalues of the iteration matrices decay to zero fast. Hence, while the GS method is not expected to convergence for typical applications, it can be effective as a preconditioner for Krylov-subspace methods. This is confirmed by our numerical tests.A byproduct of this research is the insight that certain instantaneous control techniques can be viewed as the application of one step of the forward block GS method applied to the DTOC optimality system.
Ebrahimnejad, Ali
2015-08-01
There are several methods, in the literature, for solving fuzzy variable linear programming problems (fuzzy linear programming in which the right-hand-side vectors and decision variables are represented by trapezoidal fuzzy numbers). In this paper, the shortcomings of some existing methods are pointed out and to overcome these shortcomings a new method based on the bounded dual simplex method is proposed to determine the fuzzy optimal solution of that kind of fuzzy variable linear programming problems in which some or all variables are restricted to lie within lower and upper bounds. To illustrate the proposed method, an application example is solved and the obtained results are given. The advantages of the proposed method over existing methods are discussed. Also, one application of this algorithm in solving bounded transportation problems with fuzzy supplies and demands is dealt with. The proposed method is easy to understand and to apply for determining the fuzzy optimal solution of bounded fuzzy variable linear programming problems occurring in real-life situations.
1987-01-01
Environ Corporation's relaxation system is built around a body lounge, a kind of super easy chair that incorporates sensory devices. Computer controlled enclosure provides filtered ionized air to create a feeling of invigoration, enhanced by mood changing aromas. Occupant is also surrounded by multidimensional audio and the lighting is programmed to change colors, patterns, and intensity periodically. These and other sensory stimulators are designed to provide an environment in which the learning process is stimulated, because research has proven that while an individual is in a deep state of relaxation, the mind is more receptive to new information.
Directory of Open Access Journals (Sweden)
Mihai-Victor PRICOP
2010-09-01
Full Text Available The present paper introduces a numerical approach of static linear elasticity equations for anisotropic materials. The domain and boundary conditions are simple, to enhance an easy implementation of the finite difference scheme. SOR and gradient are used to solve the resulting linear system. The simplicity of the geometry is also useful for MPI parallelization of the code.
Czech Academy of Sciences Publication Activity Database
Červinka, Michal
2010-01-01
Roč. 2010, č. 4 (2010), s. 730-753 ISSN 0023-5954 Institutional research plan: CEZ:AV0Z10750506 Keywords : equilibrium problems with complementarity constraints * homotopy * C-stationarity Subject RIV: BC - Control Systems Theory Impact factor: 0.461, year: 2010 http://library.utia.cas.cz/separaty/2010/MTR/cervinka-on computation of c-stationary points for equilibrium problems with linear complementarity constraints via homotopy method.pdf
International Nuclear Information System (INIS)
Anastassi, Z. A.; Simos, T. E.
2010-01-01
We develop a new family of explicit symmetric linear multistep methods for the efficient numerical solution of the Schroedinger equation and related problems with oscillatory solution. The new methods are trigonometrically fitted and have improved intervals of periodicity as compared to the corresponding classical method with constant coefficients and other methods from the literature. We also apply the methods along with other known methods to real periodic problems, in order to measure their efficiency.
Directory of Open Access Journals (Sweden)
Aihong Ren
2016-01-01
Full Text Available This paper is concerned with a class of fully fuzzy bilevel linear programming problems where all the coefficients and decision variables of both objective functions and the constraints are fuzzy numbers. A new approach based on deviation degree measures and a ranking function method is proposed to solve these problems. We first introduce concepts of the feasible region and the fuzzy optimal solution of a fully fuzzy bilevel linear programming problem. In order to obtain a fuzzy optimal solution of the problem, we apply deviation degree measures to deal with the fuzzy constraints and use a ranking function method of fuzzy numbers to rank the upper and lower level fuzzy objective functions. Then the fully fuzzy bilevel linear programming problem can be transformed into a deterministic bilevel programming problem. Considering the overall balance between improving objective function values and decreasing allowed deviation degrees, the computational procedure for finding a fuzzy optimal solution is proposed. Finally, a numerical example is provided to illustrate the proposed approach. The results indicate that the proposed approach gives a better optimal solution in comparison with the existing method.
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
International Nuclear Information System (INIS)
Goncalves, Glenio A.; Bodmann, Bardo; Bogado, Sergio; Vilhena, Marco T.
2008-01-01
Analytical solutions for neutron transport in cylindrical geometry is available for isotropic problems, but to the best of our knowledge for anisotropic problems are not available, yet. In this work, an analytical solution for the neutron transport equation in an infinite cylinder assuming anisotropic scattering is reported. Here we specialize the solution, without loss of generality, for the linearly anisotropic problem using the combined decomposition and HTS N methods. The key feature of this method consists in the application of the decomposition method to the anisotropic problem by virtue of the fact that the inverse of the operator associated to isotropic problem is well know and determined by the HTS N approach. So far, following the idea of the decomposition method, we apply this operator to the integral term, assuming that the angular flux appearing in the integrand is considered to be equal to the HTS N solution interpolated by polynomial considering only even powers. This leads to the first approximation for an anisotropic solution. Proceeding further, we replace this solution for the angular flux in the integral and apply again the inverse operator for the isotropic problem in the integral term and obtain a new approximation for the angular flux. This iterative procedure yields a closed form solution for the angular flux. This methodology can be generalized, in a straightforward manner, for transport problems with any degree of anisotropy. For the sake of illustration, we report numerical simulations for linearly anisotropic transport problems. (author)
Suliman, Mohamed Abdalla Elhag; Ballal, Tarig; Kammoun, Abla; Al-Naffouri, Tareq Y.
2016-01-01
This paper proposes a new approach to find the regularization parameter for linear least-squares discrete ill-posed problems. In the proposed approach, an artificial perturbation matrix with a bounded norm is forced into the discrete ill-posed model
Czech Academy of Sciences Publication Activity Database
Kiguradze, I.; Šremr, Jiří
2011-01-01
Roč. 74, č. 17 (2011), s. 6537-6552 ISSN 0362-546X Institutional research plan: CEZ:AV0Z10190503 Keywords : half-linear differential system * non-local boundary value problem * solvability Subject RIV: BA - General Mathematics Impact factor: 1.536, year: 2011 http://www.sciencedirect.com/science/article/pii/S0362546X11004573
Dujardin, G. M.
2009-01-01
This paper deals with the asymptotic behaviour of the solutions of linear initial boundary value problems with constant coefficients on the half-line and on finite intervals. We assume that the boundary data are periodic in time and we investigate
Cost Cumulant-Based Control for a Class of Linear Quadratic Tracking Problems
National Research Council Canada - National Science Library
Pham, Khanh D
2007-01-01
.... For instance, the present paper extends the application of cost-cumulant controller design to control of a wide class of linear-quadratic tracking systems where output measurements of a tracker...
Sole, Marla A.
2016-01-01
Open-ended questions that can be solved using different strategies help students learn and integrate content, and provide teachers with greater insights into students' unique capabilities and levels of understanding. This article provides a problem that was modified to allow for multiple approaches. Students tended to employ high-powered, complex,…
Energy Technology Data Exchange (ETDEWEB)
Tuereci, R.G. [Kirikkale Univ., Kirikkale (Turkey). Kirikkale Vocational School; Tuereci, D. [Ministry of Education, Ankara (Turkey). 75th year Anatolia High School
2017-05-15
One speed, time independent and homogeneous medium neutron transport equation can be solved with the anisotropic scattering which includes both the linear anisotropic and the quadratic anisotropic scattering properties. Having solved Case's eigenfunctions and the orthogonality relations among these eigenfunctions, some neutron transport problems such as albedo problem can be calculated as numerically by using numerical or semi-analytic methods. In this study the half-space albedo problem is investigated by using the modified F{sub N} method.
Halyo, N.; Caglayan, A. K.
1976-01-01
This paper considers the control of a continuous linear plant disturbed by white plant noise when the control is constrained to be a piecewise constant function of time; i.e. a stochastic sampled-data system. The cost function is the integral of quadratic error terms in the state and control, thus penalizing errors at every instant of time while the plant noise disturbs the system continuously. The problem is solved by reducing the constrained continuous problem to an unconstrained discrete one. It is shown that the separation principle for estimation and control still holds for this problem when the plant disturbance and measurement noise are Gaussian.
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
Relaxation from particle production
Energy Technology Data Exchange (ETDEWEB)
Hook, Anson; Marques-Tavares, Gustavo [Stanford Institute for Theoretical Physics, Stanford University, Stanford, CA 94305 (United States)
2016-12-20
We consider using particle production as a friction force by which to implement a “Relaxion” solution to the electroweak hierarchy problem. Using this approach, we are able to avoid superplanckian field excursions and avoid any conflict with the strong CP problem. The relaxation mechanism can work before, during or after inflation allowing for inflationary dynamics to play an important role or to be completely decoupled.
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...
Directory of Open Access Journals (Sweden)
Dauda GuliburYAKUBU
2012-12-01
Full Text Available Accurate solutions to initial value systems of ordinary differential equations may be approximated efficiently by Runge-Kutta methods or linear multistep methods. Each of these has limitations of one sort or another. In this paper we consider, as a middle ground, the derivation of continuous general linear methods for solution of stiff systems of initial value problems in ordinary differential equations. These methods are designed to combine the advantages of both Runge-Kutta and linear multistep methods. Particularly, methods possessing the property of A-stability are identified as promising methods within this large class of general linear methods. We show that the continuous general linear methods are self-starting and have more ability to solve the stiff systems of ordinary differential equations, than the discrete ones. The initial value systems of ordinary differential equations are solved, for instance, without looking for any other method to start the integration process. This desirable feature of the proposed approach leads to obtaining very high accuracy of the solution of the given problem. Illustrative examples are given to demonstrate the novelty and reliability of the methods.
DEFF Research Database (Denmark)
Amini Afshar, Mostafa; Bingham, Harry B.
2017-01-01
. Frequency-domain results are then obtained from a Fourier transform of the force and motion signals. In order to make a robust Fourier transform, and capture the response around the critical frequency, the tail of the force signal is asymptotically extrapolated assuming a linear decay rate. Fourth......The linearized potential flow approximation for the forward speed radiation problem is solved in the time domain using a high-order finite difference method. The finite-difference discretization is developed on overlapping, curvilinear body-fitted grids. To ensure numerical stability...
Ben Gharbia , Ibtihel; Gilbert , Jean Charles
2012-01-01
The plain Newton-min algorithm to solve the linear complementarity problem (LCP for short) 0 ≤ x ⊥ (Mx+q) ≥ 0 can be viewed as a nonsmooth Newton algorithm without globalization technique to solve the system of piecewise linear equations min(x,Mx+q)=0, which is equivalent to the LCP. When M is an M-matrix of order n, the algorithm is known to converge in at most n iterations. We show in this paper that this result no longer holds when M is a P-matrix of order ≥ 3, since then the algorithm may...
The longitudinal space charge problem in the high current linear proton accelerators
International Nuclear Information System (INIS)
Lustfeld, H.
1984-01-01
In a linear proton accelerator peak currents of 200 mA lead to high space charge densities and the resultant space charge forces reduce the effective focussing considerably. In particular the longitudinal focussing is affected. A new concept based on linear theory is proposed that restricts the influence of the space charge forces on the longitudinal focussing by increasing a, the mean transverse bunch radius, as a proportional(βγ)sup(3/8). This concept is compared with other concepts for the Alvarez (1 MeV - 100 MeV) and for the high energy part (100 MeV - 1100 MeV) of the SNQ linear accelerator. (orig.)
Fast Combinatorial Algorithm for the Solution of Linearly Constrained Least Squares Problems
Van Benthem, Mark H.; Keenan, Michael R.
2008-11-11
A fast combinatorial algorithm can significantly reduce the computational burden when solving general equality and inequality constrained least squares problems with large numbers of observation vectors. The combinatorial algorithm provides a mathematically rigorous solution and operates at great speed by reorganizing the calculations to take advantage of the combinatorial nature of the problems to be solved. The combinatorial algorithm exploits the structure that exists in large-scale problems in order to minimize the number of arithmetic operations required to obtain a solution.
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
Systems of Inhomogeneous Linear Equations
Scherer, Philipp O. J.
Many problems in physics and especially computational physics involve systems of linear equations which arise e.g. from linearization of a general nonlinear problem or from discretization of differential equations. If the dimension of the system is not too large standard methods like Gaussian elimination or QR decomposition are sufficient. Systems with a tridiagonal matrix are important for cubic spline interpolation and numerical second derivatives. They can be solved very efficiently with a specialized Gaussian elimination method. Practical applications often involve very large dimensions and require iterative methods. Convergence of Jacobi and Gauss-Seidel methods is slow and can be improved by relaxation or over-relaxation. An alternative for large systems is the method of conjugate gradients.
Advanced topics in linear algebra weaving matrix problems through the Weyr form
O'Meara, Kevin; Vinsonhaler, Charles
2011-01-01
The Weyr matrix canonical form is a largely unknown cousin of the Jordan canonical form. Discovered by Eduard Weyr in 1885, the Weyr form outperforms the Jordan form in a number of mathematical situations, yet it remains somewhat of a mystery, even to many who are skilled in linear algebra. Written in an engaging style, this book presents various advanced topics in linear algebra linked through the Weyr form. Kevin O'Meara, John Clark, and Charles Vinsonhaler develop the Weyr form from scratch and include an algorithm for computing it. A fascinating duality exists between the Weyr form and the
Half-linear Sturm-Liouville problem with weights: asymptotic behavior of eigenfunctions
Czech Academy of Sciences Publication Activity Database
Drábek, P.; Kufner, Alois; Kuliev, K.
2014-01-01
Roč. 284, č. 1 (2014), s. 148-154 ISSN 0081-5438 Institutional support: RVO:67985840 Keywords : Sturm-Liouville problem * spectral problems * Hardy inequality Subject RIV: BA - General Mathematics Impact factor: 0.302, year: 2014 http://link.springer.com/article/10.1134%2FS008154381401009X
Solution of the spherically symmetric linear thermoviscoelastic problem in the inertia-free limit
DEFF Research Database (Denmark)
Christensen, Tage Emil; Dyre, J. C.
2008-01-01
paper-the thermoviscoelastic problem may be solved analytically in the inertia-free limit, i.e., the limit where the sample is much smaller than the wavelength of sound waves at the frequencies of interest. As for the one-dimensional thermoviscoelastic problem [Christensen et al., Phys. Rev. E 75...
Novel method of interpolation and extrapolation of functions by a linear initial value problem
CSIR Research Space (South Africa)
Shatalov, M
2008-09-01
Full Text Available A novel method of function approximation using an initial value, linear, ordinary differential equation (ODE) is presented. The main advantage of this method is to obtain the approximation expressions in a closed form. This technique can be taught...
Sain, M. K.; Antsaklis, P. J.; Gejji, R. R.; Wyman, B. F.; Peczkowski, J. L.
1981-01-01
Zames (1981) has observed that there is, in general, no 'separation principle' to guarantee optimality of a division between control law design and filtering of plant uncertainty. Peczkowski and Sain (1978) have solved a model matching problem using transfer functions. Taking into consideration this investigation, Peczkowski et al. (1979) proposed the Total Synthesis Problem (TSP), wherein both the command/output-response and command/control-response are to be synthesized, subject to the plant constraint. The TSP concept can be subdivided into a Nominal Design Problem (NDP), which is not dependent upon specific controller structures, and a Feedback Synthesis Problem (FSP), which is. Gejji (1980) found that NDP was characterized in terms of the plant structural matrices and a single, 'good' transfer function matrix. Sain et al. (1981) have extended this NDP work. The present investigation is concerned with a study of FSP for the unity feedback case. NDP, together with feedback synthesis, is understood as a Total Synthesis Problem.
Lagrangian relaxation based algorithm for trigeneration planning with storages
DEFF Research Database (Denmark)
Rong, Aiying; Lahdelma, Risto; Luh, Peter
2008-01-01
of three energy commodities follows a joint characteristic. This paper presents a Lagrangian relaxation (LR) based algorithm for trigeneration planning with storages based on deflected subgradient optimization method. The trigeneration planning problem is modeled as a linear programming (LP) problem...... an effective method for the long-term planning problem based on the proper strategy to form Lagrangian subproblems and solve the Lagrangian dual (LD) problem based on deflected subgradient optimization method. We also develop a heuristic for restoring feasibility from the LD solution. Numerical results based...
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
DEFF Research Database (Denmark)
Auger-Méthé, Marie; Field, Chris; Albertsen, Christoffer Moesgaard
2016-01-01
problems. We demonstrate that these problems occur primarily when measurement error is larger than biological stochasticity, the condition that often drives ecologists to use SSMs. Using an animal movement example, we show how these estimation problems can affect ecological inference. Biased parameter......State-space models (SSMs) are increasingly used in ecology to model time-series such as animal movement paths and population dynamics. This type of hierarchical model is often structured to account for two levels of variability: biological stochasticity and measurement error. SSMs are flexible...
Synthetic acceleration methods for linear transport problems with highly anisotropic scattering
International Nuclear Information System (INIS)
Khattab, K.M.; Larsen, E.W.
1992-01-01
The diffusion synthetic acceleration (DSA) algorithm effectively accelerates the iterative solution of transport problems with isotropic or mildly anisotropic scattering. However, DSA loses its effectiveness for transport problems that have strongly anisotropic scattering. Two generalizations of DSA are proposed, which, for highly anisotropic scattering problems, converge at least an order of magnitude (clock time) faster than the DSA method. These two methods are developed, the results of Fourier analysis that theoretically predict their efficiency are described, and numerical results that verify the theoretical predictions are presented. (author). 10 refs., 7 figs., 5 tabs
Synthetic acceleration methods for linear transport problems with highly anisotropic scattering
International Nuclear Information System (INIS)
Khattab, K.M.; Larsen, E.W.
1991-01-01
This paper reports on the diffusion synthetic acceleration (DSA) algorithm that effectively accelerates the iterative solution of transport problems with isotropic or mildly anisotropic scattering. However, DSA loses its effectiveness for transport problems that have strongly anisotropic scattering. Two generalizations of DSA are proposed, which, for highly anisotropic scattering problems, converge at least an order of magnitude (clock time) faster than the DSA method. These two methods are developed, the results of Fourier analyses that theoretically predict their efficiency are described, and numerical results that verify the theoretical predictions are presented
DEFF Research Database (Denmark)
Skajaa, Anders; Andersen, Erling D.; Ye, Yinyu
2013-01-01
and their negligible computational cost. This is a major advantage when compared to previously suggested strategies that require a pool of iterates from the solution process of the initial problem. Consequently our strategies are better suited for users who use optimization algorithms as black-box routines which...... worst-case complexity. We present extensive computational results showing work reductions when warmstarting compared to coldstarting in the range 30–75% depending on the problem class and magnitude of the problem perturbation. The computational experiments thus substantiate that the warmstarting...
International Nuclear Information System (INIS)
Govaerts, Jan; Hounkonnou, M Norbert; Mweene, Habatwa V
2009-01-01
The ordinary Landau problem of a charged particle in a plane subjected to a perpendicular homogeneous and static magnetic field is reconsidered from different points of view. The role of phase space canonical transformations and their relation to a choice of gauge in the solution of the problem is addressed. The Landau problem is then extended to different contexts, in particular the singular situation of a purely linear potential term being added as an interaction, for which a complete purely algebraic solution is presented. This solution is then exploited to solve this same singular Landau problem in the half-plane, with as motivation the potential relevance of such a geometry for quantum Hall measurements in the presence of an electric field or a gravitational quantum well.
Energy Technology Data Exchange (ETDEWEB)
Govaerts, Jan [Center for Particle Physics and Phenomenology (CP3), Institut de Physique Nucleaire, Universite catholique de Louvain (UCL), 2, Chemin du Cyclotron, B-1348 Louvain-la Neuve (Belgium); Hounkonnou, M Norbert [International Chair in Mathematical Physics and Applications (ICMPA-UNESCO Chair), University of Abomey-Calavi, 072 BP 50, Cotonou (Benin); Mweene, Habatwa V [Physics Department, University of Zambia, PO Box 32379, Lusaka (Zambia)], E-mail: Jan.Govaerts@uclouvain.be, E-mail: hounkonnou@yahoo.fr, E-mail: norbert.hounkonnou@cipma.uac.bj, E-mail: habatwamweene@yahoo.com, E-mail: hmweene@unza.zm
2009-12-04
The ordinary Landau problem of a charged particle in a plane subjected to a perpendicular homogeneous and static magnetic field is reconsidered from different points of view. The role of phase space canonical transformations and their relation to a choice of gauge in the solution of the problem is addressed. The Landau problem is then extended to different contexts, in particular the singular situation of a purely linear potential term being added as an interaction, for which a complete purely algebraic solution is presented. This solution is then exploited to solve this same singular Landau problem in the half-plane, with as motivation the potential relevance of such a geometry for quantum Hall measurements in the presence of an electric field or a gravitational quantum well.
Energy Technology Data Exchange (ETDEWEB)
Moryakov, A. V., E-mail: sailor@orc.ru [National Research Centre Kurchatov Institute (Russian Federation)
2016-12-15
An algorithm for solving the linear Cauchy problem for large systems of ordinary differential equations is presented. The algorithm for systems of first-order differential equations is implemented in the EDELWEISS code with the possibility of parallel computations on supercomputers employing the MPI (Message Passing Interface) standard for the data exchange between parallel processes. The solution is represented by a series of orthogonal polynomials on the interval [0, 1]. The algorithm is characterized by simplicity and the possibility to solve nonlinear problems with a correction of the operator in accordance with the solution obtained in the previous iterative process.
International Nuclear Information System (INIS)
Fernandes, L.; Friedlander, A.; Guedes, M.; Judice, J.
2001-01-01
This paper addresses a General Linear Complementarity Problem (GLCP) that has found applications in global optimization. It is shown that a solution of the GLCP can be computed by finding a stationary point of a differentiable function over a set defined by simple bounds on the variables. The application of this result to the solution of bilinear programs and LCPs is discussed. Some computational evidence of its usefulness is included in the last part of the paper
An interior-point method for the Cartesian P*(k-linear complementarity problem over symmetric cones
Directory of Open Access Journals (Sweden)
B Kheirfam
2014-06-01
Full Text Available A novel primal-dual path-following interior-point algorithm for the Cartesian P*(k-linear complementarity problem over symmetric cones is presented. The algorithm is based on a reformulation of the central path for finding the search directions. For a full Nesterov-Todd step feasible interior-point algorithm based on the new search directions, the complexity bound of the algorithm with small-update approach is the best-available bound.
Pfeil, W. H.; De Los Reyes, G.; Bobula, G. A.
1985-01-01
A power turbine governor was designed for a recent-technology turboshaft engine coupled to a modern, articulated rotor system using Linear Quadratic Regulator (LQR) and Kalman Filter (KF) techniques. A linear, state-space model of the engine and rotor system was derived for six engine power settings from flight idle to maximum continuous. An integrator was appended to the fuel flow input to reduce the steady-state governor error to zero. Feedback gains were calculated for the system states at each power setting using the LQR technique. The main rotor tip speed state is not measurable, so a Kalman Filter of the rotor was used to estimate this state. The crossover of the system was increased to 10 rad/s compared to 2 rad/sec for a current governor. Initial computer simulations with a nonlinear engine model indicate a significant decrease in power turbine speed variation with the LQR governor compared to a conventional governor.
Pérez Gladish, Blanca María; Arenas Parra, María del Mar; Bilbao Terol, Amelia María; Rodríguez Uria, María Victoria
2005-01-01
This study attempts to apply a management science technique to improve the efficiency of Hospital Administration. We aim to design the performance of the surgical services at a Public Hospital that allows the Decision-Maker to plan surgical scheduling over one year in order to reduce waiting lists. Real decision problems usually involve several objectives that have parameters which are often given by the decision maker in an imprecise way. It is possible to handle these kinds of problems ...
Directory of Open Access Journals (Sweden)
Qiong Liu
2012-01-01
Full Text Available We study the following fourth-order elliptic equations: Δ2+Δ=(,,∈Ω,=Δ=0,∈Ω, where Ω⊂ℝ is a bounded domain with smooth boundary Ω and (, is asymptotically linear with respect to at infinity. Using an equivalent version of Cerami's condition and the symmetric mountain pass lemma, we obtain the existence of multiple solutions for the equations.
Czech Academy of Sciences Publication Activity Database
Haslinger, Jaroslav; Repin, S.; Sysala, Stanislav
2016-01-01
Roč. 61, č. 5 (2016), s. 527-564 ISSN 0862-7940 R&D Projects: GA MŠk LQ1602 Institutional support: RVO:68145535 Keywords : functionals with linear growth * limit load * truncation method * perfect plasticity Subject RIV: BA - General Mathematics Impact factor: 0.618, year: 2016 http://link.springer.com/article/10.1007/s10492-016-0146-6
A Unique Technique to get Kaprekar Iteration in Linear Programming Problem
Sumathi, P.; Preethy, V.
2018-04-01
This paper explores about a frivolous number popularly known as Kaprekar constant and Kaprekar numbers. A large number of courses and the different classroom capacities with difference in study periods make the assignment between classrooms and courses complicated. An approach of getting the minimum value of number of iterations to reach the Kaprekar constant for four digit numbers and maximum value is also obtained through linear programming techniques.
Some mathematical problems in non-linear Physics; Algunos problemas matematicos en fisica no-lineal
Energy Technology Data Exchange (ETDEWEB)
NONE
1983-07-01
The main results contained in this report are the following: I) A general analysis of non-autonomous conserved densities for simple linear evolution systems. II) Partial differential systems within a wide class are converted into Lagrange an form. III) Rigorous criteria for existence of integrating factor matrices. IV) Isolation of all third-order evolution equations with high order symmetries and conservation laws. (Author) 3 refs.
A Linear Time Algorithm for the k Maximal Sums Problem
DEFF Research Database (Denmark)
Brodal, Gerth Stølting; Jørgensen, Allan Grønlund
2007-01-01
k maximal sums problem. We use this algorithm to obtain algorithms solving the two-dimensional k maximal sums problem in O(m 2·n + k) time, where the input is an m ×n matrix with m ≤ n. We generalize this algorithm to solve the d-dimensional problem in O(n 2d − 1 + k) time. The space usage of all......Finding the sub-vector with the largest sum in a sequence of n numbers is known as the maximum sum problem. Finding the k sub-vectors with the largest sums is a natural extension of this, and is known as the k maximal sums problem. In this paper we design an optimal O(n + k) time algorithm for the...... the algorithms can be reduced to O(n d − 1 + k). This leads to the first algorithm for the k maximal sums problem in one dimension using O(n + k) time and O(k) space....
An Improved Method for Solving Multiobjective Integer Linear Fractional Programming Problem
Directory of Open Access Journals (Sweden)
Meriem Ait Mehdi
2014-01-01
Full Text Available We describe an improvement of Chergui and Moulaï’s method (2008 that generates the whole efficient set of a multiobjective integer linear fractional program based on the branch and cut concept. The general step of this method consists in optimizing (maximizing without loss of generality one of the fractional objective functions over a subset of the original continuous feasible set; then if necessary, a branching process is carried out until obtaining an integer feasible solution. At this stage, an efficient cut is built from the criteria’s growth directions in order to discard a part of the feasible domain containing only nonefficient solutions. Our contribution concerns firstly the optimization process where a linear program that we define later will be solved at each step rather than a fractional linear program. Secondly, local ideal and nadir points will be used as bounds to prune some branches leading to nonefficient solutions. The computational experiments show that the new method outperforms the old one in all the treated instances.
Reduction of Linear Programming to Linear Approximation
Vaserstein, Leonid N.
2006-01-01
It is well known that every Chebyshev linear approximation problem can be reduced to a linear program. In this paper we show that conversely every linear program can be reduced to a Chebyshev linear approximation problem.
A Review On Linear Programming Analysis Of The Outsourcing Problem Using MATLAB
Directory of Open Access Journals (Sweden)
FLt Lt Dinesh Kumar Gupta Retd.
2015-08-01
Full Text Available Abstract This study examines the case where market demand exceeds the companys capacity to manufacture. Manufacturing companies often function in situations where internal production resources constrain their throughput. Such situations are characterized as the problem of finite capacity scheduling. Management policy is to meet all demand in order to prevent competitor from entering the field. Now if management needs to decide what quantities of each product to manufacture and what quantities to buy from external contractors. In this study we have described two methodologies based on LP analysis to solve production outsourcing problem using latest version of MATLAB. We choose the best methodology which gives us maximum profits.
Experiments in paramagnetic relaxation
International Nuclear Information System (INIS)
Lijphart, E.E.
1976-01-01
This thesis presents two attempts to improve the resolving power of the relaxation measurement technique. The first attempt reconsiders the old technique of steady state saturation. When used in conjunction with the pulse technique, it offers the possibility of obtaining additional information about the system in which all-time derivatives are zero; in addition, non-linear effects may be distinguished from each other. The second attempt involved a systematic study of only one system: Cu in the Tutton salts (K and Rb). The systematic approach, the high accuracy of the measurement and the sheer amount of experimental data for varying temperature, magnetic field and concentration made it possible in this case to separate the prevailing relaxation mechanisms reliably
Relaxation approximations to second-order traffic flow models by high-resolution schemes
International Nuclear Information System (INIS)
Nikolos, I.K.; Delis, A.I.; Papageorgiou, M.
2015-01-01
A relaxation-type approximation of second-order non-equilibrium traffic models, written in conservation or balance law form, is considered. Using the relaxation approximation, the nonlinear equations are transformed to a semi-linear diagonilizable problem with linear characteristic variables and stiff source terms with the attractive feature that neither Riemann solvers nor characteristic decompositions are in need. In particular, it is only necessary to provide the flux and source term functions and an estimate of the characteristic speeds. To discretize the resulting relaxation system, high-resolution reconstructions in space are considered. Emphasis is given on a fifth-order WENO scheme and its performance. The computations reported demonstrate the simplicity and versatility of relaxation schemes as numerical solvers
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
Yanti, Y. R.; Amin, S. M.; Sulaiman, R.
2018-01-01
This study described representation of students who have musical, logical-mathematic and naturalist intelligence in solving a problem. Subjects were selected on the basis of multiple intelligence tests (TPM) consists of 108 statements, with 102 statements adopted from Chislet and Chapman and 6 statements equal to eksistensial intelligences. Data were analyzed based on problem-solving tests (TPM) and interviewing. See the validity of the data then problem-solving tests (TPM) and interviewing is given twice with an analyzed using the representation indikator and the problem solving step. The results showed that: the stage of presenting information known, stage of devising a plan, and stage of carrying out the plan those three subjects were using same form of representation. While he stage of presenting information asked and stage of looking back, subject of logical-mathematic was using different forms of representation with subjects of musical and naturalist intelligence. From this research is expected to provide input to the teacher in determining the learning strategy that will be used by considering the representation of students with the basis of multiple intelligences.
On nonseparated three-point boundary value problems for linear functional differential equations
Czech Academy of Sciences Publication Activity Database
Rontó, András; Rontó, M.
2011-01-01
Roč. 2011, - (2011), s. 326052 ISSN 1085-3375 Institutional research plan: CEZ:AV0Z10190503 Keywords : functional-differential equation * three-point boundary value problem * nonseparated boundary condition Subject RIV: BA - General Mathematics Impact factor: 1.318, year: 2011 http://www.hindawi.com/journals/ aaa /2011/326052/
Fan, Xitao; Wang, Lin
The Monte Carlo study compared the performance of predictive discriminant analysis (PDA) and that of logistic regression (LR) for the two-group classification problem. Prior probabilities were used for classification, but the cost of misclassification was assumed to be equal. The study used a fully crossed three-factor experimental design (with…
Well-posedness of the second-order linear singular Dirichlet problem
Czech Academy of Sciences Publication Activity Database
Lomtatidze, Alexander; Opluštil, Z.
2015-01-01
Roč. 22, č. 3 (2015), s. 409-419 ISSN 1072-947X Institutional support: RVO:67985840 Keywords : singular Dirichlet problem * well-posedness Subject RIV: BA - General Mathematics Impact factor: 0.417, year: 2015 http://www.degruyter.com/view/j/gmj.2015.22.issue-3/gmj-2015-0023/gmj-2015-0023. xml
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
DEFF Research Database (Denmark)
Jensen, Jakob Søndergaard; Nakshatrala, Praveen B.; Tortorelli, Daniel A.
2014-01-01
Gradient-based topology optimization typically involves thousands or millions of design variables. This makes efficient sensitivity analysis essential and for this the adjoint variable method (AVM) is indispensable. For transient problems it has been observed that the traditional AVM, based on a ...
Directory of Open Access Journals (Sweden)
H Kazemipoor
2012-04-01
Full Text Available A multi-skilled project scheduling problem (MSPSP has been generally presented to schedule a project with staff members as resources. Each activity in project network requires different skills and also staff members have different skills, too. This causes the MSPSP becomes a special type of a multi-mode resource-constrained project scheduling problem (MM-RCPSP with a huge number of modes. Given the importance of this issue, in this paper, a mixed integer linear programming for the MSPSP is presented. Due to the complexity of the problem, a meta-heuristic algorithm is proposed in order to find near optimal solutions. To validate performance of the algorithm, results are compared against exact solutions solved by the LINGO solver. The results are promising and show that optimal or near-optimal solutions are derived for small instances and good solutions for larger instances in reasonable time.
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.
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.
The Dirichlet problem with L2-boundary data for elliptic linear equations
Chabrowski, Jan
1991-01-01
The Dirichlet problem has a very long history in mathematics and its importance in partial differential equations, harmonic analysis, potential theory and the applied sciences is well-known. In the last decade the Dirichlet problem with L2-boundary data has attracted the attention of several mathematicians. The significant features of this recent research are the use of weighted Sobolev spaces, existence results for elliptic equations under very weak regularity assumptions on coefficients, energy estimates involving L2-norm of a boundary data and the construction of a space larger than the usual Sobolev space W1,2 such that every L2-function on the boundary of a given set is the trace of a suitable element of this space. The book gives a concise account of main aspects of these recent developments and is intended for researchers and graduate students. Some basic knowledge of Sobolev spaces and measure theory is required.
Special Cases in Optimization Problems for Stationary Linear Closed-Loop Systems
Aliev, F. A.; Larin, Vladimir Borisovich
2003-03-01
Consideration is given to problems of solving the algebraic Riccati equation (ARE)— J-factorization of matrix polynomials and J-factorization of rational matrices—to which traditional solution algorithms are not applicable. In this connection, solution algorithms for these problems are discussed where the eigenvalues of the Hamiltonian matrix corresponding to the ARE and the zeros of matrix polynomials are located on the imaginary axis. Moreover, a procedure is set forth for asymptotic expansion of a stabilizing solution of the ARE in the neighborhood of a point at which the ARE has no stabilizing solution. It is shown how this expansion can be used for constructing canonical J-factorization of matrix polynomials that is nearly a noncanonical J-factorization. It is pointed out that the algorithms described can be implemented with the help of MATLAB routines
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 ...
International Nuclear Information System (INIS)
Mueller, E.
2007-01-01
The paper presents an approach which treats topics of macroeconomics by methods familiar in physics and technology, especially in nuclear reactor technology and in quantum mechanics. Such methods are applied to simplified models for the money flows within a national economy, their variation in time and thereby for the annual national growth rate. As usual, money flows stand for economic activities. The money flows between the economic groups are described by a set of difference equations or by a set of approximative differential equations or eventually by a set of linear algebraic equations. Thus this paper especially deals with the time behaviour of model economies which are under the influence of imbalances and of delay processes, thereby dealing also with economic growth and recession rates. These differential equations are solved by a completely numerical Runge-Kutta algorithm. Case studies are presented for cases with 12 groups only and are to show the capability of the methods which have been worked out. (orig.)
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
Energy Technology Data Exchange (ETDEWEB)
Mueller, E.
2007-12-15
The paper presents an approach which treats topics of macroeconomics by methods familiar in physics and technology, especially in nuclear reactor technology and in quantum mechanics. Such methods are applied to simplified models for the money flows within a national economy, their variation in time and thereby for the annual national growth rate. As usual, money flows stand for economic activities. The money flows between the economic groups are described by a set of difference equations or by a set of approximative differential equations or eventually by a set of linear algebraic equations. Thus this paper especially deals with the time behaviour of model economies which are under the influence of imbalances and of delay processes, thereby dealing also with economic growth and recession rates. These differential equations are solved by a completely numerical Runge-Kutta algorithm. Case studies are presented for cases with 12 groups only and are to show the capability of the methods which have been worked out. (orig.)
Parametric linear programming for a materials requirement planning problem solution with uncertainty
Martin Darío Arango Serna; Conrado Augusto Serna; Giovanni Pérez Ortega
2010-01-01
Using fuzzy set theory as a methodology for modelling and analysing decision systems is particularly interesting for researchers in industrial engineering because it allows qualitative and quantitative analysis of problems involving uncertainty and imprecision. Thus, in an effort to gain a better understanding of the use of fuzzy logic in industrial engineering, more specifically in the field of production planning, this article was aimed at providing a materials requirement planning (MRP) pr...
The general linear thermoelastic end problem for solid and hollow cylinders
International Nuclear Information System (INIS)
Thompson, J.J.; Chen, P.Y.P.
1977-01-01
This paper reports on three topics arising from work in progress on theoretical and computational aspects of the utilization of self equilibrating and load stress systems, to solve thermoelastic problems of finite, or semi-infinite, solid or hollow circular cylinders, with particular reference to the pellets, rods, tubes and shells with arbitrary internal heat generation encountered in Nuclear Reactor Technology. Specifically the work is aimed at the evaluation of stress intensification factors in the end elastic boundary layer region, due to various thermal and mechanical end load conditions, in relation to the external, exact stress solutions, which satisfy conditions on the curved surfaces only and are valid over the remainder of the cylindrical body. More generally, it is possible, at least for symmetric thermoelastic problems, to derive exact external solutions, using self equilibrating end load systems, which describe the stress/displacement state completely as a combination of a simple local plane strain solution and a correction dependent on the magnitude of axial thermal gradients. Thus plane strain, and self equilibrating end load systems are sufficient for the complete external and boundary layer solution of a finite cylindrical body. This formulation is capable of further extension, e.g., to concentric multi-region problems, and provides a useful approach to the study of local stress intensification factors due to thermal perturbations
International Nuclear Information System (INIS)
Ekel, P.Y.; Galperin, E.A.
2003-01-01
Models for multicriteria resource allocation are constructed with the specific box-triangular structure of a feasible region. The method of balance set equations is extended for the satisfaction level representation of the cost function space including the case of linearly dependent cost functions. On this basis, different goal criteria on the balance set are investigated for linear cases. Procedures for determining the balance set and finding goal-optimal Pareto solutions are illustrated on examples. The results of the paper are of universal character and can find wide applications in allocating diverse types of resources on the multiobjective basis in planning and control of complex systems including load management and energy market problems. (Author)
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.
Directory of Open Access Journals (Sweden)
Jagadish Singh
2012-01-01
Full Text Available This paper investigates the positions and linear stability of an infinitesimal body around the equilibrium points in the framework of the Robe’s circular restricted three-body problem, with assumptions that the hydrostatic equilibrium figure of the first primary is an oblate spheroid and the second primary is an oblate body as well. It is found that equilibrium point exists near the centre of the first primary. Further, there can be one more equilibrium point on the line joining the centers of both primaries. Points on the circle within the first primary are also equilibrium points under certain conditions and the existence of two out-of-plane points is also observed. The linear stability of this configuration is examined and it is found that points near the center of the first primary are conditionally stable, while the circular and out of plane equilibrium points are unstable.
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.
Shilov, Georgi E
1977-01-01
Covers determinants, linear spaces, systems of linear equations, linear functions of a vector argument, coordinate transformations, the canonical form of the matrix of a linear operator, bilinear and quadratic forms, Euclidean spaces, unitary spaces, quadratic forms in Euclidean and unitary spaces, finite-dimensional space. Problems with hints and answers.
A Mixed-Integer Linear Programming Problem which is Efficiently Solvable.
1987-10-01
ger prongramn rg versions or the problem is not ac’hievable in genieral for sparse inistancves of’ P rolem(r Mi. Th le remrai nder or thris paper is...rClazes c:oIh edge (i,I*) by comlpli urg +- rnirr(z 3, ,x + a,j). A sirnI) le analysis (11 vto Nei [131 indicates why whe Iellinan-Ford algorithm works...ari cl(cck to iceat reguilar rnct’vtuls. For c’xamiic, oi1cc Wwitiil pcroccc’ssicg svlstcici1 rccjcilrcc thicit I iisc wires ice repeated verr 200W
Parker, Peter A.; Geoffrey, Vining G.; Wilson, Sara R.; Szarka, John L., III; Johnson, Nels G.
2010-01-01
The calibration of measurement systems is a fundamental but under-studied problem within industrial statistics. The origins of this problem go back to basic chemical analysis based on NIST standards. In today's world these issues extend to mechanical, electrical, and materials engineering. Often, these new scenarios do not provide "gold standards" such as the standard weights provided by NIST. This paper considers the classic "forward regression followed by inverse regression" approach. In this approach the initial experiment treats the "standards" as the regressor and the observed values as the response to calibrate the instrument. The analyst then must invert the resulting regression model in order to use the instrument to make actual measurements in practice. This paper compares this classical approach to "reverse regression," which treats the standards as the response and the observed measurements as the regressor in the calibration experiment. Such an approach is intuitively appealing because it avoids the need for the inverse regression. However, it also violates some of the basic regression assumptions.
Directory of Open Access Journals (Sweden)
Buscaglia Gustavo C.
2001-01-01
Full Text Available A new numerical approach is proposed to alleviate the computational cost of solving non-linear non-uniform homogenized problems. The article details the application of the proposed approach to lubrication problems with roughness effects. The method is based on a two-parameter Taylor expansion of the implicit dependence of the homogenized coefficients on the average pressure and on the local value of the air gap thickness. A fourth-order Taylor expansion provides an approximation that is accurate enough to be used in the global problem solution instead of the exact dependence, without introducing significant errors. In this way, when solving the global problem, the solution of local problems is simply replaced by the evaluation of a polynomial. Moreover, the method leads naturally to Newton-Raphson nonlinear iterations, that further reduce the cost. The overall efficiency of the numerical methodology makes it feasible to apply rigorous homogenization techniques in the analysis of compressible fluid contact considering roughness effects. Previous work makes use of an heuristic averaging technique. Numerical comparison proves that homogenization-based methods are superior when the roughness is strongly anisotropic and not aligned with the flow direction.
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.
Antar, B. N.
1976-01-01
A numerical technique is presented for locating the eigenvalues of two point linear differential eigenvalue problems. The technique is designed to search for complex eigenvalues belonging to complex operators. With this method, any domain of the complex eigenvalue plane could be scanned and the eigenvalues within it, if any, located. For an application of the method, the eigenvalues of the Orr-Sommerfeld equation of the plane Poiseuille flow are determined within a specified portion of the c-plane. The eigenvalues for alpha = 1 and R = 10,000 are tabulated and compared for accuracy with existing solutions.
Directory of Open Access Journals (Sweden)
Zhifeng Dai
2014-01-01
Full Text Available Combining the Rosen gradient projection method with the two-term Polak-Ribière-Polyak (PRP conjugate gradient method, we propose a two-term Polak-Ribière-Polyak (PRP conjugate gradient projection method for solving linear equality constraints optimization problems. The proposed method possesses some attractive properties: (1 search direction generated by the proposed method is a feasible descent direction; consequently the generated iterates are feasible points; (2 the sequences of function are decreasing. Under some mild conditions, we show that it is globally convergent with Armijio-type line search. Preliminary numerical results show that the proposed method is promising.
Generalized Uncertainty Quantification for Linear Inverse Problems in X-ray Imaging
Energy Technology Data Exchange (ETDEWEB)
Fowler, Michael James [Clarkson Univ., Potsdam, NY (United States)
2014-04-25
In industrial and engineering applications, X-ray radiography has attained wide use as a data collection protocol for the assessment of material properties in cases where direct observation is not possible. The direct measurement of nuclear materials, particularly when they are under explosive or implosive loading, is not feasible, and radiography can serve as a useful tool for obtaining indirect measurements. In such experiments, high energy X-rays are pulsed through a scene containing material of interest, and a detector records a radiograph by measuring the radiation that is not attenuated in the scene. One approach to the analysis of these radiographs is to model the imaging system as an operator that acts upon the object being imaged to produce a radiograph. In this model, the goal is to solve an inverse problem to reconstruct the values of interest in the object, which are typically material properties such as density or areal density. The primary objective in this work is to provide quantitative solutions with uncertainty estimates for three separate applications in X-ray radiography: deconvolution, Abel inversion, and radiation spot shape reconstruction. For each problem, we introduce a new hierarchical Bayesian model for determining a posterior distribution on the unknowns and develop efficient Markov chain Monte Carlo (MCMC) methods for sampling from the posterior. A Poisson likelihood, based on a noise model for photon counts at the detector, is combined with a prior tailored to each application: an edge-localizing prior for deconvolution; a smoothing prior with non-negativity constraints for spot reconstruction; and a full covariance sampling prior based on a Wishart hyperprior for Abel inversion. After developing our methods in a general setting, we demonstrate each model on both synthetically generated datasets, including those from a well known radiation transport code, and real high energy radiographs taken at two U. S. Department of Energy
Synthetic acceleration methods for linear transport problems with highly anisotropic scattering
International Nuclear Information System (INIS)
Khattab, K.M.
1989-01-01
One of the iterative methods which is used to solve the discretized transport equation is called the Source Iteration Method (SI). The SI method converges very slowly for problems with optically thick regions and scattering ratios (σ s /σ t ) near unity. The Diffusion-Synthetic Acceleration method (DSA) is one of the methods which has been devised to improve the convergence rate of the SI method. The DSA method is a good tool to accelerate the SI method, if the particle which is being dealt with is a neutron. This is because the scattering process for neutrons is not severely anisotropic. However, if the particle is a charged particle (electron), DSA becomes ineffective as an acceleration device because here the scattering process is severely anisotropic. To improve the DSA algorithm for electron transport, the author approaches the problem in two different ways in this thesis. He develops the first approach by accelerating more angular moments (φ 0 , φ 1 , φ 2 , φ 3 ,...) than is done in DSA; he calls this approach the Modified P N Synthetic Acceleration (MPSA) method. In the second approach he modifies the definition of the transport sweep, using the physics of the scattering; he calls this approach the Modified Diffusion Synthetic Acceleration (MDSA) method. In general, he has developed, analyzed, and implemented the MPSA and MDSA methods in this thesis and has shown that for a high order quadrature set and mesh widths about 1.0 cm, they are each about 34 times faster (clock time) than the DSA method. Also, he has found that the MDSA spectral radius decreases as the mesh size increases. This makes the MDSA method a better choice for large spatial meshes
Herman, Gabor T; Chen, Wei
2008-03-01
The goal of Intensity-Modulated Radiation Therapy (IMRT) is to deliver sufficient doses to tumors to kill them, but without causing irreparable damage to critical organs. This requirement can be formulated as a linear feasibility problem. The sequential (i.e., iteratively treating the constraints one after another in a cyclic fashion) algorithm ART3 is known to find a solution to such problems in a finite number of steps, provided that the feasible region is full dimensional. We present a faster algorithm called ART3+. The idea of ART3+ is to avoid unnecessary checks on constraints that are likely to be satisfied. The superior performance of the new algorithm is demonstrated by mathematical experiments inspired by the IMRT application.
Suliman, Mohamed Abdalla Elhag
2016-12-19
This paper proposes a new approach to find the regularization parameter for linear least-squares discrete ill-posed problems. In the proposed approach, an artificial perturbation matrix with a bounded norm is forced into the discrete ill-posed model matrix. This perturbation is introduced to enhance the singular-value (SV) structure of the matrix and hence to provide a better solution. The proposed approach is derived to select the regularization parameter in a way that minimizes the mean-squared error (MSE) of the estimator. Numerical results demonstrate that the proposed approach outperforms a set of benchmark methods in most cases when applied to different scenarios of discrete ill-posed problems. Jointly, the proposed approach enjoys the lowest run-time and offers the highest level of robustness amongst all the tested methods.
Memon, Sajid; Nataraj, Neela; Pani, Amiya Kumar
2012-01-01
In this article, a posteriori error estimates are derived for mixed finite element Galerkin approximations to second order linear parabolic initial and boundary value problems. Using mixed elliptic reconstructions, a posteriori error estimates in L∞(L2)- and L2(L2)-norms for the solution as well as its flux are proved for the semidiscrete scheme. Finally, based on a backward Euler method, a completely discrete scheme is analyzed and a posteriori error bounds are derived, which improves upon earlier results on a posteriori estimates of mixed finite element approximations to parabolic problems. Results of numerical experiments verifying the efficiency of the estimators have also been provided. © 2012 Society for Industrial and Applied Mathematics.
Directory of Open Access Journals (Sweden)
Gilberto Chavarría Arroyo
2014-06-01
Full Text Available The current article presents the results of a study that aimed to analyze the difficulties faced by eighth grade students when learning to solve algebraic problems based on linear equations with one unknown variable. The participants were learners with low average performance in mathematics at a high school in Heredia. The research followed a naturalistic paradigm and the case study method with a qualitative approach. Different techniques like class observations, questionnaires to students, non-structured interviews to teachers and interviews to the learners were applied. The research helped to identify the main causes of difficulty when learning to solve algebraic problems. Some of the causes that were identified are affective aspects, lack of previous knowledge, poor relational understanding, fatigue, diversion, reading deficiencies and misunderstanding of terminology.
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.
Turrisi, E.; Ciancio, V.; Kluitenberg, G.A.
1982-01-01
The propagation of linear transverse acoustic waves in isotropic media in which mechanical relaxation phenomena occur was considered in a previous paper. In particular expressions for the velocity and attenuation of the waves were obtained and the limiting cases of waves with high and low
Goswami, Deepjyoti; Pani, Amiya K.
2011-01-01
In this article, we propose and analyze an alternate proof of a priori error estimates for semidiscrete Galerkin approximations to a general second order linear parabolic initial and boundary value problem with rough initial data. Our analysis
Handelman's hierarchy for the maximum stable set problem
Laurent, M.; Sun, Z.
2014-01-01
The maximum stable set problem is a well-known NP-hard problem in combinatorial optimization, which can be formulated as the maximization of a quadratic square-free polynomial over the (Boolean) hypercube. We investigate a hierarchy of linear programming relaxations for this problem, based on a
Directory of Open Access Journals (Sweden)
Nikolay N. Nefedov
2018-01-01
Full Text Available In the paper, we study a singularly perturbed periodic in time problem for the parabolic reaction-advection-diffusion equation with a weak linear advection. The case of the reactive term in the form of a cubic nonlinearity is considered. On the basis of already known results, a more general formulation of the problem is investigated, with weaker sufficient conditions for the existence of a solution with an internal transition layer to be provided than in previous studies. For convenience, the known results are given, which ensure the fulfillment of the existence theorem of the contrast structure. The justification for the existence of a solution with an internal transition layer is based on the use of an asymptotic method of differential inequalities based on the modification of the terms of the constructed asymptotic expansion. Further, sufficient conditions are established to fulfill these requirements, and they have simple and concise formulations in the form of the algebraic equation w(x0,t = 0 and the condition wx(x0,t < 0, which is essentially a condition of simplicity of the root x0(t and ensuring the stability of the solution found. The function w is a function of the known functions appearing in the reactive and advective terms of the original problem. The equation w(x0,t = 0 is a problem for finding the zero approximation x0(t to determine the localization region of the inner transition layer. In addition, the asymptotic Lyapunov stability of the found periodic solution is investigated, based on the application of the so-called compressible barrier method. The main result of the paper is formulated as a theorem.
International Nuclear Information System (INIS)
Ignatovich, V.K.
1989-01-01
The equations. governing the transport of radiation in plane media of finite thickness are formulated and solved in terms reflection and extintion of radiation inthe case of semi infinite media. 13 refs
Data-Driven Problems in Elasticity
Conti, S.; Müller, S.; Ortiz, M.
2018-01-01
We consider a new class of problems in elasticity, referred to as Data-Driven problems, defined on the space of strain-stress field pairs, or phase space. The problem consists of minimizing the distance between a given material data set and the subspace of compatible strain fields and stress fields in equilibrium. We find that the classical solutions are recovered in the case of linear elasticity. We identify conditions for convergence of Data-Driven solutions corresponding to sequences of approximating material data sets. Specialization to constant material data set sequences in turn establishes an appropriate notion of relaxation. We find that relaxation within this Data-Driven framework is fundamentally different from the classical relaxation of energy functions. For instance, we show that in the Data-Driven framework the relaxation of a bistable material leads to material data sets that are not graphs.
Searching for optimal integer solutions to set partitioning problems using column generation
Bredström, David; Jörnsten, Kurt; Rönnqvist, Mikael
2007-01-01
We describe a new approach to produce integer feasible columns to a set partitioning problem directly in solving the linear programming (LP) relaxation using column generation. Traditionally, column generation is aimed to solve the LP relaxation as quick as possible without any concern of the integer properties of the columns formed. In our approach we aim to generate the columns forming the optimal integer solution while simultaneously solving the LP relaxation. By this we can re...
Directory of Open Access Journals (Sweden)
Nahed S. Hussein
2014-01-01
Full Text Available A numerical boundary integral scheme is proposed for the solution to the system of eld equations of plane. The stresses are prescribed on one-half of the circle, while the displacements are given. The considered problem with mixed boundary conditions in the circle is replaced by two problems with homogeneous boundary conditions, one of each type, having a common solution. The equations are reduced to a system of boundary integral equations, which is then discretized in the usual way, and the problem at this stage is reduced to the solution to a rectangular linear system of algebraic equations. The unknowns in this system of equations are the boundary values of four harmonic functions which define the full elastic solution and the unknown boundary values of stresses or displacements on proper parts of the boundary. On the basis of the obtained results, it is inferred that a stress component has a singularity at each of the two separation points, thought to be of logarithmic type. The results are discussed and boundary plots are given. We have also calculated the unknown functions in the bulk directly from the given boundary conditions using the boundary collocation method. The obtained results in the bulk are discussed and three-dimensional plots are given. A tentative form for the singular solution is proposed and the corresponding singular stresses and displacements are plotted in the bulk. The form of the singular tangential stress is seen to be compatible with the boundary values obtained earlier. The efficiency of the used numerical schemes is discussed.
Energy Technology Data Exchange (ETDEWEB)
Addona, Davide, E-mail: d.addona@campus.unimib.it [Università degli Studi di Milano Bicocca, (MILANO BICOCCA) Dipartimento di Matematica (Italy)
2015-08-15
We obtain weighted uniform estimates for the gradient of the solutions to a class of linear parabolic Cauchy problems with unbounded coefficients. Such estimates are then used to prove existence and uniqueness of the mild solution to a semi-linear backward parabolic Cauchy problem, where the differential equation is the Hamilton–Jacobi–Bellman equation of a suitable optimal control problem. Via backward stochastic differential equations, we show that the mild solution is indeed the value function of the controlled equation and that the feedback law is verified.
Goswami, Deepjyoti
2011-09-01
In this article, we propose and analyze an alternate proof of a priori error estimates for semidiscrete Galerkin approximations to a general second order linear parabolic initial and boundary value problem with rough initial data. Our analysis is based on energy arguments without using parabolic duality. Further, it follows the spirit of the proof technique used for deriving optimal error estimates for finite element approximations to parabolic problems with smooth initial data and hence, it unifies both theories, that is, one for smooth initial data and other for nonsmooth data. Moreover, the proposed technique is also extended to a semidiscrete mixed method for linear parabolic problems. In both cases, optimal L2-error estimates are derived, when the initial data is in L2. A superconvergence phenomenon is also observed, which is then used to prove L∞-estimates for linear parabolic problems defined on two-dimensional spatial domain again with rough initial data. Copyright © Taylor & Francis Group, LLC.
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
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).
Energy Technology Data Exchange (ETDEWEB)
Oliva, Amaury M.; Filho, Hermes A.; Silva, Davi M.; Garcia, Carlos R., E-mail: aoliva@iprj.uerj.br, E-mail: halves@iprj.uerj.br, E-mail: davijmsilva@yahoo.com.br, E-mail: cgh@instec.cu [Universidade do Estado do Rio de Janeiro (UERJ), Nova Friburgo, RJ (Brazil). Instituto Politecnico. Departamento de Modelagem Computacional; Instituto Superior de Tecnologias y Ciencias Aplicadas (InSTEC), La Habana (Cuba)
2017-07-01
In this paper, we propose a numerical methodology for the development of a method of the spectral nodal class that will generate numerical solutions free from spatial truncation errors. This method, denominated Spectral Deterministic Method (SDM), is tested as an initial study of the solutions (spectral analysis) of neutron transport equations in the discrete ordinates (S{sub N}) formulation, in one-dimensional slab geometry, multigroup approximation, with linearly anisotropic scattering, considering homogeneous and heterogeneous domains with fixed source. The unknowns in the methodology are the cell-edge, and cell average angular fluxes, the numerical values calculated for these quantities coincide with the analytic solution of the equations. These numerical results are shown and compared with the traditional ne- mesh method Diamond Difference (DD) and the coarse-mesh method spectral Green's function (SGF) to illustrate the method's accuracy and stability. The solution algorithms problems are implemented in a computer simulator made in C++ language, the same that was used to generate the results of the reference work. (author)
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.
Tangarife, Walter; Tobioka, Kohsaku; Ubaldi, Lorenzo; Volansky, Tomer
2018-02-01
The cosmological relaxation of the electroweak scale has been proposed as a mechanism to address the hierarchy problem of the Standard Model. A field, the relaxion, rolls down its potential and, in doing so, scans the squared mass parameter of the Higgs, relaxing it to a parametrically small value. In this work, we promote the relaxion to an inflaton. We couple it to Abelian gauge bosons, thereby introducing the necessary dissipation mechanism which slows down the field in the last stages. We describe a novel reheating mechanism, which relies on the gauge-boson production leading to strong electro-magnetic fields, and proceeds via the vacuum production of electron-positron pairs through the Schwinger effect. We refer to this mechanism as Schwinger reheating. We discuss the cosmological dynamics of the model and the phenomenological constraints from CMB and other experiments. We find that a cutoff close to the Planck scale may be achieved. In its minimal form, the model does not generate sufficient curvature perturbations and additional ingredients, such as a curvaton field, are needed.
Relaxation of the single-slip condition in strain-gradient plasticity.
Anguige, Keith; Dondl, Patrick W
2014-09-08
We consider the variational formulation of both geometrically linear and geometrically nonlinear elasto-plasticity subject to a class of hard single-slip conditions. Such side conditions typically render the associated boundary-value problems non-convex. We show that, for a large class of non-smooth plastic distortions, a given single-slip condition (specification of Burgers vectors) can be relaxed by introducing a microstructure through a two-stage process of mollification and lamination. The relaxed model can be thought of as an aid to simulating macroscopic plastic behaviour without the need to resolve arbitrarily fine spatial scales.
... Find a Doctor Relaxation is the absence of tension in muscle groups and a minimum or absence ... Drill Meditation Progressive Muscle Relaxation Minimizing Shortness of Breath Visualization This information has been approved by Shelby ...
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.
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)
Slow relaxation in weakly open rational polygons.
Kokshenev, Valery B; Vicentini, Eduardo
2003-07-01
The interplay between the regular (piecewise-linear) and irregular (vertex-angle) boundary effects in nonintegrable rational polygonal billiards (of m equal sides) is discussed. Decay dynamics in polygons (of perimeter P(m) and small opening Delta) is analyzed through the late-time survival probability S(m) approximately equal t(-delta). Two distinct slow relaxation channels are established. The primary universal channel exhibits relaxation of regular sliding orbits, with delta=1. The secondary channel is given by delta>1 and becomes open when m>P(m)/Delta. It originates from vertex order-disorder dual effects and is due to relaxation of chaoticlike excitations.
Nakhanu, Shikuku Beatrice; Musasia, Amadalo Maurice
2015-01-01
The topic Linear Programming is included in the compulsory Kenyan secondary school mathematics curriculum at form four. The topic provides skills for determining best outcomes in a given mathematical model involving some linear relationship. This technique has found application in business, economics as well as various engineering fields. Yet many…
Strickland, Tricia K.; Maccini, Paula
2013-01-01
We examined the effects of the Concrete-Representational-Abstract Integration strategy on the ability of secondary students with learning disabilities to multiply linear algebraic expressions embedded within contextualized area problems. A multiple-probe design across three participants was used. Results indicated that the integration of the…
Directory of Open Access Journals (Sweden)
Yanmei Sun
2012-01-01
Full Text Available By using the Leggett-Williams fixed theorem, we establish the existence of multiple positive solutions for second-order nonhomogeneous Sturm-Liouville boundary value problems with linear functional boundary conditions. One explicit example with singularity is presented to demonstrate the application of our main results.
Dynamical renormalization group approach to relaxation in quantum field theory
International Nuclear Information System (INIS)
Boyanovsky, D.; Vega, H.J. de
2003-01-01
The real time evolution and relaxation of expectation values of quantum fields and of quantum states are computed as initial value problems by implementing the dynamical renormalization group (DRG). Linear response is invoked to set up the renormalized initial value problem to study the dynamics of the expectation value of quantum fields. The perturbative solution of the equations of motion for the field expectation values of quantum fields as well as the evolution of quantum states features secular terms, namely terms that grow in time and invalidate the perturbative expansion for late times. The DRG provides a consistent framework to resum these secular terms and yields a uniform asymptotic expansion at long times. Several relevant cases are studied in detail, including those of threshold infrared divergences which appear in gauge theories at finite temperature and lead to anomalous relaxation. In these cases the DRG is shown to provide a resummation akin to Bloch-Nordsieck but directly in real time and that goes beyond the scope of Bloch-Nordsieck and Dyson resummations. The nature of the resummation program is discussed in several examples. The DRG provides a framework that is consistent, systematic, and easy to implement to study the non-equilibrium relaxational dynamics directly in real time that does not rely on the concept of quasiparticle widths
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.
International Nuclear Information System (INIS)
Dinh Nho Hao; Nguyen Trung Thanh; Sahli, Hichem
2008-01-01
In this paper we consider a multi-dimensional inverse heat conduction problem with time-dependent coefficients in a box, which is well-known to be severely ill-posed, by a variational method. The gradient of the functional to be minimized is obtained by aids of an adjoint problem and the conjugate gradient method with a stopping rule is then applied to this ill-posed optimization problem. To enhance the stability and the accuracy of the numerical solution to the problem we apply this scheme to the discretized inverse problem rather than to the continuous one. The difficulties with large dimensions of discretized problems are overcome by a splitting method which only requires the solution of easy-to-solve one-dimensional problems. The numerical results provided by our method are very good and the techniques seem to be very promising.
Mechanical relaxation in glasses
International Nuclear Information System (INIS)
Hiki, Y.
2004-01-01
The basic properties of glasses and the characteristics of mechanical relaxation in glasses were briefly reviewed, and then our studies concerned were presented. Experimental methods adopted were viscosity, internal friction, ultrasonic attenuation, and Brillouin scattering measurements. The specimens used were several kinds of inorganic, organic, and metallic glasses. The measurements were mainly carried out from the room temperature up to the glass transition temperature, and the relaxation time was determined as a function of temperature. The 'double relaxation' composed of two Arrhenius-type relaxations was observed in many materials. In both relaxations, the 'compensation effect' showing a correlation of the pre-exponential factor and the activation energy was observed. These results were explained by considering the 'complex relaxation' due to cooperative motions of atoms or group of atoms. Values of activation energy near the glass transition determined by the various experimental methods were compared with each other
Relaxation properties in classical diamagnetism
Carati, A.; Benfenati, F.; Galgani, L.
2011-06-01
It is an old result of Bohr that, according to classical statistical mechanics, at equilibrium a system of electrons in a static magnetic field presents no magnetization. Thus a magnetization can occur only in an out of equilibrium state, such as that produced through the Foucault currents when a magnetic field is switched on. It was suggested by Bohr that, after the establishment of such a nonequilibrium state, the system of electrons would quickly relax back to equilibrium. In the present paper, we study numerically the relaxation to equilibrium in a modified Bohr model, which is mathematically equivalent to a billiard with obstacles, immersed in a magnetic field that is adiabatically switched on. We show that it is not guaranteed that equilibrium is attained within the typical time scales of microscopic dynamics. Depending on the values of the parameters, one has a relaxation either to equilibrium or to a diamagnetic (presumably metastable) state. The analogy with the relaxation properties in the Fermi Pasta Ulam problem is also pointed out.
Stress relaxation in viscous soft spheres.
Boschan, Julia; Vasudevan, Siddarth A; Boukany, Pouyan E; Somfai, Ellák; Tighe, Brian P
2017-10-04
We report the results of molecular dynamics simulations of stress relaxation tests in athermal viscous soft sphere packings close to their unjamming transition. By systematically and simultaneously varying both the amplitude of the applied strain step and the pressure of the initial condition, we access both linear and nonlinear response regimes and control the distance to jamming. Stress relaxation in viscoelastic solids is characterized by a relaxation time τ* that separates short time scales, where viscous loss is substantial, from long time scales, where elastic storage dominates and the response is essentially quasistatic. We identify two distinct plateaus in the strain dependence of the relaxation time, one each in the linear and nonlinear regimes. The height of both plateaus scales as an inverse power law with the distance to jamming. By probing the time evolution of particle velocities during relaxation, we further identify a correlation between mechanical relaxation in the bulk and the degree of non-affinity in the particle velocities on the micro scale.
Relaxation characteristics of hastelloy X
International Nuclear Information System (INIS)
Suzuki, Kazuhiko
1980-02-01
Relaxation diagrams of Hastelloy X (relaxation curves, relaxation design diagrams, etc.) were generated from the creep constitutive equation of Hastelloy X, using inelastic stress analysis code TEPICC-J. These data are in good agreement with experimental relaxation data of ORNL-5479. Three typical inelastic stress analyses were performed for various relaxation behaviors of the high-temperature structures. An attempt was also made to predict these relaxation behaviors by the relaxation curves. (author)
Czech Academy of Sciences Publication Activity Database
Rontó, András; Samoilenko, A. M.
2007-01-01
Roč. 41, - (2007), s. 115-136 ISSN 1512-0015 R&D Projects: GA ČR(CZ) GA201/06/0254 Institutional research plan: CEZ:AV0Z10190503 Keywords : two-point problem * functional differential equation * singular boundary problem Subject RIV: BA - General Mathematics
Mills, James W.; And Others
1973-01-01
The Study reported here tested an application of the Linear Programming Model at the Reading Clinic of Drew University. Results, while not conclusive, indicate that this approach yields greater gains in speed scores than a traditional approach for this population. (Author)
B. Koren (Barry); M.R. Lewis; E.H. van Brummelen (Harald); B. van Leer
2001-01-01
textabstractA finite-volume method is presented for the computation of compressible flows of two immiscible fluids at very different densities. The novel ingredient in the method is a two-fluid linearized Godunov scheme, allowing for flux computations in case of different fluids (e.g., water and
TEACHING NEUROMUSCULAR RELAXATION.
NORRIS, JEANNE E.; STEINHAUS, ARTHUR H.
THIS STUDY ATTEMPTED TO FIND OUT WHETHER (1) THE METHODS FOR ATTAINING NEUROMUSCULAR RELAXATION THAT HAVE PROVED FRUITFUL IN THE ONE-TO-ONE RELATIONSHIP OF THE CLINIC CAN BE SUCCESSFULLY ADAPTED TO THE TEACHER-CLASS RELATIONSHIP OF THE CLASSROOM AND GYMNASIUM, AND (2) NEUROMUSCULAR RELAXATION CAN BE TAUGHT SUCCESSFULLY BY AN APPROPRIATELY TRAINED…
Relaxation of Anisotropic Glasses
DEFF Research Database (Denmark)
Deubener, Joachim; Martin, Birgit; Wondraczek, Lothar
2004-01-01
. When the load was removed at room temperature a permanent optical anisotropy (birefringence) was observed only perpendicular to cylinder axis and the pressure direction indicating complete elimination of thermal stresses. Relaxation of structural anisotropy was studied from reheating experiments using...... the energy release, thermo-mechanical and optical relaxation behaviour are drawn....
Relaxation techniques for stress
... raise your heart rate. This is called the stress response. Relaxation techniques can help your body relax and lower your blood pressure ... also many other types of breathing techniques you can learn. In many cases, you do not need much ... including those that cause stress. Meditation has been practiced for thousands of years, ...
Linearly constrained minimax optimization
DEFF Research Database (Denmark)
Madsen, Kaj; Schjær-Jacobsen, Hans
1978-01-01
We present an algorithm for nonlinear minimax optimization subject to linear equality and inequality constraints which requires first order partial derivatives. The algorithm is based on successive linear approximations to the functions defining the problem. The resulting linear subproblems...
Relaxation and hypnosis in pediatric dental patients.
Peretz, B
1996-01-01
Relaxation and hypnosis are methods which, may solve the problem of extreme dental anxiety, when all other methods, behavioral or pharmacological may not be used. A simple definition of hypnosis is suggestion and repetition. Suggestion is the process whereby an individual accepts a proposition put to him by another, without having the slightest logical reason for doing so. Relaxation is one method of inducing hypnosis. A case of using hypnosis on an 11-year-old boy is described.
A Thermodynamic Theory Of Solid Viscoelasticity. Part 1: Linear Viscoelasticity.
Freed, Alan D.; Leonov, Arkady I.
2002-01-01
The present series of three consecutive papers develops a general theory for linear and finite solid viscoelasticity. Because the most important object for nonlinear studies are rubber-like materials, the general approach is specified in a form convenient for solving problems important for many industries that involve rubber-like materials. General linear and nonlinear theories for non-isothermal deformations of viscoelastic solids are developed based on the quasi-linear approach of non-equilibrium thermodynamics. In this, the first paper of the series, we analyze non-isothermal linear viscoelasticity, which is applicable in a range of small strains not only to all synthetic polymers and bio-polymers but also to some non-polymeric materials. Although the linear case seems to be well developed, there still are some reasons to implement a thermodynamic derivation of constitutive equations for solid-like, non-isothermal, linear viscoelasticity. The most important is the thermodynamic modeling of thermo-rheological complexity , i.e. different temperature dependences of relaxation parameters in various parts of relaxation spectrum. A special structure of interaction matrices is established for different physical mechanisms contributed to the normal relaxation modes. This structure seems to be in accord with observations, and creates a simple mathematical framework for both continuum and molecular theories of the thermo-rheological complex relaxation phenomena. Finally, a unified approach is briefly discussed that, in principle, allows combining both the long time (discrete) and short time (continuous) descriptions of relaxation behaviors for polymers in the rubbery and glassy regions.
Czech Academy of Sciences Publication Activity Database
Tichý, Ondřej; Šmídl, Václav; Hofman, Radek; Stohl, A.
2016-01-01
Roč. 9, č. 11 (2016), s. 4297-4311 ISSN 1991-959X R&D Projects: GA MŠk(CZ) 7F14287 Institutional support: RVO:67985556 Keywords : Linear inverse problem * Bayesian regularization * Source-term determination * Variational Bayes method Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 3.458, year: 2016 http://library.utia.cas.cz/separaty/2016/AS/tichy-0466029.pdf
Tuey, R. C.
1972-01-01
Computer solutions of linear programming problems are outlined. Information covers vector spaces, convex sets, and matrix algebra elements for solving simultaneous linear equations. Dual problems, reduced cost analysis, ranges, and error analysis are illustrated.
Relaxation time in confined disordered systems
International Nuclear Information System (INIS)
Chamati, H.; Korutcheva, E.
2006-05-01
The dynamic critical behavior of a quenched hypercubic sample of linear size L is considered within the 'random T c ' field theoretical model with purely relaxation dynamic (Model A). The dynamic finite size scaling behavior is established and analyzed when the system is quenched from a homogeneous phase towards its critical temperature. The obtained results are compared to those reported in the literature. (author)
Energy Technology Data Exchange (ETDEWEB)
Ji, Aimin; Yin, Xu; Yuan, Minghai [Hohai University, Changzhou (China)
2015-09-15
There are two problems in Collaborative optimization (CO): (1) the local optima arising from the selection of an inappropriate initial point; (2) the low efficiency and accuracy root in inappropriate relaxation factors. To solve these problems, we first develop the Latin hypercube design (LHD) to determine an initial point of optimization, and then use the non-linear programming by quadratic Lagrangian (NLPQL) to search for the global solution. The effectiveness of the initial point selection strategy is verified by three benchmark functions with some dimensions and different complexities. Then we propose the Adaptive relaxation collaborative optimization (ARCO) algorithm to solve the inconsistency between the system level and the disciplines level, and in this method, the relaxation factors are determined according to the three separated stages of CO respectively. The performance of the ARCO algorithm is compared with the standard collaborative algorithm and the constant relaxation collaborative algorithm with a typical numerical example, which indicates that the ARCO algorithm is more efficient and accurate. Finally, we propose a Hybrid collaborative optimization (HCO) approach, which integrates the selection strategy of initial point with the ARCO algorithm. The results show that HCO can achieve the global optimal solution without the initial value and it also has advantages in convergence, accuracy and robustness. Therefore, the proposed HCO approach can solve the CO problems with applications in the spindle and the speed reducer.
International Nuclear Information System (INIS)
Ji, Aimin; Yin, Xu; Yuan, Minghai
2015-01-01
There are two problems in Collaborative optimization (CO): (1) the local optima arising from the selection of an inappropriate initial point; (2) the low efficiency and accuracy root in inappropriate relaxation factors. To solve these problems, we first develop the Latin hypercube design (LHD) to determine an initial point of optimization, and then use the non-linear programming by quadratic Lagrangian (NLPQL) to search for the global solution. The effectiveness of the initial point selection strategy is verified by three benchmark functions with some dimensions and different complexities. Then we propose the Adaptive relaxation collaborative optimization (ARCO) algorithm to solve the inconsistency between the system level and the disciplines level, and in this method, the relaxation factors are determined according to the three separated stages of CO respectively. The performance of the ARCO algorithm is compared with the standard collaborative algorithm and the constant relaxation collaborative algorithm with a typical numerical example, which indicates that the ARCO algorithm is more efficient and accurate. Finally, we propose a Hybrid collaborative optimization (HCO) approach, which integrates the selection strategy of initial point with the ARCO algorithm. The results show that HCO can achieve the global optimal solution without the initial value and it also has advantages in convergence, accuracy and robustness. Therefore, the proposed HCO approach can solve the CO problems with applications in the spindle and the speed reducer
A fuzzy Bi-linear management model in reverse logistic chains
Directory of Open Access Journals (Sweden)
Tadić Danijela
2016-01-01
Full Text Available The management of the electrical and electronic waste (WEEE problem in the uncertain environment has a critical effect on the economy and environmental protection of each region. The considered problem can be stated as a fuzzy non-convex optimization problem with linear objective function and a set of linear and non-linear constraints. The original problem is reformulated by using linear relaxation into a fuzzy linear programming problem. The fuzzy rating of collecting point capacities and fix costs of recycling centers are modeled by triangular fuzzy numbers. The optimal solution of the reformulation model is found by using optimality concept. The proposed model is verified through an illustrative example with real-life data. The obtained results represent an input for future research which should include a good benchmark base for tested reverse logistic chains and their continuous improvement. [Projekat Ministarstva nauke Republike Srbije, br. 035033: Sustainable development technology and equipment for the recycling of motor vehicles
The relaxation time approximation
International Nuclear Information System (INIS)
Gairola, R.P.; Indu, B.D.
1991-01-01
A plausible approximation has been made to estimate the relaxation time from a knowledge of the transition probability of phonons from one state (r vector, q vector) to other state (r' vector, q' vector), as a result of collision. The relaxation time, thus obtained, shows a strong dependence on temperature and weak dependence on the wave vector. In view of this dependence, relaxation time has been expressed in terms of a temperature Taylor's series in the first Brillouin zone. Consequently, a simple model for estimating the thermal conductivity is suggested. the calculations become much easier than the Callaway model. (author). 14 refs
DEFF Research Database (Denmark)
Stolpe, Mathias
2004-01-01
of structures subjected to either static or periodic loads, design of composite materials with prescribed homogenized properties using the inverse homogenization approach, optimization of fluids in Stokes flow, design of band gap structures, and multi-physics problems involving coupled steady-state heat...
DEFF Research Database (Denmark)
Stolpe, Mathias
2007-01-01
of structures subjected to static or periodic loads, design of composite materials with prescribed homogenized properties using the inverse homogenization approach, optimization of fluids in Stokes flow, design of band gap structures, and multi-physics problems involving coupled steady-state heat conduction...
Czech Academy of Sciences Publication Activity Database
Šremr, Jiří
2007-01-01
Roč. 132, č. 3 (2007), s. 263-295 ISSN 0862-7959 R&D Projects: GA ČR GP201/04/P183 Institutional research plan: CEZ:AV0Z10190503 Keywords : system of functional differential equations with monotone operators * initial value problem * unique solvability Subject RIV: BA - General Mathematics
Directory of Open Access Journals (Sweden)
Muhammad Aslam Noor
2004-01-01
Full Text Available We consider a new class of equilibrium problems, known as hemiequilibrium problems. Using the auxiliary principle technique, we suggest and analyze a class of iterative algorithms for solving hemiequilibrium problems, the convergence of which requires either pseudomonotonicity or partially relaxed strong monotonicity. As a special case, we obtain a new method for hemivariational inequalities. Since hemiequilibrium problems include hemivariational inequalities and equilibrium problems as special cases, the results proved in this paper still hold for these problems.
International Nuclear Information System (INIS)
Turner, W.C.; Barrett, D.M.; Sampayan, S.E.
1991-01-01
In this paper the authors attempt to motivate the development of modeling tools for linear induction accelerator components by giving examples of performance limitations related to energy sweep. The most pressing issues is the development of an accurate model of the switching behavior of large magnetic cores at high dB/dt in the accelerator and magnetic compression modulators. Ideally one would like to have a model with as few parameters as possible that allows the user to choose the core geometry and magnetic material and perhaps a few parameters characterizing the switch model. Beyond this, the critical modeling tasks are: simulation of a magnetic compression modulator, modeling the reset dynamics of a magnetic compression modulator, modeling the loading characteristics of a linear induction accelerator cell, and modeling the electron injector current including the dynamics of feedback modulation and beam loading in an accelerator cell. Of course in the development of these models care should be given to benchmarking them against data from experimental systems. Beyond that one should aim for tools that have predictive power so that they can be used as design tools and not merely to replicate existing data
Energy Technology Data Exchange (ETDEWEB)
NONE
1981-07-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 {zeta}/{zeta} u{sub {alpha}}, |{alpha} | - 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.
International Nuclear Information System (INIS)
Spies, G.O.; Lortz, D.; Kaiser, R.
2001-01-01
Taylor's theory of relaxed toroidal plasmas (states of lowest energy with fixed total magnetic helicity) is extended to include a vacuum between the plasma and the wall. In the extended variational problem, one prescribes, in addition to the helicity and the magnetic fluxes whose conservation follows from the perfect conductivity of the wall, the fluxes whose conservation follows from the assumption that the plasma-vacuum interface is also perfectly conducting (if the wall is a magnetic surface, then one has the toroidal and the poloidal flux in the vacuum). Vanishing of the first energy variation implies a pressureless free-boundary magnetohydrostatic equilibrium with a Beltrami magnetic field in the plasma, and in general with a surface current in the interface. Positivity of the second variation implies that the equilibrium is stable according to ideal magnetohydrodynamics, that it is a relaxed state according to Taylor's theory if the interface is replaced by a wall, and that the surface current is nonzero (at least if there are no closed magnetic field lines in the interface). The plane slab, with suitable boundary conditions to simulate a genuine torus, is investigated in detail. The relaxed state has the same double symmetry as the vessel if, and only if, the prescribed helicity is in an interval that depends on the prescribed fluxes. This interval is determined in the limit of a thin slab
International Nuclear Information System (INIS)
Bayati, Mohsen; Borgs, Christian; Chayes, Jennifer; Zecchina, Riccardo
2008-01-01
We consider the general problem of finding the minimum weight b-matching on arbitrary graphs. We prove that, whenever the linear programing relaxation of the problem has no fractional solutions, then the cavity or belief propagation equations converge to the correct solution both for synchronous and asynchronous updating. (letter)
Directory of Open Access Journals (Sweden)
Evans BAIDOO
2016-12-01
Full Text Available A study branch that mocks-up a population of network of swarms or agents with the ability to self-organise is Swarm intelligence. In spite of the huge amount of work that has been done in this area in both theoretically and empirically and the greater success that has been attained in several aspects, it is still ongoing and at its infant stage. An immune system, a cloud of bats, or a flock of birds are distinctive examples of a swarm system. . In this study, two types of meta-heuristics algorithms based on population and swarm intelligence - Multi Swarm Optimization (MSO and Bat algorithms (BA - are set up to find optimal solutions of continuous non-linear optimisation models. In order to analyze and compare perfect solutions at the expense of performance of both algorithms, a chain of computational experiments on six generally used test functions for assessing the accuracy and the performance of algorithms, in swarm intelligence fields are used. Computational experiments show that MSO algorithm seems much superior to BA.
Liu, Tianyang; Chan, Hiu Ning; Grimshaw, Roger; Chow, Kwok Wing
2017-11-01
The spatial structure of small disturbances in stratified flows without background shear, usually named the `Taylor-Goldstein equation', is studied by employing the Boussinesq approximation (variation in density ignored except in the buoyancy). Analytical solutions are derived for special wavenumbers when the Brunt-Väisälä frequency is quadratic in hyperbolic secant, by comparison with coupled systems of nonlinear Schrödinger equations intensively studied in the literature. Cases of coupled Schrödinger equations with four, five and six components are utilized as concrete examples. Dispersion curves for arbitrary wavenumbers are obtained numerically. The computations of the group velocity, second harmonic, induced mean flow, and the second derivative of the angular frequency can all be facilitated by these exact linear eigenfunctions of the Taylor-Goldstein equation in terms of hyperbolic function, leading to a cubic Schrödinger equation for the evolution of a wavepacket. The occurrence of internal rogue waves can be predicted if the dispersion and cubic nonlinearity terms of the Schrödinger equations are of the same sign. Partial financial support has been provided by the Research Grants Council contract HKU 17200815.
Directory of Open Access Journals (Sweden)
O. Tichý
2016-11-01
Full Text Available Estimation of pollutant releases into the atmosphere is an important problem in the environmental sciences. It is typically formalized as an inverse problem using a linear model that can explain observable quantities (e.g., concentrations or deposition values as a product of the source-receptor sensitivity (SRS matrix obtained from an atmospheric transport model multiplied by the unknown source-term vector. Since this problem is typically ill-posed, current state-of-the-art methods are based on regularization of the problem and solution of a formulated optimization problem. This procedure depends on manual settings of uncertainties that are often very poorly quantified, effectively making them tuning parameters. We formulate a probabilistic model, that has the same maximum likelihood solution as the conventional method using pre-specified uncertainties. Replacement of the maximum likelihood solution by full Bayesian estimation also allows estimation of all tuning parameters from the measurements. The estimation procedure is based on the variational Bayes approximation which is evaluated by an iterative algorithm. The resulting method is thus very similar to the conventional approach, but with the possibility to also estimate all tuning parameters from the observations. The proposed algorithm is tested and compared with the standard methods on data from the European Tracer Experiment (ETEX where advantages of the new method are demonstrated. A MATLAB implementation of the proposed algorithm is available for download.
Tichý, Ondřej; Šmídl, Václav; Hofman, Radek; Stohl, Andreas
2016-11-01
Estimation of pollutant releases into the atmosphere is an important problem in the environmental sciences. It is typically formalized as an inverse problem using a linear model that can explain observable quantities (e.g., concentrations or deposition values) as a product of the source-receptor sensitivity (SRS) matrix obtained from an atmospheric transport model multiplied by the unknown source-term vector. Since this problem is typically ill-posed, current state-of-the-art methods are based on regularization of the problem and solution of a formulated optimization problem. This procedure depends on manual settings of uncertainties that are often very poorly quantified, effectively making them tuning parameters. We formulate a probabilistic model, that has the same maximum likelihood solution as the conventional method using pre-specified uncertainties. Replacement of the maximum likelihood solution by full Bayesian estimation also allows estimation of all tuning parameters from the measurements. The estimation procedure is based on the variational Bayes approximation which is evaluated by an iterative algorithm. The resulting method is thus very similar to the conventional approach, but with the possibility to also estimate all tuning parameters from the observations. The proposed algorithm is tested and compared with the standard methods on data from the European Tracer Experiment (ETEX) where advantages of the new method are demonstrated. A MATLAB implementation of the proposed algorithm is available for download.
The hysteresis limit in relaxation oscillation problems
Czech Academy of Sciences Publication Activity Database
Krejčí, Pavel
2005-01-01
Roč. 22, - (2005), s. 103-123 ISSN 1742-6588. [International Workshop on Hysteresis & Multi-scale Asymptotic. Cork , 17.3.2004-21.3.2004] Institutional research plan: CEZ:AV0Z1019905 Keywords : Helly principle * differential equation Subject RIV: BA - General Mathematics http://iopscience.iop.org/1742-6596/22/1/007
[A study on Korean concepts of relaxation].
Park, J S
1992-01-01
statements, 59 experiences were extracted. And then 9 categories--at rest after physical activities, after problem solving, fancy, bathing in the bed, situation, rest, particular time, others--were organized. 3. The musics of the relaxation; From 229 statements, 108 musics were extracted, and the 9 categories--Western classical music, semi classical music, Korean song, Korean popular classical music, song, western popular song, hymn, characteristics of music, others--were organized. In conclusion, There are some differences between Korean concepts, experiences and musics of relaxation and western concepts, experiences and musics of relaxation.
Nonmaxwell relaxation in disordered media: Physical mechanisms and fractional relaxation equations
International Nuclear Information System (INIS)
Arkhincheev, V.E.
2004-12-01
The problem of charge relaxation in disordered systems has been solved. It is shown, that due to the inhomogeneity of the medium the charge relaxation has a non-Maxwell character. The two physical mechanisms of a such behavior have been founded. The first one is connected with the 'fractality' of conducting ways. The second mechanism of nonexponential non-Maxwell behavior is connected with the frequency dispersion of effective conductivity of heterogeneous medium, initially consisting of conducting phases without dispersion. The new generalized relaxation equations in the form of fractional temporal integro-differential equations are deduced. (author)
Relaxation training for anxiety: a ten-years systematic review with meta-analysis
Castelnuovo Gianluca; Pagnini Francesco; Manzoni Gian; Molinari Enrico
2008-01-01
Abstract Background Relaxation training is a common treatment for anxiety problems. Lacking is a recent quantitative meta-analysis that enhances understanding of the variability and clinical significance of anxiety reduction outcomes after relaxation treatment. Methods All studies (1997–2007), both RCT, observational and without control group, evaluating the efficacy of relaxation training (Jacobson's progressive relaxation, autogenic training, applied relaxation and meditation) for anxiety p...
Relaxation and Diffusion in Complex Systems
Ngai, K L
2011-01-01
Relaxation and Diffusion in Complex Systems comprehensively presents a variety of experimental evidences of universal relaxation and diffusion properties in complex materials and systems. The materials discussed include liquids, glasses, colloids, polymers, rubbers, plastic crystals and aqueous mixtures, as well as carbohydrates, biomolecules, bioprotectants and pharmaceuticals. Due to the abundance of experimental data, emphasis is placed on glass-formers and the glass transition problem, a still unsolved problem in condensed matter physics and chemistry. The evidence for universal properties of relaxation and diffusion dynamics suggests that a fundamental physical law is at work. The origin of the universal properties is traced to the many-body effects of the interaction, rigorous theory of which does not exist at the present time. However, using solutions of simplified models as guides, key quantities have been identified and predictions of the universal properties generated. These predictions from Ngai’...
International Nuclear Information System (INIS)
Vialettes, Henry; Rocchesani, Jean; Lemure, Pierre
1971-06-01
The use of a natural uranium target for neutron production with a linear electron accelerator set special shielding problems due to the fact that, to standard photonuclear reactions, are added photoneutron induced photofission reactions giving rise to fission products of which the untimely liberation could cause very serious contamination problems. On the occasion of a recent accident on the target used with the Saclay 60 MeV linear accelerator, activity measurements were carried out on a certain number of samples taken. This revealed the presence of some twenty radionuclides of hall-lives between 30 minutes and 30 years and of activities such that the combustion of 1 g of target would release about 30 mCi of fission products of medium and short half-life (over 1 hour), This figure shows the magnitude of a contamination accident on a unit of this type, which is why the present report describes the systems to be employed in order on the one hand to detect the appearance of contamination as quickly as possible, and on the other hand to channel and retain this contamination so as to avoid a personnel contamination accident and/or the spread of contamination towards the outside [fr
Ultrasonic relaxations in borate glasses
International Nuclear Information System (INIS)
D'Angelo, G.; Tripodo, G.; Carini, G.; Cosio, E.; Bartolotta, A.; Di Marco, G.
2004-01-01
The attenuation and velocity of ultrasonic waves of frequencies in the range from 10 to 70 MHz have been measured in M 2 O-B 2 O 3 borate glasses (M: Li or Ag) as a function of temperature between 15 and 350 K. The velocity of sound waves decreases with increasing temperature in all the glasses, the decrease as the temperature is increased is larger in glasses containing silver than in those with lithium. A broad relaxation peak characterises the attenuation behaviour of the lithium and silver borate glasses at temperatures below 100 K and is paralleled by a corresponding dispersive behaviour of the sound velocity. Above 100 K, the ultrasonic velocity shows a nearly linear behaviour regulated by the vibrational anharmonicity, which decreases with increasing content of modifier oxide and is smaller in lithium than in silver borates. These results suggest that the relaxation of structural defects and the anharmonicity of borate glasses are strongly affected by two parameters: the number of bridging bonds per network forming ion and the polarising power of network modifier ions which occupy sites in the existing interstices
Edwards, Harold M
1995-01-01
In his new undergraduate textbook, Harold M Edwards proposes a radically new and thoroughly algorithmic approach to linear algebra Originally inspired by the constructive philosophy of mathematics championed in the 19th century by Leopold Kronecker, the approach is well suited to students in the computer-dominated late 20th century Each proof is an algorithm described in English that can be translated into the computer language the class is using and put to work solving problems and generating new examples, making the study of linear algebra a truly interactive experience Designed for a one-semester course, this text adopts an algorithmic approach to linear algebra giving the student many examples to work through and copious exercises to test their skills and extend their knowledge of the subject Students at all levels will find much interactive instruction in this text while teachers will find stimulating examples and methods of approach to the subject
Relaxing a large cosmological constant
International Nuclear Information System (INIS)
Bauer, Florian; Sola, Joan; Stefancic, Hrvoje
2009-01-01
The cosmological constant (CC) problem is the biggest enigma of theoretical physics ever. In recent times, it has been rephrased as the dark energy (DE) problem in order to encompass a wider spectrum of possibilities. It is, in any case, a polyhedric puzzle with many faces, including the cosmic coincidence problem, i.e. why the density of matter ρ m is presently so close to the CC density ρ Λ . However, the oldest, toughest and most intriguing face of this polyhedron is the big CC problem, namely why the measured value of ρ Λ at present is so small as compared to any typical density scale existing in high energy physics, especially taking into account the many phase transitions that our Universe has undergone since the early times, including inflation. In this Letter, we propose to extend the field equations of General Relativity by including a class of invariant terms that automatically relax the value of the CC irrespective of the initial size of the vacuum energy in the early epochs. We show that, at late times, the Universe enters an eternal de Sitter stage mimicking a tiny positive cosmological constant. Thus, these models could be able to solve the big CC problem without fine-tuning and have also a bearing on the cosmic coincidence problem. Remarkably, they mimic the ΛCDM model to a large extent, but they still leave some characteristic imprints that should be testable in the next generation of experiments.
Generalized Linear Covariance Analysis
Carpenter, James R.; Markley, F. Landis
2014-01-01
This talk presents a comprehensive approach to filter modeling for generalized covariance analysis of both batch least-squares and sequential estimators. We review and extend in two directions the results of prior work that allowed for partitioning of the state space into solve-for'' and consider'' parameters, accounted for differences between the formal values and the true values of the measurement noise, process noise, and textita priori solve-for and consider covariances, and explicitly partitioned the errors into subspaces containing only the influence of the measurement noise, process noise, and solve-for and consider covariances. In this work, we explicitly add sensitivity analysis to this prior work, and relax an implicit assumption that the batch estimator's epoch time occurs prior to the definitive span. We also apply the method to an integrated orbit and attitude problem, in which gyro and accelerometer errors, though not estimated, influence the orbit determination performance. We illustrate our results using two graphical presentations, which we call the variance sandpile'' and the sensitivity mosaic,'' and we compare the linear covariance results to confidence intervals associated with ensemble statistics from a Monte Carlo analysis.
Waveform relaxation methods for implicit differential equations
P.J. van der Houwen; W.A. van der Veen
1996-01-01
textabstractWe apply a Runge-Kutta-based waveform relaxation method to initial-value problems for implicit differential equations. In the implementation of such methods, a sequence of nonlinear systems has to be solved iteratively in each step of the integration process. The size of these systems
Relaxation dynamics of multilayer triangular Husimi cacti
Galiceanu, Mircea; Jurjiu, Aurel
2016-09-01
We focus on the relaxation dynamics of multilayer polymer structures having, as underlying topology, the Husimi cactus. The relaxation dynamics of the multilayer structures is investigated in the framework of generalized Gaussian structures model using both Rouse and Zimm approaches. In the Rouse type-approach, we determine analytically the complete eigenvalues spectrum and based on it we calculate the mechanical relaxation moduli (storage and loss modulus) and the average monomer displacement. First, we monitor these physical quantities for structures with a fixed generation number and we increase the number of layers, such that the linear topology will smoothly come into play. Second, we keep constant the size of the structures, varying simultaneously two parameters: the generation number of the main layer, G, and the number of layers, c. This fact allows us to study in detail the crossover from a pure Husimi cactus behavior to a predominately linear chain behavior. The most interesting situation is found when the two limiting topologies cancel each other. For this case, we encounter in the intermediate frequency/time domain regions of constant slope for different values of the parameter set (G, c) and we show that the number of layers follows an exponential-law of G. In the Zimm-type approach, which includes the hydrodynamic interactions, the quantities that describe the mechanical relaxation dynamics do not show scaling behavior as in the Rouse model, except the limiting case, namely, a very high number of layers and low generation number.
Vogel-Fulcher dependence of relaxation rates in a nematic monomer and elastomer
Shenoy, D.; Filippov, S.; Aliev, F.; Keller, P.; Thomsen, D.; Ratna, B.
2000-12-01
Dielectric relaxation spectroscopy is used to study the relaxation processes in a nematic monomer and the corresponding cross-linked polymer nematic liquid crystal (elastomer). In the frequency window 10 mHz to 2 GHz the monomer liquid crystal shows a single relaxation whereas the polymer exhibits three relaxation processes, two of which are quantitatively analyzed. The temperature dependence of relaxation times in both the monomer and polymer follows a Vogel-Fulcher behavior. The relaxation processes are identified with specific molecular motions and activation energies are calculated in a linear approximation for comparison with literature data.
Evolutionary problems in non-reflexive spaces
Czech Academy of Sciences Publication Activity Database
Kružík, Martin; Zimmer, J.
2010-01-01
Roč. 16, č. 1 (2010), s. 1-22 ISSN 1262-3377 R&D Projects: GA AV ČR IAA1075402 Institutional research plan: CEZ:AV0Z10750506 Keywords : concentrations * energetic solution * energies with linear growth * oscillations * relaxation Subject RIV: BA - General Mathematics Impact factor: 1.084, year: 2009 http://library.utia.cas.cz/separaty/2008/MTR/kruzik-evolutionary problems in non-reflexive spaces.pdf
On integral representation, relaxation and homogenization for unbounded functionals
International Nuclear Information System (INIS)
Carbone, L.; De Arcangelis, R.
1997-01-01
A theory of integral representation, relaxation and homogenization for some types of variational functionals taking extended real values and possibly being not finite also on large classes of regular functions is presented. Some applications to gradient constrained relaxation and homogenization problems are given
Noninteracting control of nonlinear systems based on relaxed control
Jayawardhana, B.
2010-01-01
In this paper, we propose methodology to solve noninteracting control problem for general nonlinear systems based on the relaxed control technique proposed by Artstein. For a class of nonlinear systems which cannot be stabilized by smooth feedback, a state-feedback relaxed control can be designed to
Classifying Linear Canonical Relations
Lorand, Jonathan
2015-01-01
In this Master's thesis, we consider the problem of classifying, up to conjugation by linear symplectomorphisms, linear canonical relations (lagrangian correspondences) from a finite-dimensional symplectic vector space to itself. We give an elementary introduction to the theory of linear canonical relations and present partial results toward the classification problem. This exposition should be accessible to undergraduate students with a basic familiarity with linear algebra.
Anisotropic temperature relaxation of plasmas in an external magnetic field
International Nuclear Information System (INIS)
Hassan, M.H.A.
1977-01-01
The magnetized kinetic equation derived in an earlier paper (Hassan and Watson, 1977) is used to study the problem of relaxation of anisotropic electron and ion temperatures in a magnetized plasma. In the case of anisotropic electron temperature relaxation, it is shown that for small anisotropies the exchange of energy within the electrons between the components parallel and perpendicular to the magnetic field direction determine the relaxation rate. For anisotropic ion temperature relaxation it is shown that the essential mechanism for relaxation is provided by energy transfer between ions and electrons, and that the expression for the relaxation rate perpendicular to the magnetic field contains a significant term proportional to ln eta 0 ln (msub(e)/msub(i)) (where eta 0 = Ωsub(e)/ksub(D)Vsub(e perpendicular to)), in addition to the term proportional to the Coulomb logarithm. (author)
Convex Relaxation of OPF in Multiphase Radial Networks with Wye and Delta Connections
Energy Technology Data Exchange (ETDEWEB)
Zhao, Changhong [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Dall-Anese, Emiliano [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Low, Steven [California Institute of Technology
2017-08-01
This panel presentation focuses on multiphase radial distribution networks with wye and delta connections, and proposes a semidefinite relaxation of the AC optimal power flow (OPF) problem. Two multiphase power flow models are developed to facilitate the integration of delta-connected loads or generation resources in the OPF problem. The first model is referred to as the extended branch flow model (EBFM). The second model leverages a linear relationship between phase-to-ground power injections and delta connections that holds under a balanced voltage approximation (BVA). Based on these models, pertinent OPF problems are formulated and relaxed to semidefinite programs (SDPs). Numerical studies on IEEE test feeders show that the proposed SDP relaxations can be solved efficiently by a generic optimization solver. Numerical evidence also indicates that solving the resultant SDP under BVA is faster than under EBFM. Moreover, both SDP solutions are numerically exact with respect to voltages and branch flows. It is further shown that the SDP solution under BVA has a small optimality gap, and the BVA model is accurate in the sense that it reproduces actual system voltages.
... For Consumers Consumer Information by Audience For Women Hair Dye and Hair Relaxers Share Tweet Linkedin Pin it More sharing ... products. If you have a bad reaction to hair dyes and relaxers, you should: Stop using the ...
Kheirollahi, Hooshang; Matin, Behzad Karami; Mahboubi, Mohammad; Alavijeh, Mehdi Mirzaei
2015-01-01
This article developed an approached model of congestion, based on relaxed combination of inputs, in stochastic data envelopment analysis (SDEA) with chance constrained programming approaches. Classic data envelopment analysis models with deterministic data have been used by many authors to identify congestion and estimate its levels; however, data envelopment analysis with stochastic data were rarely used to identify congestion. This article used chance constrained programming approaches to replace stochastic models with "deterministic equivalents". This substitution leads us to non-linear problems that should be solved. Finally, the proposed method based on relaxed combination of inputs was used to identify congestion input in six Iranian hospital with one input and two outputs in the period of 2009 to 2012.
Post-seismic relaxation theory on laterally heterogeneous viscoelastic model
Pollitz, F.F.
2003-01-01
Investigation was carried out into the problem of relaxation of a laterally heterogeneous viscoelastic Earth following an impulsive moment release event. The formal solution utilizes a semi-analytic solution for post-seismic deformation on a laterally homogeneous Earth constructed from viscoelastic normal modes, followed by application of mode coupling theory to derive the response on the aspherical Earth. The solution is constructed in the Laplace transform domain using the correspondence principle and is valid for any linear constitutive relationship between stress and strain. The specific implementation described in this paper is a semi-analytic discretization method which assumes isotropic elastic structure and a Maxwell constitutive relation. It accounts for viscoelastic-gravitational coupling under lateral variations in elastic parameters and viscosity. For a given viscoelastic structure and minimum wavelength scale, the computational effort involved with the numerical algorithm is proportional to the volume of the laterally heterogeneous region. Examples are presented of the calculation of post-seismic relaxation with a shallow, laterally heterogeneous volume following synthetic impulsive seismic events, and they illustrate the potentially large effect of regional 3-D heterogeneities on regional deformation patterns.
On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy
Kurpisz, Adam; Leppänen, Samuli; Mastrolilli, Monaldo
2015-01-01
The Lasserre/Sum-of-Squares (SoS) hierarchy is a systematic procedure for constructing a sequence of increasingly tight semidefinite relaxations. It is known that the hierarchy converges to the 0/1 polytope in n levels and captures the convex relaxations used in the best available approximation algorithms for a wide variety of optimization problems. In this paper we characterize the set of 0/1 integer linear problems and unconstrained 0/1 polynomial optimization problems that can still have ...
Magnetic relaxation in anisotropic magnets
DEFF Research Database (Denmark)
Lindgård, Per-Anker
1971-01-01
The line shape and the kinematic and thermodynamic slowing down of the critical and paramagnetic relaxation in axially anisotropic materials are discussed. Kinematic slowing down occurs only in the longitudinal relaxation function. The thermodynamic slowing down occurs in either the transverse...... or longitudinal relaxation function depending on the sign of the axial anisotropy....
Momentum constraint relaxation
International Nuclear Information System (INIS)
Marronetti, Pedro
2006-01-01
Full relativistic simulations in three dimensions invariably develop runaway modes that grow exponentially and are accompanied by violations of the Hamiltonian and momentum constraints. Recently, we introduced a numerical method (Hamiltonian relaxation) that greatly reduces the Hamiltonian constraint violation and helps improve the quality of the numerical model. We present here a method that controls the violation of the momentum constraint. The method is based on the addition of a longitudinal component to the traceless extrinsic curvature A ij -tilde, generated by a vector potential w i , as outlined by York. The components of w i are relaxed to solve approximately the momentum constraint equations, slowly pushing the evolution towards the space of solutions of the constraint equations. We test this method with simulations of binary neutron stars in circular orbits and show that it effectively controls the growth of the aforementioned violations. We also show that a full numerical enforcement of the constraints, as opposed to the gentle correction of the momentum relaxation scheme, results in the development of instabilities that stop the runs shortly
On the Volterra integral equation relating creep and relaxation
International Nuclear Information System (INIS)
Anderssen, R S; De Hoog, F R; Davies, A R
2008-01-01
The evolving stress–strain response of a material to an applied deformation is causal. If the current response depends on the earlier history of the stress–strain dynamics of the material (i.e. the material has memory), then Volterra integral equations become the natural framework within which to model the response. For viscoelastic materials, when the response is linear, the dual linear Boltzmann causal integral equations are the appropriate model. The choice of one rather than the other depends on whether the applied deformation is a stress or a strain, and the associated response is, respectively, a creep or a relaxation. The duality between creep and relaxation is known explicitly and is referred to as the 'interconversion equation'. Rheologically, its importance relates to the fact that it allows the creep to be determined from knowledge of the relaxation and vice versa. Computationally, it has been known for some time that the recovery of the relaxation from the creep is more problematic than the creep from the relaxation. Recent research, using discrete models for the creep and relaxation, has confirmed that this is an essential feature of interconversion. In this paper, the corresponding result is generalized for continuous models of the creep and relaxation
Contractive relaxation systems and interacting particles for scalar conservation laws
International Nuclear Information System (INIS)
Katsoulakis, M.A.; Tzavaras, A.E.
1996-01-01
We consider a class of semi linear hyperbolic systems with relaxation that are contractive in the L 1 -norm and admit invariant regions. We show that, as the relaxation parameter ξ goes to zero, their solutions converge to a weak solution of the scalar multidimensional conversation law that satisfies the Kruzhkov conditions. In the case of one space dimension, we propose certain interacting particle systems, whose mesoscopic limit is the systems with relaxation and their macroscopic dynamics is described by entropy solutions of a scalar conservation law. (author)
Altman, Michael D.; Bardhan, Jaydeep P.; White, Jacob K.; Tidor, Bruce
2009-01-01
We present a boundary-element method (BEM) implementation for accurately solving problems in biomolecular electrostatics using the linearized Poisson–Boltzmann equation. Motivating this implementation is the desire to create a solver capable of precisely describing the geometries and topologies prevalent in continuum models of biological molecules. This implementation is enabled by the synthesis of four technologies developed or implemented specifically for this work. First, molecular and accessible surfaces used to describe dielectric and ion-exclusion boundaries were discretized with curved boundary elements that faithfully reproduce molecular geometries. Second, we avoided explicitly forming the dense BEM matrices and instead solved the linear systems with a preconditioned iterative method (GMRES), using a matrix compression algorithm (FFTSVD) to accelerate matrix-vector multiplication. Third, robust numerical integration methods were employed to accurately evaluate singular and near-singular integrals over the curved boundary elements. Finally, we present a general boundary-integral approach capable of modeling an arbitrary number of embedded homogeneous dielectric regions with differing dielectric constants, possible salt treatment, and point charges. A comparison of the presented BEM implementation and standard finite-difference techniques demonstrates that for certain classes of electrostatic calculations, such as determining absolute electrostatic solvation and rigid-binding free energies, the improved convergence properties of the BEM approach can have a significant impact on computed energetics. We also demonstrate that the improved accuracy offered by the curved-element BEM is important when more sophisticated techniques, such as non-rigid-binding models, are used to compute the relative electrostatic effects of molecular modifications. In addition, we show that electrostatic calculations requiring multiple solves using the same molecular geometry
Communication: Relaxation-limited electronic currents in extended reservoir simulations
Gruss, Daniel; Smolyanitsky, Alex; Zwolak, Michael
2017-10-01
Open-system approaches are gaining traction in the simulation of charge transport in nanoscale and molecular electronic devices. In particular, "extended reservoir" simulations, where explicit reservoir degrees of freedom are present, allow for the computation of both real-time and steady-state properties but require relaxation of the extended reservoirs. The strength of this relaxation, γ, influences the conductance, giving rise to a "turnover" behavior analogous to Kramers turnover in chemical reaction rates. We derive explicit, general expressions for the weak and strong relaxation limits. For weak relaxation, the conductance increases linearly with γ and every electronic state of the total explicit system contributes to the electronic current according to its "reduced" weight in the two extended reservoir regions. Essentially, this represents two conductors in series—one at each interface with the implicit reservoirs that provide the relaxation. For strong relaxation, a "dual" expression-one with the same functional form-results, except now proportional to 1/γ and dependent on the system of interest's electronic states, reflecting that the strong relaxation is localizing electrons in the extended reservoirs. Higher order behavior (e.g., γ2 or 1/γ2) can occur when there is a gap in the frequency spectrum. Moreover, inhomogeneity in the frequency spacing can give rise to a pseudo-plateau regime. These findings yield a physically motivated approach to diagnosing numerical simulations and understanding the influence of relaxation, and we examine their occurrence in both simple models and a realistic, fluctuating graphene nanoribbon.
ON PROBLEM OF REGIONAL WAREHOUSE AND TRANSPORT INFRASTRUCTURE OPTIMIZATION
Directory of Open Access Journals (Sweden)
I. Yu. Miretskiy
2017-01-01
Full Text Available The article suggests an approach of solving the problem of warehouse and transport infrastructure optimization in a region. The task is to determine the optimal capacity and location of the support network of warehouses in the region, as well as power, composition and location of motor fleets. Optimization is carried out using mathematical models of a regional warehouse network and a network of motor fleets. These models are presented as mathematical programming problems with separable functions. The process of finding the optimal solution of problems is complicated due to high dimensionality, non-linearity of functions, and the fact that a part of variables are constrained to integer, and some variables can take values only from a discrete set. Given the mentioned above complications search for an exact solution was rejected. The article suggests an approximate approach to solving problems. This approach employs effective computational schemes for solving multidimensional optimization problems. We use the continuous relaxation of the original problem to obtain its approximate solution. An approximately optimal solution of continuous relaxation is taken as an approximate solution of the original problem. The suggested solution method implies linearization of the obtained continuous relaxation and use of the separable programming scheme and the scheme of branches and bounds. We describe the use of the simplex method for solving the linearized continuous relaxation of the original problem and the specific moments of the branches and bounds method implementation. The paper shows the finiteness of the algorithm and recommends how to accelerate process of finding a solution.
Energy Technology Data Exchange (ETDEWEB)
Wiedemann, H.
1981-11-01
Since no linear colliders have been built yet it is difficult to know at what energy the linear cost scaling of linear colliders drops below the quadratic scaling of storage rings. There is, however, no doubt that a linear collider facility for a center of mass energy above say 500 GeV is significantly cheaper than an equivalent storage ring. In order to make the linear collider principle feasible at very high energies a number of problems have to be solved. There are two kinds of problems: one which is related to the feasibility of the principle and the other kind of problems is associated with minimizing the cost of constructing and operating such a facility. This lecture series describes the problems and possible solutions. Since the real test of a principle requires the construction of a prototype I will in the last chapter describe the SLC project at the Stanford Linear Accelerator Center.
International Nuclear Information System (INIS)
Wiedemann, H.
1981-11-01
Since no linear colliders have been built yet it is difficult to know at what energy the linear cost scaling of linear colliders drops below the quadratic scaling of storage rings. There is, however, no doubt that a linear collider facility for a center of mass energy above say 500 GeV is significantly cheaper than an equivalent storage ring. In order to make the linear collider principle feasible at very high energies a number of problems have to be solved. There are two kinds of problems: one which is related to the feasibility of the principle and the other kind of problems is associated with minimizing the cost of constructing and operating such a facility. This lecture series describes the problems and possible solutions. Since the real test of a principle requires the construction of a prototype I will in the last chapter describe the SLC project at the Stanford Linear Accelerator Center
Lattice Boltzmann methods for global linear instability analysis
Pérez, José Miguel; Aguilar, Alfonso; Theofilis, Vassilis
2017-12-01
Modal global linear instability analysis is performed using, for the first time ever, the lattice Boltzmann method (LBM) to analyze incompressible flows with two and three inhomogeneous spatial directions. Four linearization models have been implemented in order to recover the linearized Navier-Stokes equations in the incompressible limit. Two of those models employ the single relaxation time and have been proposed previously in the literature as linearization of the collision operator of the lattice Boltzmann equation. Two additional models are derived herein for the first time by linearizing the local equilibrium probability distribution function. Instability analysis results are obtained in three benchmark problems, two in closed geometries and one in open flow, namely the square and cubic lid-driven cavity flow and flow in the wake of the circular cylinder. Comparisons with results delivered by classic spectral element methods verify the accuracy of the proposed new methodologies and point potential limitations particular to the LBM approach. The known issue of appearance of numerical instabilities when the SRT model is used in direct numerical simulations employing the LBM is shown to be reflected in a spurious global eigenmode when the SRT model is used in the instability analysis. Although this mode is absent in the multiple relaxation times model, other spurious instabilities can also arise and are documented herein. Areas of potential improvements in order to make the proposed methodology competitive with established approaches for global instability analysis are discussed.
Joint shape segmentation with linear programming
Huang, Qixing; Koltun, Vladlen; Guibas, Leonidas
2011-01-01
program is solved via a linear programming relaxation, using a block coordinate descent procedure that makes the optimization feasible for large databases. We evaluate the presented approach on the Princeton segmentation benchmark and show that joint shape
Variational formulation of relaxed and multi-region relaxed magnetohydrodynamics
Dewar, R. L.; Yoshida, Z.; Bhattacharjee, A.; Hudson, S. R.
2015-12-01
> Ideal magnetohydrodynamics (IMHD) is strongly constrained by an infinite number of microscopic constraints expressing mass, entropy and magnetic flux conservation in each infinitesimal fluid element, the latter preventing magnetic reconnection. By contrast, in the Taylor relaxation model for formation of macroscopically self-organized plasma equilibrium states, all these constraints are relaxed save for the global magnetic fluxes and helicity. A Lagrangian variational principle is presented that leads to a new, fully dynamical, relaxed magnetohydrodynamics (RxMHD), such that all static solutions are Taylor states but also allows state with flow. By postulating that some long-lived macroscopic current sheets can act as barriers to relaxation, separating the plasma into multiple relaxation regions, a further generalization, multi-region relaxed magnetohydrodynamics (MRxMHD) is developed.
Georgatzis, Konstantinos; Lal, Partha; Hawthorne, Christopher; Shaw, Martin; Piper, Ian; Tarbert, Claire; Donald, Rob; Williams, Christopher K I
2016-01-01
High-resolution, artefact-free and accurately annotated physiological data are desirable in patients with brain injury both to inform clinical decision-making and for intelligent analysis of the data in applications such as predictive modelling. We have quantified the quality of annotation surrounding artefactual events and propose a factorial switching linear dynamical systems (FSLDS) approach to automatically detect artefact in physiological data collected in the neurological intensive care unit (NICU). Retrospective analysis of the BrainIT data set to discover potential hypotensive events corrupted by artefact and identify the annotation of associated clinical interventions. Training of an FSLDS model on clinician-annotated artefactual events in five patients with severe traumatic brain injury. In a subset of 187 patients in the BrainIT database, 26.5 % of potential hypotensive events were abandoned because of artefactual data. Only 30 % of these episodes could be attributed to an annotated clinical intervention. As assessed by the area under the receiver operating characteristic curve metric, FSLDS model performance in automatically identifying the events of blood sampling, arterial line damping and patient handling was 0.978, 0.987 and 0.765, respectively. The influence of artefact on physiological data collected in the NICU is a significant problem. This pilot study using an FSLDS approach shows real promise and is under further development.
Stretched exponential relaxation and ac universality in disordered dielectrics
DEFF Research Database (Denmark)
Milovanov, Alexander V.; Rypdal, Kristoffer; Juul Rasmussen, Jens
2007-01-01
This paper is concerned with the connection between the properties of dielectric relaxation and alternating-current (ac) conduction in disordered dielectrics. The discussion is divided between the classical linear-response theory and a self-consistent dynamical modeling. The key issues are stretc......This paper is concerned with the connection between the properties of dielectric relaxation and alternating-current (ac) conduction in disordered dielectrics. The discussion is divided between the classical linear-response theory and a self-consistent dynamical modeling. The key issues...
Dynamical relaxation in 2HDM models
Lalak, Zygmunt; Markiewicz, Adam
2018-03-01
Dynamical relaxation provides an interesting solution to the hierarchy problem in face of the missing signatures of any new physics in recent experiments. Through a dynamical process taking place in the inflationary phase of the Universe it manages to achieve a small electroweak scale without introducing new states observable in current experiments. Appropriate approximation makes it possible to derive an explicit formula for the final vevs in the double-scanning scenario extended to a model with two Higgs doublets (2HDM). Analysis of the relaxation in the 2HDM confirms that in a general case it is impossible to keep vevs of both scalars small, unless fine-tuning is present or additional symmetries are cast upon the Lagrangian. Within the slightly constrained variant of the 2HDM, where odd powers of the fields’ expectation values are not present (which can be easily enforced by requiring that the doublets have different gauge transformations or by imposing a global symmetry) it is shown that the difference between the vevs of two scalars tends to be proportional to the cutoff. The analysis of the relaxation in 2HDM indicates that in a general case the relaxation would be stopped by the first doublet that gains a vev, with the other one remaining vevless with a mass of the order of the cutoff. This happens to conform with the inert doublet model.
Discriminative Elastic-Net Regularized Linear Regression.
Zhang, Zheng; Lai, Zhihui; Xu, Yong; Shao, Ling; Wu, Jian; Xie, Guo-Sen
2017-03-01
In this paper, we aim at learning compact and discriminative linear regression models. Linear regression has been widely used in different problems. However, most of the existing linear regression methods exploit the conventional zero-one matrix as the regression targets, which greatly narrows the flexibility of the regression model. Another major limitation of these methods is that the learned projection matrix fails to precisely project the image features to the target space due to their weak discriminative capability. To this end, we present an elastic-net regularized linear regression (ENLR) framework, and develop two robust linear regression models which possess the following special characteristics. First, our methods exploit two particular strategies to enlarge the margins of different classes by relaxing the strict binary targets into a more feasible variable matrix. Second, a robust elastic-net regularization of singular values is introduced to enhance the compactness and effectiveness of the learned projection matrix. Third, the resulting optimization problem of ENLR has a closed-form solution in each iteration, which can be solved efficiently. Finally, rather than directly exploiting the projection matrix for recognition, our methods employ the transformed features as the new discriminate representations to make final image classification. Compared with the traditional linear regression model and some of its variants, our method is much more accurate in image classification. Extensive experiments conducted on publicly available data sets well demonstrate that the proposed framework can outperform the state-of-the-art methods. The MATLAB codes of our methods can be available at http://www.yongxu.org/lunwen.html.
Relaxation in x-space magnetic particle imaging.
Croft, Laura R; Goodwill, Patrick W; Conolly, Steven M
2012-12-01
Magnetic particle imaging (MPI) is a new imaging modality that noninvasively images the spatial distribution of superparamagnetic iron oxide nanoparticles (SPIOs). MPI has demonstrated high contrast and zero attenuation with depth, and MPI promises superior safety compared to current angiography methods, X-ray, computed tomography, and magnetic resonance imaging angiography. Nanoparticle relaxation can delay the SPIO magnetization, and in this work we investigate the open problem of the role relaxation plays in MPI scanning and its effect on the image. We begin by amending the x-space theory of MPI to include nanoparticle relaxation effects. We then validate the amended theory with experiments from a Berkeley x-space relaxometer and a Berkeley x-space projection MPI scanner. Our theory and experimental data indicate that relaxation reduces SNR and asymmetrically blurs the image in the scanning direction. While relaxation effects can have deleterious effects on the MPI scan, we show theoretically and experimentally that x-space reconstruction remains robust in the presence of relaxation. Furthermore, the role of relaxation in x-space theory provides guidance as we develop methods to minimize relaxation-induced blurring. This will be an important future area of research for the MPI community.
Interrelation of creep and relaxation: a modeling approach for ligaments.
Lakes, R S; Vanderby, R
1999-12-01
Experimental data (Thornton et al., 1997) show that relaxation proceeds more rapidly (a greater slope on a log-log scale) than creep in ligament, a fact not explained by linear viscoelasticity. An interrelation between creep and relaxation is therefore developed for ligaments based on a single-integral nonlinear superposition model. This interrelation differs from the convolution relation obtained by Laplace transforms for linear materials. We demonstrate via continuum concepts of nonlinear viscoelasticity that such a difference in rate between creep and relaxation phenomenologically occurs when the nonlinearity is of a strain-stiffening type, i.e., the stress-strain curve is concave up as observed in ligament. We also show that it is inconsistent to assume a Fung-type constitutive law (Fung, 1972) for both creep and relaxation. Using the published data of Thornton et al. (1997), the nonlinear interrelation developed herein predicts creep behavior from relaxation data well (R > or = 0.998). Although data are limited and the causal mechanisms associated with viscoelastic tissue behavior are complex, continuum concepts demonstrated here appear capable of interrelating creep and relaxation with fidelity.
Assigning uncertainties in the inversion of NMR relaxation data.
Parker, Robert L; Song, Yi-Qaio
2005-06-01
Recovering the relaxation-time density function (or distribution) from NMR decay records requires inverting a Laplace transform based on noisy data, an ill-posed inverse problem. An important objective in the face of the consequent ambiguity in the solutions is to establish what reliable information is contained in the measurements. To this end we describe how upper and lower bounds on linear functionals of the density function, and ratios of linear functionals, can be calculated using optimization theory. Those bounded quantities cover most of those commonly used in the geophysical NMR, such as porosity, T(2) log-mean, and bound fluid volume fraction, and include averages over any finite interval of the density function itself. In the theory presented statistical considerations enter to account for the presence of significant noise in the signal, but not in a prior characterization of density models. Our characterization of the uncertainties is conservative and informative; it will have wide application in geophysical NMR and elsewhere.
Relatively Inexact Proximal Point Algorithm and Linear Convergence Analysis
Directory of Open Access Journals (Sweden)
Ram U. Verma
2009-01-01
Full Text Available Based on a notion of relatively maximal (m-relaxed monotonicity, the approximation solvability of a general class of inclusion problems is discussed, while generalizing Rockafellar's theorem (1976 on linear convergence using the proximal point algorithm in a real Hilbert space setting. Convergence analysis, based on this new model, is simpler and compact than that of the celebrated technique of Rockafellar in which the Lipschitz continuity at 0 of the inverse of the set-valued mapping is applied. Furthermore, it can be used to generalize the Yosida approximation, which, in turn, can be applied to first-order evolution equations as well as evolution inclusions.
Electron spin-lattice relaxation in fractals
International Nuclear Information System (INIS)
Shrivastava, K.N.
1986-08-01
We have developed the theory of the spin-fracton interaction for paramagnetic ions in fractal structures. The interaction is exponentially damped by the self-similarity length of the fractal and by the range dimensionality d Φ . The relaxation time of the spin due to the absorption and emission of the fracton has been calculated for a general dimensionality called the Raman dimensionality d R , which for the fractons differs from the Hausdorff (fractal) dimensionality, D, as well as from the Euclidean dimensionality, d. The exponent of the energy level separation in the relaxation rate varies with d R d Φ /D. We have calculated the spin relaxation rate due to a new type of Raman process in which one fracton is absorbed to affect a spin transition from one electronic level to another and later another fracton is emitted along with a spin transition such that the difference in the energies of the two fractons is equal to the electronic energy level separation. The temperature and the dimensionality dependence of such a process has been found in several approximations. In one of the approximations where the van Vleck relaxation rate for a spin in a crystal is known to vary with temperature as T 9 , our calculated variation for fractals turns out to be T 6.6 , whereas the experimental value for Fe 3+ in frozen solutions of myoglobin azide is T 6.3 . Since we used d R =4/3 and the fracton range dimensionality d Φ =D/1.8, we expect to measure the dimensionalities of the problem by measuring the temperature dependence of the relaxation times. We have also calculated the shift of the paramagnetic resonance transition for a spin in a fractal for general dimensionalities. (author)
Simultaneous Buffer-sizing and Wire-sizing for Clock Trees Based on Lagrangian Relaxation
Directory of Open Access Journals (Sweden)
Yu-Min Lee
2002-01-01
Full Text Available Delay, power, skew, area and sensitivity are the most important concerns in current clock-tree design. We present in this paper an algorithm for simultaneously optimizing the above objectives by sizing wires and buffers in clock trees. Our algorithm, based on Lagrangian relaxation method, can optimally minimize delay, power and area simultaneously with very low skew and sensitivity. With linear storage overall and linear runtime per iteration, our algorithm is extremely economical, fast and accurate; for example, our algorithm can solve a 6201-wire-segment clock-tree problem using about 1-minute runtime and 1.3-MB memory and still achieve pico-second precision on an IBM RS/6000 workstation.
Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory
Richtarik, Peter; Taká č, Martin
2017-01-01
We develop a family of reformulations of an arbitrary consistent linear system into a stochastic problem. The reformulations are governed by two user-defined parameters: a positive definite matrix defining a norm, and an arbitrary discrete or continuous distribution over random matrices. Our reformulation has several equivalent interpretations, allowing for researchers from various communities to leverage their domain specific insights. In particular, our reformulation can be equivalently seen as a stochastic optimization problem, stochastic linear system, stochastic fixed point problem and a probabilistic intersection problem. We prove sufficient, and necessary and sufficient conditions for the reformulation to be exact. Further, we propose and analyze three stochastic algorithms for solving the reformulated problem---basic, parallel and accelerated methods---with global linear convergence rates. The rates can be interpreted as condition numbers of a matrix which depends on the system matrix and on the reformulation parameters. This gives rise to a new phenomenon which we call stochastic preconditioning, and which refers to the problem of finding parameters (matrix and distribution) leading to a sufficiently small condition number. Our basic method can be equivalently interpreted as stochastic gradient descent, stochastic Newton method, stochastic proximal point method, stochastic fixed point method, and stochastic projection method, with fixed stepsize (relaxation parameter), applied to the reformulations.
Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory
Richtarik, Peter
2017-06-04
We develop a family of reformulations of an arbitrary consistent linear system into a stochastic problem. The reformulations are governed by two user-defined parameters: a positive definite matrix defining a norm, and an arbitrary discrete or continuous distribution over random matrices. Our reformulation has several equivalent interpretations, allowing for researchers from various communities to leverage their domain specific insights. In particular, our reformulation can be equivalently seen as a stochastic optimization problem, stochastic linear system, stochastic fixed point problem and a probabilistic intersection problem. We prove sufficient, and necessary and sufficient conditions for the reformulation to be exact. Further, we propose and analyze three stochastic algorithms for solving the reformulated problem---basic, parallel and accelerated methods---with global linear convergence rates. The rates can be interpreted as condition numbers of a matrix which depends on the system matrix and on the reformulation parameters. This gives rise to a new phenomenon which we call stochastic preconditioning, and which refers to the problem of finding parameters (matrix and distribution) leading to a sufficiently small condition number. Our basic method can be equivalently interpreted as stochastic gradient descent, stochastic Newton method, stochastic proximal point method, stochastic fixed point method, and stochastic projection method, with fixed stepsize (relaxation parameter), applied to the reformulations.
Topology Synthesis of Structures Using Parameter Relaxation and Geometric Refinement
Hull, P. V.; Tinker, M. L.
2007-01-01
Typically, structural topology optimization problems undergo relaxation of certain design parameters to allow the existence of intermediate variable optimum topologies. Relaxation permits the use of a variety of gradient-based search techniques and has been shown to guarantee the existence of optimal solutions and eliminate mesh dependencies. This Technical Publication (TP) will demonstrate the application of relaxation to a control point discretization of the design workspace for the structural topology optimization process. The control point parameterization with subdivision has been offered as an alternative to the traditional method of discretized finite element design domain. The principle of relaxation demonstrates the increased utility of the control point parameterization. One of the significant results of the relaxation process offered in this TP is that direct manufacturability of the optimized design will be maintained without the need for designer intervention or translation. In addition, it will be shown that relaxation of certain parameters may extend the range of problems that can be addressed; e.g., in permitting limited out-of-plane motion to be included in a path generation problem.
Iterated local search algorithm for solving the orienteering problem with soft time windows.
Aghezzaf, Brahim; Fahim, Hassan El
2016-01-01
In this paper we study the orienteering problem with time windows (OPTW) and the impact of relaxing the time windows on the profit collected by the vehicle. The way of relaxing time windows adopted in the orienteering problem with soft time windows (OPSTW) that we study in this research is a late service relaxation that allows linearly penalized late services to customers. We solve this problem heuristically by considering a hybrid iterated local search. The results of the computational study show that the proposed approach is able to achieve promising solutions on the OPTW test instances available in the literature, one new best solution is found. On the newly generated test instances of the OPSTW, the results show that the profit collected by the OPSTW is better than the profit collected by the OPTW.
Algebraic coarsening methods for linear and nonlinear PDE and systems
International Nuclear Information System (INIS)
McWilliams, J C
2000-01-01
In [l] Brandt describes a general approach for algebraic coarsening. Given fine-grid equations and a prescribed relaxation method, an approach is presented for defining both the coarse-grid variables and the coarse-grid equations corresponding to these variables. Although, these two tasks are not necessarily related (and, indeed, are often performed independently and with distinct techniques) in the approaches of [1] both revolve around the same underlying observation. To determine whether a given set of coarse-grid variables is appropriate it is suggested that one should employ compatible relaxation. This is a generalization of so-called F-relaxation (e.g., [2]). Suppose that the coarse-grid variables are defined as a subset of the fine-grid variables. Then, F-relaxation simply means relaxing only the F-variables (i.e., fine-grid variables that do not correspond to coarse-grid variables), while leaving the remaining fine-grid variables (C-variables) unchanged. The generalization of compatible relaxation is in allowing the coarse-grid variables to be defined differently, say as linear combinations of fine-grid variables, or even nondeterministically (see examples in [1]). For the present summary it suffices to consider the simple case. The central observation regarding the set of coarse-grid variables is the following [1]: Observation 1--A general measure for the quality of the set of coarse-grid variables is the convergence rate of compatible relaxation. The conclusion is that a necessary condition for efficient multigrid solution (e.g., with convergence rates independent of problem size) is that the compatible-relaxation convergence be bounded away from 1, independently of the number of variables. This is often a sufficient condition, provided that the coarse-grid equations are sufficiently accurate. Therefore, it is suggested in [1] that the convergence rate of compatible relaxation should be used as a criterion for choosing and evaluating the set of coarse
Relaxation and kinetics in scalar field theories
International Nuclear Information System (INIS)
Boyanovsky, D.; Lawrie, I.D.; Lee, D.
1996-01-01
A new approach to the dynamics of relaxation and kinetics of thermalization in a scalar field theory is presented that incorporates the relevant time scales through the resummation of hard thermal loops. An alternative derivation of the kinetic equations for the open-quote open-quote quasiparticle close-quote close-quote distribution functions is obtained that allows a clear understanding of the different open-quote open-quote coarse-graining close-quote close-quote approximations usually involved in a kinetic description. This method leads to a systematic perturbative expansion to obtain the kinetic equations including hard thermal loop resummation and to an improvement including renormalization, off-shell effects, and contributions that change chemical equilibrium on short time scales. As a by-product of these methods we establish the equivalence between the relaxation time scale in the linearized equation of motion of the quasiparticles and the thermalization time scale of the quasiparticle distribution function in the open-quote open-quote relaxation time approximation close-quote close-quote including hard thermal loop effects. Hard thermal loop resummation dramatically modifies the scattering rate for long wavelength modes as compared to the usual (semi)classical estimate. Relaxation and kinetics are studied both in the unbroken and broken symmetry phases of the theory. The broken symmetry phase also provides the setting to obtain the contribution to the kinetic equations from processes that involve decay of a heavy scalar into light scalar particles in the medium. copyright 1996 The American Physical Society
Joint shape segmentation with linear programming
Huang, Qixing
2011-01-01
We present an approach to segmenting shapes in a heterogenous shape database. Our approach segments the shapes jointly, utilizing features from multiple shapes to improve the segmentation of each. The approach is entirely unsupervised and is based on an integer quadratic programming formulation of the joint segmentation problem. The program optimizes over possible segmentations of individual shapes as well as over possible correspondences between segments from multiple shapes. The integer quadratic program is solved via a linear programming relaxation, using a block coordinate descent procedure that makes the optimization feasible for large databases. We evaluate the presented approach on the Princeton segmentation benchmark and show that joint shape segmentation significantly outperforms single-shape segmentation techniques. © 2011 ACM.
Robust Control Design via Linear Programming
Keel, L. H.; Bhattacharyya, S. P.
1998-01-01
This paper deals with the problem of synthesizing or designing a feedback controller of fixed dynamic order. The closed loop specifications considered here are given in terms of a target performance vector representing a desired set of closed loop transfer functions connecting various signals. In general these point targets are unattainable with a fixed order controller. By enlarging the target from a fixed point set to an interval set the solvability conditions with a fixed order controller are relaxed and a solution is more easily enabled. Results from the parametric robust control literature can be used to design the interval target family so that the performance deterioration is acceptable, even when plant uncertainty is present. It is shown that it is possible to devise a computationally simple linear programming approach that attempts to meet the desired closed loop specifications.
Fahmida, Umi; Kolopaking, Risatianti; Santika, Otte; Sriani, Sriani; Umar, Jahja; Htet, Min Kyaw; Ferguson, Elaine
2015-03-01
Complementary feeding recommendations (CFRs) with the use of locally available foods can be developed by using linear programming (LP). Although its potential has been shown for planning phases of food-based interventions, the effectiveness in the community setting has not been tested to our knowledge. We aimed to assess effectiveness of promoting optimized CFRs for improving maternal knowledge, feeding practices, and child intakes of key problem nutrients (calcium, iron, niacin, and zinc). A community-intervention trial with a quasi-experimental design was conducted in East Lombok, West Nusa Tenggara Province, Indonesia, on children aged 9-16 mo at baseline. A CFR group (n = 240) was compared with a non-CFR group (n = 215). The CFRs, which were developed using LP, were promoted in an intervention that included monthly cooking sessions and weekly home visits. The mother's nutrition knowledge and her child's feeding practices and the child's nutrient intakes were measured before and after the 6-mo intervention by using a structured interview, 24-h recall, and 1-wk food-frequency questionnaire. The CFR intervention improved mothers' knowledge and children's feeding practices and improved children's intakes of calcium, iron, and zinc. At the end line, median (IQR) nutrient densities were significantly higher in the CFR group than in the non-CFR group for iron [i.e., 0.6 mg/100 kcal (0.4-0.8 mg/100 kcal) compared with 0.5 mg/100 kcal (0.4-0.7 mg/100 kcal)] and niacin [i.e., 0.8 mg/100 kcal (0.5-1.0 mg/100 kcal) compared with 0.6 mg/100 kcal (0.4-0.8 mg/100 kcal)]. However, median nutrient densities for calcium, iron, niacin, and zinc in the CFR group (23, 0.6, 0.7, and 0.5 mg/100 kcal, respectively) were still below desired densities (63, 1.0, 0.9, and 0.6 mg/100 kcal, respectively). The CFRs significantly increased intakes of calcium, iron, niacin, and zinc, but nutrient densities were still below desired nutrient densities. When the adoption of optimized CFRs is
Energy Technology Data Exchange (ETDEWEB)
Gurevich, S. G.
1955-07-01
Galerkin's method is applied to the solution of a linear partial differential equation of arbitrary order under specified initial and boundary conditions. An example is carried through in complete detail to illustrate the method. (auth)
International Nuclear Information System (INIS)
King, J.B.; Anghaie, S.; Domanus, H.M.
1987-01-01
Finite difference approximations to the continuity, momentum, and energy equations in thermal hydraulics codes result in a system of N by N equations for a problem having N field points. In a three dimensional problem, N increases as the problem becomes larger or more complex, and more rapidly as the computational mesh size is reduced. As a consequence, the execution time required to solve the problem increases, which may lead to placing limits on the problem resolution or accuracy. A conventinal method of solution of these systems of equations is the Successive Over Relaxation (SOR) technique. However, for a wide range of problems the execution time may be reduced by using a more efficient linear equation solver. One such method is the conjugate gradient method which was implemented in COMMIX-1B thermal hydraulics code. It was found that the execution time required to solve the resulting system of equations was reduced by a factor of about 2 for some problems. This paper summarizes the characteristics of these iterative solution procedures and compares their performance in modeling of a variety of reactor thermal hydraulic problems, using the COMMIX-1B computer code
Relaxed states with plasma flow
International Nuclear Information System (INIS)
Avinash, K.; Taylor, J.B.
1991-01-01
In the theory of relaxation, a turbulent plasma reaches a state of minimum energy subject to constant magnetic helicity. In this state the plasma velocity is zero. Attempts have been made by introducing a number of different constraints, to obtain relaxed states with plasma flow. It is shown that these alternative constraints depend on two self-helicities, one for ions, and one for electrons. However, whereas there are strong arguments for the effective invariance of the original magnetic-helicity, these arguments do not apply to the self-helicities. Consequently the existence of relaxed states with flow remains in doubt. (author)
On the relaxation of cold electrons and hot ions
International Nuclear Information System (INIS)
Potapenko, I.F.; Bobylev, A.V.; Azevedo, C.A. de; Sakanaka, P.H.; Assis, A.S. de
1998-01-01
The relaxation process of a space uniform plasma composed of cold electrons and one species of hot ions is studied numerically using one- and two-dimensional Landau - Fokker - Planck codes. Relaxation of a monoenergetic ion beam is considered in possibly extreme temperature regimes. Special attention is paid to the deviation of the relaxation process from the classical picture, which is characterized by the close initial temperatures T e >(m e /m i ) 1/3 T i . The present results give quite a clear idea of the relaxation picture for any initial temperatures also in extreme temperature regimes. A difference scheme, preserving the number of particles and the energy, gives the possibility of solving the problem numerically without error accumulation, except for machine errors. copyright 1998 American Institute of Physics
Relaxed states of tokamak plasmas
International Nuclear Information System (INIS)
Kucinski, M.Y.; Okano, V.
1993-01-01
The relaxed states of tokamak plasmas are studied. It is assumed that the plasma relaxes to a quasi-steady state which is characterized by a minimum entropy production rate, compatible with a number of prescribed conditions and pressure balance. A poloidal current arises naturally due to the anisotropic resistivity. The minimum entropy production theory is applied, assuming the pressure equilibrium as fundamental constraint on the final state. (L.C.J.A.)
Negative magnetic relaxation in superconductors
Directory of Open Access Journals (Sweden)
Krasnoperov E.P.
2013-01-01
Full Text Available It was observed that the trapped magnetic moment of HTS tablets or annuli increases in time (negative relaxation if they are not completely magnetized by a pulsed magnetic field. It is shown, in the framework of the Bean critical-state model, that the radial temperature gradient appearing in tablets or annuli during a pulsed field magnetization can explain the negative magnetic relaxation in the superconductor.
Relaxation effects in ferrous complexes
International Nuclear Information System (INIS)
Nicolini, C.; Mathieu, J.P.; Chappert, J.
1976-01-01
The slow relaxation mechanism of the Fe 2+ ion in the tri-fluorinated TF(acac) and hexafluorinated HF(acac) complexes of Fe(II) acetylacetonate was investigated. The 300K and 77K Moessbauer spectra for TF(acac) consist in a slightly asymmetric quadrupole doublet. On the contrary, at 4.2K the higher energy line is strongly widened; that is typical of a slowing down in the electron relaxation frequency [fr
Simple molecular mechanism of heat transfer: Debye relaxation versus power-law
International Nuclear Information System (INIS)
Gall, M.; Kutner, R.
2005-01-01
We study a simple molecular model (at coarse-grain level) as a basis of irreversible heat transfer through a diathermic partition. The partition separates into two adjacent parts a box containing ideal point particles that communicate only though this partition. We provide the basic mechanism of energy transfer between the left- and right-hand side gas samples by assuming equipartition of kinetic energy of all outgoing particles colliding with the partition at a given time. We analyse and compare two essentially different cases (A) the reference one, where we assume that the border walls of the box and the diathermic partitions can randomize the direction of motion of rebounding particles, and (B) the case where we assume the mirror collisions of particles with the border walls and the partition. In both cases the rebounding of the particles from border walls is elastic. The above introduced assumptions allow us to numerically simulate and analytically consider, for example, the relaxation of temperatures of both gas samples and the entropy of the system. However, in both cases the long-time relaxation is essentially different since in case (A) it is an exponential one, while in case (B) it seems to be a power-law relaxation. The obtained results well agree in case (A) with the predictions of the phenomenological, linear theory of irreversible theory had to be developed which assumes time-dependence of heat conductivity; it describes the relaxation of the system far from equilibrium. The explanation of the results obtained in this case is, nevertheless, an intriguing problem. (author)