WorldWideScience

Sample records for linear thermoviscoelastic problem

  1. 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......, 041502 (2007)], the solution is conveniently formulated in terms of the so-called transfer matrix, which directly links to the boundary conditions that can be experimentally controlled. Once the transfer matrix has been calculated, it is fairly easy to deduce the equations describing various...

  2. L~p-L~q decay estimates of solutions to Cauchy problems of thermoviscoelastic systems

    Institute of Scientific and Technical Information of China (English)

    YANG Lin; HUANG Li-hong; KUANG Feng-lian

    2009-01-01

    Lp-Lq decay estimate of solution to Cauchy problem of a linear thermoviscoelastic system is studied. By using a diagonalization argument of frequency analysis, the coupled system will be decoupled micrologically. Then with the help of the information of characteristic roots for the coefficient matrix of the system, L~p-L~q decay estimate of parabolic type of solution to the Cauchy problem is obtained.

  3. Invariant and partially invariant solutions of integro-differential equations for linear thermoviscoelastic aging materials with memory

    Science.gov (United States)

    Zhou, Long-Qiao; Meleshko, Sergey V.

    2017-01-01

    A linear thermoviscoelastic model for homogeneous, aging materials with memory is established. A system of integro-differential equations is obtained by using two motions (a one-dimensional motion and a shearing motion) for this model. Applying the group analysis method to the system of integro-differential equations, the admitted Lie group is determined. Using this admitted Lie group, invariant and partially invariant solutions are found. The present paper gives a first example of application of partially invariant solutions to integro-differential equations.

  4. Thermoviscoelastic models for polyethylene thin films

    DEFF Research Database (Denmark)

    Li, Jun; Kwok, Kawai; Pellegrino, Sergio

    2016-01-01

    This paper presents a constitutive thermoviscoelastic model for thin films of linear low-density polyethylene subject to strains up to yielding. The model is based on the free volume theory of nonlinear thermoviscoelasticity, extended to orthotropic membranes. An ingredient of the present approach...... is that the experimentally inaccessible out-of-plane material properties are determined by fitting the model predictions to the measured nonlinear behavior of the film. Creep tests, uniaxial tension tests, and biaxial bubble tests are used to determine the material parameters. The model has been validated experimentally...

  5. Numerical Study of Phase Transition in Thermoviscoelasticity

    Institute of Scientific and Technical Information of China (English)

    ShaoqingTANG

    1997-01-01

    We study the spatially periodic problem of thermoviscoelasticity with nonmonotone structure relations.By pseudo-spectral method.we demosnstrate numerically phase transitions for certain symmetric initial data.Without symmetry,the simulations show that a translation occurs for the phase boundary.

  6. Asymptotic analysis for vanishing acceleration in a thermoviscoelastic system

    Directory of Open Access Journals (Sweden)

    Elena Bonetti

    2005-01-01

    Full Text Available We have investigated a dynamic thermoviscoelastic system (2003, establishing existence and uniqueness results for a related initial and boundary values problem. The aim of the present paper is to study the asymptotic behavior of the solution to the above problem as the power of the acceleration forces goes to zero. In particular, well-posedness and regularity results for the limit (quasistatic problem are recovered.

  7. Compact decoupling for thermoviscoelasticity in irregular domains

    Directory of Open Access Journals (Sweden)

    El Mustapha Ait Ben Hassi

    2011-05-01

    Full Text Available Our goal is to prove the compactness of the difference between the thermoviscoelasticity semigroup and its decoupled semigroup. To show this, we prove the norm continuity of this difference, the compactness of the difference of their resolvents and use Theorem 2.3 in Huang [4]. We generalize a result by Liu [5]. An illustrative example of a thermoviscoelastic system with Neumann Laplacian on a Jelly Roll domain is given.

  8. An internal-variable theory of thermo-viscoelastic constitutive relations at finite strain

    Institute of Scientific and Technical Information of China (English)

    黄筑平; 陈建康; 王文标

    2000-01-01

    Based on the nonequilibrium thermodynamic theory, a new thermo-viscoelastic relation at finite strain is proposed. Under the assumption that the specific heat at a fixed strain and fixed internal variables can be regarded as a constant, a new expression for the free energy which decouples the mechanical and the thermal effects is derived. Through an analysis of the mesoscopic deformation mechanism of solid polymers, a set of internal variables is introduced, and an internal-variable consti-tutive theory in thermo-viscoelasticity at finite strain is formulated. An explicit expression of a thermo-viscoelastic constitutive relation is obtained for solid polymers in the case where their molecular network has a randomly oriented distribution function at reference configuration. Moreover, the relationship be-tween the relaxation time and the temperature is also discussed. The viscoelastic constitutive theory proposed in reference is only a linear approximation of the present theory.

  9. An internal-variable theory of thermo-viscoelastic constitutive relations at finite strain

    Institute of Scientific and Technical Information of China (English)

    2000-01-01

    Based on the nonequilibrium thermodynamic theory,a new thermo-viscoelastic relation at finite strain is proposed.Under the assumption that the specific heat at a fixed strain and fixed internal variables can be regarded as a constant,a new expression for the free energy which decouples the mechanical and the thermal effects is derived.Through an analysis of the mesoscopic deformation mechanism of solid polymers,a set of internal variables is introduced,and an internal-variable constitutive theory in thermo-viscoelasticity at finite strain is formulated.An explicit expression of a thermo-viscoelastic constitutive relation is obtained for solid polymers in the case where their molecular network has a randomly oriented distribution function at reference configuration.Moreover,the relationship between the relaxation time and the temperature is also discussed.The viscoelastic constitutive theory proposed in reference is only a linear approximation of the present theory.

  10. Thermoviscoelastic dynamic response for a composite material thin narrow strip

    Energy Technology Data Exchange (ETDEWEB)

    Dai, Hong Liang; Qi, Li-Li; Liu, Hai-Bo [Hunan University, Changsha (China)

    2015-02-15

    Based on von Karman nonlinear strain-displacement relationships and classical thin plate theory, a list of nonlinear dynamic equilibrium equations for a viscoelastic composite material thin narrow strip under thermal and mechanic loads are deduced. According to the material constitutive relationship and the relaxation modulus in the form of the Prony series, combing with the Newmark method and the Newton-cotes integration method, a new numerical algorithm for direct solving the whole problem in the time domain is established. By applying this numerical algorithm, the viscoelastic composite material thin narrow strip as the research subject is analyzed systematically, and its rich dynamical behaviors are revealed comprehensively. To verify the accuracy of the present work, a comparison is made with previously published results. Finally, the viscoelastic composite material thin narrow strip under harmonic excitation load and impact load are discussed in detail, and many valuable thermoviscoelastic dynamic characteristics are revealed.

  11. Linearization problem in pseudolite surveys

    Science.gov (United States)

    Cellmer, Slawomir; Rapinski, Jacek

    2010-06-01

    GPS augmented with pseudolites (PL), can be used in various engineering surveys. Also pseudolite—only navigation system can be designed and used in any place, even if GPS signal is not available (Kee et al. Development of indoor navigation system using asynchronous pseudolites, 1038-1045, 2000). Especially in engineering surveys, where harsh survey environment is common, pseudolites have a lot of applications. Pseudolites may be used in construction sites, open pit mines, city canyons, GPS and PL baseline processing is similar, although there are few differences that must be taken into account. One of the major issues is linearization problem. The source of the problem is neglecting second terms of Taylor series expansion in GPS baseline processing software. This problem occurs when the pseudolite is relatively close to the receiver, which is the case in PL surveys. In this paper authors presents the algorithm for GPS + PL data processing including, neglected in classical GPS only approach, second terms of Taylor series expansion. The mathematical model of adjustment problem, detailed proposal of application in baseline processing algorithms, and numerical tests are presented.

  12. Relative entropy for hyperbolic-parabolic systems and application to the constitutive theory of thermoviscoelasticity

    KAUST Repository

    Christoforou, Cleopatra

    2016-03-27

    We extend the relative entropy identity to the class of hyperbolic-parabolic systems whose hyperbolic part is symmetrizable. The resulting identity is useful to provide measure valued weak versus strong uniqueness theorems for the hyperbolic problem. Also, it yields a convergence result in the zero-viscosity limit to smooth solutions in an Lp framework. The relative entropy identity is also developed for the system of gas dynamics for viscous and heat conducting gases, and for the system of thermoviscoelasticity with viscosity and heat-conduction. Existing differences between the example and the general hyperbolic theory are underlined.

  13. Templates for Linear Algebra Problems

    NARCIS (Netherlands)

    Bai, Z.; Day, D.; Demmel, J.; Dongarra, J.; Gu, M.; Ruhe, A.; Vorst, H.A. van der

    2001-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 eig

  14. Linear and complex analysis problem

    CERN Document Server

    Nikolski, Nikolai

    1994-01-01

    The 2-volume book is an updated, reorganized and considerably enlarged version of the previous edition of the Research Problem Book in Analysis (LNM 1043), a collection familiar to many analysts, that has sparked off much research. This new edition, created in a joint effort by a large team of analysts, is, like its predecessor, a collection of unsolved problems of modern analysis designed as informally written mini-articles, each containing not only a statement of a problem but also historical and methodological comments, motivation, conjectures and discussion of possible connections, of plausible approaches as well as a list of references. There are now 342 of these mini- articles, almost twice as many as in the previous edition, despite the fact that a good deal of them have been solved!

  15. Linear and complex analysis problem

    CERN Document Server

    Nikolski, Nikolai

    1994-01-01

    The 2-volume-book is an updated, reorganized and considerably enlarged version of the previous edition of the Research Problem Book in Analysis (LNM 1043), a collection familiar to many analysts, that has sparked off much research. This new edition, created in a joint effort by a large team of analysts, is, like its predecessor, a collection of unsolved problems of modern analysis designed as informally written mini-articles, each containing not only a statement of a problem but also historical and metho- dological comments, motivation, conjectures and discussion of possible connections, of plausible approaches as well as a list of references. There are now 342 of these mini- articles, almost twice as many as in the previous edition, despite the fact that a good deal of them have been solved!

  16. Can linear superiorization be useful for linear optimization problems?

    Science.gov (United States)

    Censor, Yair

    2017-04-01

    Linear superiorization (LinSup) considers linear programming problems but instead of attempting to solve them with linear optimization methods it employs perturbation resilient feasibility-seeking algorithms and steers them toward reduced (not necessarily minimal) target function values. The two questions that we set out to explore experimentally are: (i) does LinSup provide a feasible point whose linear target function value is lower than that obtained by running the same feasibility-seeking algorithm without superiorization under identical conditions? (ii) How does LinSup fare in comparison with the Simplex method for solving linear programming problems? Based on our computational experiments presented here, the answers to these two questions are: ‘yes’ and ‘very well’, respectively.

  17. Connection matrices for ultradiscrete linear problems

    Energy Technology Data Exchange (ETDEWEB)

    Ormerod, Chris [School of Mathematics and Statistics F07, The University of Sydney, Sydney (Australia)

    2007-10-19

    We present theory outlining associated linear problems for ultradiscrete equations. The appropriate domain for these problems is the max-plus semiring. Our main result is that despite the restrictive nature of the max-plus semiring, it is still possible to define a theory of connection matrices analogous to that of Birkhoff and his school for systems of linear difference equations. We use such theory to provide evidence for the integrability of an ultradiscrete difference equation.

  18. Numerical linear algebra for reconstruction inverse problems

    Science.gov (United States)

    Nachaoui, Abdeljalil

    2004-01-01

    Our goal in this paper is to discuss various issues we have encountered in trying to find and implement efficient solvers for a boundary integral equation (BIE) formulation of an iterative method for solving a reconstruction problem. We survey some methods from numerical linear algebra, which are relevant for the solution of this class of inverse problems. We motivate the use of our constructing algorithm, discuss its implementation and mention the use of preconditioned Krylov methods.

  19. On an asymptotically linear elliptic Dirichlet problem

    Directory of Open Access Journals (Sweden)

    Zhitao Zhang

    2002-01-01

    Full Text Available Under very simple conditions, we prove the existence of one positive and one negative solution of an asymptotically linear elliptic boundary value problem. Even for the resonant case at infinity, we do not need to assume any more conditions to ensure the boundness of the (PS sequence of the corresponding functional. Moreover, the proof is very simple.

  20. 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.

  1. Solving fault diagnosis problems linear synthesis techniques

    CERN Document Server

    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 ...

  2. Numerical stability in problems of linear algebra.

    Science.gov (United States)

    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.

  3. 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...

  4. Spectral integration of linear boundary value problems

    CERN Document Server

    Viswanath, Divakar

    2012-01-01

    Spectral integration is a method for solving linear boundary value problems which uses the Chebyshev series representation of functions to avoid the numerical discretization of derivatives. It is occasionally attributed to Zebib (J. of Computational Physics vol. 53 (1984), p. 443-455) and more often to Greengard (SIAM J. on Numerical Analysis vol. 28 (1991), p. 1071-1080). Its advantage is believed to be its relative immunity to errors that arise when nearby grid points are used to approximate derivatives. In this paper, we reformulate the method of spectral integration by changing it in four different ways. The changes consist of a more convenient integral formulation, a different way to treat and interpret boundary conditions, treatment of higher order problems in factored form, and the use of piecewise Chebyshev grid points. Our formulation of spectral integration is more flexible and powerful as show by its ability to solve a problem that would otherwise take 8192 grid points using only 96 grid points. So...

  5. A three dimensional finite element formulation for thermoviscoelastic orthotropic media

    Energy Technology Data Exchange (ETDEWEB)

    Zocher, M.A. [Los Alamos National Lab., NM (United States)

    1997-12-31

    A numerical algorithm for the efficient solution of the uncoupled quasistatic initial/boundary value problem involving orthotropic linear viscoelastic media undergoing thermal and/or mechanical deformation is briefly outlined.

  6. A METHOD FOR SOLVING LINEAR PROGRAMMING PROBLEMS WITH FUZZY PARAMETERS BASED ON MULTIOBJECTIVE LINEAR PROGRAMMING TECHNIQUE

    OpenAIRE

    Zangiabadi, M.; 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...

  7. LINEARIZATION AND CORRECTION METHOD FOR NONLINEAR PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    何吉欢

    2002-01-01

    A new perturbation-like technique called linearization and correction method is proposed. Contrary to the traditional perturbation techniques, the present theory does not assume that the solution is expressed in the form of a power series of small parameter. To obtain an asymptotic solution of nonlinear system, the technique first searched for a solution for the linearized system, then a correction was added to the linearized solution. So the obtained results are uniformly valid for both weakly and strongly nonlinear equations.

  8. Elementary linear algebra for advanced spectral problems

    OpenAIRE

    Sjoestrand, J.; Zworski, M

    2003-01-01

    We discuss the general method of Grushin problems, closely related to Shur complements, Feshbach projections and effective Hamiltonians, and describe various appearances in spectral theory, pdes, mathematical physics and numerical problems.

  9. Elementary linear algebra for advanced spectral problems

    OpenAIRE

    Sjoestrand, J.; Zworski, M.

    2003-01-01

    We discuss the general method of Grushin problems, closely related to Shur complements, Feshbach projections and effective Hamiltonians, and describe various appearances in spectral theory, pdes, mathematical physics and numerical problems.

  10. 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.

  11. Optimal impulse control problems and linear programming.

    OpenAIRE

    Bauso, D.

    2009-01-01

    Optimal impulse control problems are, in general, difficult to solve. A current research goal is to isolate those problems that lead to tractable solutions. In this paper, we identify a special class of optimal impulse control problems which are easy to solve. Easy to solve means that solution algorithms are polynomial in time and therefore suitable to the on-line implementation in real-time problems. We do this by using a paradigm borrowed from the Operations Research field. As main result, ...

  12. Evolutionary Programming for IP/MIP Problems with Linear Constraints

    Institute of Scientific and Technical Information of China (English)

    2000-01-01

    In this paper, we propose a modified evolutionary programming with dynamic domain for solving nonlinear IP/MIP problems with linear constraints, without involving penalty function or any transformation for the problem to a linear model or others. The numerical results show that the new algorithm gives a satisfactory performance in which it works of high speed and accuracy in IP/MIP problems.

  13. Microlocal analysis of a seismic linearized inverse problem

    NARCIS (Netherlands)

    Stolk, C.C.

    2001-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

  14. The Uniqueness of Optimal Solution for Linear Programming Problem

    Institute of Scientific and Technical Information of China (English)

    QuanlingWei; HongYan; JunWang

    2004-01-01

    This paper investigates an old problem in operations research, the uniqueness of the optimal solution to a linear programming problem. We discuss the problem on a general polyhedron, give some equivalent conditions for uniqueness testing. In addition, we discuss the implementation issues for linear programming based decision making procedures,which motivated this research.

  15. Linear inverse problem of the reactor dynamics

    Science.gov (United States)

    Volkov, N. P.

    2017-01-01

    The aim of this work is the study transient processes in nuclear reactors. The mathematical model of the reactor dynamics excluding reverse thermal coupling is investigated. This model is described by a system of integral-differential equations, consisting of a non-stationary anisotropic multispeed kinetic transport equation and a delayed neutron balance equation. An inverse problem was formulated to determine the stationary part of the function source along with the solution of the direct problem. The author obtained sufficient conditions for the existence and uniqueness of a generalized solution of this inverse problem.

  16. Piecewise polynomial solutions to linear inverse problems

    DEFF Research Database (Denmark)

    Hansen, Per Christian; Mosegaard, K.

    1996-01-01

    We have presented a new algorithm PP-TSVD that computes piecewise polynomial solutions to ill-posed problems, without a priori knowledge about the positions of the break points. In particular, we can compute piecewise constant functions that describe layered models. Such solutions are useful, e.g.......g., in seismological problems, and the algorithm can also be used as a preprocessor for other methods where break points/discontinuities must be incorporated explicitly....

  17. RELAXED ASYNCHRONOUS ITERATIONS FOR THE LINEAR COMPLEMENTARITY PROBLEM

    Institute of Scientific and Technical Information of China (English)

    Zhong-zhi Bai; Yu-guang Huang

    2002-01-01

    We present a class of relaxed asynchronous parallel multisplitting iterative methods forsolving the linear complementarity problem on multiprocessor systems, and set up theirconvergence theories when the system matrix of the linear complementarity problem is anH-matrix with positive diagonal elements.

  18. Monte Carlo Algorithms for Linear Problems

    OpenAIRE

    DIMOV, Ivan

    2000-01-01

    MSC Subject Classification: 65C05, 65U05. Monte Carlo methods are a powerful tool in many fields of mathematics, physics and engineering. It is known, that these methods give statistical estimates for the functional of the solution by performing random sampling of a certain chance variable whose mathematical expectation is the desired functional. Monte Carlo methods are methods for solving problems using random variables. In the book [16] edited by Yu. A. Shreider one can find the followin...

  19. Newtonian Nonlinear Dynamics for Complex Linear and Optimization Problems

    CERN Document Server

    Vázquez, Luis

    2013-01-01

    Newtonian Nonlinear Dynamics for Complex Linear and Optimization Problems explores how Newton's equation for the motion of one particle in classical mechanics combined with finite difference methods allows creation of a mechanical scenario to solve basic problems in linear algebra and programming. The authors present a novel, unified numerical and mechanical approach and an important analysis method of optimization. This book also: Presents mechanical method for determining matrix singularity or non-independence of dimension and complexity Illustrates novel mathematical applications of classical Newton’s law Offers a new approach and insight to basic, standard problems Includes numerous examples and applications Newtonian Nonlinear Dynamics for Complex Linear and Optimization Problems is an ideal book for undergraduate and graduate students as well as researchers interested in linear problems and optimization, and nonlinear dynamics.      

  20. Turnpike theory of continuous-time linear optimal control problems

    CERN Document Server

    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...

  1. An approach for solving linear fractional programming problems ...

    African Journals Online (AJOL)

    An approach for solving linear fractional programming problems. ... Journal of the Nigerian Association of Mathematical Physics. Journal Home · ABOUT · Advanced Search ... Open Access DOWNLOAD FULL TEXT Subscription or Fee Access ...

  2. MULTILEVEL ITERATION METHODS FOR SOLVING LINEAR ILL-POSED PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    2005-01-01

    In this paper we develop multilevel iteration methods for solving linear systems resulting from the Galerkin method and Tikhonov regularization for ill-posed problems. The algorithm and its convergence analysis are presented in an abstract framework.

  3. On Alternative Optimal Solutions to Linear Fractional Optimization Problems

    Institute of Scientific and Technical Information of China (English)

    ShengjiaXue

    2004-01-01

    The structure of the optimal solution set is derived for linear fractional optimization problems with the representation theorem of polyhedral sets.And the computational procedure in determining all optimal solutions is also given.

  4. 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.

  5. Schaum's outline of theory and problems of linear algebra

    CERN Document Server

    Lipschutz, Seymour

    2001-01-01

    This third edition of the successful outline in linear algebra--which sold more than 400,000 copies in its past two editions--has been thoroughly updated to increase its applicability to the fields in which linear algebra is now essential: computer science, engineering, mathematics, physics, and quantitative analysis. Revised coverage includes new problems relevant to computer science and a revised chapter on linear equations.

  6. THE DEGENERACY PROBLEM OF TWO-DIMENSIONAL LINEAR RECURRING ARRAYS

    Institute of Scientific and Technical Information of China (English)

    2000-01-01

    The degeneracy degree and degeneracy position sets of a wo-dimensional linear recurrence relation set are characterized. The fact that a linear recurring array is essentially a doubly periodic array is shown. By using the Grbner base theory, a calculation formula for degeneracy degree is given and the existence of a special degeneracy position set is proved. In the present paper, the degeneracy problem of the two-dimensional linear recurring arrays is completely solved.

  7. ANOTHER LOOK AT LINEAR-QUADRATIC OPTIMIZATION PROBLEMS OVER TIME

    NARCIS (Netherlands)

    NIEUWENHUIS, JW

    1995-01-01

    We will study deterministic quadratic optimization problems over time with linear constraints by means of the behavioral approach of linear systems as developed by Willems (1986, 1989). We will start with a simple example from economics and embed this in a general framework. Then we will develop the

  8. 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.

  9. (Numerical algorithms for solving linear algebra problems). Final report

    Energy Technology Data Exchange (ETDEWEB)

    Golub, G.H.

    1985-04-16

    We have concentrated on developing and analyzing various numerical algorithms for solving problems arising in a linear algebra context. The papers and research fall into basically three categories: (1) iterative methods for solving linear equations arising from p.d.e.'s; (2) calculation of Gauss-type quadrature rules; and (3) solution of matrix and data problems arising in statistical computation. We summarize some of these results, highlighting those which are of most importance.

  10. Linear Programming and Its Application to Pattern Recognition Problems

    Science.gov (United States)

    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.

  11. Essential linear algebra with applications a problem-solving approach

    CERN Document Server

    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.    ...

  12. About one problem of optimal stabilization of linear compound systems

    Directory of Open Access Journals (Sweden)

    Barseghyan V.R.

    2014-12-01

    Full Text Available The problem of optimal stabilization of linear compound system is investigated. Based on Lyapunov function method the method of building optimal stabilizing control action is suggested. The solution of the problem of optimal stabilization of a concrete compound system is given.

  13. Inverse Modelling Problems in Linear Algebra Undergraduate Courses

    Science.gov (United States)

    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…

  14. Testing problems with linear or angular inequality constraints

    NARCIS (Netherlands)

    Akkerboom, Johan Cornelis

    1988-01-01

    The present study is concerned mainly with certain generalizations of one-sided hypothesis testing problems, namely problems where the alternative is restricted by at least two linear inequalities. A celebrated example in the statistical literature is that of testing homogeneity against upward trend

  15. A Robin Problem for Quasi-linear System

    Institute of Scientific and Technical Information of China (English)

    0UYANGCheng

    2004-01-01

    In this paper, a Robin problem for quasi-linear system is considered. Under the appropriate assumptions, the existence of solution for the problem is proved and the asymptotic behavior of the solution is studied using the theory of differential inequalities.

  16. Applying the General Linear Model to Repeated Measures Problems.

    Science.gov (United States)

    Pohlmann, John T.; McShane, Michael G.

    The purpose of this paper is to demonstrate the use of the general linear model (GLM) in problems with repeated measures on a dependent variable. Such problems include pretest-posttest designs, multitrial designs, and groups by trials designs. For each of these designs, a GLM analysis is demonstrated wherein full models are formed and restrictions…

  17. Inverse Modelling Problems in Linear Algebra Undergraduate Courses

    Science.gov (United States)

    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…

  18. Solving linear integer programming problems by a novel neural model.

    Science.gov (United States)

    Cavalieri, S

    1999-02-01

    The paper deals with integer linear programming problems. As is well known, these are extremely complex problems, even when the number of integer variables is quite low. Literature provides examples of various methods to solve such problems, some of which are of a heuristic nature. This paper proposes an alternative strategy based on the Hopfield neural network. The advantage of the strategy essentially lies in the fact that hardware implementation of the neural model allows for the time required to obtain a solution so as not depend on the size of the problem to be solved. The paper presents a particular class of integer linear programming problems, including well-known problems such as the Travelling Salesman Problem and the Set Covering Problem. After a brief description of this class of problems, it is demonstrated that the original Hopfield model is incapable of supplying valid solutions. This is attributed to the presence of constant bias currents in the dynamic of the neural model. A demonstration of this is given and then a novel neural model is presented which continues to be based on the same architecture as the Hopfield model, but introduces modifications thanks to which the integer linear programming problems presented can be solved. Some numerical examples and concluding remarks highlight the solving capacity of the novel neural model.

  19. Linear Riccati Dynamics, Constant Feedback, and Controllability in Linear Quadratic Control Problems

    OpenAIRE

    Ronald J. Balvers; Douglas W. Mitchell

    2005-01-01

    Conditions are derived for linear-quadratic control (LQC) problems to exhibit linear evolution of the Riccati matrix and constancy of the control feedback matrix. One of these conditions involves a matrix upon whose rank a necessary condition and a sufficient condition for controllability are based. Linearity of Riccati evolution allows for rapid iterative calculation, and constancy of the control feedback matrix allows for time-invariant comparative static analysis of policy reactions.

  20. Interior Point Method for Solving Fuzzy Number Linear Programming Problems Using Linear Ranking Function

    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.

  1. An adaptive genetic algorithm for solving bilevel linear programming problem

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    Bilevel linear programming, which consists of the objective functions of the upper level and lower level, is a useful tool for modeling decentralized decision problems.Various methods are proposed for solving this problem. Of all the algorithms, the genetic algorithm is an alternative to conventional approaches to find the solution of the bilevel linear programming. In this paper, we describe an adaptive genetic algorithm for solving the bilevel linear programming problem to overcome the difficulty of determining the probabilities of crossover and mutation. In addition, some techniques are adopted not only to deal with the difficulty that most of the chromosomes may be infeasible in solving constrained optimization problem with genetic algorithm but also to improve the efficiency of the algorithm. The performance of this proposed algorithm is illustrated by the examples from references.

  2. Solving a Fully Fuzzy Linear Programming Problem through Compromise Programming

    OpenAIRE

    Haifang Cheng; Weilai Huang; Jianhu Cai

    2013-01-01

    In the current literatures, there are several models of fully fuzzy linear programming (FFLP) problems where all the parameters and variables were fuzzy numbers but the constraints were crisp equality or inequality. In this paper, an FFLP problem with fuzzy equality constraints is discussed, and a method for solving this FFLP problem is also proposed. We first transform the fuzzy equality constraints into the crisp inequality ones using the measure of the similarity, which is interpreted as t...

  3. Local regularization of linear inverse problems via variational filtering

    Science.gov (United States)

    Lamm, Patricia K.

    2017-08-01

    We develop local regularization methods for ill-posed linear inverse problems governed by general Fredholm integral operators. The methods are executed as filtering algorithms which are simple to implement and computationally efficient for a large class of problems. We establish a convergence theory and give convergence rates for such methods, and illustrate their computational speed in numerical tests for inverse problems in geomagnetic exploration and imaging.

  4. Efficient numerical methods for entropy-linear programming problems

    Science.gov (United States)

    Gasnikov, A. V.; Gasnikova, E. B.; Nesterov, Yu. E.; Chernov, A. V.

    2016-04-01

    Entropy-linear programming (ELP) problems arise in various applications. They are usually written as the maximization of entropy (minimization of minus entropy) under affine constraints. In this work, new numerical methods for solving ELP problems are proposed. Sharp estimates for the convergence rates of the proposed methods are established. The approach described applies to a broader class of minimization problems for strongly convex functionals with affine constraints.

  5. Singular linear quadratic control problem for systems with linear and constant delay

    Science.gov (United States)

    Sesekin, A. N.; Andreeva, I. Yu.; Shlyakhov, A. S.

    2016-12-01

    This article is devoted to the singular linear-quadratic optimization problem on the trajectories of the linear non-autonomous system of differential equations with linear and constant delay. It should be noted that such task does not solve the class of integrable controls, so to ensure the existence of a solution is needed to expand the class of controls to include the control impulse components. For the problem under consideration, we have built program control containing impulse components in the initial and final moments time. This is done under certain assumptions on the functional and the right side of the control system.

  6. Global optimization over linear constraint non-convex programming problem

    Institute of Scientific and Technical Information of China (English)

    ZHANG Gui-Jun; WU Ti-Huan; YE Rong; YANG Hai-qing

    2005-01-01

    A improving Steady State Genetic Algorithm for global optimization over linear constraint non-convex programmin g problem is presented. By convex analyzing, the primal optimal problem can be converted to an equivalent problem, in which only the information of convex extremes of feasible space is included, and is more easy for GAs to solve. For avoiding invalid genetic operators, a redesigned convex crossover operator is also performed in evolving. As a integrality, the quality of two problem is proven, and a method is also given to get all extremes in linear constraint space. Simulation result show that new algorithm not only converges faster, but also can maintain an diversity population, and can get the global optimum of test problem.

  7. A Preconditioned Multisplitting and Schwarz Method for Linear Complementarity Problem

    Directory of Open Access Journals (Sweden)

    Cuiyu Liu

    2014-01-01

    Full Text Available The preconditioner presented by Hadjidimos et al. (2003 can improve on the convergence rate of the classical iterative methods to solve linear systems. In this paper, we extend this preconditioner to solve linear complementarity problems whose coefficient matrix is M-matrix or H-matrix and present a multisplitting and Schwarz method. The convergence theorems are given. The numerical experiments show that the methods are efficient.

  8. A NEW PRINCIPAL PIVOTING SCHEME FOR BOX LINEAR COMPLEMENTARITY PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    WANGZHEMIN

    1997-01-01

    Judice and Pires developed in recent years principal pivoting methods for the solving ofthe so-called box linear complementarity problems (BLCPs) where the constraint matrices are restrictedly supposed to be of P-matrices. This paper aims at presenting a new principal pivoting scheme for BLCPs where the constraint matrices are loosely supposed to be row sufficient. This scheme can be applied to the solving of convex quadratic programs subject to linear constraints and arbitrary upper and lower bound constraints on variables.

  9. A Modified Projection Method for Linear Feasibility Problems

    Institute of Scientific and Technical Information of China (English)

    Yi-Ju Wang; Hong-Yu Zhang

    2009-01-01

    In this paper, we present a modified projection method for the linear feasibility problems (LFP). Compared with the existing methods, the new method adopts a surrogate technique to obtain new iteration instead of the line search procedure with fixed stepsize. For the new method, we first show its global convergence under the condition that the solution set is nonempty, and then establish its linear convergence rate. Preliminary numerical experiments show that this method has good performance.

  10. Global well-posedness and asymptotic behavior of the solutions to non-classical thermo(visco)elastic models

    CERN Document Server

    Qin, Yuming

    2016-01-01

    This book presents recent findings on the global existence, the uniqueness and the large-time behavior of global solutions of thermo(vis)coelastic systems and related models arising in physics, mechanics and materials science such as thermoviscoelastic systems, thermoelastic systems of types II and III, as well as Timoshenko-type systems with past history. Part of the book is based on the research conducted by the authors and their collaborators in recent years. The book will benefit interested beginners in the field and experts alike.

  11. Robust output regulation problem for linear time-delay systems

    Science.gov (United States)

    Lu, Maobin; Huang, Jie

    2015-06-01

    In this paper, we study the robust output regulation problem for linear systems with input time-delay. By extending the internal model design method to linear time-delay systems, we have established solvability conditions for the problem by both dynamic state feedback control and dynamic output feedback control. The advantages of internal model approach over the feedforward design approach are that it can handle perturbations of the uncertain parameters in the plant and the control law, and it does not need to solve the regulator equations.

  12. A new heuristic algorithm for general integer linear programming problems

    Institute of Scientific and Technical Information of China (English)

    GAO Pei-wang; CAI Ying

    2006-01-01

    A new heuristic algorithm is proposed for solving general integer linear programming problems.In the algorithm,the objective function hyperplane is used as a cutting plane,and then by introducing a special set of assistant sets,an efficient heuristic search for the solution to the integer linear program is carried out in the sets on the objective function hyperplane.A simple numerical example shows that the algorithm is efficient for some problems,and therefore,of practical interest.

  13. An Algorithm for Linearly Constrained Nonlinear Programming Programming Problems.

    Science.gov (United States)

    1980-01-01

    ALGORITHM FOR LINEARLY CONSTRAINED NONLINEAR PROGRAMMING PROBLEMS Mokhtar S. Bazaraa and Jamie J. Goode In this paper an algorithm for solving a linearly...distance pro- gramr.ing, as in the works of Bazaraa and Goode 12], and Wolfe [16 can be used for solving this problem. Special methods that take advantage of...34 Pacific Journal of Mathematics, Volume 16, pp. 1-3, 1966. 2. M. S. Bazaraa and J. j. Goode, "An Algorithm for Finding the Shortest Element of a

  14. Particle swarm optimization - Genetic algorithm (PSOGA) on linear transportation problem

    Science.gov (United States)

    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.

  15. Linear decomposition approach for a class of nonconvex programming problems.

    Science.gov (United States)

    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.

  16. 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.

  17. 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.

  18. Acoustic reflection from the boundary of anisotropic thermoviscoelastic solid with fluid

    Indian Academy of Sciences (India)

    M D Sharma

    2009-12-01

    Vertical slownesses of waves at a boundary of an anisotropic thermoviscoelastic medium are calculated as roots of a polynomial equation of degree eight. Out of the corresponding eight waves, the four, which travel towards the boundary are identified as upgoing waves. Remaining four waves travel away from the boundary and are termed as downgoing waves. Reflection and refraction of plane harmonic acoustic waves are studied at a plane boundary between anisotropic thermoviscoelastic solid and a non-viscous fluid. At this fluid-solid interface, an incident acoustic wave through the fluid reflects back as an attenuated acoustic wave and refracts as four attenuating waves into the anisotropic base. Slowness vectors of all the waves in two media differ only in vertical components. Complex values of vertical slowness define inhomogeneous refracted waves with a fixed direction of attenuation, i.e. perpendicular to the interface. Energy partition is calculated at the interface to find energy shares of reflected and refracted waves. A part of incident energy dissipates due to interaction among the attenuated refracted waves. Numerical examples are considered to study the variations in energy shares with the direction of incident wave. For each incidence, the conservation of incident energy is verified in the presence of interaction energy. Energy partition at the interface seems to be changing very slightly with the azimuthal variations of the incident direction. Effects of anisotropy, elastic relaxation and thermal parameters on the variations in energy partition are discussed. The acoustic wave reflected from isothermal interface is much significant for incidence around some critical directions, which are analogous to the critical angles in a non-dissipative medium. The changes in thermal relaxation times and uniform temperature of the thermoviscoelastic medium do not show any significant effect on the reflected energy.

  19. Stability Problems for Chua System with One Linear Control

    Directory of Open Access Journals (Sweden)

    Camelia Pop Arieşanu

    2013-01-01

    Full Text Available A Hamilton-Poisson realization and some stability problems for a dynamical system arisen from Chua system are presented. The stability and dynamics of a linearized smooth version of the Chua system are analyzed using the Hamilton-Poisson formalism. This geometrical approach allows to deduce the nonlinear stabilization near different equilibria.

  20. Output Regulation Problem for Differentiable Families of Linear Systems

    Science.gov (United States)

    Compta, Albert; Ferrer, Josep; Peña, Marta

    2009-09-01

    Given a family of linear systems depending on a parameter varying in a differentiable manifold, we obtain sufficient conditions for the existence of a (global or local) differentiable family of controllers solving the output regulation problem for the given family. Moreover, we construct it when these conditions hold.

  1. Linear iterative technique for solution of nonlinear thermal network problems

    Energy Technology Data Exchange (ETDEWEB)

    Seabourn, C.M.

    1976-11-01

    A method for rapid and accurate solution of linear and/or nonlinear thermal network problems is described. It is a matrix iterative process that converges for nodal temperatures and variations of thermal conductivity with temperature. The method is computer oriented and can be changed easily for design studies.

  2. A Smoothing SAA Method for a Stochastic Linear Complementarity Problem

    Institute of Scientific and Technical Information of China (English)

    Zhang Jie; Zhang Hong-wei; Zhang Li-wei

    2013-01-01

    Utilizing the well-known aggregation technique, we propose a smoothing sample average approximation (SAA) method for a stochastic linear complementarity problem, where the underlying functions are represented by expectations of stochas-tic functions. The method is proved to be convergent and the preliminary numerical results are reported.

  3. MULTIPLE SOLUTIONS TO AN ASYMPTOTICALLY LINEAR ROBIN BOUNDARY VALUE PROBLEM

    Institute of Scientific and Technical Information of China (English)

    2012-01-01

    Under some weaker conditions,we prove the existence of at least two solutions to an asymptotically linear elliptic problem with Robin boundary value condition,using truncation arguments.Our results are also valid for the case of the so-called resonance at infinity.

  4. Positivity for the linearized problem for semilinear equations

    OpenAIRE

    2006-01-01

    Using recent results of M. Tang [Uniqueness of positive radial solutions for $\\Delta u − u + u^p = 0$ on an annulus, J. Differential Equations 189 (2003), no. 1, 148–160], we provide a simple approach to proving positivity for the linearized problem of semilinear equations, which is crucial for establishment of exact multiplicity results, and for symmetry breaking.

  5. An Accurate Thermoviscoelastic Rheological Model for Ethylene Vinyl Acetate Based on Fractional Calculus

    Directory of Open Access Journals (Sweden)

    Marco Paggi

    2015-01-01

    Full Text Available The thermoviscoelastic rheological properties of ethylene vinyl acetate (EVA used to embed solar cells have to be accurately described to assess the deformation and the stress state of photovoltaic (PV modules and their durability. In the present work, considering the stress as dependent on a noninteger derivative of the strain, a two-parameter model is proposed to approximate the power-law relation between the relaxation modulus and time for a given temperature level. Experimental validation with EVA uniaxial relaxation data at different constant temperatures proves the great advantage of the proposed approach over classical rheological models based on exponential solutions.

  6. STOCHASTIC LINEAR QUADRATIC OPTIMAL CONTROL PROBLEMS WITH RANDOM COEFFICIENTS

    Institute of Scientific and Technical Information of China (English)

    2000-01-01

    This paper studies a 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. The authors introduce the stochastic Riccati equation for the LQ problem. This is a backward SDE with a complicated nonlinearity and a singularity. The local solvability of such a backward SDE is established, which by no means is obvious. For the case of deterministic coefficients, some further discussions on the Riccati equations have been carried out. Finally, an illustrative example is presented.

  7. 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...... of nodes, the number of leaves, and the depth of a tree S ε {P, T}. In this article we show that the tree inclusion problem can be solved in space O(nT ) and time: Eqation Presented ∑ This improves or matches the best known time complexities while using only linear space instead of quadratic...

  8. On the linear properties of the nonlinear radiative transfer problem

    Science.gov (United States)

    Pikichyan, H. V.

    2016-11-01

    In this report, we further expose the assertions made in nonlinear problem of reflection/transmission of radiation from a scattering/absorbing one-dimensional anisotropic medium of finite geometrical thickness, when both of its boundaries are illuminated by intense monochromatic radiative beams. The new conceptual element of well-defined, so-called, linear images is noteworthy. They admit a probabilistic interpretation. In the framework of nonlinear problem of reflection/transmission of radiation, we derive solution which is similar to linear case. That is, the solution is reduced to the linear combination of linear images. By virtue of the physical meaning, these functions describe the reflectivity and transmittance of the medium for a single photon or their beam of unit intensity, incident on one of the boundaries of the layer. Thereby the medium in real regime is still under the bilateral illumination by external exciting radiation of arbitrary intensity. To determine the linear images, we exploit three well known methods of (i) adding of layers, (ii) its limiting form, described by differential equations of invariant imbedding, and (iii) a transition to the, so-called, functional equations of the "Ambartsumyan's complete invariance".

  9. Problems of linear electron (polaron) transport theory in semiconductors

    CERN Document Server

    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

  10. 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.

  11. 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.

  12. Using vector divisions in solving linear complementarity problem

    CERN Document Server

    Elfoutayeni, Youssef

    2010-01-01

    The linear complementarity problem is to find vector $z$ in $\\mathrm{IR}^{n}$ satisfying $z^{T}(Mz+q)=0$, $Mz+q\\geqslant0,$ $z\\geqslant0$, where $M$ as a matrix and $q$ as a vector, are given data; this problem becomes in present the subject of much important research because it arises in many areas and it includes important fields, we cite for example the linear and nonlinear programming, the convex quadratic programming and the variational inequalities problems, ... It is known that the linear complementarity problem is completely equivalent to solving nonlinear equation $F(x)=0$ with $F$ is a function from $\\mathrm{IR}^{n}$ into itself defined by $F(x)=(M+I)x+(M-I)|x|+q$. In this paper we propose a globally convergent hybrid algorithm for solving this equation; this method is based on an algorithm given by Shi \\cite{Y. Shi}, he uses vector divisions with the secant method; but for using this method we must have a function continuous with partial derivatives on an open set of $\\mathrm{IR}^{n}$; so we built ...

  13. Ab initio molecular dynamics study of collective dynamics in liquid Tl: Thermo-viscoelastic analysis

    Science.gov (United States)

    Bryk, Taras; Demchuk, Taras

    2017-08-01

    We studied collective dynamics of pure liquid metal Tl using a combination of ab initio molecular dynamics (AIMD) simulations and a thermoviscoelastic model applied to calculations of dynamic eigenmodes and dispersion of collective excitations in particular. We found that for liquid Tl at ambient pressure the transverse current spectral functions obtained directly in ab initio simulations for wave numbers larger than first pseudo-Brillouin-zone boundary contain two low-and high-frequency peaks that is an evidence of emergence of the unusually high-frequency transverse modes as it was observed before in liquid Li at very high pressures. The thermo-viscoelastic dynamic model shows perfect reproduction of the simulation-derived longitudinal current autocorrelation functions, and the acoustic eigenmodes are in nice agreement with the peaks of the longitudinal current spectral functions up to the first pseudo-Brillouin-zone boundary. The deviation of the dynamic eigenmodes from peak positions at higher wave numbers gives evidence of L-T coupling effects.

  14. Regularization Techniques for Linear Least-Squares Problems

    KAUST Repository

    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

  15. A new algorithm for solving linear programming problems

    Directory of Open Access Journals (Sweden)

    Andrés Leonardo Ramírez Leal

    2012-08-01

    Full Text Available Linear programming (LP is one of the most widely-applied techniques in operations research. Many methods have been developed and several others are being proposed for solving LP problems, including the famous simplex method and interior point algorithms. This study was aimed at introducing a new method for solving LP problems. The proposed algorithm starts from an interior point and then carries out orthogonal projections using parametric straight lines to move between the interior and polyhedron frontier defining the feasible region until reaching the extreme optimal point.

  16. Recent developments and open problems in linear series

    CERN Document Server

    Bauer, Thomas; Cooper, Susan; Di Rocco, Sandra; Dumnicki, Marcin; Harbourne, Brian; Jabbusch, Kelly; Knutsen, Andreas Leopold; Kuronya, Alex; Miranda, Rick; Roe, Joaquim; Schenck, Hal; Szemberg, Tomasz; Teitler, Zach

    2011-01-01

    In the week 3--9, October 2010, the Mathematisches Forschungsinstitut at Oberwolfach hosted a mini workshop Linear Series on Algebraic Varieties. These notes contain a variety of interesting problems which motivated the participants prior to the event, and examples, results and further problems which grew out of discussions during and shortly after the workshop. A lot of arguments presented here are scattered in the literature or constitute folklore. It was one of our aims to have a usable and easily accessible collection of examples and results.

  17. Discontinuous Mixed Covolume Methods for Linear Parabolic Integrodifferential Problems

    Directory of Open Access Journals (Sweden)

    Ailing Zhu

    2014-01-01

    Full Text Available The semidiscrete and fully discrete discontinuous mixed covolume schemes for the linear parabolic integrodifferential problems on triangular meshes are proposed. The error analysis of the semidiscrete and fully discrete discontinuous mixed covolume scheme is presented and the optimal order error estimate in discontinuous H(div and first-order error estimate in L2 are obtained with the lowest order Raviart-Thomas mixed element space.

  18. A full multigrid method for linear complementarity problems arising from elastic normal contact problems

    NARCIS (Netherlands)

    Zhao, J.; Vollebregt, E.A.H.; Oosterlee, C.W.

    2014-01-01

    This paper presents a full multigrid (FMG) technique, which combines a multigrid method, an active set algorithm and a nested iteration technique, to solve a linear complementarity problem (LCP) modeling elastic normal contact problems. The governing system in this LCP is derived from a Fredholm int

  19. 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.

  20. Positional and impulse strategies for linear problems of motion correction

    Science.gov (United States)

    Ananyev, B. I.; Gredasova, N. V.

    2016-12-01

    Control problems for a linear system with incomplete information are considered. It is supposed that a linear signal with an additive noise is observed. This noise along with the disturbances in the state equation is bounded by the quadratic constraints. The control action in the state equation may be contained in a compact set. In the second case, the total variation of the control is restricted. This case leads us to a sequence of impulse control actions (delta-functions). For both cases, we obtain the definite relations for optimal control actions that guarantee the minimax value of the terminal functional. We use methods of the control theory under uncertainty and the dynamic programming. Some examples from the theory of the movement of space and flight vehicles are investigated.

  1. Analyticity of solutions of analytic non-linear general elliptic boundary value problems,and some results about linear problems

    Institute of Scientific and Technical Information of China (English)

    WANG Rouhuai

    2006-01-01

    The main aim of this paper is to discuss the problem concerning the analyticity of the solutions of analytic non-linear elliptic boundary value problems.It is proved that if the corresponding first variation is regular in Lopatinski(i) sense,then the solution is analytic up to the boundary.The method of proof really covers the case that the corresponding first variation is regularly elliptic in the sense of Douglis-Nirenberg-Volevich,and hence completely generalize the previous result of C.B.Morrey.The author also discusses linear elliptic boundary value problems for systems of ellip tic partial differential equations where the boundary operators are allowed to have singular integral operators as their coefficients.Combining the standard Fourier transform technique with analytic continuation argument,the author constructs the Poisson and Green's kernel matrices related to the problems discussed and hence obtain some representation formulae to the solutions.Some a priori estimates of Schauder type and Lp type are obtained.

  2. A recurrent neural network for solving bilevel linear programming problem.

    Science.gov (United States)

    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.

  3. Strong Superconvergence of Finite Element Methods for Linear Parabolic Problems

    Directory of Open Access Journals (Sweden)

    Kening Wang

    2009-01-01

    Full Text Available We study the strong superconvergence of a semidiscrete finite element scheme for linear parabolic problems on =Ω×(0,], where Ω is a bounded domain in ℛ(≤4 with piecewise smooth boundary. We establish the global two order superconvergence results for the error between the approximate solution and the Ritz projection of the exact solution of our model problem in 1,(Ω and ( with 2≤<∞ and the almost two order superconvergence in 1,∞(Ω and ∞(. Results of the =∞ case are also included in two space dimensions (=1 or 2. By applying the interpolated postprocessing technique, similar results are also obtained on the error between the interpolation of the approximate solution and the exact solution.

  4. Parallel Implementation of Linear Algebra Problems on Dawning—1000

    Institute of Scientific and Technical Information of China (English)

    迟学斌

    1998-01-01

    In this paper,some parallel algorithms are described for solving numerical linear algebra problems on Dawning-1000.They include matrix multiplication,LU factorization of a dense matrix,Cholesky factorization of a symmetric matrix,and eigendecomposition of symmetric matrix for real and complex data types.These programs are constructed based on fast BLAS library of Dawning-1000 under NX environment.Some comparison results under different parallel environments and implementing methods are also given for Cholesky factorization.The execution time,measured performance and speedup for each problem on Dawning-1000 are shown.For matrix multiplication and IU factorization,1.86GFLOPS and 1.53GFLOPS are reached.

  5. Three-Dimensional Problems of Thermoviscoplasticity: Focus on Ukrainian Research (Review)

    Science.gov (United States)

    Shevchenko, Yu. N.; Savchenko, V. G.

    2016-05-01

    Methods and results of studying the three-dimensional viscoplastic stress-strain state of engineering structures under thermomechanical loading are presented. The following classes of thermoviscoelastic problems are considered: axisymmetric problems, nonaxisymmetric problems for bodies of revolution, three-dimensional problems for arbitrarily shaped bodies, three-dimensional problems for isotropic and anisotropic bodies of revolution

  6. SEQUENTIAL SYSTEMS OF LINEAR EQUATIONS ALGORITHM FOR NONLINEAR OPTIMIZATION PROBLEMS - INEQUALITY CONSTRAINED PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    Zi-you Gao; Tian-de Guo; Guo-ping He; Fang Wu

    2002-01-01

    In this paper, a new superlinearly convergent algorithm of sequential systems of linear equations (SSLE) for nonlinear optimization problems with inequality constraints is proposed. Since the new algorithm only needs to solve several systems of linear equations having a same coefficient matrix per iteration, the computation amount of the algorithm is much less than that of the existing SQP algorithms per iteration. Moreover, for the SQPtype algorithms, there exist so-called inconsistent problems, i.e., quadratic programming subproblems of the SQP algorithms may not have a solution at some iterations, but this phenomenon will not occur with the SSLE algorithms because the related systems of linear equations always have solutions. Some numerical results are reported.

  7. Linearization of the boundary-layer equations of the minimum time-to-climb problem

    Science.gov (United States)

    Ardema, M. D.

    1979-01-01

    Ardema (1974) has formally linearized the two-point boundary value problem arising from a general optimal control problem, and has reviewed the known stability properties of such a linear system. In the present paper, Ardema's results are applied to the minimum time-to-climb problem. The linearized zeroth-order boundary layer equations of the problem are derived and solved.

  8. CONDITION NUMBER FOR WEIGHTED LINEAR LEAST SQUARES PROBLEM

    Institute of Scientific and Technical Information of China (English)

    Yimin Wei; Huaian Diao; Sanzheng Qiao

    2007-01-01

    In this paper,we investigate the condition numbers for the generalized matrix inversion and the rank deficient linear least squares problem:minx ||Ax-b||2,where A is an m-by-n (m≥n)rank deficient matrix.We first derive an explicit expression for the condition number in the weighted Frobenius norm || [AT,βb]||F of the data A and b,where T is a positive diagonal matrix and β is a positive scalar.We then discuss the sensitivity of the standard 2-norm condition numbers for the generalized matrix inversion and rank deficient least squares and establish relations between the condition numbers and their condition numbers called level-2 condition numbers.

  9. 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.

  10. Output regulation problem for discrete-time linear time-delay systems by output feedback control

    Institute of Scientific and Technical Information of China (English)

    Yamin YAN; Jie HUANG

    2016-01-01

    In this paper, we study the output regulation problem of discrete linear time-delay systems by output feedback control. We have established some results parallel to those for the output regulation problem of continuous linear time-delay systems.

  11. Lamb's problem for a linear viscoelastic medium

    Energy Technology Data Exchange (ETDEWEB)

    Pound, Michael J.

    1988-02-01

    Lamb's problem for an elastic medium is one of the fundamental theoretical problems in mathematical seismology. It has been essential to the understanding of the basic interaction of waves with surfaces, including the production of such surface effects as Rayleigh waves and head waves. All real materials, however, exhibit some dissipation, and the combined effect of dissipation and surface interactions has not been well understood, particularly in the case of transient phenomena. In this work, the distance generated in a semi-infinite linear viscoelastic medium due to an impulsive line load applied normally to the surface is investigated. Uniform asymptotic techniques based on the method of steepest descent are developed to construct the long-time solution for the half-space. It is found that the solution for long times consists primarily of a set of small amplitude ''precursor'' signals whose properties are determined largely by the initial elastic response of the medium, and a set of much larger amplitude smooth waves. It is these smooth waves, analogous to the viscoelastic ''main'' waves of one-dimensional studies, which occupy the bulk of the analysis, and some of these signals are found to exhibit some interesting and unexpected properties. The Archenbach-Chao solid (ACS) model was selected as the material model for this study primarily because of its desirable physical and mathematical properties, but the results are applicable, both qualitatively and quantitatively, to a broad class of viscoelastic materials that exhibit initial elasticity and have bounded creep function. 103 refs., 24 figs.

  12. An approach to dark energy problem through linear invariants

    Institute of Scientific and Technical Information of China (English)

    Jeong Ryeol Choi

    2011-01-01

    The time evolution of vacuum energy density is investigated in the coherent states of inflationary universe using a linear invariant approach. The linear invariants we derived are represented in terms of annihilation operators. On account of the fact that

  13. Goal-oriented reduced basis approximation for linear elastodynamic problems

    CERN Document Server

    Hoang, Khac Chi; Bordas, Stephane P A

    2013-01-01

    In this paper, we study numerically the linear damped second-order hyperbolic partial differential equation (PDE) with affine parameter dependence using a goal-oriented approach by finite element (FE) and reduced basis (RB) methods. The main contribution of this paper is the "goal-oriented" proper orthogonal decomposition (POD)-Greedy sampling procedure within the RB approximation context. This proposed procedure makes use of the information of the solution of the associated dual (or adjoint) problem and the primal residual similarly to the well-known dual-weighted residual (DWR) technique developed earlier. First, we introduce the RB recipe: Galerkin projection onto a space $Y_N$ spanned by solutions of the governing PDE at $N$ selected points in parameter space. This set of $N$ parameter points is constructed very optimally by the proposed goal-oriented POD-Greedy sampling procedure. Second, based on the affine parameter dependence, we make use of the offline-online computational procedures: in the offline ...

  14. An efficient method for generalized linear multiplicative programming problem with multiplicative constraints

    OpenAIRE

    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 so...

  15. 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....

  16. The Regular Free-Endpoint Linear Quadratic Problem with Indefinite Cost

    NARCIS (Netherlands)

    Trentelman, Hendrikus

    1989-01-01

    This paper studies an open problem in the context of linear quadratic optimal control, the free-endpoint regular linear quadratic problem with indefinite cost functional. It is shown that the optimal cost for this problem is given by a particular solution of the algebraic Riccati equation. This

  17. Answers to selected problems in multivariable calculus with linear algebra and series

    CERN Document Server

    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

  18. Inverse Eigenvalue Problems for a Structure with Linear Parameters

    Institute of Scientific and Technical Information of China (English)

    WU Liang-sheng; YANG Jia-hua; WEI Yuan-qian; MEN Hao; YANG Qing-kun; LIU Zhen-yu

    2005-01-01

    The inverse design method of a dynamic system with linear parameters has been studied. For some specified eigenvalues and eigenvectors, the design parameter vector which is often composed of whole or part of coefficients of spring and mass of the system can be obtained and the rigidity and mass matrices of an initially designed structure can be reconstructed through solving linear algebra equations. By using implicit function theorem, the conditions of existence and uniqueness of the solution are also deduced. The theory and method can be used for inverse vibration design of complex structure system.

  19. A Novel Tabular Form of the Simplex Method for Solving Linear Programming Problems

    Directory of Open Access Journals (Sweden)

    Akaninyene Obot

    2016-01-01

    Full Text Available A new tabular form of the simplex method for solving linear programming problems is presented in this paper. There are many variants of the simplex method. The existing different tabular forms of the simplex method are difficult to comprehend, boring, not straight forward, confusing and tedious. The results obtained based on the proposed method are simpler and computationally more efficient for calculations of linear programs, than other competing simplex methods by other writers. The proposed method could be applied to solve Operations Research based problems in fuzzy linear programming, goal programming, transportation and assignment problems, game problems, and for carrying out sensitivity analysis in linear programming.

  20. A parallel linear system solver for circuit simulation problems

    NARCIS (Netherlands)

    Bomhof, W.; Vorst, H.A. van der

    2001-01-01

    This paper presents a parallel mixed direct/iterative method for solving linear systems Ax = b arising from circuit simulation. The systems are solved by a block LU factorization with an iterative method for the Schur complement. The Schur complement is a small and rather dense matrix. Direct LU

  1. An approach to dark energy problem through linear invariants

    Institute of Scientific and Technical Information of China (English)

    Jeong Ryeol Choi

    2011-01-01

    The time evolution of vacuum energy density is investigated in the coherent states of inflationary universe using a linear invariant approach. The linear invariants we derived are represented in terms of annihilation operators. On account of the fact that the coherent state is an eigenstate of an annihilation operator, the wave function.in the coherent state is easily evaluated by solving the eigenvalue equation of the linear invariants. The expectation value of the vacuum energy density is derived using this wave function.Fluctuations of the scalar field and its conjugate momentum are also investigated. Our theory based on the linear invariant shows that the vacuum energy density of the universe in a coherent state is decreased continuously with time due to nonconservative force acting on the coherent oscillations of the scalar field,which is provided by the expansion of the universe. In effect, our analysis reveals that the vacuum energy density decreases in proportion to t-β where β is 3/2 for radiation-dominated era and 2 for matter-dominated era. In the case where the duration term of radiation-dominated era is short enough to be negligible, the estimation of the relic vacuum energy density agrees well with the current observational data.

  2. A linear regression solution to the spatial autocorrelation problem

    Science.gov (United States)

    Griffith, Daniel A.

    The Moran Coefficient spatial autocorrelation index can be decomposed into orthogonal map pattern components. This decomposition relates it directly to standard linear regression, in which corresponding eigenvectors can be used as predictors. This paper reports comparative results between these linear regressions and their auto-Gaussian counterparts for the following georeferenced data sets: Columbus (Ohio) crime, Ottawa-Hull median family income, Toronto population density, southwest Ohio unemployment, Syracuse pediatric lead poisoning, and Glasgow standard mortality rates, and a small remotely sensed image of the High Peak district. This methodology is extended to auto-logistic and auto-Poisson situations, with selected data analyses including percentage of urban population across Puerto Rico, and the frequency of SIDs cases across North Carolina. These data analytic results suggest that this approach to georeferenced data analysis offers considerable promise.

  3. An approach to the linear multivariable servomechanism problem.

    Science.gov (United States)

    Young, P. C.; Willems, J. C.

    1972-01-01

    This paper presents a state-space approach to the multivariable 'type one' servomechanism problem. Necessary and sufficient conditions for the controllability of such systems are derived and applied to the observability of the (dual) state reconstructor problem for a system with an unknown constant input. The paper also presents a simple systematic design algorithm which provides type one servomechanism performance to command inputs, together with pre-specified closed-loop pole locations. Examples are given to illustrate the utility of the design procedure.

  4. Solutions of Multi Objective Fuzzy Transportation Problems with Non-Linear Membership Functions

    Directory of Open Access Journals (Sweden)

    Dr. M. S. Annie Christi

    2016-11-01

    Full Text Available Multi-objective transportation problem with fuzzy interval numbers are considered. The solution of linear MOTP is obtained by using non-linear membership functions. The optimal compromise solution obtained is compared with the solution got by using a linear membership function. Some numerical examples are presented to illustrate this.

  5. 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...

  6. Linear problems and Baecklund transformations for the Hirota-Ohta system

    Energy Technology Data Exchange (ETDEWEB)

    Adler, V.E., E-mail: adler@itp.ac.r [L.D. Landau Institute for Theoretical Physics, Chernogolovka (Russian Federation); Postnikov, V.V., E-mail: postnikovvv@rambler.r [Sochi Branch of Peoples' Friendship University of Russia, Sochi (Russian Federation)

    2011-01-17

    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.

  7. 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

    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...

  8. Forward-backward Stochastic Differential Equations and Backward Linear Quadratic Stochastic Optimal Control Problem

    Institute of Scientific and Technical Information of China (English)

    ZHANG DE-TAO

    2009-01-01

    In this paper, we use the solutions of forward-backward stochastic differential equations to get the optimal control for backward stochastic linear quadratic optimal control problem. And we also give the linear feedback regulator for the optimal control problem by using the solutions of a group of Riccati equations.

  9. A Hamiltonian-based solution to the linear quadratic consensus control problem

    NARCIS (Netherlands)

    Weiss, M.

    2012-01-01

    The Linear Quadratic Consensus Control (LQCC) problem is a relaxation of the classical Linear Quadratic Regulation (LQR) problem, that consists of asymptotically driving the state of the system to a "consensus" point in which all coordinates are equal, in such a way that a quadratic cost function on

  10. An Effective Hybrid Artificial Bee Colony Algorithm for Nonnegative Linear Least Squares Problems

    Directory of Open Access Journals (Sweden)

    Xiangyu Kong

    2014-07-01

    Full Text Available An effective hybrid artificial bee colony algorithm is proposed in this paper for nonnegative linear least squares problems. To further improve the performance of algorithm, orthogonal initialization method is employed to generate the initial swarm. Furthermore, to balance the exploration and exploitation abilities, a new search mechanism is designed. The performance of this algorithm is verified by using 27 benchmark functions and 5 nonnegative linear least squares test problems. And the comparison analyses are given between the proposed algorithm and other swarm intelligence algorithms. Numerical results demonstrate that the proposed algorithm displays a high performance compared with other algorithms for global optimization problems and nonnegative linear least squares problems.

  11. Variation-difference method for solving boundary value problems for linear elliptic complex equations

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    This paper deals with boundary value problems for linear uniformly elliptic systems. First the general linear uniformly elliptic system of the first order equations is reduced to complex form, and then the compound boundary value problem for the complex equations of the first order is discussed. The approximate solutions of the boundary value problem are found by the variation-difference method, and the error estimates for the approximate solutions are derived.Finally the approximate method of the oblique derivative problem for linear uniformly elliptic equations of the second or der is introduced.

  12. A Comparative Study of Redundant Constraints Identification Methods in Linear Programming Problems

    Directory of Open Access Journals (Sweden)

    Paulraj S.

    2010-01-01

    Full Text Available The objective function and the constraints can be formulated as linear functions of independent variables in most of the real-world optimization problems. Linear Programming (LP is the process of optimizing a linear function subject to a finite number of linear equality and inequality constraints. Solving linear programming problems efficiently has always been a fascinating pursuit for computer scientists and mathematicians. The computational complexity of any linear programming problem depends on the number of constraints and variables of the LP problem. Quite often large-scale LP problems may contain many constraints which are redundant or cause infeasibility on account of inefficient formulation or some errors in data input. The presence of redundant constraints does not alter the optimal solutions(s. Nevertheless, they may consume extra computational effort. Many researchers have proposed different approaches for identifying the redundant constraints in linear programming problems. This paper compares five of such methods and discusses the efficiency of each method by solving various size LP problems and netlib problems. The algorithms of each method are coded by using a computer programming language C. The computational results are presented and analyzed in this paper.

  13. The Solution Structure and Error Estimation for The Generalized Linear Complementarity Problem

    Directory of Open Access Journals (Sweden)

    Tingfa Yan

    2014-07-01

    Full Text Available In this paper, we consider the generalized linear complementarity problem (GLCP. Firstly, we develop some equivalent reformulations of the problem under milder conditions, and then characterize the solution of the GLCP. Secondly, we also establish the global error estimation for the GLCP by weakening the assumption. These results obtained in this paper can be taken as an extension for the classical linear complementarity problems.

  14. Linearized primal-dual methods for linear inverse problems with total variation regularization and finite element discretization

    Science.gov (United States)

    Tian, Wenyi; Yuan, Xiaoming

    2016-11-01

    Linear inverse problems with total variation regularization can be reformulated as saddle-point problems; the primal and dual variables of such a saddle-point reformulation can be discretized in piecewise affine and constant finite element spaces, respectively. Thus, the well-developed primal-dual approach (a.k.a. the inexact Uzawa method) is conceptually applicable to such a regularized and discretized model. When the primal-dual approach is applied, the resulting subproblems may be highly nontrivial and it is necessary to discuss how to tackle them and thus make the primal-dual approach implementable. In this paper, we suggest linearizing the data-fidelity quadratic term of the hard subproblems so as to obtain easier ones. A linearized primal-dual method is thus proposed. Inspired by the fact that the linearized primal-dual method can be explained as an application of the proximal point algorithm, a relaxed version of the linearized primal-dual method, which can often accelerate the convergence numerically with the same order of computation, is also proposed. The global convergence and worst-case convergence rate measured by the iteration complexity are established for the new algorithms. Their efficiency is verified by some numerical results.

  15. An Effective Algorithm for Globally Solving Sum of Linear Ratios Problems

    Directory of Open Access Journals (Sweden)

    Hongwei Jiao

    2017-01-01

    Full Text Available In this study, we propose an effective algorithm for globally solving the sum of linear ratios problems. Firstly, by introducing new variables, we transform the initial problem into an equivalent nonconvex programming problem. Secondly, by utilizing direct relaxation, the linear relaxation programming problem of the equivalent problem can be constructed. Thirdly, in order to improve the computational efficiency of the algorithm, an out space pruning technique is derived, which offers a possibility of pruning a large part of the out space region which does not contain the optimal solution of the equivalent problem. Fourthly, based on out space partition, by combining bounding technique and pruning technique, a new out space branch-and-bound algorithm for globally solving the sum of linear ratios problems (SLRP is designed. Finally, numerical experimental results are presented to demonstrate both computational efficiency and solution quality of the proposed algorithm.

  16. 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.

  17. An introduction to fuzzy linear programming problems theory, methods and applications

    CERN Document Server

    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.

  18. Global Optimization for Sum of Linear Ratios Problem Using New Pruning Technique

    Directory of Open Access Journals (Sweden)

    2009-02-01

    Full Text Available A global optimization algorithm is proposed for solving sum of general linear ratios problem (P using new pruning technique. Firstly, an equivalent problem (P1 of the (P is derived by exploiting the characteristics of linear constraints. Then, by utilizing linearization method the relaxation linear programming (RLP of the (P1 can be constructed and the proposed algorithm is convergent to the global minimum of the (P through the successive refinement of the linear relaxation of feasible region and solutions of a series of (RLP. Then, a new pruning technique is proposed, this technique offers a possibility to cut away a large part of the current investigated feasible region by the optimization algorithm, which can be utilized as an accelerating device for global optimization of problem (P. Finally, the numerical experiments are given to illustrate the feasibility of the proposed algorithm.

  19. Partial Stability Approach to Consensus Problem of Linear Multi-agent Systems

    Institute of Scientific and Technical Information of China (English)

    CHEN Yang-Zhou; GE Yan-Rong; ZHANG Ya-Xiao

    2014-01-01

    A linear transformation is proposed to deal with the consensus problem of high-order linear multi-agent systems (LMASs). In virtue of the linear transformation, the consensus problem is equivalently translated into a partial stability problem. We discuss three issues of the LMASs under a generalized linear protocol: 1) to find criteria of consensus convergence;2) to calculate consensus function; 3) to design gain matrices in the linear consensus protocol. Precisely, we provide a necessary and sufficient criterion of consensus convergence in terms of Hurwitz stability of a matrix and give an analytical expression of the consensus function. In addition, we set up a relation between the gain matrices in the protocol and the convergence time and consensus accuracy of the agents, and then design the gain matrices with respect to a pre-specified convergence time and a required consensus accuracy.

  20. The Expansion of Dynamic Solving Process About a Class of Non-linear Programming Problems

    Institute of Scientific and Technical Information of China (English)

    ZANG Zhen-chun

    2001-01-01

    In this paper, we research non-linear programming problems which have a given specialstructure, some simple forms of this kind structure have been solved in some papers, here we focus on othercomplex ones.

  1. Linear Time Approximation Schemes for the Gale-Berlekamp Game and Related Minimization Problems

    CERN Document Server

    Karpinski, Marek

    2008-01-01

    We design a linear time approximation scheme for the Gale-Berlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest Codeword Problem (NCP) and Unique Games Problem. Further applications include, among other things, finding a constrained form of matrix rigidity and maximum likelihood decoding of an error correcting code. As another application of our method we give the first linear time approximation schemes for correlation clustering with a fixed number of clusters and its hierarchical generalization. Our results depend on a new technique for dealing with small objective function values of optimization problems and could be of independent interest.

  2. Reduced-Size Integer Linear Programming Models for String Selection Problems: Application to the Farthest String Problem.

    Science.gov (United States)

    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.

  3. EZLP: An Interactive Computer Program for Solving Linear Programming Problems. Final Report.

    Science.gov (United States)

    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,…

  4. A CLASS OF ASYNCHRONOUS PARALLEL MULTISPLITTING RELAXATION METHODS FOR LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    Zhong-zhi Bai; Yu-guang Huang

    2003-01-01

    Asynchronous parallel multisplitting relaxation methods for solving large sparse linear complementarity problems are presented, and their convergence is proved when the system matrices are H-matrices having positive diagonal elements. Moreover, block and multi-parameter variants of the new methods, together with their convergence properties,are investigated in detail. Numerical results show that these new methods can achieve high parallel efficiency for solving the large sparse linear complementarity problems on multiprocessor systems.

  5. A goal programming procedure for solving fuzzy multiobjective fractional linear programming problems

    OpenAIRE

    Tunjo Perić; Zoran Babić; Sead Rešić

    2014-01-01

    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.

  6. Numerical approximation for the infinite-dimensional discrete-time optimal linear-quadratic regulator problem

    Science.gov (United States)

    Gibson, J. S.; Rosen, I. G.

    1988-01-01

    An abstract approximation framework is developed for the finite and infinite time horizon discrete-time linear-quadratic regulator problem for systems whose state dynamics are described by a linear semigroup of operators on an infinite dimensional Hilbert space. The schemes included the framework yield finite dimensional approximations to the linear state feedback gains which determine the optimal control law. Convergence arguments are given. Examples involving hereditary and parabolic systems and the vibration of a flexible beam are considered. Spline-based finite element schemes for these classes of problems, together with numerical results, are presented and discussed.

  7. A two-phase linear programming approach for redundancy allocation problems

    Directory of Open Access Journals (Sweden)

    Hsieh Yi-Chih

    2002-01-01

    Full Text Available Provision of redundant components in parallel is an efficient way to increase the system reliability, however, the weight, volume and cost of the system will increase simultaneously. This paper proposes a new two-phase linear programming approach for solving the nonlinear redundancy allocation problems subject to multiple linear constraints. The first phase is used to approximately allocate the resource by using a general linear programming, while the second phase is used to re-allocate the slacks of resource by using a 0-1 integer linear programming. Numerical results demonstrate the effectiveness and efficiency of the proposed approach.

  8. Report on article The Travelling Salesman Problem: A Linear Programming Formulation

    CERN Document Server

    Hofman, Radoslaw

    2008-01-01

    This article describes counter example prepared in order to prove that linear formulation of TSP problem proposed in [arXiv:0803.4354] is incorrect (it applies also to QAP problem formulation in [arXiv:0802.4307]). Article refers not only to model itself, but also to ability of extension of proposed model to be correct.

  9. A Novel Linear Programming Formulation of Maximum Lifetime Routing Problem in Wireless Sensor Networks

    DEFF Research Database (Denmark)

    Cetin, Bilge Kartal; Prasad, Neeli R.; Prasad, Ramjee

    2011-01-01

    of the maximum lifetime routing problem that considers the operation modes of the node. Solution of the linear programming gives the upper analytical bound for the network lifetime. In order to illustrate teh application of the optimization model, we solved teh problem for different parameter settings...

  10. Interactive Fuzzy Programming for Stochastic Two-level Linear Programming Problems through Probability Maximization

    OpenAIRE

    M Sakawa; Kato, K.

    2009-01-01

    This paper considers stochastic two-level linear programming problems. Using the concept of chance constraints and probability maximization, original problems are transformed into deterministic ones. An interactive fuzzy programming method is presented for deriving a satisfactory solution efficiently with considerations of overall satisfactory balance.

  11. Illusion of Linearity in Geometry: Effect in Multiple-Choice Problems

    Science.gov (United States)

    Vlahovic-Stetic, Vesna; Pavlin-Bernardic, Nina; Rajter, Miroslav

    2010-01-01

    The aim of this study was to examine if there is a difference in the performance on non-linear problems regarding age, gender, and solving situation, and whether the multiple-choice answer format influences students' thinking. A total of 112 students, aged 15-16 and 18-19, were asked to solve problems for which solutions based on proportionality…

  12. Linearization of a Matrix Riccati Equation Associated to an Optimal Control Problem

    Directory of Open Access Journals (Sweden)

    Foued Zitouni

    2014-01-01

    Full Text Available The matrix Riccati equation that must be solved to obtain the solution to stochastic optimal control problems known as LQG homing is linearized for a class of processes. The results generalize a theorem proved by Whittle and the one-dimensional case already considered by the authors. A particular two-dimensional problem is solved explicitly.

  13. Solving fully fuzzy multiple objective linear programming problems: A new perspective

    OpenAIRE

    A. Hadi-Vencheh; Z Rezaei; S. Razipour

    2014-01-01

    In this paper a systematic process has been proposed to solve a fully fuzzy multi objective linear programming problem (FFMOLPP). Using the utility vector the MOLPP is transferred to a single objective programming and this single fuzzy object problem is simply solved by one of the fuzzy approaches.A numerical example is then given to show applicability of the proposed approach.

  14. ASYMPTOTIC ESTIMATION FOR SOLUTION OF A CLASS OF SEMI-LINEAR ROBIN PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    Cheng Ouyang

    2005-01-01

    A class of semi-linear Robin problem is considered. Under appropriate assumptions, the existence and asymptotic behavior of its solution are studied more carefully. Using stretched variables, the formal asymptotic expansion of solution for the problem is constructed and the uniform validity of the solution is obtained by using the method of upper and lower solution.

  15. Students' Reported Justifications for Their Representational Choices in Linear Function Problems: An Interview Study

    Science.gov (United States)

    Acevedo Nistal, Ana; Van Dooren, Wim; Verschaffel, Lieven

    2013-01-01

    Thirty-six secondary school students aged 14-16 were interviewed while they chose between a table, a graph or a formula to solve three linear function problems. The justifications for their choices were classified as (1) task-related if they explicitly mentioned the to-be-solved problem, (2) subject-related if students mentioned their own…

  16. A NEW MODIFIED APPROACH USING BEST CANDIDATES METHOD FOR SOLVING LINEAR ASSIGNMENT PROBLEMS

    Directory of Open Access Journals (Sweden)

    ABDALLAH A. HLAYEL

    2013-05-01

    Full Text Available There is an increasing awareness among modern business, engineers, managers, and planners to design and operate their systems even to minimize cost, or to maximum profit (maximum efficiency/business benefits. Accordingly, significant work has been done on business (specially, on manufacturing system operations for total demand and on the optimal allocation of resources available. Linear Assignment Problems (LAP is one of the most important optimization problem solving methods (in Operation Research support this problem. Thispaper proposes a new modifications on the Best Candidates Method (BCM and compares the proposed method with other Linear Programming (LP methods in solving Linear Assignment Problems (LAP. In general, there are many development approaches for LAP to reach the optimal solution through minimize or maximize the objective function. Each problem solving technique (method has its own time complexity, and solution optimality. Some methods can be used successfully when dealing with small scale problems, while they considered as an inefficient method when solving large scale problems. Performance of different LAP problem solving methods is presented because of their wide used in different area of optimization problems. We introduce our new modifications on BCM in solving LAP problems which has a significant improvements in the number of combinations and searching strategy.

  17. A Generalized Multiscale Finite Element Method for Poroelasticity Problems I: Linear Problems

    CERN Document Server

    Brown, Donald L

    2015-01-01

    In this paper, we consider the numerical solution of poroelasticity problems that are of Biot type and develop a general algorithm for solving coupled systems. We discuss the challenges associated with mechanics and flow problems in heterogeneous media. The two primary issues being the multiscale nature of the media and the solutions of the fluid and mechanics variables traditionally developed with separate grids and methods. For the numerical solution we develop and implement a Generalized Multiscale Finite Element Method (GMsFEM) that solves problem on a coarse grid by constructing local multiscale basis functions. The procedure begins with construction of multiscale bases for both displacement and pressure in each coarse block. Using a snapshot space and local spectral problems, we construct a basis of reduced dimension. Finally, after multiplying by a multiscale partitions of unity, the multiscale basis is constructed in the offline phase and the coarse grid problem then can be solved for arbitrary forcin...

  18. A Novel Linear Programming Formulation of Maximum Lifetime Routing Problem in Wireless Sensor Networks

    DEFF Research Database (Denmark)

    Cetin, Bilge Kartal; Prasad, Neeli R.; Prasad, Ramjee

    2011-01-01

    of the maximum lifetime routing problem that considers the operation modes of the node. Solution of the linear programming gives the upper analytical bound for the network lifetime. In order to illustrate teh application of the optimization model, we solved teh problem for different parameter settings...... 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...

  19. Problem of probabilistic calculation of the design on linearly and non-linearly deformable basis with casual parameters

    Directory of Open Access Journals (Sweden)

    Mkrtychev Oleg Vartanovich

    Full Text Available In the article the problem of calculation of a construction basis system in case of earthquake is considered taking into account casual properties of basis soil in various points of the soil body. As a stochastic function in the calculation of linearly deformable basis, the deformation module, which accepts different values in the direction x, y, z, was chosen. In the calculation of the system on non-linearly deformable basis as incidentally distributed sizes the following parameters were accepted: deformation module, shear modulus, specific adhesion, angle of internal friction. The authors of the article offer to consider initial seismic influence in the form of casual stationary process. In order to solve such problems modern software systems are proposed that solve differential equations of motion via direct integration with explicit schemes. The calculation in this case will be held on the synthesized accelerograms. A short review of the task solution of the beam lying on elastic basis, which was received by D.N. Sobolev at casual distribution of pastel coefficient in the direction x, is provided in article. In order to define the objective, D.N. Sobolev gives expressions for a population mean and correlation function of stochastic function. As a result of the task solution population means and dispersions of function of movements and its derivatives were received. The problem formulation considered in the article is more complicated, but at the same time important from a practical standpoint.

  20. On the Minimum Attention and the Anytime Attention Control Problems for Linear Systems: A Linear Programming Approach

    CERN Document Server

    Donkers, M C F; Heemels, W P M H

    2011-01-01

    In this paper, we present two control laws that are tailored for control applications in which computational and/or communication resources are scarce. Namely, we consider minimum attention control, where the `attention' that a control task requires is minimised given certain performance requirements, and anytime attention control, where the performance under the `attention' given by a scheduler is maximised. Here, we interpret `attention' as the inverse of the time elapsed between two consecutive executions of a control task. By focussing on linear plants, by allowing for only a finite number of possible intervals between two subsequent executions of the control task, by making a novel extension to the notion of control Lyapunov functions and taking these novel extended control Lyapunov function to be infinity-norm-based, we can formulate the aforementioned control problems as online linear programs, which can be solved efficiently. Furthermore, we provide techniques to construct suitable infinity-norm-based...

  1. On high-continuity transfinite element formulations for linear-nonlinear transient thermal problems

    Science.gov (United States)

    Tamma, Kumar K.; Railkar, Sudhir B.

    1987-01-01

    This paper describes recent developments in the applicability of a hybrid transfinite element methodology with emphasis on high-continuity formulations for linear/nonlinear transient thermal problems. The proposed concepts furnish accurate temperature distributions and temperature gradients making use of a relatively smaller number of degrees of freedom; and the methodology is applicable to linear/nonlinear thermal problems. Characteristic features of the formulations are described in technical detail as the proposed hybrid approach combines the major advantages and modeling features of high-continuity thermal finite elements in conjunction with transform methods and classical Galerkin schemes. Several numerical test problems are evaluated and the results obtained validate the proposed concepts for linear/nonlinear thermal problems.

  2. Linear discrete-time Pareto-Nash-Stackelberg control problem and principles for its solving

    Directory of Open Access Journals (Sweden)

    Valeriu Ungureanu

    2013-04-01

    Full Text Available A direct-straightforward method for solving linear discrete-time optimal control problem is applied to solve control problem of a linear discrete-time system as a mixture of multi-criteria Stackelberg and Nash games. For simplicity, the exposure starts with the simplest case of linear discrete-time optimal control problem and, by sequential considering of more general cases, investigation finalizes with the highlighted Pareto-Nash-Stackelberg and set valued control problems. Different principles of solving are compared and their equivalence is proved. Mathematics Subject Classification 2010: 49K21, 49N05, 93C05, 93C55, 90C05, 90C29, 91A10, 91A20, 91A44, 91A50.

  3. Some comparison of restarted GMRES and QMR for linear and nonlinear problems

    Energy Technology Data Exchange (ETDEWEB)

    Morgan, R. [Baylor Univ., Waco, TX (United States); Joubert, W. [Los Alamos National Lab., NM (United States)

    1994-12-31

    Comparisons are made between the following methods: QMR including its transpose-free version, restarted GMRES, and a modified restarted GMRES that uses approximate eigenvectors to improve convergence, For some problems, the modified GMRES is competitive with or better than QMR in terms of the number of matrix-vector products. Also, the GMRES methods can be much better when several similar systems of linear equations must be solved, as in the case of nonlinear problems and ODE problems.

  4. Solution to the Generalized Champagne Problem on simultaneous stabilization of linear systems

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    The well-known Generalized Champagne Problem on simultaneous stabilization of linear systems is solved by using complex analysis and Blondel's technique. We give a complete answer to the open problem proposed by Patel et al., which automatically includes the solution to the original Champagne Problem. Based on the recent development in automated inequality-type theorem proving, a new stabilizing controller design method is established. Our numerical examples significantly improve the relevant results in the literature.

  5. A new neural network model for solving random interval linear programming problems.

    Science.gov (United States)

    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.

  6. 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.

  7. A Fast Condensing Method for Solution of 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 we...... 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...... 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...

  8. Solutions to estimation problems for scalar hamilton-jacobi equations using linear programming

    KAUST Repository

    Claudel, Christian G.

    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.

  9. Potential function methods for approximately solving linear programming problems theory and practice

    CERN Document Server

    Bienstock, Daniel

    2002-01-01

    Potential Function Methods For Approximately Solving Linear Programming Problems breaks new ground in linear programming theory. The book draws on the research developments in three broad areas: linear and integer programming, numerical analysis, and the computational architectures which enable speedy, high-level algorithm design. During the last ten years, a new body of research within the field of optimization research has emerged, which seeks to develop good approximation algorithms for classes of linear programming problems. This work both has roots in fundamental areas of mathematical programming and is also framed in the context of the modern theory of algorithms. The result of this work, in which Daniel Bienstock has been very much involved, has been a family of algorithms with solid theoretical foundations and with growing experimental success. This book will examine these algorithms, starting with some of the very earliest examples, and through the latest theoretical and computational developments.

  10. ORDER RESULTS OF GENERAL LINEAR METHODS FOR MULTIPLY STIFF SINGULAR PERTURBATION PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    Si-qing Gan; Geng Sun

    2002-01-01

    In this paper we analyze the error behavior of general linear methods applied to some classes of one-parameter multiply stiff singularly perturbed problems. We obtain the global error estimate of algebraically and diagonally stable general linear methods. The main result of this paper can be viewed as an extension of that obtained by Xiao [13] for the case of Runge-Kutta methods.

  11. A Tight Linearization Strategy for Zero-One Quadratic Programming Problems

    CERN Document Server

    gharibi, Wajeb

    2012-01-01

    In this paper, we present a new approach to linearizing zero-one quadratic minimization problem which has many applications in computer science and communications. Our algorithm is based on the observation that the quadratic term of zero-one variables has two equivalent piece-wise formulations, convex and concave cases. The convex piece-wise objective function and/or constraints play a great role in deducing small linearization. Further tight strategies are also discussed.

  12. Simplified neural networks for solving linear least squares and total least squares problems in real time.

    Science.gov (United States)

    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.

  13. Solution for integer linear bilevel programming problems using orthogonal genetic algorithm

    Institute of Scientific and Technical Information of China (English)

    Hong Li; Li Zhang; Yongchang Jiao

    2014-01-01

    An integer linear bilevel programming problem is firstly transformed into a binary linear bilevel programming problem, and then converted into a single-level binary implicit program-ming. An orthogonal genetic algorithm is developed for solving the binary linear implicit programming problem based on the ortho-gonal design. The orthogonal design with the factor analysis, an experimental design method is applied to the genetic algorithm to make the algorithm more robust, statistical y sound and quickly convergent. A crossover operator formed by the orthogonal array and the factor analysis is presented. First, this crossover operator can generate a smal but representative sample of points as off-spring. After al of the better genes of these offspring are selected, a best combination among these offspring is then generated. The simulation results show the effectiveness of the proposed algo-rithm.

  14. A study of the associated linear problem for q-P{sub V}

    Energy Technology Data Exchange (ETDEWEB)

    Ormerod, Christopher, E-mail: C.Ormerod@latrobe.edu.a [Department of Mathematics and Statistics, La Trobe University, Bundoora VIC 3086 (Australia)

    2011-01-14

    We consider the associated linear problem for a q-analogue of the fifth Painleve equation (q-P{sub V}). We identify a lattice of connection preserving deformations in the space of the characteristic data for the linear problem with the lattice of translational Baecklund transformations for q-P{sub V}; hence, show all translational Baecklund transformations possess a Lax pair. We show that the big q-Laguerre polynomials, and a suitable generalization, solve a special case of the linear problem, and hence, find solutions to q-P{sub V} in terms of determinants of Hankel matrices with entries consisting of rational or hypergeometric functions. We show that we may specialize the connection preserving deformations to rational deformations of the weight and the recurrence relations.

  15. An Adaptive Finite Element Method Based on Optimal Error Estimates for Linear Elliptic Problems

    Institute of Scientific and Technical Information of China (English)

    汤雁

    2004-01-01

    The subject of the work is to propose a series of papers about adaptive finite element methods based on optimal error control estimate. This paper is the third part in a series of papers on adaptive finite element methods based on optimal error estimates for linear elliptic problems on the concave corner domains. In the preceding two papers (part 1:Adaptive finite element method based on optimal error estimate for linear elliptic problems on concave corner domain; part 2:Adaptive finite element method based on optimal error estimate for linear elliptic problems on nonconvex polygonal domains), we presented adaptive finite element methods based on the energy norm and the maximum norm. In this paper, an important result is presented and analyzed. The algorithm for error control in the energy norm and maximum norm in part 1 and part 2 in this series of papers is based on this result.

  16. Great Deluge Algorithm for the Linear Ordering Problem: The Case of Tanzanian Input-Output Table

    Directory of Open Access Journals (Sweden)

    Amos Mathias

    2015-06-01

    Full Text Available Given a weighted complete digraph, the Linear Ordering Problem (LOP consists of finding and acyclic tournament with maximum weight. It is sometimes referred to as triangulation problem or permutation problem depending on the context of its application. This study introduces an algorithm for LOP and applied for triangulation of Tanzanian Input-Output tables. The algorithm development process uses Great Deluge heuristic method. It is implemented using C++ programming language and tested on a personal computer with 2.40GHZ speed processor. The algorithm has been able to triangulate the Tanzanian input-output tables of size 79×79 within a reasonable time (1.17 seconds. It has been able to order the corresponding economic sectors in the linear order, with upper triangle weight increased from 585,481 to 839,842 giving the degree of linearity of 94.3%.

  17. 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...

  18. Convergence of an adaptive Ka\\v{c}anov FEM for quasi-linear problems

    OpenAIRE

    Garau, Eduardo M.; Morin, Pedro; Zuppa, Carlos

    2010-01-01

    We design an adaptive finite element method to approximate the solutions of quasi-linear elliptic problems. The algorithm is based on a Ka\\v{c}anov iteration and a mesh adaptation step is performed after each linear solve. The method is thus \\emph{inexact} because we do not solve the discrete nonlinear problems exactly, but rather perform one iteration of a fixed point method (Ka\\v{c}anov), using the approximation of the previous mesh as an initial guess. The convergence of the method is prov...

  19. On Development of a Problem Based Learning System for Linear Algebra with Simple Input Method

    Science.gov (United States)

    Yokota, Hisashi

    2011-08-01

    Learning how to express a matrix using a keyboard inputs requires a lot of time for most of college students. Therefore, for a problem based learning system for linear algebra to be accessible for college students, it is inevitable to develop a simple method for expressing matrices. Studying the two most widely used input methods for expressing matrices, a simpler input method for expressing matrices is obtained. Furthermore, using this input method and educator's knowledge structure as a concept map, a problem based learning system for linear algebra which is capable of assessing students' knowledge structure and skill is developed.

  20. 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.

  1. The Knowledge of Expert Opinion in Intuitionistic Fuzzy Linear Programming Problem

    Directory of Open Access Journals (Sweden)

    A. Nagoorgani

    2015-01-01

    Full Text Available In real life, information available for certain situations is vague and such uncertainty is unavoidable. One possible solution is to consider the knowledge of experts on the parameters involved as intuitionistic fuzzy data. We examine a linear programming problem in which all the coefficients are intuitionistic in nature. An approach is presented to solve an intuitionistic fuzzy linear programming problem. In this proposed approach, a procedure for allocating limited resources effectively among competing demands is developed. An example is given to highlight the illustrated study.

  2. 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.

  3. 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....

  4. A Primal- Dual Infeasible- Interior- Point Algorithm for Multiple Objective Linear Programming Problems

    Institute of Scientific and Technical Information of China (English)

    HUANG Hui; FEI Pu-sheng; YUAN Yuan

    2005-01-01

    A primal-dual infeasible-interior-point algorithm for multiple objective linear programming (MOLP) problems was presented. In contrast to the current MOLP algorithm,moving through the interior of polytope but not confining the iterates within the feasible region in our proposed algorithm result in a solution approach that is quite different and less sensitive to problem size, so providing the potential to dramatically improve the practical computation effectiveness.

  5. Solving fully fuzzy multiple objective linear programming problems: A new perspective

    Directory of Open Access Journals (Sweden)

    A. Hadi-Vencheh

    2014-08-01

    Full Text Available In this paper a systematic process has been proposed to solve a fully fuzzy multi objective linear programming problem (FFMOLPP. Using the utility vector the MOLPP is transferred to a single objective programming and this single fuzzy object problem is simply solved by one of the fuzzy approaches.A numerical example is then given to show applicability of the proposed approach.

  6. A Linear System Arising from a Polynomial Problem and Its Applications

    Institute of Scientific and Technical Information of China (English)

    Wen-Xiu MA; Boris SHEKHTMAN

    2007-01-01

    A linear system arising from a polynomial problem in the approximation theory is studied,and the necessary and sufficient conditions for existence and uniqueness of its solutions are presented.Together with a class of determinant identities,the resulting theory is used to determine the unique solution to the polynomial problem.Some homogeneous polynomial identities as well as results on the structure of related polynomial ideals are just by-products.

  7. SINGULARLY PERTURBED SEMI-LINEAR BOUNDARY VALUE PROBLEM WITH DISCONTINUOUS FUNCTION

    Institute of Scientific and Technical Information of China (English)

    Ding Haiyun; Ni Mingkang; Lin Wuzhong; Cao Yang

    2012-01-01

    A class of singularly perturbed semi-linear boundary value problems with discontinuous functions is examined in this article.Using the boundary layer function method,the asymptotic solution of such a problem is given and shown to be uniformly effective. The existence and uniqueness of the solution for the system is also proved.Numerical result is presented as an illustration to the theoretical result.

  8. Sequential Monte Carlo samplers for semi-linear inverse problems and application to magnetoencephalography

    Science.gov (United States)

    Sommariva, Sara; Sorrentino, Alberto

    2014-11-01

    We discuss the use of a recent class of sequential Monte Carlo methods for solving inverse problems characterized by a semi-linear structure, i.e. where the data depend linearly on a subset of variables and nonlinearly on the remaining ones. In this type of problems, under proper Gaussian assumptions one can marginalize the linear variables. This means that the Monte Carlo procedure needs only to be applied to the nonlinear variables, while the linear ones can be treated analytically; as a result, the Monte Carlo variance and/or the computational cost decrease. We use this approach to solve the inverse problem of magnetoencephalography, with a multi-dipole model for the sources. Here, data depend nonlinearly on the number of sources and their locations, and depend linearly on their current vectors. The semi-analytic approach enables us to estimate the number of dipoles and their location from a whole time-series, rather than a single time point, while keeping a low computational cost.

  9. An investigation of the accuracy of finite difference methods in the solution of linear elasticity problems

    Science.gov (United States)

    Bauld, N. R., Jr.; Goree, J. G.

    1983-01-01

    The accuracy of the finite difference method in the solution of linear elasticity problems that involve either a stress discontinuity or a stress singularity is considered. Solutions to three elasticity problems are discussed in detail: a semi-infinite plane subjected to a uniform load over a portion of its boundary; a bimetallic plate under uniform tensile stress; and a long, midplane symmetric, fiber reinforced laminate subjected to uniform axial strain. Finite difference solutions to the three problems are compared with finite element solutions to corresponding problems. For the first problem a comparison with the exact solution is also made. The finite difference formulations for the three problems are based on second order finite difference formulas that provide for variable spacings in two perpendicular directions. Forward and backward difference formulas are used near boundaries where their use eliminates the need for fictitious grid points.

  10. 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....

  11. Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones

    NARCIS (Netherlands)

    Lesaja, G.; Roos, C.

    2011-01-01

    We present an interior-point method for monotone linear complementarity problems over symmetric cones (SCLCP) that is based on barrier functions which are defined by a large class of univariate functions, called eligible kernel functions. This class is fairly general and includes the classical logar

  12. High Order Finite Difference Methods, Multidimensional Linear Problems and Curvilinear Coordinates

    Science.gov (United States)

    Nordstrom, Jan; Carpenter, Mark H.

    1999-01-01

    Boundary and interface conditions are derived for high order finite difference methods applied to multidimensional linear problems in curvilinear coordinates. The boundary and interface conditions lead to conservative schemes and strict and strong stability provided that certain metric conditions are met.

  13. A dual framework for lower bounds of the quadratic assignment|problem based on linearization

    DEFF Research Database (Denmark)

    Karisch, Stefan E.; Cela, E.; Clausen, Jens;

    1999-01-01

    A dual framework allowing the comparison of various bounds for the quadratic assignment problem (QAP) based on linearization, e.g. the bounds of Adams and Johnson, Carraresi and Malucelli, and Hahn and Grant, is presented. We discuss the differences of these bounds and propose a new and more...

  14. The problem of scheduling for the linear section of a single-track railway

    Science.gov (United States)

    Akimova, Elena N.; Gainanov, Damir N.; Golubev, Oleg A.; Kolmogortsev, Ilya D.; Konygin, Anton V.

    2016-06-01

    The paper is devoted to the problem of scheduling for the linear section of a single-track railway: how to organize the flow in both directions in the most efficient way. In this paper, the authors propose an algorithm for scheduling, examine the properties of this algorithm and perform the computational experiments.

  15. A TWO-STEP EXPLICIT METHOD FOR A CLASS OF LINEAR PERIODIC INITIAL VALUE PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    李庆宏; 罗亮生; 吴新元

    2003-01-01

    This paper presents a two-step explicit method of order four for solving aclass of linear periodic initial value problems. At each computational step, only tworight function evaluations and one derivative evaluation are employed. Basing on aspecial vector operation, the method can be extended to the vector-applicable in multi-dimensional space.

  16. Scenarios for solving a non-linear transportation problem in multi-agent systems

    DEFF Research Database (Denmark)

    Brehm, Robert; Top, Søren; Mátéfi-Tempfli, Stefan

    2017-01-01

    We introduce and provide an evaluation on two scenarios and related algorithms for implementation of a multi-agent system to solve a type of non-linear transportation problem using distributed optimization algorithms based on dual decomposition and consensus. The underlying fundamental optimization...

  17. Multiple Solutions for a Fourth-order Asymptotically Linear Elliptic Problem

    Institute of Scientific and Technical Information of China (English)

    Ai Xia QIAN; Shu Jie LI

    2006-01-01

    Under simple conditions, we prove the existence of three solutions for a fourth-order asymptotically linear elliptic boundary value problem. For the resonance case at infinity, we do not need to assume any more conditions to ensure the boundedness of the (PS) sequence of the corresponding functional.

  18. Using Feasible Direction to Find All Alternative Extreme Optimal Points for Linear Programming Problem

    Directory of Open Access Journals (Sweden)

    S. F. Tantawy

    2007-01-01

    Full Text Available We presented a feasible direction method to find all optimal extreme points for the linear programming problem. Our method depends on the conjugate gradient projection method starting with an initial point we generate a sequence of feasible directions towards all alternative extremes.

  19. Improving Students' Representational Flexibility in Linear-Function Problems: An Intervention

    Science.gov (United States)

    Acevedo Nistal, A.; Van Dooren, W.; Verschaffel, L.

    2014-01-01

    This study evaluates the effects of an intervention aimed at improving representational flexibility in linear-function problems. Forty-nine students aged 13-16 participated in the study. A pretest-intervention-posttest design with an experimental and control group was used. At pretest, both groups solved a choice test, where they could freely…

  20. Time domain analysis for discrete difference equation on discrete linear system controllable problem's research

    Institute of Scientific and Technical Information of China (English)

    DENG Shu-xian; DING Yu; GE Lei

    2008-01-01

    We usually describle a comparatively more complex control system, especially a multi-inputs and multioutputs system by time domation analytical procedure. While the system's controllability means whether the system is controllable according to certain requirements. It involves not only the system's outputs' controllability but also the controllability of the system's partial or total conditions. The movement is described by difference equation in the linear discrete-time system. Therefore, the problem of controllability of the linear discrete-time system has been converted into a problem of the controllability of discrete-time difference equation. The thesis makes out the determination method of the discrete-time system's controllability and puts forward the sufficient and necessary conditions to determine it's controllability by making a study on the controllability of the linear discrete-time equation.

  1. Goal-Oriented Error Estimation and Adaptivity for Free-Boundary Problems: The Shape-Linearization Approach

    NARCIS (Netherlands)

    Van der Zee, K.G.; Van Brummelen, E.H.; De Borst, R.

    2010-01-01

    We develop duality-based a posteriori error estimates for functional outputs of solutions of free-boundary problems via shape-linearization principles. To derive an appropriate dual (linearized adjoint) problem, we linearize the domain dependence of the very weak form and goal functional of interest

  2. 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...

  3. GENERAL CAUCHY PROBLEM FOR THE LINEAR SHALLOW -WATER EQUATIONS ON AN EQUATORIAL BETA-PLANE

    Institute of Scientific and Technical Information of China (English)

    SHEN Chun; SHI Wei-hui

    2006-01-01

    Based on the theory of stratification, the well-posedness of the initial value problem for the linear shallow-water equations on an equatorial beta-plane was discussed. The sufficient and necessary conditions of the existence and uniqueness for the local solution of the equations were presented and the existence conditions for formal solutions of the equations were also given. For the Cauchy problem on the hyper-plane, the local analytic solution were worked out and a special case was discussed. Finally, an example was used to explain the variety of formal solutions for the ill-posed problem.

  4. Geometric tools for solving the FDI problem for linear periodic discrete-time systems

    Science.gov (United States)

    Longhi, Sauro; Monteriù, Andrea

    2013-07-01

    This paper studies the problem of detecting and isolating faults in linear periodic discrete-time systems. The aim is to design an observer-based residual generator where each residual is sensitive to one fault, whilst remaining insensitive to the other faults that can affect the system. Making use of the geometric tools, and in particular of the outer observable subspace notion, the Fault Detection and Isolation (FDI) problem is formulated and necessary and solvability conditions are given. An algorithmic procedure is described to determine the solution of the FDI problem.

  5. Transportation problem: A special case for linear programing problems in mining engineering

    Institute of Scientific and Technical Information of China (English)

    Ali Mahrous A.M.; Sik Yang Hyung

    2012-01-01

    In real world applications the supply,the demand and the transportation cost per unit of the quantities in a transportation problem are hardly specified precisely because of the changing economic and environmental conditions.It is also important that the time required for transportation should be minimum.In this paper a method has been proposed for the minimization of transportation costs.Supply and transportation costs per unit of the quantities are also determined.The present study was carried out to evaluate the quality of gravel to know its suitability for aggregate (raw material for concrete and road).The samples of gravel were analyzed for petrographic,physical,mechanical and chemical properties.Samples were categorized as quartzite group and carbonate group according to ASTM standard 295.Among these,samples of quartzite group were found dominant.The petrography examination of gravels which was carried out constituted of opal,tridymite,chalcedony,crystobalite and alkali carbonates rocks.Those minerals react with alkalis in cement leading to expansion and cracking of concrete.Other components such as sulfides,sulfates,halites,iron oxides,clay minerals and anhydrites are examined,which might be present as coating and impurities.The present study indicated that all samples are suitable for concrete making and obtain the optimum solution for transporting these materials from quarries to cities with minimum cost according to Egyptian Code.

  6. Comparison of the Tangent Linear Properties of Tracer Transport Schemes Applied to Geophysical Problems.

    Science.gov (United States)

    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.

  7. An algorithm of sequential systems of linear equations for nonlinear optimization problems with arbitrary initial point

    Institute of Scientific and Technical Information of China (English)

    高自友; 贺国平; 吴方

    1997-01-01

    For current sequential quadratic programming (SQP) type algorithms, there exist two problems; (i) in order to obtain a search direction, one must solve one or more quadratic programming subproblems per iteration, and the computation amount of this algorithm is very large. So they are not suitable for the large-scale problems; (ii) the SQP algorithms require that the related quadratic programming subproblems be solvable per iteration, but it is difficult to be satisfied. By using e-active set procedure with a special penalty function as the merit function, a new algorithm of sequential systems of linear equations for general nonlinear optimization problems with arbitrary initial point is presented This new algorithm only needs to solve three systems of linear equations having the same coefficient matrix per iteration, and has global convergence and local superlinear convergence. To some extent, the new algorithm can overcome the shortcomings of the SQP algorithms mentioned above.

  8. Linear Diophantine Equation Discrete Log Problem and the AA{\\beta}-Cryptosystem

    CERN Document Server

    Ariffin, M R K; Abu, N A; Mandangan, A; Atan, K A M

    2011-01-01

    The Linear Diophantine Equation Discrete Log Problem (LDEDLP) is a discrete log problem on the linear Diophantine equation U=Vx+y. A proper implementation of LDEDLP would render an attacker to search for two private parameters amongst the exponentially many solutions. The search would involve a key space of size at least 2^k, where k is the length of the private key. LDEDLP follows a simple mathematical structure. Its low computational requirement would enable communication devices with low computing power to deploy secure communication procedures efficiently. Similar to the cryptographic schemes based on the Elliptic Curve Discrete Log Problem (ECDLP), cryptographic schemes based upon the LDEDLP are also able to produce secure key exchange schemes and asymmetric cryptographic schemes. The AA{\\beta}-cryptosystem is one such cryptographic scheme. The AA{\\beta}-cryptosystem transmits a two-parameter ciphertext analogous to the El-Gamal and elliptic curve cryptosystems. The AA{\\beta}-cryptosystem consists of bas...

  9. EXPERIMENTAL STUDY OF THE ASYNCHRONOUS MULTISPLITTING RELAXATION METHODS FOR THE LINEAR COMPLEMENTARITY PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    Zhong-zhi Bai

    2002-01-01

    We study the numerical behaviours of the relaxed asynchronous multisplitting methods for the linear complementarity problems by solving some typical problems from practical applications on a real multiprocessor system. Numerical results show that the parallel multisplitting relaxation methods always perform much better than the corresponding sequential alternatives, and that the asynchronous multisplitting relaxation methods often outperform their corresponding synchronous counterparts. Moreover, the two-sweep relaxed multisplitting methods have better convergence properties than their corresponding one-sweep relaxed ones in the sense that they have larger convergence domains and faster convergence speeds. Hence, the asynchronous multisplitting unsymmetric relaxation iterations should be the methods of choice for solving the large sparse linear complementarity problems in the parallel computing environments.

  10. Voila: A visual object-oriented iterative linear algebra problem solving environment

    Energy Technology Data Exchange (ETDEWEB)

    Edwards, H.C.; Hayes, L.J. [Univ. of Texas, Austin, TX (United States)

    1994-12-31

    Application of iterative methods to solve a large linear system of equations currently involves writing a program which calls iterative method subprograms from a large software package. These subprograms have complex interfaces which are difficult to use and even more difficult to program. A problem solving environment specifically tailored to the development and application of iterative methods is needed. This need will be fulfilled by Voila, a problem solving environment which provides a visual programming interface to object-oriented iterative linear algebra kernels. Voila will provide several quantum improvements over current iterative method problem solving environments. First, programming and applying iterative methods is considerably simplified through Voila`s visual programming interface. Second, iterative method algorithm implementations are independent of any particular sparse matrix data structure through Voila`s object-oriented kernels. Third, the compile-link-debug process is eliminated as Voila operates as an interpreter.

  11. A Genetic-Algorithms-Based Approach for Programming Linear and Quadratic Optimization Problems with Uncertainty

    Directory of Open Access Journals (Sweden)

    Weihua Jin

    2013-01-01

    Full Text Available This paper proposes a genetic-algorithms-based approach as an all-purpose problem-solving method for operation programming problems under uncertainty. The proposed method was applied for management of a municipal solid waste treatment system. Compared to the traditional interactive binary analysis, this approach has fewer limitations and is able to reduce the complexity in solving the inexact linear programming problems and inexact quadratic programming problems. The implementation of this approach was performed using the Genetic Algorithm Solver of MATLAB (trademark of MathWorks. The paper explains the genetic-algorithms-based method and presents details on the computation procedures for each type of inexact operation programming problems. A comparison of the results generated by the proposed method based on genetic algorithms with those produced by the traditional interactive binary analysis method is also presented.

  12. SIMULTANEOUSLY SPARSE SOLUTIONS TO LINEAR INVERSE PROBLEMS WITH MULTIPLE SYSTEM MATRICES AND A SINGLE OBSERVATION VECTOR*

    Science.gov (United States)

    ZELINSKI, ADAM C.; GOYAL, VIVEK K.; ADALSTEINSSON, ELFAR

    2010-01-01

    A problem that arises in slice-selective magnetic resonance imaging (MRI) radio-frequency (RF) excitation pulse design is abstracted as a novel linear inverse problem with a simultaneous sparsity constraint. Multiple unknown signal vectors are to be determined, where each passes through a different system matrix and the results are added to yield a single observation vector. Given the matrices and lone observation, the objective is to find a simultaneously sparse set of unknown vectors that approximately solves the system. We refer to this as the multiple-system single-output (MSSO) simultaneous sparse approximation problem. This manuscript contrasts the MSSO problem with other simultaneous sparsity problems and conducts an initial exploration of algorithms with which to solve it. Greedy algorithms and techniques based on convex relaxation are derived and compared empirically. Experiments involve sparsity pattern recovery in noiseless and noisy settings and MRI RF pulse design. PMID:20445814

  13. Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems

    DEFF Research Database (Denmark)

    Skajaa, Anders; Andersen, Erling D.; Ye, Yinyu

    2013-01-01

    We present two strategies for warmstarting primal-dual interior point methods for the homogeneous self-dual model when applied to mixed linear and quadratic conic optimization problems. Common to both strategies is their use of only the final (optimal) iterate of the initial problem...... 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...

  14. Linear time constant factor approximation algorithm for the Euclidean ``Freeze-Tag`` robot awakening problem

    Directory of Open Access Journals (Sweden)

    Mohammad Javad Namazifar

    2015-09-01

    Full Text Available The Freeze-Tag Problem (FTP arises in the study of swarm robotics. The FTP is a combinatorial optimization problem that starts by locating a set of robots in a Euclidean plane. Here, we are given a swarm of n asleep (frozen or inactive robots and a single awake (active robot. In order to activate an inactive robot in FTP, the active robot should either be in the physical proximity to the inactive robot or ``touch`` it. The new activated robot starts moving and can wake up other inactive robots. The goal is to find an optimal activating schedule with the minimum time required for activating all robots. In general, FTP is an NP-Hard problem and in the Euclidean space is an open problem. In this paper, we present a recursive approximation algorithm with a constant approximation factor and a linear running time for the Euclidean Freeze-Tag Problem.

  15. Analytical vs. Simulation Solution Techniques for Pulse Problems in Non-linear Stochastic Dynamics

    DEFF Research Database (Denmark)

    Iwankiewicz, R.; Nielsen, Søren R. K.

    -numerical techniques suitable for Markov response problems such as moments equation, Petrov-Galerkin and cell-to-cell mapping techniques are briefly discussed. Usefulness of these techniques is limited by the fact that effectiveness of each of them depends on the mean rate of impulses. Another limitation is the size...... of the problem, i.e. the number of state variables of the dynamical systems. In contrast, the application of the simulation techniques is not limited to Markov problems, nor is it dependent on the mean rate of impulses. Moreover their use is straightforward for a large class of point processes, at least......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...

  16. 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. 

  17. Fuzzy linear programming approach for solving transportation problems with interval-valued trapezoidal fuzzy numbers

    Indian Academy of Sciences (India)

    ALI EBRAHIMNEJAD

    2016-03-01

    Transportation problem (TP) is an important network structured linear programming problem that arises in several contexts and has deservedly received a great deal of attention in the literature. The central concept in this problem is to find the least total transportation cost of a commodity in order to satisfy demands at destinations using available supplies at origins in a crisp environment. In real life situations, the decision maker may not be sure about the precise values of the coefficients belonging to the transportation problem. The aim of this paper is to introduce a formulation of TP involving interval-valued trapezoidal fuzzy numbers for the transportation costs and values of supplies and demands. We propose a fuzzy linear programming approach for solvinginterval-valued trapezoidal fuzzy numbers transportation problem based on comparison of interval-valued fuzzy numbers by the help of signed distance ranking. To illustrate the proposed approach an application example issolved. It is demonstrated that study of interval-valued trapezoidal fuzzy numbers transportation problem gives rise to the same expected results as those obtained for TP with trapezoidal fuzzy numbers.

  18. A Fuzzy Approach Using Generalized Dinkelbach’s Algorithm for Multiobjective Linear Fractional Transportation Problem

    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.

  19. 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.

  20. 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.

  1. 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 ARnxn and qRn, the linear complementarity problem LCP(A, q is to determine if there is xRn 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.

  2. Solving sparse linear least squares problems on some supercomputers by using large dense blocks

    DEFF Research Database (Denmark)

    Hansen, Per Christian; Ostromsky, T; Sameh, A;

    1997-01-01

    technique is preferable to sparse matrix technique when the matrices are not large, because the high computational speed compensates fully the disadvantages of using more arithmetic operations and more storage. For very large matrices the computations must be organized as a sequence of tasks in each...... the matrix so that dense blocks can be constructed and treated with some standard software, say LAPACK or NAG. These ideas are implemented for linear least-squares problems. The rectangular matrices (that appear in such problems) are decomposed by an orthogonal method. Results obtained on a CRAY C92A...

  3. 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.

  4. Internal end-effect problem in a linear asynchronous MHD machine with arbitrary current load

    Energy Technology Data Exchange (ETDEWEB)

    Vilnitis, A.Ya.

    1977-01-01

    The internal end-effect problem in a bilateral linear asynchronous engine is solved by variation of constants for a surface current load of any type, including discrete conductors. Mathematically correct formulae for this case are given for computing the mechanical force on wound coils and the active power. Known methods of end-effect compensation are examined. The requirements for the surface load of inductors were found for the case where the requirements may be limited to an internal problem and scattering along the magnetic circuit ends.

  5. Assessment of Two Analytical Methods in Solving the Linear and Nonlinear Elastic Beam Deformation Problems

    DEFF Research Database (Denmark)

    Barari, Amin; Ganjavi, B.; Jeloudar, M. Ghanbari

    2010-01-01

    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...... 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...

  6. Observations on the linear programming formulation of the single reflector design problem.

    Science.gov (United States)

    Canavesi, Cristina; Cassarly, William J; Rolland, Jannick P

    2012-02-13

    We implemented the linear programming approach proposed by Oliker and by Wang to solve the single reflector problem for a point source and a far-field target. The algorithm was shown to produce solutions that aim the input rays at the intersections between neighboring reflectors. This feature makes it possible to obtain the same reflector with a low number of rays - of the order of the number of targets - as with a high number of rays, greatly reducing the computation complexity of the problem.

  7. Improved simple optimization (SOPT algorithm for unconstrained non-linear optimization problems

    Directory of Open Access Journals (Sweden)

    J. Thomas

    2016-09-01

    Full Text Available In the recent years, population based meta-heuristic are developed to solve non-linear optimization problems. These problems are difficult to solve using traditional methods. Simple optimization (SOPT algorithm is one of the simple and efficient meta-heuristic techniques to solve the non-linear optimization problems. In this paper, SOPT is compared with some of the well-known meta-heuristic techniques viz. Artificial Bee Colony algorithm (ABC, Particle Swarm Optimization (PSO, Genetic Algorithm (GA and Differential Evolutions (DE. For comparison, SOPT algorithm is coded in MATLAB and 25 standard test functions for unconstrained optimization having different characteristics are run for 30 times each. The results of experiments are compared with previously reported results of other algorithms. Promising and comparable results are obtained for most of the test problems. To improve the performance of SOPT, an improvement in the algorithm is proposed which helps it to come out of local optima when algorithm gets trapped in it. In almost all the test problems, improved SOPT is able to get the actual solution at least once in 30 runs.

  8. Accelerated solution of non-linear flow problems using Chebyshev iteration polynomial based RK recursions

    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.

  9. The solution of the optimization problem of small energy complexes using linear programming methods

    Science.gov (United States)

    Ivanin, O. A.; Director, L. B.

    2016-11-01

    Linear programming methods were used for solving the optimization problem of schemes and operation modes of distributed generation energy complexes. Applicability conditions of simplex method, applied to energy complexes, including installations of renewable energy (solar, wind), diesel-generators and energy storage, considered. The analysis of decomposition algorithms for various schemes of energy complexes was made. The results of optimization calculations for energy complexes, operated autonomously and as a part of distribution grid, are presented.

  10. Interior-point algorithm based on general kernel function for monotone linear complementarity problem

    Institute of Scientific and Technical Information of China (English)

    LIU Yong; BAI Yan-qin

    2009-01-01

    A polynomial interior-point algorithm is presented for monotone linear complementarity problem (MLCP) based on:a class of kernel functions with the general barrier term, which are called general kernel functions. Under the mild conditions for the barrier term, the complexity bound of algorithm in terms of such kernel function and its derivatives is obtained. The approach is actually an extension of the existing work which only used the specific kernel functions for the MLCP.

  11. A redundancy eliminating approach to linearly independent rings selection in the ring perception problem

    Science.gov (United States)

    Mancini, G.

    2002-02-01

    Based on a recently published efficient, exact algorithm to solve the ring perception problem, a new approach is presented to feed the linear independence test on rings to enter a minimal basis with no duplicate information, thus reducing calls to the most demanding procedure in terms of computational order. The efficiency of a perfect hashing algorithm is actually met by a "pre-filtering" method derived from simple considerations.

  12. A LOCKING-FREE ANISOTROPIC NONCONFORMING FINITE ELEMENT FOR PLANAR LINEAR ELASTICITY PROBLEM

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    The main aim of this article is to study the approximation of a locking-free anisotropic nonconforming finite element for the pure displacement boundary value problem of planar linear elasticity. The optimal error estimates are obtained by using some novel approaches and techniques. The method proposed in this article is robust in the sense that the convergence estimates in the energy and L2-norms are independentof the Lamé parameter λ.

  13. Elliptic Linear Problem for Calogero-Inozemtsev Model and Painleve VI Equation

    OpenAIRE

    2003-01-01

    We introduce $3N\\times 3N$ Lax pair with spectral parameter for Calogero-Inozemtsev model. The one degree of freedom case appears to have $2\\times 2$ Lax representation. We derive it from the elliptic Gaudin model via some reduction procedure and prove algebraic integrability. This Lax pair provides elliptic linear problem for the Painlev{\\'e} VI equation in elliptic form.

  14. The Smoothing Newton Method for Solving the Extended Linear Complementarity Problem

    Institute of Scientific and Technical Information of China (English)

    TANG Jia; MA Chang-feng

    2012-01-01

    The extended linear complementarity problem(denoted by ELCP) can be reformulated as the solution of a nonsmooth system of equations.By the symmetrically perturbed CHKS smoothing function,the ELCP is approximated by a family of parameterized smooth equations.A one-step smoothing Newton method is designed for solving the ELCP.The proposed algorithm is proved to be globally convergent under suitable assumptions.

  15. PARALLEL CHAOTIC MULTISPLITTING ITERATIVE METHODS FOR THE LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEM

    Institute of Scientific and Technical Information of China (English)

    Zhong-zhi Bai

    2001-01-01

    A parallel chaotic multisplitting method for solving the large sparse linear complementarity problem is presented, and its convergence properties are discussed in detail when the system matrix is either symmetric or nonsymmetric. Moreover, some applicable relaxed variants of this parallel chaotic multisplitting method together with their convergence properties are investigated. Numerical results show that highly parallel efficiency can be achieved by these new parallel chaotic multisplitting methods.

  16. Legendre-tau approximation for functional differential equations. II - The linear quadratic optimal control problem

    Science.gov (United States)

    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.

  17. Legendre-tau approximation for functional differential equations. Part 2: The linear quadratic optimal control problem

    Science.gov (United States)

    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.

  18. Boundary value problems for systems of linear partial differential equations and propagation of microanalyticity

    OpenAIRE

    Oaku, Toshinori

    1986-01-01

    We give a general formulation of boundary value problems in the framework of hyperfunctions both for systems of linear partial differential equations with non-characteristic boundary and for Fuchsian systems of partial differential equations in a unified manner. We also give a microlocal formulation, which enables us to prove new results on propagation of micro-analyticity up to the boundary for solutions of systems micro-hyperbolic in a weak sense.

  19. Robust parallel iterative solvers for linear and least-squares problems, Final Technical Report

    Energy Technology Data Exchange (ETDEWEB)

    Saad, Yousef

    2014-01-16

    The primary goal of this project is to study and develop robust iterative methods for solving linear systems of equations and least squares systems. The focus of the Minnesota team is on algorithms development, robustness issues, and on tests and validation of the methods on realistic problems. 1. The project begun with an investigation on how to practically update a preconditioner obtained from an ILU-type factorization, when the coefficient matrix changes. 2. We investigated strategies to improve robustness in parallel preconditioners in a specific case of a PDE with discontinuous coefficients. 3. We explored ways to adapt standard preconditioners for solving linear systems arising from the Helmholtz equation. These are often difficult linear systems to solve by iterative methods. 4. We have also worked on purely theoretical issues related to the analysis of Krylov subspace methods for linear systems. 5. We developed an effective strategy for performing ILU factorizations for the case when the matrix is highly indefinite. The strategy uses shifting in some optimal way. The method was extended to the solution of Helmholtz equations by using complex shifts, yielding very good results in many cases. 6. We addressed the difficult problem of preconditioning sparse systems of equations on GPUs. 7. A by-product of the above work is a software package consisting of an iterative solver library for GPUs based on CUDA. This was made publicly available. It was the first such library that offers complete iterative solvers for GPUs. 8. We considered another form of ILU which blends coarsening techniques from Multigrid with algebraic multilevel methods. 9. We have released a new version on our parallel solver - called pARMS [new version is version 3]. As part of this we have tested the code in complex settings - including the solution of Maxwell and Helmholtz equations and for a problem of crystal growth.10. As an application of polynomial preconditioning we considered the

  20. 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.

  1. 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.

  2. A unified approach to optimal image interpolation problems based on linear partial differential equation models.

    Science.gov (United States)

    Chen, G; de Figueiredo, R P

    1993-01-01

    The unified approach to optimal image interpolation problems presented provides a constructive procedure for finding explicit and closed-form optimal solutions to image interpolation problems when the type of interpolation can be either spatial or temporal-spatial. The unknown image is reconstructed from a finite set of sampled data in such a way that a mean-square error is minimized by first expressing the solution in terms of the reproducing kernel of a related Hilbert space, and then constructing this kernel using the fundamental solution of an induced linear partial differential equation, or the Green's function of the corresponding self-adjoint operator. It is proved that in most cases, closed-form fundamental solutions (or Green's functions) for the corresponding linear partial differential operators can be found in the general image reconstruction problem described by a first- or second-order linear partial differential operator. An efficient method for obtaining the corresponding closed-form fundamental solutions (or Green's functions) of the operators is presented. A computer simulation demonstrates the reconstruction procedure.

  3. Dual mean field search for large scale linear and quadratic knapsack problems

    Science.gov (United States)

    Banda, Juan; Velasco, Jonás; Berrones, Arturo

    2017-07-01

    An implementation of mean field annealing to deal with large scale linear and non linear binary optimization problems is given. Mean field annealing is based on the analogy between combinatorial optimization and interacting physical systems at thermal equilibrium. Specifically, a mean field approximation of the Boltzmann distribution given by a Lagrangian that encompass the objective function and the constraints is calculated. The original discrete task is in this way transformed into a continuous variational problem. In our version of mean field annealing, no temperature parameter is used, but a good starting point in the dual space is given by a ;thermodynamic limit; argument. The method is tested in linear and quadratic knapsack problems with sizes that are considerably larger than those used in previous studies of mean field annealing. Dual mean field annealing is capable to find high quality solutions in running times that are orders of magnitude shorter than state of the art algorithms. Moreover, as may be expected for a mean field theory, the solutions tend to be more accurate as the number of variables grow.

  4. Scilab software as an alternative low-cost computing in solving the linear equations problem

    Science.gov (United States)

    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.

  5. Analysis of junior high school students' attempt to solve a linear inequality problem

    Science.gov (United States)

    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 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.

  6. Solving Directly Two Point Non Linear Boundary Value Problems Using Direct Adams Moulton Method

    Directory of Open Access Journals (Sweden)

    Zanariah A. Majid

    2011-01-01

    Full Text Available Problem statement: In this study, a direct method of Adams Moulton type was developed for solving non linear two point Boundary Value Problems (BVPs directly. Most of the existence researches involving BVPs will reduced the problem to a system of first order Ordinary Differential Equations (ODEs. This approach is very well established but it obviously will enlarge the systems of first order equations. However, the direct method in this research will solved the second order BVPs directly without reducing it to first order ODEs. Approach: Lagrange interpolation polynomial was applied in the derivation of the proposed method. The method was implemented using constant step size via shooting technique in order to determine the approximated solutions. The shooting technique will employ the Newton’s method for checking the convergent of the guessing values for the next iteration. Results: Numerical results confirmed that the direct method gave better accuracy and converged faster compared to the existing method. Conclusion: The proposed direct method is suitable for solving two point non linear boundary value problems.

  7. A new gradient-based neural network for solving linear and quadratic programming problems.

    Science.gov (United States)

    Leung, Y; Chen, K Z; Jiao, Y C; Gao, X B; Leung, K S

    2001-01-01

    A new gradient-based neural network is constructed on the basis of the duality theory, optimization theory, convex analysis theory, Lyapunov stability theory, and LaSalle invariance principle to solve linear and quadratic programming problems. In particular, a new function F(x, y) is introduced into the energy function E(x, y) such that the function E(x, y) is convex and differentiable, and the resulting network is more efficient. This network involves all the relevant necessary and sufficient optimality conditions for convex quadratic programming problems. For linear programming and quadratic programming (QP) problems with unique and infinite number of solutions, we have proven strictly that for any initial point, every trajectory of the neural network converges to an optimal solution of the QP and its dual problem. The proposed network is different from the existing networks which use the penalty method or Lagrange method, and the inequality constraints are properly handled. The simulation results show that the proposed neural network is feasible and efficient.

  8. Preservation of local linearity by neighborhood subspace scaling for solving the pre-image problem

    Institute of Scientific and Technical Information of China (English)

    Sheng-kai YANG; Jian-yi MENG; Hai-bin SHEN

    2014-01-01

    An important issue involved in kernel methods is the pre-image problem. However, it is an ill-posed problem, as the solution is usually nonexistent or not unique. In contrast to direct methods aimed at minimizing the distance in feature space, indirect methods aimed at constructing approximate equivalent models have shown outstanding performance. In this paper, an indirect method for solving the pre-image problem is proposed. In the proposed algorithm, an inverse mapping process is constructed based on a novel framework that preserves local linearity. In this framework, a local nonlinear transformation is implicitly conducted by neighborhood subspace scaling transformation to preserve the local linearity between feature space and input space. By extending the inverse mapping process to test samples, we can obtain pre-images in input space. The proposed method is non-iterative, and can be used for any kernel functions. Experimental results based on image denoising using kernel principal component analysis (PCA) show that the proposed method outperforms the state-of-the-art methods for solving the pre-image problem.

  9. Fuzzy linear fractional bi-level multi-objective programming problems

    Directory of Open Access Journals (Sweden)

    nemat safaei

    2012-08-01

    Full Text Available The Kuhn-Tuker condition has become nowadays an important tool in the hands of investigation for checking the optimality in optimization literature. In the present paper with use of a Taylor series and Kuhn-Tucker conditions approach, we solve a fuzzy linear fractional bilevel multi-objective programming (FLFBL-MOP problem. The Taylor series is an expansion of a series that represents a function. In the proposed approach, membership functions associated with each level(s ofthe objective(s of FLFBL-MOP problems are transformed and unied by using a Taylor series approach. By using the Kuhn-Tucker conditions, the problem is reduced to a single objective and nally, numericalexample is given to illustrates the efficiency and superiority of the proposed approach.

  10. Techniques that strive to combat the influence of degeneracy in linear programming problems

    Directory of Open Access Journals (Sweden)

    J.H. Nel

    2003-12-01

    Full Text Available Degeneracy can cause enormous problems when solving large scale linear programming problems. This is not only because there is a possibility that the problem can cycle, but also because a large number of iterations can be executed that do not improve the objective. In this article a procedure which utilises derived reduced costs is discussed. The derived reduced cost of a non- basic variable is defined in such a way that it makes the introduction to the non-basic variable into the basis unattractive if such a decision fails to improve the objective. The procedure deliberately strives to combat degeneracy using derived reduced costs, but it also utilises the advantageous properties of the classical gradient methods.

  11. OPTIMAL THICKNESS OF A CYLINDRICAL SHELL - AN OPTIMAL CONTROL PROBLEM IN LINEAR ELASTICITY THEORY

    Directory of Open Access Journals (Sweden)

    Peter Nestler

    2013-01-01

    Full Text Available In this paper we discuss optimization problems for cylindrical tubeswhich are loaded by an applied force. This is a problem of optimal control in linear elasticity theory (shape optimization. We are looking for an optimal thickness minimizing the deflection (deformation of the tube under the influence of an external force. From basic equations of mechanics, we derive the equation of deformation. We apply the displacement approach from shell theory and make use of the hypotheses of Mindlin and Reissner. A corresponding optimal control problem is formulated and first order necessary conditions for the optimal solution (optimal thickness are derived. We present numerical examples which were solved by the finite element method.

  12. On the Dirichlet Problem for First Order Linear Hyperbolic PDEs on Bounded Domains with Mere Inflow Boundary

    CERN Document Server

    März, Thomas

    2010-01-01

    Here we study the Dirichlet problem for first order linear and quasi-linear hyperbolic PDEs on a simply connected bounded domain of $\\R^2$, where the domain has an interior outflow set and a mere inflow boundary. By means of a Lyapunov function we show the existence of a unique solution in the space of functions of bounded variation and its continuous dependence on all the data of the linear problem. Finally, we conclude the existence of a solution to the quasi-linear case by utilizing the Schauder fixed point theorem. This type of problems considered here appears in applications such as transport based image inpainting.

  13. A TRUST REGION ALGORITHM VIA BILEVEL LINEAR PROGRAMMING FOR SOLVING THE GENERAL MULTICOMMODITY MINIMAL COST FLOW PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    ZhuDetong

    2004-01-01

    This paper proposes a nonmonotonic backtracking trust region algorithm via bilevel linear programming for solving the general multicommodity minimal cost flow problems. Using the duality theory of the linear programming and convex theory, the generalized directional derivative of the general multicommodity minimal cost flow problems is derived. The global convergence and superlinear convergence rate of the proposed algorithm are established under some mild conditions.

  14. IESIP - AN IMPROVED EXPLORATORY SEARCH TECHNIQUE FOR PURE INTEGER LINEAR PROGRAMMING PROBLEMS

    Science.gov (United States)

    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.

  15. Greedy and Linear Ensembles of Machine Learning Methods Outperform Single Approaches for QSPR Regression Problems.

    Science.gov (United States)

    Kew, William; Mitchell, John B O

    2015-09-01

    The application of Machine Learning to cheminformatics is a large and active field of research, but there exist few papers which discuss whether ensembles of different Machine Learning methods can improve upon the performance of their component methodologies. Here we investigated a variety of methods, including kernel-based, tree, linear, neural networks, and both greedy and linear ensemble methods. These were all tested against a standardised methodology for regression with data relevant to the pharmaceutical development process. This investigation focused on QSPR problems within drug-like chemical space. We aimed to investigate which methods perform best, and how the 'wisdom of crowds' principle can be applied to ensemble predictors. It was found that no single method performs best for all problems, but that a dynamic, well-structured ensemble predictor would perform very well across the board, usually providing an improvement in performance over the best single method. Its use of weighting factors allows the greedy ensemble to acquire a bigger contribution from the better performing models, and this helps the greedy ensemble generally to outperform the simpler linear ensemble. Choice of data preprocessing methodology was found to be crucial to performance of each method too. © 2015 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

  16. Acceleration of multiple solution of a boundary value problem involving a linear algebraic system

    Science.gov (United States)

    Gazizov, Talgat R.; Kuksenko, Sergey P.; Surovtsev, Roman S.

    2016-06-01

    Multiple solution of a boundary value problem that involves a linear algebraic system is considered. New approach to acceleration of the solution is proposed. The approach uses the structure of the linear system matrix. Particularly, location of entries in the right columns and low rows of the matrix, which undergo variation due to the computing in the range of parameters, is used to apply block LU decomposition. Application of the approach is considered on the example of multiple computing of the capacitance matrix by method of moments used in numerical electromagnetics. Expressions for analytic estimation of the acceleration are presented. Results of the numerical experiments for solution of 100 linear systems with matrix orders of 1000, 2000, 3000 and different relations of variated and constant entries of the matrix show that block LU decomposition can be effective for multiple solution of linear systems. The speed up compared to pointwise LU factorization increases (up to 15) for larger number and order of considered systems with lower number of variated entries.

  17. Exact solutions to robust control problems involving scalar hyperbolic conservation laws using Mixed Integer Linear Programming

    KAUST Repository

    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.

  18. State-space models' dirty little secrets: even simple linear Gaussian models can have estimation problems.

    Science.gov (United States)

    Auger-Méthé, Marie; Field, Chris; Albertsen, Christoffer M; Derocher, Andrew E; Lewis, Mark A; Jonsen, Ian D; Mills Flemming, Joanna

    2016-05-25

    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. They can model linear and nonlinear processes using a variety of statistical distributions. Recent ecological SSMs are often complex, with a large number of parameters to estimate. Through a simulation study, we show that even simple linear Gaussian SSMs can suffer from parameter- and state-estimation 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 estimates of a SSM describing the movement of polar bears (Ursus maritimus) result in overestimating their energy expenditure. We suggest potential solutions, but show that it often remains difficult to estimate parameters. While SSMs are powerful tools, they can give misleading results and we urge ecologists to assess whether the parameters can be estimated accurately before drawing ecological conclusions from their results.

  19. 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

    with analytical solutions for several test cases. The dynamic behaviour of a cylinder and barge on variable bathymetry has been investigated on a multi-block grid in two dimensions. Simulations have been performed to evaluate the induced flow field and radiation forces generated by these bodies in response...... 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...... of the time-dependent displacement and force are applied, and the ratio of the resulting signals used to determine the radiation added mass and damping of the body as a function of frequency. The present software implementation has been validated by comparing numerical results from the linear model...

  20. A novel approach based on preference-based index for interval bilevel linear programming problem.

    Science.gov (United States)

    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.

  1. Using Perturbed QR Factorizations To Solve Linear Least-Squares Problems

    Energy Technology Data Exchange (ETDEWEB)

    Avron, Haim; Ng, Esmond G.; Toledo, Sivan

    2008-03-21

    We propose and analyze a new tool to help solve sparse linear least-squares problems min{sub x} {parallel}Ax-b{parallel}{sub 2}. Our method is based on a sparse QR factorization of a low-rank perturbation {cflx A} of A. More precisely, we show that the R factor of {cflx A} is an effective preconditioner for the least-squares problem min{sub x} {parallel}Ax-b{parallel}{sub 2}, when solved using LSQR. We propose applications for the new technique. When A is rank deficient we can add rows to ensure that the preconditioner is well-conditioned without column pivoting. When A is sparse except for a few dense rows we can drop these dense rows from A to obtain {cflx A}. Another application is solving an updated or downdated problem. If R is a good preconditioner for the original problem A, it is a good preconditioner for the updated/downdated problem {cflx A}. We can also solve what-if scenarios, where we want to find the solution if a column of the original matrix is changed/removed. We present a spectral theory that analyzes the generalized spectrum of the pencil (A*A,R*R) and analyze the applications.

  2. Computationally Improved Optimal Control Methodology for Linear Programming Problems of Flexible Manufacturing Systems

    Directory of Open Access Journals (Sweden)

    Yen-Liang Pan

    2013-01-01

    Full Text Available Deadlock prevention policies are used to solve the deadlock problems of FMSs. It is well known that the theory of regions is the efficient method for obtaining optimal (i.e., maximally permissive controllers. All legal and live maximal behaviors of Petri net models can be preserved by using marking/transition-separation instances (MTSIs or event-state-separation-problem (ESSP methods. However, they encountered great difficulties in solving all sets of inequalities that is an extremely time consuming problem. Moreover, the number of linear programming problems (LPPs of legal markings is also exponential with net size when a plant net grows exponentially. This paper proposes a novel methodology to reduce the number of MTSIs/ESSPs and LPPs. In this paper, we used the well-known reduction approach Murata (1989 to simply the construct of system such that the problem of LPPs can then be reduced. Additionally, critical ones of crucial marking/transition-separation instances (COCMTSI are developed and used in our deadlock prevention policy that allows designers to employ few MTSIs to deal with deadlocks. Experimental results indicate that the computational cost can be reduced. To our knowledge, this deadlock prevention policy is the most efficient policy to obtain maximal permissive behavior of Petri net models than past approaches.

  3. Meshless analysis of an improved element-free Galerkin method for linear and nonlinear elliptic problems

    Science.gov (United States)

    Tang, Yao-Zong; Li, Xiao-Lin

    2017-03-01

    We first give a stabilized improved moving least squares (IMLS) approximation, which has better computational stability and precision than the IMLS approximation. Then, analysis of the improved element-free Galerkin method is provided theoretically for both linear and nonlinear elliptic boundary value problems. Finally, numerical examples are given to verify the theoretical analysis. Project supported by the National Natural Science Foundation of China (Grant No. 11471063), the Chongqing Research Program of Basic Research and Frontier Technology, China (Grant No. cstc2015jcyjBX0083), and the Educational Commission Foundation of Chongqing City, China (Grant No. KJ1600330).

  4. A KIND OF FUZZY MULTI-OBJECTIVE LINEAR PROGRAMMING PROBLEMS BASED ON INTERVAL VALUED FUZZY SETS

    Institute of Scientific and Technical Information of China (English)

    XU Jiuping

    2001-01-01

    This paper presents a general solution procedure and an interactive fuzzy satisfying method for a kind of fuzzy multi-objective linear programming problems based on interval valued fuzzy sets. Firstly, a fuzzy set of the fuzzy solutions, which can be focused on providing complete information for the final decision, can be obtained by the proposed tolerance analysis of a non-dominated set. Secondly, the satisfying solution for the decisionmaker can be derived from Pareto optimal solutions by updating the current reference membership levels on the basis of the current levels of the membership functions together with the trade-off rates between the membership functions.

  5. Efficient Non-Linear Finite Element Implementation of Elasto-Plasticity for Geotechnical Problems

    DEFF Research Database (Denmark)

    Clausen, Johan

    of foundations, mainly due to its simplicity which allows simple solutions with simple geometries. But for complex geometries a numerical solution is needed. It turns out that the apparently simple Mohr-Coulomb model is non-trivial to implement in the finite-element method. This is due to the fact that the Mohr...... with the safety factors obtained with a linear Mohr envelope, with which they are directly comparable, when the presented method is used. The classical problem of yield surfaces with corners and apexes is elaborated upon. A small modification to the formulation of the constitutive matrices on corners and apexes...

  6. Constrained regulator problem for linear uncertain systems: control of a pH process

    Directory of Open Access Journals (Sweden)

    2006-01-01

    Full Text Available The regulator problem for linear uncertain continuous-time systems having control constraints is considered. Necessary and sufficient conditions of positive invariance of polyhedral domains are extended to the case of continuous-time uncertain systems. Robust constrained regulators are then derived. An application to the control of pH in a stirred tank is then presented. First, the uncertainty in the pH process is evaluated from first-principle models, then the design of a robust constrained regulator is presented. Simulation results show that this control law is easy to implement and that robust asymptotic stability and control admissibility are guaranteed.

  7. An inverse problem of temperature estimation for the combination of the linear and nonlinear resistances

    Directory of Open Access Journals (Sweden)

    Slavica M. Perovich

    2011-06-01

    Full Text Available The subject of the theoretical analysis presented in this paper is an analytical approach to the temperature estimation, as an inverse problem, for different thermistors – linear resistances structures: series and parallel ones, by the STFT - Special Trans Functions Theory (S.M. Perovich. The mathematical formulae genesis of both cases is given. Some numerical and graphical simulations in MATHEMATICA program have been realized. The estimated temperature intervals for strongly determined values of the equivalent resistances of the nonlinear structures are given, as well.

  8. The Background Field Method and the Linearization Problem for Poisson Manifolds

    CERN Document Server

    Grassi, P A

    2004-01-01

    The background field method (BFM) for the Poisson Sigma Model (PSM) is studied as an example of the application of the BFM technique to open gauge algebras. The relationship with Seiberg-Witten maps arising in non-commutative gauge theories is clarified. It is shown that the implementation of the BFM for the PSM in the Batalin-Vilkovisky formalism is equivalent to the solution of a generalized linearization problem (in the formal sense) for Poisson structures in the presence of gauge fields. Sufficient conditions for the existence of a solution and a constructive method to derive it are presented.

  9. A Reduced Basis Framework: Application to large scale non-linear multi-physics problems

    Directory of Open Access Journals (Sweden)

    Daversin C.

    2013-12-01

    Full Text Available In this paper we present applications of the reduced basis method (RBM to large-scale non-linear multi-physics problems. We first describe the mathematical framework in place and in particular the Empirical Interpolation Method (EIM to recover an affine decomposition and then we propose an implementation using the open-source library Feel++ which provides both the reduced basis and finite element layers. Large scale numerical examples are shown and are connected to real industrial applications arising from the High Field Resistive Magnets development at the Laboratoire National des Champs Magnétiques Intenses.

  10. REGULARITY RESULTS FOR LINEAR ELLIPTIC PROBLEMS RELATED TO THE PRIMITIVE EQUATIONS

    Institute of Scientific and Technical Information of China (English)

    2002-01-01

    The authors study the regularity of solutions of the GFD-Stokes problem and of some second order linear elliptic partial differential equations related to the Primitive Equations of the ocean.The present work generalizes the regularity results in [18] by taking into consideration the nonhomogeneous boundary conditions and the dependence of solutions on the thickness ε of the domain occupied by the ocean and its varying bottom topography. These regularity results are important tools in the study of the PEs (see e.g. [6]),and they seem also to possess their own interest.

  11. An Integer Linear Programming Solution to the Telescope Network Scheduling Problem

    CERN Document Server

    Lampoudi, Sotiria; Eastman, Jason

    2015-01-01

    Telescope networks are gaining traction due to their promise of higher resource utilization than single telescopes and as enablers of novel astronomical observation modes. However, as telescope network sizes increase, the possibility of scheduling them completely or even semi-manually disappears. In an earlier paper, a step towards software telescope scheduling was made with the specification of the Reservation formalism, through the use of which astronomers can express their complex observation needs and preferences. In this paper we build on that work. We present a solution to the discretized version of the problem of scheduling a telescope network. We derive a solvable integer linear programming (ILP) model based on the Reservation formalism. We show computational results verifying its correctness, and confirm that our Gurobi-based implementation can address problems of realistic size. Finally, we extend the ILP model to also handle the novel observation requests that can be specified using the more advanc...

  12. STOCHASTIC DIFFERENTIAL EQUATIONS AND STOCHASTIC LINEAR QUADRATIC OPTIMAL CONTROL PROBLEM WITH L(E)VY PROCESSES

    Institute of Scientific and Technical Information of China (English)

    Huaibin TANG; Zhen WU

    2009-01-01

    In this paper, the authors first study two kinds of stochastic differential equations (SDEs)cesses, the authors proceed to study a stochastic linear quadratic (LQ) optimal control problem with One kind of new stochastic Riccati equation that involves equality and inequality constraints is derived from the idea of square completion and its solvability is proved to be sufficient for the well-posedness and the existence of optimal control which can be of either state feedback or open-loop form of the LQ problems. Moreover, the authors obtain the existence and uniqueness of the solution to the Riccati equation for some special cases. Finally, two examples are presented to illustrate these theoretical results.

  13. THE PERIODIC CAPACITATED ARC ROUTING PROBLEM LINEAR PROGRAMMING MODEL,METAHEURISTIC AND LOWER BOUNDS

    Institute of Scientific and Technical Information of China (English)

    Feng CHU; Nacima LABADI; Christian PRINS

    2004-01-01

    The Periodic Capacitated Arc Routing Problem (PCARP) generalizes the well known NP-hard Capacitated Arc Routing Problem (CARP) by extending the single period to multi-period horizon.The Capacitated Arc Routing Problem (CARP) is defined on an undirected network in which a fleet of identical vehicles is based at a depot node. A subset of edges, called tasks, must be serviced by a vehicle. The CARP consists of determining a set of feasible vehicle trips that minimizes the total cost of traversed edges. The PCARP involves the assignment of tasks to periods and the determination of vehicles trips in each period, to minimize the total cost on the whole horizon. This new problem arises in various real life applications such as waste collection, mail delivery, etc. In this paper, a new linear programming model and preliminary lower bounds based on graph transformation are proposed. A meta-heuristic approach - Scatter Search (SS) is developed for the PCARP and evaluated on a large variety of instances.

  14. The initial value problem for linearized gravitational perturbations of the Schwarzschild naked singularity

    Science.gov (United States)

    Dotti, Gustavo; Gleiser, Reinaldo J.

    2009-11-01

    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 ^2 \\Psi _z / \\partial t^2 + {\\cal H} \\Psi _z =0 , where {\\cal H} = -\\partial ^2 / \\partial x^2 + V(x) is the Zerilli 'Hamiltonian' and x is the tortoise radial coordinate. From its definition, for smooth metric perturbations the field Ψz is singular at rs = -6M/(ell - 1)(ell +2), with ell being the mode harmonic number. The equation Ψz obeys is also singular, since V has a second-order pole at rs. This is irrelevant to the black hole exterior stability problem, where r > 2M > 0, and rs 0, and the singularity appears in the relevant range of r (0 value of M. The relation of \\hat{\\Psi} to Ψz is provided by an intertwiner operator. The spatial pieces of the (1 + 1) wave equations that \\hat{\\Psi} and Ψz obey are related as a supersymmetric pair of quantum Hamiltonians {\\cal H} and \\hat{\\cal H} . For Mproof of the linear instability of the Schwarzschild naked singularity, by showing that a previously found unstable mode belongs to a complete basis of \\hat{\\cal H} in {\\cal D} , and thus is excitable by generic initial data. This is further illustrated by numerically solving the linearized equations for suitably chosen initial data.

  15. What Counts as a Flexible Representational Choice? An Evaluation of Students' Representational Choices to Solve Linear Function Problems

    Science.gov (United States)

    Nistal, Ana Acevedo; Van Dooren, Wim; Verschaffel, Lieven

    2012-01-01

    This study evaluated students' representational choices while they solved linear function problems. Eighty-six secondary-school students solved problems under one choice condition, where they chose a table, a formula, or both to solve each problem, and two no-choice conditions, where one of these representations was forced upon them. Two…

  16. Linear stability of the Couette flow of a vibrationally excited gas. 2. viscous problem

    Science.gov (United States)

    Grigor'ev, Yu. N.; Ershov, I. V.

    2016-03-01

    Based on the linear theory, stability of viscous disturbances in a supersonic plane Couette flow of a vibrationally excited gas described by a system of linearized equations of two-temperature gas dynamics including shear and bulk viscosity is studied. It is demonstrated that two sets are identified in the spectrum of the problem of stability of plane waves, similar to the case of a perfect gas. One set consists of viscous acoustic modes, which asymptotically converge to even and odd inviscid acoustic modes at high Reynolds numbers. The eigenvalues from the other set have no asymptotic relationship with the inviscid problem and are characterized by large damping decrements. Two most unstable viscous acoustic modes (I and II) are identified; the limits of these modes were considered previously in the inviscid approximation. It is shown that there are domains in the space of parameters for both modes, where the presence of viscosity induces appreciable destabilization of the flow. Moreover, the growth rates of disturbances are appreciably greater than the corresponding values for the inviscid flow, while thermal excitation in the entire considered range of parameters increases the stability of the viscous flow. For a vibrationally excited gas, the critical Reynolds number as a function of the thermal nonequilibrium degree is found to be greater by 12% than for a perfect gas.

  17. A linear model approach for ultrasonic inverse problems with attenuation and dispersion.

    Science.gov (United States)

    Carcreff, Ewen; Bourguignon, Sébastien; Idier, Jérôme; Simon, Laurent

    2014-07-01

    Ultrasonic inverse problems such as spike train deconvolution, synthetic aperture focusing, or tomography attempt to reconstruct spatial properties of an object (discontinuities, delaminations, flaws, etc.) from noisy and incomplete measurements. They require an accurate description of the data acquisition process. Dealing with frequency-dependent attenuation and dispersion is therefore crucial because both phenomena modify the wave shape as the travel distance increases. In an inversion context, this paper proposes to exploit a linear model of ultrasonic data taking into account attenuation and dispersion. The propagation distance is discretized to build a finite set of radiation impulse responses. Attenuation is modeled with a frequency power law and then dispersion is computed to yield physically consistent responses. Using experimental data acquired from attenuative materials, this model outperforms the standard attenuation-free model and other models of the literature. Because of model linearity, robust estimation methods can be implemented. When matched filtering is employed for single echo detection, the model that we propose yields precise estimation of the attenuation coefficient and of the sound velocity. A thickness estimation problem is also addressed through spike deconvolution, for which the proposed model also achieves accurate results.

  18. A Hierarchical Bayesian Setting for an Inverse Problem in Linear Parabolic PDEs with Noisy Boundary Conditions

    KAUST Repository

    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.

  19. Existence and uniqueness to the Cauchy problem for linear and semilinear parabolic equations with local conditions⋆

    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.

  20. The reduction of the linear stability of elliptic Euler-Moulton solutions of the n-body problem to those of 3-body problems

    Science.gov (United States)

    Zhou, Qinglong; Long, Yiming

    2017-04-01

    In this paper, we consider the elliptic collinear solutions of the classical n-body problem, where the n bodies always stay on a straight line, and each of them moves on its own elliptic orbit with the same eccentricity. Such a motion is called an elliptic Euler-Moulton collinear solution. Here we prove that the corresponding linearized Hamiltonian system at such an elliptic Euler-Moulton collinear solution of n-bodies splits into (n-1) independent linear Hamiltonian systems, the first one is the linearized Hamiltonian system of the Kepler 2-body problem at Kepler elliptic orbit, and each of the other (n-2) systems is the essential part of the linearized Hamiltonian system at an elliptic Euler collinear solution of a 3-body problem whose mass parameter is modified. Then the linear stability of such a solution in the n-body problem is reduced to those of the corresponding elliptic Euler collinear solutions of the 3-body problems, which for example then can be further understood using numerical results of Martínez et al. on 3-body Euler solutions in 2004-2006. As an example, we carry out the detailed derivation of the linear stability for an elliptic Euler-Moulton solution of the 4-body problem with two small masses in the middle.

  1. Composite nonlinear feedback control for output regulation problem of linear discrete-time systems with input saturation

    Institute of Scientific and Technical Information of China (English)

    Chongwen Wang; Xing Chu; Weiyao Lan

    2014-01-01

    Transient performance for output regulation problems of linear discrete-time systems with input saturation is addressed by using the composite nonlinear feedback (CNF) control tech-nique. The regulator is designed to be an additive combination of a linear regulator part and a nonlinear feedback part. The linear regulator part solves the regulation problem independently which produces a quick output response but large oscil ations. The non-linear feedback part with wel-tuned parameters is introduced to improve the transient performance by smoothing the oscil atory convergence. It is shown that the introduction of the nonlinear feedback part does not change the solvability conditions of the linear discrete-time output regulation problem. The effectiveness of transient improvement is il ustrated by a numeric example.

  2. Linear stability analysis in the numerical solution of initial value problems

    Science.gov (United States)

    van Dorsselaer, J. L. M.; Kraaijevanger, J. F. B. M.; Spijker, M. N.

    This article addresses the general problem of establishing upper bounds for the norms of the nth powers of square matrices. The focus is on upper bounds that grow only moderately (or stay constant) where n, or the order of the matrices, increases. The so-called resolvant condition, occuring in the famous Kreiss matrix theorem, is a classical tool for deriving such bounds.Recently the classical upper bounds known to be valid under Kreiss's resolvant condition have been improved. Moreover, generalizations of this resolvant condition have been considered so as to widen the range of applications. The main purpose of this article is to review and extend some of these new developments.The upper bounds for the powers of matrices discussed in this article are intimately connected with the stability analysis of numerical processes for solving initial(-boundary) value problems in ordinary and partial linear differential equations. The article highlights this connection.The article concludes with numerical illustrations in the solution of a simple initial-boundary value problem for a partial differential equation.

  3. Linear problem of the shock wave disturbance in a non-classical case

    Science.gov (United States)

    Semenko, Evgeny V.

    2017-06-01

    A linear problem of the shock wave disturbance for a special (non-classical) case, where both pre-shock and post-shock flows are subsonic, is considered. The phase transition for the van der Waals gas is an example of this problem. Isentropic solutions are constructed. In addition, the stability of the problem is investigated and the known result is approved: the only neutral stability case occurs here. A strictly algebraic representation of the solution in the plane of the Fourier transform is obtained. This representation allows the solution to be studied both analytically and numerically. In this way, any solution can be decomposed into a sum of acoustic and vorticity waves and into a sum of initial (generated by initial perturbations), transmitted (through the shock) and reflected (from the shock) waves. Thus, the wave incidence/refraction/reflection is investigated. A principal difference of the refraction/reflection from the classical case is found, namely, the waves generated by initial pre-shock perturbations not only pass through the shock (i.e., generate post-shock transmitted waves) but also are reflected from it (i.e., generate pre-shock reflected waves). In turn, the waves generated by the initial post-shock perturbation are not only reflected from the shock (generate post-shock reflected waves) but also pass through it (generate pre-shock transmitted waves).

  4. A quasi-physical algorithm for solving the linear separation problem in n-dimensional space

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    A quasi-physical algorithm was proposed for solving the linear separation problem of point set in n-dimensional space, The original idea of the quasi-physical algorithm is to find an equivalent physical world for the primitive mathematical problem and to observe the vivid images of the motion of matter in it so as to be inspired to obtain an algorithm for solving the mathematical problem. In this work, the electrostatics with two kinds of matter is found to be the equivalent physical world. As a result, the proposed algorithm is evidently more efficient and robust than the famous LMS algorithm and ETL algorithm. The efficiency of the quasiphysical algorithm is about 10 - 50 times of the LMS algorithm' s for representative instances. A typical Boolean-valued instance shows that it is hard for ETL algorithm but very easy for the quasi-physical algorithm.In this instance, point set A and B is {000, 010, 011, 111 and {001,100}, respectively.

  5. Reorganizing Neural Network System for Two Spirals and Linear Low-Density Polyethylene Copolymer Problems

    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.

  6. Statistical mechanical analysis of linear programming relaxation for combinatorial optimization problems

    Science.gov (United States)

    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.

  7. A O(n^8) X O(n^7) Linear Programming Model of the Traveling Salesman Problem

    CERN Document Server

    Diaby, Moustapha

    2008-01-01

    In this paper, we present a new linear programming (LP) formulation of the Traveling Salesman Problem (TSP). The proposed model has O(n^8) variables and O(n^7) constraints, where n is the number of cities. Our numerical experimentation shows that computational times for the proposed linear program are several orders of magnitude smaller than those for the existing model [3].

  8. A Linear Viscoelastic Model Calibration of Sylgard 184.

    Energy Technology Data Exchange (ETDEWEB)

    Long, Kevin Nicholas; Brown, Judith Alice

    2017-04-01

    We calibrate a linear thermoviscoelastic model for solid Sylgard 184 (90-10 formulation), a lightly cross-linked, highly flexible isotropic elastomer for use both in Sierra / Solid Mechanics via the Universal Polymer Model as well as in Sierra / Structural Dynamics (Salinas) for use as an isotropic viscoelastic material. Material inputs for the calibration in both codes are provided. The frequency domain master curve of oscillatory shear was obtained from a report from Los Alamos National Laboratory (LANL). However, because the form of that data is different from the constitutive models in Sierra, we also present the mapping of the LANL data onto Sandia’s constitutive models. Finally, blind predictions of cyclic tension and compression out to moderate strains of 40 and 20% respectively are compared with Sandia’s legacy cure schedule material. Although the strain rate of the data is unknown, the linear thermoviscoelastic model accurately predicts the experiments out to moderate strains for the slower strain rates, which is consistent with the expectation that quasistatic test procedures were likely followed. This good agreement comes despite the different cure schedules between the Sandia and LANL data.

  9. The method of varying amplitudes for solving (non)linear problems involving strong parametric excitation

    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...

  10. Posterior Consistency of the Bayesian Approach to Linear Ill-Posed Inverse Problems

    CERN Document Server

    Agapiou, Sergios; Stuart, Andrew M

    2012-01-01

    We consider a Bayesian nonparametric approach to a family of linear inverse problems in a separable Hilbert space setting, with Gaussian prior and noise distribution. A method of identifying the posterior distribution using its precision operator is presented. Working with the unbounded precision operator enables us to use partial differential equations (PDE) methodology to study posterior consistency in a frequentist sense, and in particular to obtain rates of contraction of the posterior distribution to a Dirac measure centered on the true solution. We show how these rates may be optimized by a choice of the scale parameter in the prior covariance operator. Our methods assume a relatively weak relation between the prior covariance operator, the forward operator and the noise covariance operator; more precisely, we assume that appropriate powers of these operators induce equivalent norms. We compare our results to known minimax rates of convergence in the case where the forward operator and the prior and noi...

  11. Homotopy Analysis Method:A new Analytical Technique for Non—linear Problems

    Institute of Scientific and Technical Information of China (English)

    ShijunLIAO

    1997-01-01

    In this paper,the basic ideas of a new kind of analytical technique,namely the Homotopy Analysis Method(HAM),are briefly described.Different from perturbation techniques,the HAM does not depend on whether or not there exist small parameters in non-linear equations under consideration.Therefore,it provides us with a powerful tool to analyse strongly nonlinear problems.A simple but typical example is used to illustrate the validity and the great potential of the HAM.Moreover,a pure mathematical theorem,namely the General Taylor Theorem,is given in appendix,which provides us with some rational knowldge for the validity of this new analytical technique.

  12. Maximum Principle for Linear-Convex Boundary Control Problems applied to Optimal Investment with Vintage Capital

    CERN Document Server

    Faggian, Silvia

    2007-01-01

    The paper concerns the study of the Pontryagin Maximum Principle for an infinite dimensional and infinite horizon boundary control problem for linear partial differential equations. The optimal control model has already been studied both in finite and infinite horizon with Dynamic Programming methods in a series of papers by the same author, or by Faggian and Gozzi. Necessary and sufficient optimality conditions for open loop controls are established. Moreover the co-state variable is shown to coincide with the spatial gradient of the value function evaluated along the trajectory of the system, creating a parallel between Maximum Principle and Dynamic Programming. The abstract model applies, as recalled in one of the first sections, to optimal investment with vintage capital.

  13. A numerical algorithm for optimal feedback gains in high dimensional linear quadratic regulator problems

    Science.gov (United States)

    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.

  14. Improved Full-Newton-Step Infeasible Interior-Point Method for Linear Complementarity Problems

    Directory of Open Access Journals (Sweden)

    Goran Lešaja

    2016-04-01

    Full Text Available We present an Infeasible Interior-Point Method for monotone Linear Complementarity Problem (LCP which is an improved version of the algorithm given in [13]. In the earlier version, each iteration consisted of one feasibility step and few centering steps. The improved version guarantees that after one feasibility step, the new iterate is feasible and close enough to the central path thanks to the much tighter proximity estimate which is based on the new lemma introduced in [18]. Thus, the centering steps are eliminated. Another advantage of this method is the use of full-Newton-steps, that is, no calculation of the step size is required. The preliminary implementation and numerical results demonstrate the advantage of the improved version of the method in comparison with the old one.

  15. A review of vector convergence acceleration methods, with applications to linear algebra problems

    Science.gov (United States)

    Brezinski, C.; Redivo-Zaglia, M.

    In this article, in a few pages, we will try to give an idea of convergence acceleration methods and extrapolation procedures for vector sequences, and to present some applications to linear algebra problems and to the treatment of the Gibbs phenomenon for Fourier series in order to show their effectiveness. The interested reader is referred to the literature for more details. In the bibliography, due to space limitation, we will only give the more recent items, and, for older ones, we refer to Brezinski and Redivo-Zaglia, Extrapolation methods. (Extrapolation Methods. Theory and Practice, North-Holland, 1991). This book also contains, on a magnetic support, a library (in Fortran 77 language) for convergence acceleration algorithms and extrapolation methods.

  16. 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.

  17. The efficient solution of the (quietly constrained) noisy, linear regulator problem

    Science.gov (United States)

    Gregory, John; Hughes, H. R.

    2007-09-01

    In a previous paper we gave a new, natural extension of the calculus of variations/optimal control theory to a (strong) stochastic setting. We now extend the theory of this most fundamental chapter of optimal control in several directions. Most importantly we present a new method of stochastic control, adding Brownian motion which makes the problem "noisy." Secondly, we show how to obtain efficient solutions: direct stochastic integration for simpler problems and/or efficient and accurate numerical methods with a global a priori error of O(h3/2) for more complex problems. Finally, we include "quiet" constraints, i.e. deterministic relationships between the state and control variables. Our theory and results can be immediately restricted to the non "noisy" (deterministic) case yielding efficient, numerical solution techniques and an a priori error of O(h2)E In this event we obtain the most efficient method of solving the (constrained) classical Linear Regulator Problem. Our methods are different from the standard theory of stochastic control. In some cases the solutions coincide or at least are closely related. However, our methods have many advantages including those mentioned above. In addition, our methods more directly follow the motivation and theory of classical (deterministic) optimization which is perhaps the most important area of physical and engineering science. Our results follow from related ideas in the deterministic theory. Thus, our approximation methods follow by guessing at an algorithm, but the proof of global convergence uses stochastic techniques because our trajectories are not differentiable. Along these lines, a general drift term in the trajectory equation is properly viewed as an added constraint and extends ideas given in the deterministic case by the first author.

  18. Stabilizing inverse problems by internal data. II: non-local internal data and generic linearized uniqueness

    KAUST Repository

    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.

  19. 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.

  20. A study of the use of linear programming techniques to improve the performance in design optimization problems

    Science.gov (United States)

    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.

  1. An optimization algorithm for checking feasibility of robust H-infinity-control problem for linear time-varying uncertain systems

    NARCIS (Netherlands)

    Balandin, DV; Kogan, MM

    2004-01-01

    An algorithm for checking feasibility of the robust H-infinity-control problem for systems with time-varying norm bounded uncertainty is suggested. This algorithm is an iterative procedure on each step of which an optimization problem for a linear function under convex constraints determined by LMIs

  2. A unified numerical scheme for linear-quadratic optimal control problems with joint control and state constraints

    NARCIS (Netherlands)

    Han, Lanshan; Camlibel, M. Kanat; Pang, Jong-Shi; Heemels, W. P. Maurice H.

    2012-01-01

    This paper presents a numerical scheme for solving the continuous-time convex linear-quadratic (LQ) optimal control problem with mixed polyhedral state and control constraints. Unifying a discretization of this optimal control problem as often employed in model predictive control and that obtained

  3. Generalized magneto-thermoviscoelasticity in a perfectly conducting thermodiffusive medium with a spherical cavity

    Indian Academy of Sciences (India)

    Ashraf M Zenkour; Ebraheem O Alzahrani; Ahmed E Abouelregal

    2015-12-01

    In this work, the effects of viscosity and diffusion on thermoelastic interactions in an infinite medium with a spherical cavity are studied. The formulation is applied to the generalized thermoelasticity based on the theory of generalized thermoelastic diffusion with one relaxation time. The surface of the spherical cavity is taken to be traction free and subjected to both heating and external constant magnetic field. The solution is obtained in the Laplace transform domain by using a direct approach. The solution of the problem in the physical domain obtained numerically using a method based on Fourier expansion techniques. The temperature, displacement, stress, concentration as well as the chemical potential are obtained and represented graphically. Comparisons are made within the theory in the presence and absence of viscosity and diffusion.

  4. Solving large double digestion problems for DNA restriction mapping by using branch-and-bound integer linear programming.

    Science.gov (United States)

    Wu, Z; Zhang, Y

    2008-01-01

    The double digestion problem for DNA restriction mapping has been proved to be NP-complete and intractable if the numbers of the DNA fragments become large. Several approaches to the problem have been tested and proved to be effective only for small problems. In this paper, we formulate the problem as a mixed-integer linear program (MIP) by following (Waterman, 1995) in a slightly different form. With this formulation and using state-of-the-art integer programming techniques, we can solve randomly generated problems whose search space sizes are many-magnitude larger than previously reported testing sizes.

  5. APPLICATION OF LINEAR PROGRAMMING TO FACILITY MAINTENANCE PROBLEMS IN THE NAVY SHORE ESTABLISHMENT.

    Science.gov (United States)

    LINEAR PROGRAMMING ), (*NAVAL SHORE FACILITIES, MAINTENANCE), (*MAINTENANCE, COSTS, MATHEMATICAL MODELS, MANAGEMENT PLANNING AND CONTROL, MANPOWER, FEASIBILITY STUDIES, OPTIMIZATION, MANAGEMENT ENGINEERING.

  6. A Mixed Integer Linear Program for Solving a Multiple Route Taxi Scheduling Problem

    Science.gov (United States)

    Montoya, Justin Vincent; Wood, Zachary Paul; Rathinam, Sivakumar; Malik, Waqar Ahmad

    2010-01-01

    Aircraft movements on taxiways at busy airports often create bottlenecks. This paper introduces a mixed integer linear program to solve a Multiple Route Aircraft Taxi Scheduling Problem. The outputs of the model are in the form of optimal taxi schedules, which include routing decisions for taxiing aircraft. The model extends an existing single route formulation to include routing decisions. An efficient comparison framework compares the multi-route formulation and the single route formulation. The multi-route model is exercised for east side airport surface traffic at Dallas/Fort Worth International Airport to determine if any arrival taxi time savings can be achieved by allowing arrivals to have two taxi routes: a route that crosses an active departure runway and a perimeter route that avoids the crossing. Results indicate that the multi-route formulation yields reduced arrival taxi times over the single route formulation only when a perimeter taxiway is used. In conditions where the departure aircraft are given an optimal and fixed takeoff sequence, accumulative arrival taxi time savings in the multi-route formulation can be as high as 3.6 hours more than the single route formulation. If the departure sequence is not optimal, the multi-route formulation results in less taxi time savings made over the single route formulation, but the average arrival taxi time is significantly decreased.

  7. Evaluation of parallel direct sparse linear solvers in electromagnetic geophysical problems

    Science.gov (United States)

    Puzyrev, Vladimir; Koric, Seid; Wilkin, Scott

    2016-04-01

    High performance computing is absolutely necessary for large-scale geophysical simulations. In order to obtain a realistic image of a geologically complex area, industrial surveys collect vast amounts of data making the computational cost extremely high for the subsequent simulations. A major computational bottleneck of modeling and inversion algorithms is solving the large sparse systems of linear ill-conditioned equations in complex domains with multiple right hand sides. Recently, parallel direct solvers have been successfully applied to multi-source seismic and electromagnetic problems. These methods are robust and exhibit good performance, but often require large amounts of memory and have limited scalability. In this paper, we evaluate modern direct solvers on large-scale modeling examples that previously were considered unachievable with these methods. Performance and scalability tests utilizing up to 65,536 cores on the Blue Waters supercomputer clearly illustrate the robustness, efficiency and competitiveness of direct solvers compared to iterative techniques. Wide use of direct methods utilizing modern parallel architectures will allow modeling tools to accurately support multi-source surveys and 3D data acquisition geometries, thus promoting a more efficient use of the electromagnetic methods in geophysics.

  8. Error Analysis Of Students Working About Word Problem Of Linear Program With NEA Procedure

    Science.gov (United States)

    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.

  9. 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.

  10. GPU-Based Heuristic Solver for Linear Sum Assignment Problems Under Real-time Constraints

    CERN Document Server

    Roverso, Roberto; El-Beltagy, Mohammed; El-Ansary, Sameh

    2011-01-01

    In this paper we modify a fast heuristic solver for the Linear Sum Assignment Problem (LSAP) for use on Graphical Processing Units (GPUs). The motivating scenario is an industrial application for P2P live streaming that is moderated by a central node which is periodically solving LSAP instances for assigning peers to one another. The central node needs to handle LSAP instances involving thousands of peers in as near to real-time as possible. Our findings are generic enough to be applied in other contexts. Our main result is a parallel version of a heuristic algorithm called Deep Greedy Switching (DGS) on GPUs using the CUDA programming language. DGS sacrifices absolute optimality in favor of low computation time and was designed as an alternative to classical LSAP solvers such as the Hungarian and auctioning methods. The contribution of the paper is threefold: First, we present the process of trial and error we went through, in the hope that our experience will be beneficial to adopters of GPU programming for...

  11. A GLOBAL LINEAR AND LOCAL QUADRATIC SINGLE-STEP NONINTERIOR CONTINUATION METHOD FOR MONOTONE SEMIDEFINITE COMPLEMENTARITY PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    A noninterior continuation method is proposed for semidefinite complementarity problem (SDCP). This method improves the noninterior continuation methods recently developed for SDCP by Chen and Tseng. The main properties of our method are: (i)it is well defined for the monotones SDCP; (ii) it has to solve just one linear system of equations at each step; (iii) it is shown to be both globally linearly convergent and locally quadratically convergent under suitable assumptions.

  12. A O(n^8) X O(n^7) Linear Programming Model of the Quadratic Assignment Problem

    OpenAIRE

    Diaby, Moustapha

    2008-01-01

    This paper has been withdrawn because Theorem 21 and Corollary 22 are in error; The modeling idea is OK, but it needs 9-dimensional variables instead of the 8-dimensional variables defined in notations 6.9. Examples of the correct model (with 9-index variables) are: (1) Diaby, M., "Linear Programming Formulation of the Set Partitioning Problem," International Journal of Operational Research 8:4 (August 2010) pp. 399-427; (2) Diaby, M., "Linear Programming Formulation of the Vertex Coloring Pr...

  13. A class of stochastic optimization problems with one quadratic & several linear objective functions and extended portfolio selection model

    Science.gov (United States)

    Xu, Jiuping; Li, Jun

    2002-09-01

    In this paper a class of stochastic multiple-objective programming problems with one quadratic, several linear objective functions and linear constraints has been introduced. The former model is transformed into a deterministic multiple-objective nonlinear programming model by means of the introduction of random variables' expectation. The reference direction approach is used to deal with linear objectives and results in a linear parametric optimization formula with a single linear objective function. This objective function is combined with the quadratic function using the weighted sums. The quadratic problem is transformed into a linear (parametric) complementary problem, the basic formula for the proposed approach. The sufficient and necessary conditions for (properly, weakly) efficient solutions and some construction characteristics of (weakly) efficient solution sets are obtained. An interactive algorithm is proposed based on reference direction and weighted sums. Varying the parameter vector on the right-hand side of the model, the DM can freely search the efficient frontier with the model. An extended portfolio selection model is formed when liquidity is considered as another objective to be optimized besides expectation and risk. The interactive approach is illustrated with a practical example.

  14. Asymptotics of linear initial boundary value problems with periodic boundary data on the half-line and finite intervals

    KAUST Repository

    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.

  15. A DUAL-RELAX PENALTY FUNCTION APPROACH FOR SOLVING NONLINEAR BILEVEL PROGRAMMING WITH LINEAR LOWER LEVEL PROBLEM

    Institute of Scientific and Technical Information of China (English)

    Wan Zhongping; Wang Guangrain; Lv Yibing

    2011-01-01

    The penalty function method, presented many years ago, is an important nu- merical method for the mathematical programming problems. In this article, we propose a dual-relax penalty function approach, which is significantly different from penalty func- tion approach existing for solving the bilevel programming, to solve the nonlinear bilevel programming with linear lower level problem. Our algorithm will redound to the error analysis for computing an approximate solution to the bilevel programming. The error estimate is obtained among the optimal objective function value of the dual-relax penalty problem and of the original bilevel programming problem. An example is illustrated to show the feasibility of the proposed approach.

  16. On the reformulation of topology optimization problems as linear or convex quadratic mixed 0–1 programs

    DEFF Research Database (Denmark)

    Stolpe, Mathias

    2007-01-01

    We consider equivalent reformulations of nonlinear mixed 0–1 optimization problems arising from a broad range of recent applications of topology optimization for the design of continuum structures and composite materials. We show that the considered problems can equivalently be cast as either...... linear or convex quadratic mixed 0–1 programs. The reformulations provide new insight into the structure of the problems and may provide a foundation for the development of new methods and heuristics for solving topology optimization problems. The applications considered are maximum stiffness design...

  17. On the reformulation of topology optimization problems as linear or convex quadratic mixed 0-1 programs

    DEFF Research Database (Denmark)

    Stolpe, Mathias

    2004-01-01

    We consider equivalent reformulations of nonlinear mixed 0-1 optimization problems arising from a broad range of recent applications of topology optimization for the design of continuum structures and composite materials. It is shown that the considered problems may equivalently be cast as either...... linear or as convex quadratic mixed 0-1 programs. The reformulations provide new insight into the structure of the problems and may provide a foundation for the development of new methods and heuristics for solving topology optimization problems. The applications considered are maximum stiffness design...

  18. Integer linear models with a polynomial number of variables and constraints for some classical combinatorial optimization problems

    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.

  19. The late Universe with non-linear interaction in the dark sector: The coincidence problem

    Science.gov (United States)

    Bouhmadi-López, Mariam; Morais, João; Zhuk, Alexander

    2016-12-01

    We study the Universe at the late stage of its evolution and deep inside the cell of uniformity. At such a scale the Universe is highly inhomogeneous and filled with discretely distributed inhomogeneities in the form of galaxies and groups of galaxies. As a matter source, we consider dark matter (DM) and dark energy (DE) with a non-linear interaction Q = 3 HγεbarDEεbarDM /(εbarDE +εbarDM) , where γ is a constant. We assume that DM is pressureless and DE has a constant equation of state parameter w. In the considered model, the energy densities of the dark sector components present a scaling behaviour with εbarDM /εbarDE ∼(a0 / a) - 3(w + γ). We investigate the possibility that the perturbations of DM and DE, which are interacting among themselves, could be coupled to the galaxies with the former being concentrated around them. To carry our analysis, we consider the theory of scalar perturbations (within the mechanical approach), and obtain the sets of parameters (w , γ) which do not contradict it. We conclude that two sets: (w = - 2 / 3 , γ = 1 / 3) and (w = - 1 , γ = 1 / 3) are of special interest. First, the energy densities of DM and DE on these cases are concentrated around galaxies confirming that they are coupled fluids. Second, we show that for both of them, the coincidence problem is less severe than in the standard ΛCDM. Third, the set (w = - 1 , γ = 1 / 3) is within the observational constraints. Finally, we also obtain an expression for the gravitational potential in the considered model.

  20. Multiple Linear Regression for Reconstruction of Gene Regulatory Networks in Solving Cascade Error Problems

    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.

  1. On the well-posedness of a linearized plasma-vacuum interface problem in ideal compressible MHD

    CERN Document Server

    Trakhinin, Yuri

    2010-01-01

    We study the initial-boundary value problem resulting from the linearization of the plasma-vacuum interface problem in ideal compressible magnetohydrodynamics (MHD). We suppose that the plasma and the vacuum regions are unbounded domains and the plasma density does not go to zero continuously, but jumps. For the basic state upon which we perform linearization we find two cases of well-posedness of the "frozen" coefficient problem: the "gas dynamical" case and the "purely MHD" case. In the "gas dynamical" case we assume that the jump of the normal derivative of the total pressure is always negative. In the "purely MHD" case this condition can be violated but the plasma and the vacuum magnetic fields are assumed to be non-zero and non-parallel to each other everywhere on the interface. For this case we prove a basic a priori estimate in the anisotropic weighted Sobolev space $H^1_*$ for the variable coefficient problem.

  2. A numerical modelling of non linear 2D-frictional multicontact problems: application to post-buckling in cellular media

    Science.gov (United States)

    Alart, P.; Barboteu, M.; Gril, J.

    2004-09-01

    In this paper a numerical modelling of non linear problems involving large deformations and frictional contact conditions is proposed. The motivation of this work comes from the study of the cellular materials (such as wood or foams) undergoing strong deformations. We restrict our study to a regular cellular network of hexagonal cells with thin walls. Strong loadings can generate at first buckling phenomena, then self-contact in the cell. Renouncing homogenization procedures, not always pertinent in this case, we have developed direct simulations. After giving the mechanical and mathematical formulations of the problem, we present two advanced numerical tools to solve large non linear frictional multicontact problems. This numerical modelling is based on an arc-length continuation method which permits to snap through singular points due to buckling phenomena and on an optimal domain decomposition method adapted to frictional contact problems. Finally, mechanical investigations of the contactless buckling and the post-buckling provide some pertinent parameters controlling the deformation process.

  3. GLOBAL C1 SOLUTION TO THE INITIAL-BOUNDARY VALUE PROBLEM FOR DIAGONAL HYPERBOLIC SYSTEMS WITH LINEARLY DEGENERATE CHARACTERISTICS

    Institute of Scientific and Technical Information of China (English)

    Li Ta-tsien(李大潜); Peng Yue-Jun

    2003-01-01

    Abstract We prove that the C0 boundedness of solution impliesthe global existence and uniqueness of C1 solution to the initial-boundary value problem for linearly degenerate quasilinear hyperbolic systems of diagonal form with nonlinear boundary conditions. Thus, if the C1 solution to the initial-boundary value problem blows up in a finite time, then the solution itself must tend to the infinity at the starting point of singularity.

  4. Infinite horizon jump-diffusion forward-backward stochastic differential equations and their application to backward linear-quadratic problems

    OpenAIRE

    Yu, Zhiyong

    2016-01-01

    In this paper, we investigate infinite horizon jump-diffusion forward-backward stochastic differential equations under some monotonicity conditions. We establish an existence and uniqueness theorem, two stability results and a comparison theorem for solutions to such kind of equations. Then the theoretical results are applied to study a kind of infinite horizon backward stochastic linear-quadratic optimal control problems, and then differential game problems. The unique optimal controls for t...

  5. Solving the Fully Fuzzy Bilevel Linear Programming Problem through Deviation Degree Measures and a Ranking Function Method

    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.

  6. A two-dimensional linear elasticity problem for anisotropic materials, solved with a parallelization code

    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.

  7. Real-time solution of linear computational problems using databases of parametric reduced-order models with arbitrary underlying meshes

    Science.gov (United States)

    Amsallem, David; Tezaur, Radek; Farhat, Charbel

    2016-12-01

    A comprehensive approach for real-time computations using a database of parametric, linear, projection-based reduced-order models (ROMs) based on arbitrary underlying meshes is proposed. In the offline phase of this approach, the parameter space is sampled and linear ROMs defined by linear reduced operators are pre-computed at the sampled parameter points and stored. Then, these operators and associated ROMs are transformed into counterparts that satisfy a certain notion of consistency. In the online phase of this approach, a linear ROM is constructed in real-time at a queried but unsampled parameter point by interpolating the pre-computed linear reduced operators on matrix manifolds and therefore computing an interpolated linear ROM. The proposed overall model reduction framework is illustrated with two applications: a parametric inverse acoustic scattering problem associated with a mockup submarine, and a parametric flutter prediction problem associated with a wing-tank system. The second application is implemented on a mobile device, illustrating the capability of the proposed computational framework to operate in real-time.

  8. Unified Analysis of Kernel-Based Interior-Point Methods for P∗(κ)-Linear Complementarity Problems

    NARCIS (Netherlands)

    Lesaja, G.; Roos, C.

    2010-01-01

    We present an interior-point method for the P∗(κ)-linear complementarity problem (LCP) that is based on barrier functions which are defined by a large class of univariate functions called eligible kernel functions. This class is fairly general and includes the classical logarithmic function and the

  9. A O(n^8) X O(n^7) Linear Programming Model of the Quadratic Assignment Problem

    CERN Document Server

    Diaby, Moustapha

    2008-01-01

    In this paper, we propose a linear programming (LP) formulation of the Quadratic Assignment Problem (QAP) with O(n^8) variables and O(n^7) constraints, where n is the number of assignments. A small experimentation that was undertaken in order to gain some rough indications about the computational performance of the model is discussed.

  10. Comparative Study of Evolutionary Multi-objective Optimization Algorithms for a Non-linear Greenhouse Climate Control Problem

    DEFF Research Database (Denmark)

    Ghoreishi, Newsha; Sørensen, Jan Corfixen; Jørgensen, Bo Nørregaard

    2015-01-01

    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...

  11. Some Problems in Linear Algebra Course%线性代数教学中的几个问题

    Institute of Scientific and Technical Information of China (English)

    陈维新

    2011-01-01

    从线性代数教学实践中,选取3个学生提出的问题,进行分析,予以解答.%We discuss three typical problems raised by students in the linear algebra course and provide detail solutions to them.

  12. A natural neighbour method based on Fraeijs de Veubeke variational principle for materially non-linear problems

    Institute of Scientific and Technical Information of China (English)

    Xiang Li; Serge Cescotto; Barbara Rossi

    2009-01-01

    The natural neighbour method can be considered as one of many variants of the meshless methods. In the present paper, a new approach based on the Fraeijs de Veubeke (FdV) functional, which is initially developed for linear elasticity, is extended to the case of geometrically linear but materially non-linear solids. The new approach provides an original treatment to two classical problems: the numerical evaluation of the integrals over the domain A and the enforcement of boundary conditions of the type ui = uion Su. In the absence of body forces (Fi = 0), it will be shown that the calculation of integrals of the type fA .dA can be avoided and that boundary conditions of the type ui = ui on Su can be imposed in the average sense in general and exactly if ui is linear between two contour nodes, which is obviously the case for ui = 0.

  13. SOME PROBLEMS CONCERNING FREE NON-LINEAR VIBRATIONS OF BEAM STRUCTURES

    Directory of Open Access Journals (Sweden)

    S. V. Bosakov

    2008-01-01

    Full Text Available The paper analyzes an influence of physical non-linearity material account on vibrations of single beams with various support fixing. The authors also analyze power criteria for existing stable periodic vibrations and dependence of vibration period on initial power is determined in the paper. Accurate values of an amplitude and non-linear bending vibration period of beams have been also determined as a conservative system with due account of initial conditions. A number of examples are given that clearly illustrate the obtained solutions and show an influence rate of the mentioned effects on amplitude-frequency characteristics of non-linear systems. 

  14. A note on the solution of fuzzy transportation problem using fuzzy linear system

    Directory of Open Access Journals (Sweden)

    P. Senthilkumar

    2013-08-01

    Full Text Available In this paper, we discuss the solution of a fuzzy transportation problem, with fuzzy quantities. The problem is solved in two stages. In the first stage, the fuzzy transportation problem is reduced to crisp system by using the lower and upper bounds of fuzzy quantities. In the second stage, the crisp transportation problems are solved by usual simplex method. The procedure is illustrated with numerical examples.

  15. Multiple Problem-Solving Strategies Provide Insight into Students' Understanding of Open-Ended Linear Programming Problems

    Science.gov (United States)

    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,…

  16. State-space models’ dirty little secrets: even simple linear Gaussian models can have estimation problems

    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...

  17. Linearization and Decomposition Methods for Large Scale Stochastic Inventory Routing Problem with Service Level Constraints

    NARCIS (Netherlands)

    Y. Yu (Yugang); C. Chu (Chengbin); H.X. Chen (Haoxun); F. Chu (Feng)

    2010-01-01

    textabstractA stochastic inventory routing problem (SIRP) is typically the combination of stochastic inventory control problems and NP-hard vehicle routing problems, for a depot to determine delivery volumes to its customers in each period, and vehicle routes to distribute the delivery volumes. This

  18. High Order A-stable Continuous General Linear Methods for Solution of Systems of Initial Value Problems in ODEs

    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.

  19. Global exponential stability of neural networks with globally Lipschitz continuous activations and its application to linear variational inequality problem.

    Science.gov (United States)

    Liang, X B; Si, J

    2001-01-01

    This paper investigates the existence, uniqueness, and global exponential stability (GES) of the equilibrium point for a large class of neural networks with globally Lipschitz continuous activations including the widely used sigmoidal activations and the piecewise linear activations. The provided sufficient condition for GES is mild and some conditions easily examined in practice are also presented. The GES of neural networks in the case of locally Lipschitz continuous activations is also obtained under an appropriate condition. The analysis results given in the paper extend substantially the existing relevant stability results in the literature, and therefore expand significantly the application range of neural networks in solving optimization problems. As a demonstration, we apply the obtained analysis results to the design of a recurrent neural network (RNN) for solving the linear variational inequality problem (VIP) defined on any nonempty and closed box set, which includes the box constrained quadratic programming and the linear complementarity problem as the special cases. It can be inferred that the linear VIP has a unique solution for the class of Lyapunov diagonally stable matrices, and that the synthesized RNN is globally exponentially convergent to the unique solution. Some illustrative simulation examples are also given.

  20. Fast Combinatorial Algorithm for the Solution of Linearly Constrained Least Squares Problems

    Science.gov (United States)

    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.

  1. Influence of geometrical parameters on the linear stability of a Bénard-Marangoni problem

    Science.gov (United States)

    Hoyas, S.; Fajardo, P.; Pérez-Quiles, M. J.

    2016-04-01

    A linear stability analysis of a thin liquid film flowing over a plate is performed. The analysis is performed in an annular domain when momentum diffusivity and thermal diffusivity are comparable (relatively low Prandtl number, Pr =1.2 ). The influence of the aspect ratio (Γ ) and gravity, through the Bond number (Bo ), in the linear stability of the flow are analyzed together. Two different regions in the Γ -Bo plane have been identified. In the first one the basic state presents a linear regime (in which the temperature gradient does not change sign with r ). In the second one, the flow presents a nonlinear regime, also called return flow. A great diversity of bifurcations have been found just by changing the domain depth d . The results obtained in this work are in agreement with some reported experiments, and give a deeper insight into the effect of physical parameters on bifurcations.

  2. Kinematics and tribological problems of linear guidance systems in four contact points

    Science.gov (United States)

    Popescu, A.; Olaru, D.

    2016-08-01

    A procedure has been developed to determine both the value of the ball's angular velocity and the angular position of this velocity, according to the normal loads in a linear system with four contact points. The program is based on the variational analysis of the power losses in ball-races contacts. Based on this the two kinematics parameters of the ball (angular velocity and angular position) were determined, in a linear system type KUE 35 as function of the C/P ratio.

  3. Advanced topics in linear algebra weaving matrix problems through the Weyr form

    CERN Document Server

    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

  4. General theory of spherically symmetric boundary-value problems of the linear transport theory.

    Science.gov (United States)

    Kanal, M.

    1972-01-01

    A general theory of spherically symmetric boundary-value problems of the one-speed neutron transport theory is presented. The formulation is also applicable to the 'gray' problems of radiative transfer. The Green's function for the purely absorbing medium is utilized in obtaining the normal mode expansion of the angular densities for both interior and exterior problems. As the integral equations for unknown coefficients are regular, a general class of reduction operators is introduced to reduce such regular integral equations to singular ones with a Cauchy-type kernel. Such operators then permit one to solve the singular integral equations by the standard techniques due to Muskhelishvili. We discuss several spherically symmetric problems. However, the treatment is kept sufficiently general to deal with problems lacking azimuthal symmetry. In particular the procedure seems to work for regions whose boundary coincides with one of the coordinate surfaces for which the Helmholtz equation is separable.

  5. On the General Taylor Theorem and its Applications in Solving Non—linear Problems

    Institute of Scientific and Technical Information of China (English)

    ShiJunLIAO

    1997-01-01

    In this paper,we propose a general Taylor series and prove a general Taylor theorem and then simply give some applications of it in solving non-linear differential equations.The general Taylor series is a family of power series which contains the classical Taylor series in logic.Moreover,it can be valid in much larger regions.

  6. Adaptive Wavelet Methods for Linear and Nonlinear Least-Squares Problems

    NARCIS (Netherlands)

    Stevenson, R.

    2014-01-01

    The adaptive wavelet Galerkin method for solving linear, elliptic operator equations introduced by Cohen et al. (Math Comp 70:27-75, 2001) is extended to nonlinear equations and is shown to converge with optimal rates without coarsening. Moreover, when an appropriate scheme is available for the appr

  7. The Optimal Linear Quadratic Feedback State Regulator Problem for Index One Descriptor Systems

    NARCIS (Netherlands)

    Engwerda, J.C.; Salmah, Y.; Wijayanti, I.E.

    2008-01-01

    In this note we present both necessary and sufficient conditions for the existence of a linear static state feedback controller if the system is described by an index one descriptor system. A priori no definiteness restrictions are made w.r.t. the quadratic performance criterium. It is shown that in

  8. The Center Problem for a Linear Center Perturbed by Homogeneous Polynomials

    Institute of Scientific and Technical Information of China (English)

    Jaume GIN(E)

    2006-01-01

    The centers of the polynomial differential systems with a linear center perturbed by homogeneous polynomials have been studied for the degrees s = 2, 3, 4, 5. They are completely classified for s = 2, 3, and partially classified for s = 4, 5. In this paper we recall these results for s = 2, 3, 4, 5,and we give new centers for s = 6, 7

  9. The Linearized Simultaneous String-Design and Cargo-Routing Problem

    DEFF Research Database (Denmark)

    Plum, Christian Edinger Munk

    A global liner shipping network, consists of a billion dollar investment in assets. Designing this network, to minimize costs, while considering operational constraints is thus of great relevance. Empirical studies of the cost structure of a networks strings (ship rotations), show linear relation...

  10. Variations on the Planar Landau Problem: Canonical Transformations, A Purely Linear Potential and the Half-Plane

    CERN Document Server

    Govaerts, Jan; 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.

  11. On the roles of minimization and linearization in least-squares finite element models of nonlinear boundary-value problems

    Science.gov (United States)

    Payette, G. S.; Reddy, J. N.

    2011-05-01

    In this paper we examine the roles of minimization and linearization in the least-squares finite element formulations of nonlinear boundary-values problems. The least-squares principle is based upon the minimization of the least-squares functional constructed via the sum of the squares of appropriate norms of the residuals of the partial differential equations (in the present case we consider L2 norms). Since the least-squares method is independent of the discretization procedure and the solution scheme, the least-squares principle suggests that minimization should be performed prior to linearization, where linearization is employed in the context of either the Picard or Newton iterative solution procedures. However, in the least-squares finite element analysis of nonlinear boundary-value problems, it has become common practice in the literature to exchange the sequence of application of the minimization and linearization operations. The main purpose of this study is to provide a detailed assessment on how the finite element solution is affected when the order of application of these operators is interchanged. The assessment is performed mathematically, through an examination of the variational setting for the least-squares formulation of an abstract nonlinear boundary-value problem, and also computationally, through the numerical simulation of the least-squares finite element solutions of both a nonlinear form of the Poisson equation and also the incompressible Navier-Stokes equations. The assessment suggests that although the least-squares principle indicates that minimization should be performed prior to linearization, such an approach is often impractical and not necessary.

  12. A reformulation of the Linear-Quadratic-Gaussian stochastic control problem for application to low thrust navigation analysis

    Science.gov (United States)

    Jacobson, R. A.

    1978-01-01

    The formulation of the classical Linear-Quadratic-Gaussian stochastic control problem as employed in low thrust navigation analysis is reviewed. A reformulation is then presented which eliminates a potentially unreliable matrix subtraction in the control calculations, improves the computational efficiency, and provides for a cleaner computational interface between the estimation and control processes. Lastly, the application of the U-D factorization method to the reformulated equations is examined with the objective of achieving a complete set of factored equations for the joint estimation and control problem.

  13. A discussion of a homogenization procedure for a degenerate linear hyperbolic-parabolic problem

    Science.gov (United States)

    Flodén, L.; Holmbom, A.; Jonasson, P.; Lobkova, T.; Lindberg, M. Olsson; Zhang, Y.

    2017-01-01

    We study the homogenization of a hyperbolic-parabolic PDE with oscillations in one fast spatial scale. Moreover, the first order time derivative has a degenerate coefficient passing to infinity when ɛ→0. We obtain a local problem which is of elliptic type, while the homogenized problem is also in some sense an elliptic problem but with the limit for ɛ-1∂tuɛ as an undetermined extra source term in the right-hand side. The results are somewhat surprising and work remains to obtain a fully rigorous treatment. Hence the last section is devoted to a discussion of the reasonability of our conjecture including numerical experiments.

  14. L{sup P}-posteriori error analysis of mixed methods for linear and quasilinear elliptic problems

    Energy Technology Data Exchange (ETDEWEB)

    Chen, Z. [Texas A& M Univ., College Station, TX (United States)

    1995-12-31

    We consider mixed finite element methods for the approximation of linear and quasilinear second-order elliptic problems. A class of postprocessing methods for improving mixed finite element solutions is analyzed. In particular, error estimates in L{sup p}, 1{<=}p{<=}{infinity}, are given. These postprocessing methods are applicable to an the existing mixed methods, and can be easily implemented. Furthermore, they are local and thus fully parallelizable.

  15. 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.

  16. ON?THE?ERROR?ESTIMATE?OF?LINEAR?FINITE?ELEMENT?APPROXIMATION?TO?THE?ELASTIC?CONTACT?PROBLEM? WITH?CURVED?CONTACT?BOUNDARY

    Institute of Scientific and Technical Information of China (English)

    Lie-heng Wang

    2000-01-01

    In this paper, the linear finite element approximation to the elastic contact problem with curved contact boundary is considered. The error bound O(h1-2) is obtained with requirements of two times continuously differentiable for contact boundary and the usual regular triangulation, while I.Hlavacek et. al. obtained the error bound O(h ) with requirements of three times continuously differentiable for contact boundary and extra regularities of triangulation (c.f. [2]).

  17. Mechanism of the Formation of Singularities to the Goursat Problem for Diagonal Systems with Linearly Degenerate Characteristic Fields

    Institute of Scientific and Technical Information of China (English)

    Yong Fu YANG

    2011-01-01

    For an inhomogeneous quasilinear hyperbolic system of diagonal form, under the assumptions that the system is linearly degenerate and the C1 norm of the boundary data is bounded, we show that the mechanism of the formation of singularities of C1 classical solution to the Goursat problem with C1 compatibility conditions at the origin must be an ODE type. The similar result is also obtained for the weakly discontinuous solution with C0 compatibility conditions at the origin.

  18. An Improved Predictor-Corrector Interior-Point Algorithm for Linear Complementarity Problems with √ ( ) -Iteration Complexity

    OpenAIRE

    Debin Fang; Qian Yu

    2011-01-01

    This paper proposes an improved predictor-corrector interior-point algorithm for the linear complementarity problem (LCP) based on the Mizuno-Todd-Ye algorithm. The modified corrector steps in our algorithm cannot only draw the iteration point back to a narrower neighborhood of the center path but also reduce the duality gap. It implies that the improved algorithm can converge faster than the MTY algorithm. The iteration complexity of the improved algorithm is proved to obtain √ ( ) whi...

  19. RIGID-PLASTIC/RIGID-VISCOPLASTIC FEM BASED ON LINEAR PROGRAMMING-THEORETICAL MODELING AND APPLICATION FOR PLANE-STRAIN PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    2003-01-01

    A new rigid-plastic/rigid-viscoplastic (RP/RVP) FEM based on linear programming (LP) for plane-strain metal forming simulation is proposed. Compared with the traditional RP/RVP FEM based on iteration solution, it has some remarkable advantages, such as it's free of convergence problem and its convenience in contact, incompressibility constraint and rigid zone treatment. Two solution examples are provided to validate its accuracy and efficiency.

  20. Estimation of central shapes of error distributions in linear regression problems

    National Research Council Canada - National Science Library

    Lai, P Y; Lee, Stephen M. S

    2013-01-01

    .... Both methods are motivated by the well-known Hill estimator, which has been extensively studied in the related problem of estimating tail indices, but substitute reciprocals of small L p residuals...

  1. 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.

  2. A linear programming formulation of Mader's edge-disjoint paths problem

    NARCIS (Netherlands)

    Keijsper, J.C.M.; Pendavingh, R.A.; Stougie, L.

    2006-01-01

    We give a dual pair of linear programs for a min–max result of Mader describing the maximum number of edge-disjoint T-paths in a graph G=(V,E) with TV. We conclude that there exists a polynomial-time algorithm (based on the ellipsoid method) for finding the maximum number of T-paths in a

  3. General linear methods and friends: Toward efficient solutions of multiphysics problems

    Science.gov (United States)

    Sandu, Adrian

    2017-07-01

    Time dependent multiphysics partial differential equations are of great practical importance as they model diverse phenomena that appear in mechanical and chemical engineering, aeronautics, astrophysics, meteorology and oceanography, financial modeling, environmental sciences, etc. There is no single best time discretization for the complex multiphysics systems of practical interest. We discuss "multimethod" approaches that combine different time steps and discretizations using the rigourous frameworks provided by Partitioned General Linear Methods and Generalize-structure Additive Runge Kutta Methods..

  4. Traffic Network Equilibrium Problems with Capacity Constraints of Arcs and Linear Scalarization Methods

    Directory of Open Access Journals (Sweden)

    X. Q. Tian

    2012-01-01

    Full Text Available Traffic network equilibrium problems with capacity constraints of arcs are studied. A (weak vector equilibrium principle with vector-valued cost functions, which are different from the ones in the work of Lin (2010, and three kinds of parametric equilibrium flows are introduced. Some necessary and sufficient conditions for a (weak vector equilibrium flow to be a parametric equilibrium flow are derived. Relationships between a parametric equilibrium flow and a solution of a scalar variational inequality problem are also discussed. Some examples are given to illustrate our results.

  5. 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.

  6. Dynamical Stability of an Ion in a Linear Trap as a Solid-State Problem of Electron Localization

    CERN Document Server

    Berman, G P; James, D F V; Hughes, R J; Kamenev, D I

    2000-01-01

    When an ion confined in a linear ion trap interacts with a coherent laser field, the internal degrees of freedom, related to the electron transitions, couple to the vibrational degree of freedom of the ion. As a result of this interaction, quantum dynamics of the vibrational degree of freedom becomes complicated, and in some ranges of parameters even chaotic. We analyze the vibrational ion dynamics using a formal analogy with the solid-state problem of electron localization. In particular, we show how the resonant approximation used in analysis of the ion dynamics, leads to a transition from a two-dimensional (2D) to a one-dimensional problem (1D) of electron localization. The localization length in the solid-state problem is estimated in cases of weak and strong interaction between the cites of the 2D cell by using the methods of resonance perturbation theory, common in analysis of 1D time-dependent dynamical systems.

  7. Solving a mixed-integer linear programming model for a multi-skilled project scheduling problem by simulated annealing

    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.

  8. Seed methods for linear equations in lattice qcd problems with multiple right-hand sides

    CERN Document Server

    Abdel Rehim, A; Wilcox, W

    2008-01-01

    We consider three improvements to seed methods for Hermitian linear systems with multiple right-hand sides: only the Krylov subspace for the first system is used for seeding subsequent right-hand sides, the first right-hand side is solved past convergence, and periodic re-orthogonalization is used in order to control roundoff errors associated with the Conjugate Gradient algorithm. The method is tested for the case of Wilson fermions near kappa critical and a considerable speed up in the convergence is observed.

  9. An Integer Linear Programming Model for the Radiotherapy Treatment Scheduling Problem

    CERN Document Server

    Burke, Edmund K; Petrovic, Sanja

    2011-01-01

    Radiotherapy represents an important phase of treatment for a large number of cancer patients. It is essential that resources used to deliver this treatment are employed effectively. This paper presents a new integer linear programming model for real-world radiotherapy treatment scheduling and analyses the effectiveness of using this model on a daily basis in a hospital. Experiments are conducted varying the days on which schedules can be created. Results obtained using real-world data from the Nottingham University Hospitals NHS Trust, UK, are presented and show how the proposed model can be used with different policies in order to achieve good quality schedules.

  10. ε-MAXIMUM PRINCIPLE IN LINEAR PROBLEM OF HYBRID SYSTEM OPTIMUM CONTROL

    Directory of Open Access Journals (Sweden)

    O. R. Gabasova

    2009-01-01

    Full Text Available The paper reveals necessary and sufficient conditions of optimality and sub-optimality of the programs for a hybrid system in the class of discrete control actions. The conditions are formulated in the support terms of  the initial problem

  11. Counterintuitive transitions in the multistate Landau-Zener problem with linear level crossings

    CERN Document Server

    Sinitsyn, N A

    2004-01-01

    We generalize the Brundobler-Elser hypothesis in the multistate Landau-Zener problem to the case when instead of a state with the highest slope of the diabatic energy level there is a band of states with an arbitrary number of parallel levels having the same slope. We argue that the probabilities of counterintuitive transitions among such states are exactly zero.

  12. Parallel Sparse Linear System and Eigenvalue Problem Solvers: From Multicore to Petascale Computing

    Science.gov (United States)

    2015-06-01

    problems that achieve high performance on a single multicore node and clusters of many multicore nodes. Further, we demonstrate both the superior ...the superior robustness and parallel scalability of our solvers compared to other publicly available parallel solvers for these two fundamental...LU‐ and algebraic multigrid‐preconditioned Krylov subspace methods. This has been demonstrated in previous annual reports of this

  13. Methodological and Epistemological Issues on Linear Regression Applied to Psychometric Variables in Problem Solving: Rethinking Variance

    Science.gov (United States)

    Stamovlasis, Dimitrios

    2010-01-01

    The aim of the present paper is two-fold. First, it attempts to support previous findings on the role of some psychometric variables, such as, M-capacity, the degree of field dependence-independence, logical thinking and the mobility-fixity dimension, on students' achievement in chemistry problem solving. Second, the paper aims to raise some…

  14. Analytic system problems and J-lossless coprime factorization for infinite-dimensional linear systems

    NARCIS (Netherlands)

    Curtain, R

    1997-01-01

    This paper extends the coprime factorization approach to the synthesis of internally stabilizing controllers satisfying an H-infinity-norm bound to a class of systems with irrational transfer matrices. Using the coprime factorization description, the H-infinity-control problem can be reduced to two

  15. Analytic system problems and J-lossless coprime factorization for infinite-dimensional linear systems

    NARCIS (Netherlands)

    Curtain, R

    This paper extends the coprime factorization approach to the synthesis of internally stabilizing controllers satisfying an H-infinity-norm bound to a class of systems with irrational transfer matrices. Using the coprime factorization description, the H-infinity-control problem can be reduced to two

  16. The linearization of boundary eigenvalue problems and reproducing kernel Hilbert spaces

    NARCIS (Netherlands)

    Ćurgus, Branko; Dijksma, Aad; Read, Tom

    2001-01-01

    The boundary eigenvalue problems for the adjoint of a symmetric relation S in a Hilbert space with finite, not necessarily equal, defect numbers, which are related to the selfadjoint Hilbert space extensions of S are characterized in terms of boundary coefficients and the reproducing kernel Hilbert

  17. A non-local non-autonomous diffusion problem: linear and sublinear cases

    Science.gov (United States)

    Figueiredo-Sousa, Tarcyana S.; Morales-Rodrigo, Cristian; Suárez, Antonio

    2017-10-01

    In this work we investigate an elliptic problem with a non-local non-autonomous diffusion coefficient. Mainly, we use bifurcation arguments to obtain existence of positive solutions. The structure of the set of positive solutions depends strongly on the balance between the non-local and the reaction terms.

  18. The Nehari problem for infinite-dimensional linear systems of parabolic type

    NARCIS (Netherlands)

    Curtain, RF; Ichikawa, A

    1996-01-01

    A complete solution is obtained to the suboptimal Nehari extension problem for transfer functions of parabolic systems with Dirichlet boundary control and smooth observations. The solutions are given in terms of the realization (-A, B, C), where A is a uniformly strongly elliptic operator of order t

  19. Linear Time Approximation Algorithms for the Relay Node Placement Problem in Wireless Sensor Networks with Hexagon Tessellation

    Directory of Open Access Journals (Sweden)

    Chi-Chang Chen

    2015-01-01

    Full Text Available The relay node placement problem in wireless sensor network (WSN aims at deploying the minimum number of relay nodes over the network so that each sensor can communicate with at least one relay node. When the deployed relay nodes are homogeneous and their communication ranges are circular, one way to solve the WSN relay node placement problem is to solve the minimum geometric disk cover (MGDC problem first and place the relay nodes at the centers of the covering disks and then, if necessary, deploy additional relay nodes to meet the connection requirement of relay nodes. It is known that the MGDC problem is NP-complete. A novel linear time approximation algorithm for the MGDC problem is proposed, which identifies covering disks using the regular hexagon tessellation of the plane with bounded area. The approximation ratio of the proposed algorithm is (5+ϵ, where 0<ϵ≤15. Experimental results show that the worst case is rare, and on average the proposed algorithm uses less than 1.7 times the optimal disks of the MGDC problem. In cases where quick deployment is necessary, this study provides a fast 7-approximation algorithm which uses on average less than twice the optimal number of relay nodes in the simulation.

  20. Fitting of dihedral terms in classical force fields as an analytic linear least-squares problem.

    Science.gov (United States)

    Hopkins, Chad W; Roitberg, Adrian E

    2014-07-28

    The derivation and optimization of most energy terms in modern force fields are aided by automated computational tools. It is therefore important to have algorithms to rapidly and precisely train large numbers of interconnected parameters to allow investigators to make better decisions about the content of molecular models. In particular, the traditional approach to deriving dihedral parameters has been a least-squares fit to target conformational energies through variational optimization strategies. We present a computational approach for simultaneously fitting force field dihedral amplitudes and phase constants which is analytic within the scope of the data set. This approach completes the optimal molecular mechanics representation of a quantum mechanical potential energy surface in a single linear least-squares fit by recasting the dihedral potential into a linear function in the parameters. We compare the resulting method to a genetic algorithm in terms of computational time and quality of fit for two simple molecules. As suggested in previous studies, arbitrary dihedral phases are only necessary when modeling chiral molecules, which include more than half of drugs currently in use, so we also examined a dihedral parametrization case for the drug amoxicillin and one of its stereoisomers where the target dihedral includes a chiral center. Asymmetric dihedral phases are needed in these types of cases to properly represent the quantum mechanical energy surface and to differentiate between stereoisomers about the chiral center.

  1. On some problems of weak consistency of quasi-maximum likelihood estimates in generalized linear models

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    In this paper,we explore some weakly consistent properties of quasi-maximum likelihood estimates(QMLE) concerning the quasi-likelihood equation in=1 Xi(yi-μ(Xiβ)) = 0 for univariate generalized linear model E(y |X) = μ(X’β).Given uncorrelated residuals {ei = Yi-μ(Xiβ0),1 i n} and other conditions,we prove that βn-β0 = Op(λn-1/2) holds,where βn is a root of the above equation,β0 is the true value of parameter β and λn denotes the smallest eigenvalue of the matrix Sn = ni=1 XiXi.We also show that the convergence rate above is sharp,provided independent non-asymptotically degenerate residual sequence and other conditions.Moreover,paralleling to the elegant result of Drygas(1976) for classical linear regression models,we point out that the necessary condition guaranteeing the weak consistency of QMLE is Sn-1→ 0,as the sample size n →∞.

  2. On some problems of weak consistency of quasi-maximum likelihood estimates in generalized linear models

    Institute of Scientific and Technical Information of China (English)

    ZHANG SanGuo; LIAO Yuan

    2008-01-01

    In this paper, we explore some weakly consistent properties of quasi-maximum likelihood estimates(QMLE)concerning the quasi-likelihood equation ∑ni=1 Xi(yi-μ(X1iβ)) =0 for univariate generalized linear model E(y|X) =μ(X1β). Given uncorrelated residuals{ei=Yi-μ(X1iβ0), 1≤i≤n}and other conditions, we prove that (β)n-β0=Op(λ--1/2n)holds, where (β)n is a root of the above equation,β0 is the true value of parameter β and λ-n denotes the smallest eigenvalue of the matrix Sn=Σni=1 XiX1i. We also show that the convergence rate above is sharp, provided independent nonasymptotically degenerate residual sequence and other conditions. Moreover, paralleling to the elegant result of Drygas(1976)for classical linear regression models,we point out that the necessary condition guaranteeing the weak consistency of QMLE is S-1n→0, as the sample size n→∞.

  3. Markov Chain Analysis of Cumulative Step-Size Adaptation on a Linear Constrained Problem.

    Science.gov (United States)

    Chotard, Alexandre; Auger, Anne; Hansen, Nikolaus

    2015-01-01

    This paper analyzes a (1, λ)-Evolution Strategy, a randomized comparison-based adaptive search algorithm optimizing a linear function with a linear constraint. The algorithm uses resampling to handle the constraint. Two cases are investigated: first, the case where the step-size is constant, and second, the case where the step-size is adapted using cumulative step-size adaptation. We exhibit for each case a Markov chain describing the behavior of the algorithm. Stability of the chain implies, by applying a law of large numbers, either convergence or divergence of the algorithm. Divergence is the desired behavior. In the constant step-size case, we show stability of the Markov chain and prove the divergence of the algorithm. In the cumulative step-size adaptation case, we prove stability of the Markov chain in the simplified case where the cumulation parameter equals 1, and discuss steps to obtain similar results for the full (default) algorithm where the cumulation parameter is smaller than 1. The stability of the Markov chain allows us to deduce geometric divergence or convergence, depending on the dimension, constraint angle, population size, and damping parameter, at a rate that we estimate. Our results complement previous studies where stability was assumed.

  4. Piecewise Linear Model for Multiskilled Workforce Scheduling Problems considering Learning Effect and Project Quality

    Directory of Open Access Journals (Sweden)

    Shujin Qin

    2016-01-01

    Full Text Available Workforce scheduling is an important and common task for projects with high labour intensities. It becomes particularly complex when employees have multiple skills and the employees’ productivity changes along with their learning of knowledge according to the tasks they are assigned to. Till now, in this context, only little work has considered the minimum quality limit of tasks and the quality learning effect. In this research, the workforce scheduling model is developed for assigning tasks to multiskilled workforce by considering learning of knowledge and requirements of project quality. By using piecewise linearization to learning curve, the mixed 0-1 nonlinear programming model (MNLP is transformed into a mixed 0-1 linear programming model (MLP. After that, the MLP model is further improved by taking account of the upper bound of employees’ experiences accumulation, and the stable performance of mature employees. Computational experiments are provided using randomly generated instances based on the investigation of a software company. The results demonstrate that the proposed MLPs can precisely approach the original MNLP model but can be calculated in much less time.

  5. A generalized fuzzy linear programming approach for environmental management problem under uncertainty.

    Science.gov (United States)

    Fan, Yurui; Huang, Guohe; Veawab, Amornvadee

    2012-01-01

    In this study, a generalized fuzzy linear programming (GFLP) method was developed to deal with uncertainties expressed as fuzzy sets that exist in the constraints and objective function. A stepwise interactive algorithm (SIA) was advanced to solve GFLP model and generate solutions expressed as fuzzy sets. To demonstrate its application, the developed GFLP method was applied to a regional sulfur dioxide (SO2) control planning model to identify effective SO2 mitigation polices with a minimized system performance cost under uncertainty. The results were obtained to represent the amount of SO2 allocated to different control measures from different sources. Compared with the conventional interval-parameter linear programming (ILP) approach, the solutions obtained through GFLP were expressed as fuzzy sets, which can provide intervals for the decision variables and objective function, as well as related possibilities. Therefore, the decision makers can make a tradeoff between model stability and the plausibility based on solutions obtained through GFLP and then identify desired policies for SO2-emission control under uncertainty.

  6. Performance evaluation of firefly algorithm with variation in sorting for non-linear benchmark problems

    Science.gov (United States)

    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.

  7. Intuitionistic Fuzzy Goal Programming Technique for Solving Non-Linear Multi-objective Structural Problem

    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.

  8. Development of High-Resolution Total Variation Diminishing Scheme for Linear Hyperbolic Problems

    Directory of Open Access Journals (Sweden)

    Rabie A. Abu Saleem

    2015-01-01

    Full Text Available A high-resolution, total variation diminishing (TVD stable scheme is derived for scalar hyperbolic problems using the method of flux limiters. The scheme was constructed by combining the 1st-order upwind scheme and the 3rd-order quadratic upstream interpolation scheme (QUICK using new flux limiter function. The new flux limiter function was established by imposing several conditions to ensure the TVD properties of the scheme. For temporal discretization, the theta method was used, and values for the parameter θ were chosen such that the scheme is unconditionally stable. Numerical results are presented for one-dimensional pure advection problems with smooth and discontinuous initial conditions and are compared to those of other known numerical schemes. The results show that the proposed numerical method is stable and of higher order than other common schemes.

  9. Sensitivity problems related to certain bifurcations in non-linear recurrence relations

    CERN Document Server

    Gumowski, I.

    1969-01-01

    This paper is concerned with certain qualitative aspects of the sensitivity problem in relation to small variations of a parameter of a system, the behaviour of which can be described by an autonomous recurrence relation: V$_{n+1}$ = F(V$_{n}, \\lambda$) (1) V being a vector, $\\lambda$ the parameter. The problem consists in the determination of the bifurcation values $\\lambda_{0}$ of $\\lambda$, i.e. values such that the qualitative behaviour of a solution of (1) should be different for $\\lambda = \\lambda \\pm \\epsilon$ where $\\epsilon$ is a small quantity. Bifurcations that correspond to a critical case in the Liapunov sense, and the crossing through this critical case, are considered. Examples of bifurcations, not connected with the presence of a critical case, and which correspond to a large deformation of the stability domain boundary of an equilibrium point, a fixed point of (1), under the effect of a parameter variation, are given where V is a two dimensional vector.

  10. The Dirichlet problem with L2-boundary data for elliptic linear equations

    CERN Document Server

    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.

  11. Essential growth rate for bounded linear perturbation of non-densely defined Cauchy problems

    Science.gov (United States)

    Ducrot, A.; Liu, Z.; Magal, P.

    2008-05-01

    This paper is devoted to the study of the essential growth rate of some class of semigroup generated by bounded perturbation of some non-densely defined problem. We extend some previous results due to Thieme [H.R. Thieme, Quasi-compact semigroups via bounded perturbation, in: Advances in Mathematical Population Dynamics--Molecules, Cells and Man, Houston, TX, 1995, in: Ser. Math. Biol. Med., vol. 6, World Sci. Publishing, River Edge, NJ, 1997, pp. 691-711] to a class of non-densely defined Cauchy problems in Lp. In particular in the context the integrated semigroup is not operator norm locally Lipschitz continuous. We overcome the lack of Lipschitz continuity of the integrated semigroup by deriving some weaker properties that are sufficient to give information on the essential growth rate.

  12. On a mixed problem for a linear coupled system with variable coefficients

    Directory of Open Access Journals (Sweden)

    H. R. Clark

    1998-02-01

    Full Text Available We prove existence, uniqueness and exponential decay of solutions to the mixed problem $$u''(x,t-mu(tDelta u(x,t+sum_{i=1}^n {partial hetaoverpartial x_i}(x,t=0 $$ $$ heta'(x,t-Delta heta(x,t +sum_{i=1}^n {partial u'overpartial x_i}(x,t=0,,$$ with a suitable boundary damping, and a positive real-valued function $mu$.

  13. Consensus problem of delayed linear multi-agent systems analysis and design

    CERN Document Server

    Liu, Cheng-Lin

    2017-01-01

    In the context of coupled-coordination control mechanisms, this book focuses on the delay robustness of consensus problems with asynchronously coupled and synchronously coupled consensus algorithms respectively. Moreover, constructive consensus algorithms that tolerate larger communication delays are proposed according to idea of compensation. By providing rigorous theoretical proofs and numerous numerical simulations, it enhances readers’ understanding of the consensus coordination control mechanism of multi-agent systems with communication delays.

  14. Facility Location with Client Latencies: Linear-Programming based Techniques for Minimum-Latency Problems

    CERN Document Server

    Chakrabarty, Deeparnab

    2010-01-01

    We introduce a problem that is a common generalization of the uncapacitated facility location and minimum latency (ML) problems, where facilities need to be opened to serve clients and also need to be sequentially activated before they can provide service. Formally, we are given a set \\F of n facilities with facility-opening costs {f_i}, a set of m clients, and connection costs {c_{ij}} specifying the cost of assigning a client j to a facility i, a root node r denoting the depot, and a time metric d on \\F\\cup{r}. Our goal is to open a subset F of facilities, find a path P starting at r and spanning F to activate the open facilities, and connect each client j to a facility \\phi(j)\\in F, so as to minimize \\sum_{i\\in F}f_i +\\sum_{clients j}(c_{\\phi(j),j}+t_j), where t_j is the time taken to reach \\phi(j) along path P. We call this the minimum latency uncapacitated facility location (MLUFL) problem. Our main result is an O(\\log n\\max{\\log n,\\log m})-approximation for MLUFL. We also show that any improvement in th...

  15. Aspects on increase and decrease within a national economy as eigenvalue problem of linear homogeneous equations

    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.)

  16. Non-linear time series extreme events and integer value problems

    CERN Document Server

    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 ...

  17. The nonconforming linear strain tetrahedron for a large deformation elasticity problem

    Science.gov (United States)

    Hansbo, Peter; Larsson, Fredrik

    2016-12-01

    In this paper we investigate the performance of the nonconforming linear strain tetrahedron element introduced by Hansbo (Comput Methods Appl Mech Eng 200(9-12):1311-1316, 2011; J Numer Methods Eng 91(10):1105-1114, 2012). This approximation uses midpoints of edges on tetrahedra in three dimensions with either point continuity or mean continuity along edges of the tetrahedra. Since it contains (rotated) bilinear terms it performs substantially better than the standard constant strain element in bending. It also allows for under-integration in the form of one point Gauss integration of volumetric terms in near incompressible situations. We combine under-integration of the volumetric terms with houglass stabilization for the isochoric terms.

  18. The nonconforming linear strain tetrahedron for a large deformation elasticity problem

    Science.gov (United States)

    Hansbo, Peter; Larsson, Fredrik

    2016-08-01

    In this paper we investigate the performance of the nonconforming linear strain tetrahedron element introduced by Hansbo (Comput Methods Appl Mech Eng 200(9-12):1311-1316, 2011; J Numer Methods Eng 91(10):1105-1114, 2012). This approximation uses midpoints of edges on tetrahedra in three dimensions with either point continuity or mean continuity along edges of the tetrahedra. Since it contains (rotated) bilinear terms it performs substantially better than the standard constant strain element in bending. It also allows for under-integration in the form of one point Gauss integration of volumetric terms in near incompressible situations. We combine under-integration of the volumetric terms with houglass stabilization for the isochoric terms.

  19. A unified linear-time temporal logic solution to the steam-boiler control specification problem

    Institute of Scientific and Technical Information of China (English)

    闫安; 唐稚松

    1999-01-01

    The TLL XYZ/E is a formal language able to represent the dynamic semantics and the static semantics in a unified framework. It supports the whole process of program development, i.e. from the abstract specification to the efficiently executable program in a formal, precise and convenient way. The steam boiler control specification problem, a large case study in the fields of real time, hybrid and communication systems, is discussed with XYZ/E. The approach covers physical model construction, formal specification, stepwise refinement, verification, executable program and visual user interface programming.

  20. The electric vehicle routing problem with non-linear charging functions

    OpenAIRE

    2015-01-01

    International audience; The use of electric vehicles (EVs) in freight and passenger transportation gives birth to a new family of vehicle routing problems (VRPs), the so-called electric VRPs (e-VRPs). As their name suggests, e-VRPs extend classical VRPs to account (mainly) for two constraining EV features: the short driving range and the long battery charging time. As a matter of fact, routes performed by EVs usually need to include time-consuming detours to charging stations. Most of the exi...

  1. Linear algebra of integrals in the quantum-mechanical two-center problem

    Energy Technology Data Exchange (ETDEWEB)

    Truskova, N.F.

    1978-09-01

    By means of commutation relations a number of formulas and recurrence relations are derived which interconnect the integrals necessary for calculating matrix elements in the quantum-mechanical two-center problem. This allows us to reduce the calculation of all possible integrals of this kind to that of only a finite number of them. Relations of the type of general orthogonality relations are derived for the two-center functions; these relations are satisfied separately in each of the ranges of variation of the coordinates xi and eta.

  2. On the consistency of adjoint sensitivity analysis for structural optimization of linear dynamic problems

    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 differentiate-then-discretize approach, may lead to inconsistent sensitivities. Herein this effect is explicitly demonstrated for a single dof system and the source of inconsistency is identified. Additionally, we outline an alternative discretize-then-differentiate AVM that inherently produces consistent...

  3. Linear algebra

    CERN Document Server

    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.

  4. The Prediction Properties of Inverse and Reverse Regression for the Simple Linear Calibration Problem

    Science.gov (United States)

    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.

  5. Extended cubic B-spline method for solving a linear system of second-order boundary value problems.

    Science.gov (United States)

    Heilat, Ahmed Salem; Hamid, Nur Nadiah Abd; Ismail, Ahmad Izani Md

    2016-01-01

    A method based on extended cubic B-spline is proposed to solve a linear system of second-order boundary value problems. In this method, two free parameters, [Formula: see text] and [Formula: see text], play an important role in producing accurate results. Optimization of these parameters are carried out and the truncation error is calculated. This method is tested on three examples. The examples suggest that this method produces comparable or more accurate results than cubic B-spline and some other methods.

  6. Extension of Modified Polak-Ribière-Polyak Conjugate Gradient Method to Linear Equality Constraints Minimization Problems

    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.

  7. An Improved Predictor-Corrector Interior-Point Algorithm for Linear Complementarity Problems with √(-Iteration Complexity

    Directory of Open Access Journals (Sweden)

    Debin Fang

    2011-01-01

    Full Text Available This paper proposes an improved predictor-corrector interior-point algorithm for the linear complementarity problem (LCP based on the Mizuno-Todd-Ye algorithm. The modified corrector steps in our algorithm cannot only draw the iteration point back to a narrower neighborhood of the center path but also reduce the duality gap. It implies that the improved algorithm can converge faster than the MTY algorithm. The iteration complexity of the improved algorithm is proved to obtain √( which is similar to the classical Mizuno-Todd-Ye algorithm. Finally, the numerical experiments show that our algorithm improved the performance of the classical MTY algorithm.

  8. A non-linear branch and cut method for solving discrete minimum compliance problems to global optimality

    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...

  9. A Priori Error Estimates of Mixed Finite Element Methods for General Linear Hyperbolic Convex Optimal Control Problems

    Directory of Open Access Journals (Sweden)

    Zuliang Lu

    2014-01-01

    Full Text Available The aim of this work is to investigate the discretization of general linear hyperbolic convex optimal control problems by using the mixed finite element methods. The state and costate are approximated by the k order (k≥0 Raviart-Thomas mixed finite elements and the control is approximated by piecewise polynomials of order k. By applying the elliptic projection operators and Gronwall’s lemma, we derive a priori error estimates of optimal order for both the coupled state and the control approximation.

  10. An Affine Scaling Interior Trust Region Method via Optimal Path for Solving Monotone Variational Inequality Problem with Linear Constraints

    Institute of Scientific and Technical Information of China (English)

    Yunjuan WANG; Detong ZHU

    2008-01-01

    Based on a differentiable merit function proposed by Taji et al.in "Math.Prog. Stud.,58,1993,369-383",the authors propose an affine scaling interior trust region strategy via optimal path to modify Newton method for the strictly monotone variational inequality problem subject to linear equality and inequality constraints.By using the eigensystem decomposition and affine scaling mapping,the authors form an affine scaling optimal curvilinear path very easily in order to approximately solve the trust region subproblem.Theoretical analysis is given which shows that the proposed algorithm is globally convergent and has a local quadratic convergence rate under some reasonable conditions.

  11. On the solution of two-point linear differential eigenvalue problems. [numerical technique with application to Orr-Sommerfeld equation

    Science.gov (United States)

    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.

  12. RIGID-PLASTIC/RIGID-VISCOPLASTIC FEM BASED ON LINEAR PROGRAMMING—THEORETICAL MODELING AND APPLICATION FOR AXISYMMETRICAL PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    Compared with the traditional rigid-plastic/rigid-viscoplastic(RP/RVP) FEM(based on iteration solution),RP/RVP FEM based on linear programming (LP) has some remarkable advantages,such as it's free of convergence problem and its convenience in contact,rigid zone,and friction force treatment.The numerical model of RP/RVP FEM based on LP for axisymmetrical metal forming simulation is studied,and some related key factors and its treatment methods in formulation of constraint condition are proposed.Some solution examples are provided to validate its accuracy and efficiency.

  13. The late Universe with non-linear interaction in the dark sector: the coincidence problem

    CERN Document Server

    Bouhmadi-López, Mariam; Zhuk, Alexander

    2016-01-01

    We study the Universe at the late stage of its evolution and deep inside the cell of uniformity. At such a scale the Universe is highly inhomogeneous and filled with discretely distributed inhomogeneities in the form of galaxies and groups of galaxies. As a matter source, we consider dark matter (DM) and dark energy (DE) with a non-linear interaction $Q = 3\\mathcal{H}\\gamma \\overline\\varepsilon_{\\mathrm{DE}} \\overline\\varepsilon_{\\mathrm{DM}} / (\\overline\\varepsilon_{\\mathrm{DE}} + \\overline\\varepsilon_{\\mathrm{DM}})$, where $\\gamma$ is a constant. We assume that DM is pressureless and DE has a constant equation of state parameter $w$. In the considered model, the energy densities of the dark sector components present a scaling behaviour with $\\overline\\varepsilon_{\\mathrm{DM}} / \\overline\\varepsilon_{\\mathrm{DE}} \\sim \\left({a_0} / {a} \\right)^{-3(w+\\gamma)}$. We investigate the possibility that the perturbations of DM and DE, which are interacting among themselves, could be coupled to the galaxies with the ...

  14. A Comparative Study of the Harmonic and Arithmetic Averaging of Diffusion Coefficients for Non-linear Heat Conduction Problems

    Energy Technology Data Exchange (ETDEWEB)

    Samet Y. Kadioglu; Robert R. Nourgaliev; Vincent A. Mousseau

    2008-03-01

    We perform a comparative study for the harmonic versus arithmetic averaging of the heat conduction coefficient when solving non-linear heat transfer problems. In literature, the harmonic average is the method of choice, because it is widely believed that the harmonic average is more accurate model. However, our analysis reveals that this is not necessarily true. For instance, we show a case in which the harmonic average is less accurate when a coarser mesh is used. More importantly, we demonstrated that if the boundary layers are finely resolved, then the harmonic and arithmetic averaging techniques are identical in the truncation error sense. Our analysis further reveals that the accuracy of these two techniques depends on how the physical problem is modeled.

  15. An A Posteriori Error Analysis of Mixed Finite Element Galerkin Approximations to Second Order Linear Parabolic Problems

    KAUST Repository

    Memon, Sajid

    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.

  16. A fast algorithm for solving a linear feasibility problem with application to Intensity-Modulated Radiation Therapy.

    Science.gov (United States)

    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.

  17. Penalized linear regression for discrete ill-posed problems: A hybrid least-squares and mean-squared error approach

    KAUST Repository

    Suliman, Mohamed

    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.

  18. The Linear Inverse Problem of Gravimetry and Magnetometry with Iterative Formulas of Analogs of Wiener-Kalman Filters

    Directory of Open Access Journals (Sweden)

    V. P. Minenko

    2014-06-01

    Full Text Available The article presents the improved iterative methods of solution of the inversion linear problems of gravimetry and magnetometry based on analogs of Wiener-Kalman filters applied to two interpretation models obtained in result of subdivision of the field grid on two sub grids containing even and odd profiles respectively. The new iterative formulas provide stable and geologically true interpretation with arbitrary initial conditions and without usage of decisions preliminarily obtained with other methods. It gives two close decisions, independent of solutions of the inverse problem achieved with other methods. Examples of practical implementation of method for processing and interpretation of magnetic data obtained at the area of iron ore deposit, Ukraine, are given.

  19. Kernel-Based Interior-Point Methods for Cartesian P*(k-Linear Complementarity Problems over Symmetric Cones

    Directory of Open Access Journals (Sweden)

    Goran Lešaja

    2011-02-01

    Full Text Available We present an interior point method for Cartesian P*(k-Linear Complementarity Problems over Symmetric Cones (SCLCPs. The Cartesian P*(k-SCLCPs have been recently introduced as the generalization of the more commonly known and more widely used monotone SCLCPs. The IPM is based on the barrier functions that are defined by a large class of univariate functions called eligible kernel function which have recently been successfully used to design new IPMs for various optimization problems. Eligible barrier (kernel functions are used in calculating the Nesterov-Todd search directions and the default step-size which leads to a very good complexity results for the method. For some specific eligilbe kernel functions we match the best known iteration bound for the long-step methods while for the short-step methods the best iteration bound is matched for all cases.

  20. Modeling Granular Materials as Compressible Non-Linear Fluids: Heat Transfer Boundary Value Problems

    Energy Technology Data Exchange (ETDEWEB)

    Massoudi, M.C.; Tran, P.X.

    2006-01-01

    We discuss three boundary value problems in the flow and heat transfer analysis in flowing granular materials: (i) the flow down an inclined plane with radiation effects at the free surface; (ii) the natural convection flow between two heated vertical walls; (iii) the shearing motion between two horizontal flat plates with heat conduction. It is assumed that the material behaves like a continuum, similar to a compressible nonlinear fluid where the effects of density gradients are incorporated in the stress tensor. For a fully developed flow the equations are simplified to a system of three nonlinear ordinary differential equations. The equations are made dimensionless and a parametric study is performed where the effects of various dimensionless numbers representing the effects of heat conduction, viscous dissipation, radiation, and so forth are presented.

  1. 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

  2. Automatic versus manual model differentiation to compute sensitivities and solve non-linear inverse problems

    Science.gov (United States)

    Elizondo, D.; Cappelaere, B.; Faure, Ch.

    2002-04-01

    Emerging tools for automatic differentiation (AD) of computer programs should be of great benefit for the implementation of many derivative-based numerical methods such as those used for inverse modeling. The Odyssée software, one such tool for Fortran 77 codes, has been tested on a sample model that solves a 2D non-linear diffusion-type equation. Odyssée offers both the forward and the reverse differentiation modes, that produce the tangent and the cotangent models, respectively. The two modes have been implemented on the sample application. A comparison is made with a manually-produced differentiated code for this model (MD), obtained by solving the adjoint equations associated with the model's discrete state equations. Following a presentation of the methods and tools and of their relative advantages and drawbacks, the performances of the codes produced by the manual and automatic methods are compared, in terms of accuracy and of computing efficiency (CPU and memory needs). The perturbation method (finite-difference approximation of derivatives) is also used as a reference. Based on the test of Taylor, the accuracy of the two AD modes proves to be excellent and as high as machine precision permits, a good indication of Odyssée's capability to produce error-free codes. In comparison, the manually-produced derivatives (MD) sometimes appear to be slightly biased, which is likely due to the fact that a theoretical model (state equations) and a practical model (computer program) do not exactly coincide, while the accuracy of the perturbation method is very uncertain. The MD code largely outperforms all other methods in computing efficiency, a subject of current research for the improvement of AD tools. Yet these tools can already be of considerable help for the computer implementation of many numerical methods, avoiding the tedious task of hand-coding the differentiation of complex algorithms.

  3. Two-point boundary value problems and exact controllability for several kinds of linear and nonlinear wave equations

    Energy Technology Data Exchange (ETDEWEB)

    Kong Dexing [Department of Mathematics, Zhejiang University, Hangzhou 310027 (China); Sun Qingyou, E-mail: qysun@cms.zju.edu.cn [Center of Mathematical Sciences, Zhejiang University, Hangzhou 310027 (China)

    2011-04-01

    All articles must In this paper we introduce some new concepts for second-order hyperbolic equations: two-point boundary value problem, global exact controllability and exact controllability. For several kinds of important linear and nonlinear wave equations arising from physics and geometry, we prove the existence of smooth solutions of the two-point boundary value problems and show the global exact controllability of these wave equations. In particular, we investigate the two-point boundary value problem for one-dimensional wave equation defined on a closed curve and prove the existence of smooth solution which implies the exact controllability of this kind of wave equation. Furthermore, based on this, we study the two-point boundary value problems for the wave equation defined on a strip with Dirichlet or Neumann boundary conditions and show that the equation still possesses the exact controllability in these cases. Finally, as an application, we introduce the hyperbolic curvature flow and obtain a result analogous to the well-known theorem of Gage and Hamilton for the curvature flow of plane curves.

  4. Data-driven non-linear elasticity: constitutive manifold construction and problem discretization

    Science.gov (United States)

    Ibañez, Ruben; Borzacchiello, Domenico; Aguado, Jose Vicente; Abisset-Chavanne, Emmanuelle; Cueto, Elias; Ladeveze, Pierre; Chinesta, Francisco

    2017-07-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.

  5. Laplacian versus topography in the solution of the linear gravimetric boundary value problem by means of successive approximations

    Science.gov (United States)

    Holota, Petr; Nesvadba, Otakar

    2017-04-01

    The aim of this paper is to discuss the solution of the linearized gravimetric boundary value problem by means of the method of successive approximations. We start with the relation between the geometry of the solution domain and the structure of Laplace's operator. Similarly as in other branches of engineering and mathematical physics a transformation of coordinates is used that offers a possibility to solve an alternative between the boundary complexity and the complexity of the coefficients of the partial differential equation governing the solution. Laplace's operator has a relatively simple structure in terms of ellipsoidal coordinates which are frequently used in geodesy. However, the physical surface of the Earth substantially differs from an oblate ellipsoid of revolution, even if it is optimally fitted. Therefore, an alternative is discussed. A system of general curvilinear coordinates such that the physical surface of the Earth is imbedded in the family of coordinate surfaces is used. Clearly, the structure of Laplace's operator is more complicated in this case. It was deduced by means of tensor calculus and in a sense it represents the topography of the physical surface of the Earth. Nevertheless, the construction of the respective Green's function is more simple, if the solution domain is transformed. This enables the use of the classical Green's function method together with the method of successive approximations for the solution of the linear gravimetric boundary value problem expressed in terms of new coordinates. The structure of iteration steps is analyzed and where useful also modified by means of the integration by parts. Comparison with other methods is discussed.

  6. 线性离散奇异系统的不定二次最优控制问题:Krein空间方法%Indefinite Linear Quadratic Optimal Control Problem for Singular Linear Discrete-time System: Krein Space Method

    Institute of Scientific and Technical Information of China (English)

    崔鹏; 张承慧

    2007-01-01

    The finite time horizon indefinite linear quadratic(LQ) optimal control problem for singular linear discrete time-varying systems is discussed. Indefinite LQ optimal control problem for singular systems can be transformed to that for standard state-space systems under a reasonable assumption. It is shown that the indefinite LQ optimal control problem is dual to that of projection for backward stochastic systems. Thus, the optimal LQ controller can be obtained by computing the gain matrices of Kalman filter.Necessary and sufficient conditions guaranteeing a unique solution for the indefinite LQ problem are given. An explicit solution for the problem is obtained in terms of the solution of Riccati difference equations.

  7. 向量法在解决直线问题中的应用%The Application of Vector Method in Solving Linear Problem

    Institute of Scientific and Technical Information of China (English)

    蓝兴华

    2011-01-01

    Linear and vector are two original concepts in midle school mathematics teaching and applying vector to solve linear problem can achieve better effect. This paper introduces the application of vector method in linear problem.%直线和向量是中学数学中的两个原始概念,但是把向量运用于解决直线问题却能收到奇特的效果。本文就给大家介绍了向量法在直线问题中的应用。

  8. An Interactive Decomposition Algorithm for Two-Level Large Scale Linear Multiobjective Optimization Problems with Stochastic Parameters Using TOPSIS Method

    Directory of Open Access Journals (Sweden)

    Tarek H. M. Abou-El-Enien

    2015-04-01

    Full Text Available This paper extended TOPSIS (Technique for Order Preference by Similarity Ideal Solution method for solving Two-Level Large Scale Linear Multiobjective Optimization Problems with Stochastic Parameters in the righthand side of the constraints (TL-LSLMOP-SPrhs of block angular structure. In order to obtain a compromise ( satisfactory solution to the (TL-LSLMOP-SPrhs of block angular structure using the proposed TOPSIS method, a modified formulas for the distance function from the positive ideal solution (PIS and the distance function from the negative ideal solution (NIS are proposed and modeled to include all the objective functions of the two levels. In every level, as the measure of ―Closeness‖ dp-metric is used, a k-dimensional objective space is reduced to two –dimentional objective space by a first-order compromise procedure. The membership functions of fuzzy set theory is used to represent the satisfaction level for both criteria. A single-objective programming problem is obtained by using the max-min operator for the second –order compromise operaion. A decomposition algorithm for generating a compromise ( satisfactory solution through TOPSIS approach is provided where the first level decision maker (FLDM is asked to specify the relative importance of the objectives. Finally, an illustrative numerical example is given to clarify the main results developed in the paper.

  9. Parallel High Order Accuracy Methods Applied to Non-Linear Hyperbolic Equations and to Problems in Materials Sciences

    Energy Technology Data Exchange (ETDEWEB)

    Jan Hesthaven

    2012-02-06

    Final report for DOE Contract DE-FG02-98ER25346 entitled Parallel High Order Accuracy Methods Applied to Non-Linear Hyperbolic Equations and to Problems in Materials Sciences. Principal Investigator Jan S. Hesthaven Division of Applied Mathematics Brown University, Box F Providence, RI 02912 Jan.Hesthaven@Brown.edu February 6, 2012 Note: This grant was originally awarded to Professor David Gottlieb and the majority of the work envisioned reflects his original ideas. However, when Prof Gottlieb passed away in December 2008, Professor Hesthaven took over as PI to ensure proper mentoring of students and postdoctoral researchers already involved in the project. This unusual circumstance has naturally impacted the project and its timeline. However, as the report reflects, the planned work has been accomplished and some activities beyond the original scope have been pursued with success. Project overview and main results The effort in this project focuses on the development of high order accurate computational methods for the solution of hyperbolic equations with application to problems with strong shocks. While the methods are general, emphasis is on applications to gas dynamics with strong shocks.

  10. Modelos lineares e não lineares inteiros para problemas da mochila bidimensional restrita a 2 estágios Linear and nonlinear integer models for constrained two-stage two-dimensional knapsack problems

    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

  11. A Robin Problem for Quasi-linear System%关于拟线性系统的一个Robin问题

    Institute of Scientific and Technical Information of China (English)

    欧阳成

    2004-01-01

    In this paper, a Robin problem for quasi-linear system is considered. Under the appropriate assumptions, the existence of solution for the problem is proved and the asymptotic behavior of the solution is studied using the theory of differential inequalities.

  12. A New Method for Deriving Robust and Globalized Robust Solutions of Uncertain Linear Conic Optimization Problems Having General Convex Uncertainty Sets

    NARCIS (Netherlands)

    Gorissen, B.L.; Ben-Tal, A.; Blanc, J.P.C.; den Hertog, D.

    2012-01-01

    Abstract: We propose a new way to derive tractable robust counterparts of a linear conic optimization problem by using the theory of Beck and Ben-Tal [2] on the duality between the robust (“pessimistic”) primal problem and its “optimistic” dual. First, we obtain a new convex reformulation of the

  13. Positive Solutions of Sub-Linear Semi-Positone Boundary Value Problem System%次线性半正微分边值系统的正解

    Institute of Scientific and Technical Information of China (English)

    徐西安

    2008-01-01

    In this paper,we study the existence of positive solutions of a sub-linear semi-positone differential boundary value problems system with positive parameter.We prove that the semipositone differential boundary value problems system has at least one positive solution for the parameter sufficiently large.

  14. Solution of a Problem Linear Plane Elasticity with Mixed Boundary Conditions by the Method of Boundary Integrals

    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.

  15. A Semi-linear Backward Parabolic Cauchy Problem with Unbounded Coefficients of Hamilton–Jacobi–Bellman Type and Applications to Optimal Control

    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.

  16. A normalized scaled gradient method to solve non-negativity and equality constrained linear inverse problem - Application to spectral mixture analysis

    CERN Document Server

    Theys, Céline; Dobigeon, Nicolas; Richard, Cédric; Tourneret, Jean-Yves; Ferrari, André

    2013-01-01

    This paper addresses the problem of minimizing a convex cost function under non-negativity and equality constraints, with the aim of solving the linear unmixing problem encountered in hyperspectral imagery. This problem can be formulated as a linear regression problem whose regression coefficients (abundances) satisfy sum-to-one and positivity constraints. A normalized scaled gradient iterative method (NSGM) is proposed for estimating the abundances of the linear mixing model. The positivity constraint is ensured by the Karush Kuhn Tucker conditions whereas the sum-to-one constraint is fulfilled by introducing normalized variables in the algorithm. The convergence is ensured by a one-dimensional search of the step size. Note that NSGM can be applied to any convex cost function with non negativity and flux constraints. In order to compare the NSGM with the well-known fully constraint least squares (FCLS) algorithm, this latter is reformulated in term of a penalized function, which reveals its suboptimality. Si...

  17. An Alternate Approach to Optimal L 2 -Error Analysis of Semidiscrete Galerkin Methods for Linear Parabolic Problems with Nonsmooth Initial Data

    KAUST Repository

    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.

  18. Book Review "Fabrikant, V.I.Contact and Crack Problems in Linear Theory of Elasticity,Bentham Science Publishers,Sharjah, UAE (2010)"

    Institute of Scientific and Technical Information of China (English)

    H. XIAO

    2012-01-01

    As suggested by the title,this extensive book is concerned with crack and contact problems in linear elasticity.However,in general,it is intended for a wide audience ranging from engineers to mathematical physicists.Indeed,numerous problems of both academic and technological interest in electro-magnetics,acoustics,solid and fluid dynamics,etc.are actually related to each other and governed by the same mixed boundary value problems from a unified mathematical standpoint.

  19. A genetic Algorithm for the Single Machine Scheduling Problem with Linear Earliness and Quadratic Tardiness Penalties with Consideration of Preemption and Idle Time

    Directory of Open Access Journals (Sweden)

    Mohamad_Bagher Fakhrzad

    2012-06-01

    Full Text Available In this paper, a non linear mathematical model has been proposed for solving a single machine scheduling problem with a linear earliness and quadratic tardiness cost, where machine idle time and preemptions are allowed. As the model is complex and cannot be solved in polynomial time, it has been assumed to be a NP hard problem, so the known optimal solution methods may not be applicable for its solution. A Genetic Algorithm approach has been developed for solving the model and numerical examples has been presented, which imply that the proposed method is efficient and effective.

  20. 利用EXCEL2010求解线性规划问题%Skillfully Use EXCEL 2010 to Solve Linear Programming Problems

    Institute of Scientific and Technical Information of China (English)

    李丽颖

    2014-01-01

    该文讨论了使用EXCEL2010求解运筹学中比较重要的线性规划特定问题的求解方法,从而大大简化了变量比较多的线性规划问题的求解方法。%The solvation of the specific problem of linear programming is important in operational research method, this article discussed the solvation that using EXCEL2010, which greatly simplifies the variable more methods of solving the linear program-ming problem.

  1. Constrained non-linear optimization in 3D reflexion tomography; Problemes d'optimisation non-lineaire avec contraintes en tomographie de reflexion 3D

    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)

  2. On the existence and uniqueness of solutions of optimal control problems of linear distributed systems which are not solved with respect to the time derivative

    Energy Technology Data Exchange (ETDEWEB)

    Plekhanova, Marina V; Fedorov, Vladimir E

    2011-04-30

    We investigate optimal control problems for linear distributed systems which are not solved with respect to the time derivative and whose homogeneous part admits a degenerate strongly continuous solution semigroup. To this end, we first obtain theorems on the existence of a unique strong solution of the Cauchy problem. This enables us to formulate sufficient conditions for the solubility of the optimal control problems under consideration. In contrast to earlier papers on a similar topic, we substantially weaken the conditions on the quality functional with respect to the state function. The abstract results thus obtained are illustrated by an example of an optimal control problem for the linearized system of Navier-Stokes equations.

  3. New results on the mathematical problems in nonlinear physics; Nuevos resultados sobre problemas matematicos en fisica no-linear

    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.

  4. Performance Assessment of Variational Integrators for Thermomechanical Problems

    CERN Document Server

    Kern, Dominik; Martin, Sergio Conde; Garcia-Orden, Juan Carlos

    2016-01-01

    Structure-preserving integrators are in the focus of ongoing research because of their distinguished features of robustness and long time stability. In particular, their formulation for coupled problems that include dissipative mechanisms is still an active topic. Conservative formulations, such as the thermo-elastic case without heat conduction, fit well into a variational framework and have been solved with variational integrators, whereas the inclusions of viscosity and heat transfer are still under investigation. To encompass viscous forces and heat transfer, an extension of Hamilton's principle is required. In this contribution we derive variational integrators for thermo-viscoelastic systems with classical heat transfer. Their results are compared for two discrete model problems vs. Energy-Entropy-Momentum methods. Such comparisons allow to draw conclusions about their relative performance, weaknesses and strengths.

  5. Problem Based Learning Technique and Its Effect on Acquisition of Linear Programming Skills by Secondary School Students in Kenya

    Science.gov (United States)

    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…

  6. Well-posedness and qualitative behaviour of a semi-linear parabolic Cauchy problem arising from a generic model for fractional-order autocatalysis.

    Science.gov (United States)

    Meyer, J C; Needham, D J

    2015-03-08

    In this paper, we examine a semi-linear parabolic Cauchy problem with non-Lipschitz nonlinearity which arises as a generic form in a significant number of applications. Specifically, we obtain a well-posedness result and examine the qualitative structure of the solution in detail. The standard classical approach to establishing well-posedness is precluded owing to the lack of Lipschitz continuity for the nonlinearity. Here, existence and uniqueness of solutions is established via the recently developed generic approach to this class of problem (Meyer & Needham 2015 The Cauchy problem for non-Lipschitz semi-linear parabolic partial differential equations. London Mathematical Society Lecture Note Series, vol. 419) which examines the difference of the maximal and minimal solutions to the problem. From this uniqueness result, the approach of Meyer & Needham allows for development of a comparison result which is then used to exhibit global continuous dependence of solutions to the problem on a suitable initial dataset. The comparison and continuous dependence results obtained here are novel to this class of problem. This class of problem arises specifically in the study of a one-step autocatalytic reaction, which is schematically given by A→B at rate a(p)b(q) (where a and b are the concentrations of A and B, respectively, with 0problem has been lacking up to the present.

  7. Existence of 2m-1 Positive Solutions for Sturm-Liouville Boundary Value Problems with Linear Functional Boundary Conditions on the Half-Line

    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.

  8. The Effects of the Concrete-Representational-Abstract Integration Strategy on the Ability of Students with Learning Disabilities to Multiply Linear Expressions within Area Problems

    Science.gov (United States)

    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…

  9. The Effects of the Concrete-Representational-Abstract Integration Strategy on the Ability of Students with Learning Disabilities to Multiply Linear Expressions within Area Problems

    Science.gov (United States)

    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…

  10. Problem-solving of Linear Programming on Add-ins%基于加载宏的线性规划问题求解

    Institute of Scientific and Technical Information of China (English)

    陈秀华

    2011-01-01

    线性规划是运筹学的重要分支,应用十分广泛。本文介绍利用加载宏解决线性规划优化问题求解的详细方法和步骤。该方法可以减少求解线性规划问题的计算量,提高计算速度,并且方便实用。%Linear programming is an important branch of operations research,is widely used.This article describes the use of add-ins to solve linear programming optimization problem-solving methods and procedures in detail.This method can reduce the calculation of solving linear programming problems,improve computing speed, and the convenient and practical.

  11. Steady induction effects in geomagnetism. Part 1B: Geomagnetic estimation of steady surficial core motions: A non-linear inverse problem

    Science.gov (United States)

    Voorhies, Coerte V.

    1993-01-01

    The problem of estimating a steady fluid velocity field near the top of Earth's core which induces the secular variation (SV) indicated by models of the observed geomagnetic field is examined in the source-free mantle/frozen-flux core (SFI/VFFC) approximation. This inverse problem is non-linear because solutions of the forward problem are deterministically chaotic. The SFM/FFC approximation is inexact, and neither the models nor the observations they represent are either complete or perfect. A method is developed for solving the non-linear inverse motional induction problem posed by the hypothesis of (piecewise, statistically) steady core surface flow and the supposition of a complete initial geomagnetic condition. The method features iterative solution of the weighted, linearized least-squares problem and admits optional biases favoring surficially geostrophic flow and/or spatially simple flow. Two types of weights are advanced radial field weights for fitting the evolution of the broad-scale portion of the radial field component near Earth's surface implied by the models, and generalized weights for fitting the evolution of the broad-scale portion of the scalar potential specified by the models.

  12. The Existence and Uniqueness of a New Boundary Value Problem (Type of Problem “E” for Linear System Equations of the Mixed Hyperbolic-Elliptic Type in the Multivariate Dimension with the Changing Time Direction

    Directory of Open Access Journals (Sweden)

    Mahammad A. Nurmammadov

    2015-01-01

    Full Text Available The existence and uniqueness of the boundary value problem for linear systems equations of the mixed hyperbolic-elliptic type in the multivariate domain with the changing time direction are studied. Applying methods of functional analysis, “ε-regularizing” continuation by the parameter and by means of prior estimates, the existence and uniqueness of generalized and regular solutions of a boundary problem are established in a weighted Sobolev space.

  13. Bounds on the Phase Velocity in the Linear Instability of Viscous Shear Flow Problem in the -Plane

    Indian Academy of Sciences (India)

    R G Shandil; Jagjit Singh

    2003-05-01

    Results obtained by Joseph (J. Fluid Mech. 33 (1968) 617) for the viscous parallel shear flow problem are extended to the problem of viscous parallel, shear flow problem in the beta plane and a sufficient condition for stability has also been derived.

  14. Use Residual Correction Method and Monotone Iterative Technique to Calculate the Upper and Lower Approximate Solutions of Singularly Perturbed Non-linear Boundary Value Problems

    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.

  15. Cauchy problem of semi-linear parabolic equations with weak data in homogeneous space and application to the Navier-Stokes equations

    Institute of Scientific and Technical Information of China (English)

    苗长兴

    2003-01-01

    In this paper we study the Cauchy problem for a class of semi-linear parabolic type equations withweak data in the homogeneous spaces. We give a method which can be used to construct local mild solutionsof the abstract Cauchy problem in Cσ,s,p and Lq([O, T);Hs,p) by introducing the concept of both admissiblequintuplet and compatible space and establishing time-space estimates for solutions to the linear parabolic typeequations. For the small data, we prove that these results can be extended globally in time. We also study theregularity of the solution to the abstract Cauchy problem for nonlinear parabolic type equations in Cσ,s,p. Asan application, we obtain the same result for Navier-Stokes equations with weak initial data in homogeneousSobolev spaces.

  16. Linear Matrix Inequality Method for a Quadratic Performance Index Minimization Problem with a class of Bilinear Matrix Inequality Conditions

    Science.gov (United States)

    Tanemura, M.; Chida, Y.

    2016-09-01

    There are a lot of design problems of control system which are expressed as a performance index minimization under BMI conditions. However, a minimization problem expressed as LMIs can be easily solved because of the convex property of LMIs. Therefore, many researchers have been studying transforming a variety of control design problems into convex minimization problems expressed as LMIs. This paper proposes an LMI method for a quadratic performance index minimization problem with a class of BMI conditions. The minimization problem treated in this paper includes design problems of state-feedback gain for switched system and so on. The effectiveness of the proposed method is verified through a state-feedback gain design for switched systems and a numerical simulation using the designed feedback gains.

  17. Practical use of SPRINT and a moving grid interface for a class of 1D non-linear transport problems

    NARCIS (Netherlands)

    van Eijkeren JCH; Zegeling PA; Hassanizadeh SM

    1991-01-01

    Environmental problems tend to become of still greater complexity. The mathematical formulation of these problems often results in a set of differential equations, which urges the need for robust differential equation solvers. Moreover, these solvers should be implemented within a user-friendly an

  18. 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...

  19. A linear programming manual

    Science.gov (United States)

    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.

  20. An Analysis of the Multiple Objective Capital Budgeting Problem via Fuzzy Linear Integer (0-1) Programming.

    Science.gov (United States)

    1980-05-31

    34 AIIE Transac- tions, Vol. 11, Nc, 1, March 1979, pp. 61-69. (8] Taylor, Bernard and Keown , Arthur J., "A Goal Programming Application of Capital...Programming," OMEGA, Vol. 1, No. 2, April 1973, pp. 193-205. [29] Lee, S. M., and Keown , Arthur J., "Integer Goal Programming Model for Capital...Hadley, G., Linear Algebra, Addison-Wesley Publishing Co., Inc., Reading, MA, 1961. [60] Zuckerman, Martin M., Sets and Transfinite Numbers, Macmillan

  1. CABARET scheme for the numerical solution of aeroacoustics problems: Generalization to linearized one-dimensional Euler equations

    Science.gov (United States)

    Goloviznin, V. M.; Karabasov, S. A.; Kozubskaya, T. K.; Maksimov, N. V.

    2009-12-01

    A generalization of the CABARET finite difference scheme is proposed for linearized one-dimensional Euler equations based on the characteristic decomposition into local Riemann invariants. The new method is compared with several central finite difference schemes that are widely used in computational aeroacoustics. Numerical results for the propagation of an acoustic wave in a homogeneous field and the refraction of this wave through a contact discontinuity obtained on a strongly nonuniform grid are presented.

  2. Palaeointensities from Pliocene lava sequences in Iceland: emphasis on the problem of Arai plot with two linear segments

    Science.gov (United States)

    Tanaka, Hidefumi; Yamamoto, Yuhji

    2016-05-01

    Palaeointensity experiments were carried out to a sample collection from two sections of basalt lava flow sequences of Pliocene age in north central Iceland (Chron C2An) to further refine the knowledge of the behaviour of the palaeomagnetic field. Selection of samples was mainly based on their stability of remanence to thermal demagnetization as well as good reversibility in variations of magnetic susceptibility and saturation magnetization with temperature, which would indicate the presence of magnetite as a product of deuteric oxidation of titanomagnetite. Among 167 lava flows from two sections, 44 flows were selected for the Königsberger-Thellier-Thellier experiment in vacuum. In spite of careful pre-selection of samples, an Arai plot with two linear segments, or a concave-up appearance, was often encountered during the experiments. This non-ideal behaviour was probably caused by an irreversible change in the domain state of the magnetic grains of the pseudo-single-domain (PSD) range. This is assumed because an ideal linear plot was obtained in the second run of the palaeointensity experiment in which a laboratory thermoremanence acquired after the final step of the first run was used as a natural remanence. This experiment was conducted on six selected samples, and no clear difference between the magnetic grains of the experimented and pristine sister samples was found by scanning electron microscope and hysteresis measurements, that is, no occurrence of notable chemical/mineralogical alteration, suggesting that no change in the grain size distribution had occurred. Hence, the two-segment Arai plot was not caused by the reversible multidomain/PSD effect in which the curvature of the Arai plot is dependent on the grain size. Considering that the irreversible change in domain state must have affected data points at not only high temperatures but also low temperatures, fv ≥ 0.5 was adopted as one of the acceptance criteria where fv is a vectorially defined

  3. A linear variational exercise with a simple non-orthogonal basis for the particle-in-the-box problem

    Energy Technology Data Exchange (ETDEWEB)

    Luana, VIctor; Otero-de la Roza, A; Blanco, M A; Recio, J M [Universidad de Oviedo, Departamento de Quimica Fisica y AnalItica, E-33006-Oviedo (Spain)], E-mail: victor@carbono.quimica.uniovi.es

    2010-01-15

    The particle-in-the-box, with or without an additional potential, is proposed as an excellent laboratory to teach and explore the details of the linear variational method using a non-orthogonal basis. The x{sup n}(a - x){sup n} and x{sup n}(a/2 - x)(a - x){sup n} polynomials are shown to form a complete basis for the even and odd states, respectively, of the particle confined to the x in [0, a] interval. A short and simple Octave code is presented as the natural extension to the hand calculations when the basis set grows in size.

  4. A geometrically non-linear formulation of a three-dimensional beam element for solving large deflection multibody system problems

    NARCIS (Netherlands)

    Jonker, J.B.; Meijaard, J.P.

    2013-01-01

    A beam finite element formulation for large deflection problems in the analysis of flexible multibody systems has been proposed. In this formulation, a set of independent discrete deformation modes are defined for each element which are related to conventional small deflection beam theory in a co-ro

  5. Problems

    Directory of Open Access Journals (Sweden)

    Yekini Shehu

    2010-01-01

    real Banach space which is also uniformly smooth using the properties of generalized f-projection operator. Using this result, we discuss strong convergence theorem concerning general H-monotone mappings and system of generalized mixed equilibrium problems in Banach spaces. Our results extend many known recent results in the literature.

  6. Numerical Solutions of Odd Order Linear and Nonlinear Initial Value Problems Using a Shifted Jacobi Spectral Approximations

    Directory of Open Access Journals (Sweden)

    A. H. Bhrawy

    2012-01-01

    Full Text Available A shifted Jacobi Galerkin method is introduced to get a direct solution technique for solving the third- and fifth-order differential equations with constant coefficients subject to initial conditions. The key to the efficiency of these algorithms is to construct appropriate base functions, which lead to systems with specially structured matrices that can be efficiently inverted. A quadrature Galerkin method is introduced for the numerical solution of these problems with variable coefficients. A new shifted Jacobi collocation method based on basis functions satisfying the initial conditions is presented for solving nonlinear initial value problems. Through several numerical examples, we evaluate the accuracy and performance of the proposed algorithms. The algorithms are easy to implement and yield very accurate results.

  7. Effective Zero-Inventory-Ordering Policies for the Single-Warehouse Multiretailer Problem with Piecewise Linear Cost Structures

    OpenAIRE

    Lap Mui Ann Chan; Ana Muriel; Zuo-Jun Max Shen; David Simchi-Levi; Chung-Piaw Teo

    2002-01-01

    We analyze the problem faced by companies that rely on TL (Truckload) and LTL (Less than Truckload) carriers for the distribution of products across their supply chain. Our goal is to design simple inventory policies and transportation strategies to satisfy time varying demands over a finite horizon, while minimizing system wide cost by taking advantage of quantity discounts in the transportation cost structures. For this purpose, we study the cost effectiveness of restricting the inventory p...

  8. Some contributions to non-linear physic: Mathematical problems; Contribuciones a problemas matematicos en fisica no-lineal

    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.

  9. Modeling Operation Problem of Micro-grids Considering Economical, Technical and Environmental issues as Mixed-Integer Non-Linear Programming

    Directory of Open Access Journals (Sweden)

    Samira Salahi

    2016-08-01

    Full Text Available Reduction of fossil resources, increasing the production of greenhouse gas emissions and demand growth lead to greater use of distributed energy resources in power system especially in distribution networks. Integrating these resources in order to supply local loads creates a new concept called micro-grid. Optimal operation of micro-grid in the specific time period is one of the most important problems of them. In this paper, the operation problem of micro-grids is modeled considering the economical, technical and environmental issues, as well as uncertainties related to loads, wind speed and solar radiation. The resulting model is a Mixed-Integer Non-Linear Programming (MINLP. To demonstrate the effectiveness of the proposed model, Bisheh village in Iran is considered as a case study. The results showed that considering load curtailment costs, the power losses of the main grid, the penalties of pollutant gasses emissions and the elimination of energy subsides will tremendous impacts on the operation of microgrids. Article History: Received March 12, 2016; Received in revised form June 20, 2016; Accepted July 2nd 2016; Available online How to Cite This Article: Salahi, S., and Bahramara, S. (2016 Modeling Operation Problem of Micro-grids Considering Economical, Technical and Environmental issues as Mixed-Integer Non-Linear Programming. Int. Journal of Renewable Energy Development, 5(2, 139-149. http://dx.doi.org/10.14710/ijred.5.2.139-149 

  10. A SIMI-LINEAR PROBLEM ON THE QUATERNIONIC HEISENBERG GROUP%四元Heisenberg群上的一个半线性问题

    Institute of Scientific and Technical Information of China (English)

    杨乔华

    2006-01-01

    本文研究了四元Heisenberg群上的一个半线性方程问题,通过把对应的方程问题化为积分进行估计,证明了其对应的半线性方程的非负双椭圆解只有唯一的零解,推广了相应Heisenberg群上的定理.%In this paper, we study a semi-linear problem on the quaternionic Heisenberg group. By estimating the integration of the corresponding semi-linear equation, we prove the only non-negative bi-cylindrical solution is zero, which generalizes the corresponding theorem in Heisenberg group.

  11. LS-APC v1.0: a tuning-free method for the linear inverse problem and its application to source-term determination

    Science.gov (United States)

    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.

  12. The linear quadratic optimal control problem for infinite dimensional systems over an infinite horizon - Survey and examples

    Science.gov (United States)

    Bensoussan, A.; Delfour, M. C.; Mitter, S. K.

    1976-01-01

    Available published results are surveyed for a special class of infinite-dimensional control systems whose evolution is characterized by a semigroup of operators of class C subscript zero. Emphasis is placed on an approach that clarifies the system-theoretic relationship among controllability, stabilizability, stability, and the existence of a solution to an associated operator equation of the Riccati type. Formulation of the optimal control problem is reviewed along with the asymptotic behavior of solutions to a general system of equations and several theorems concerning L2 stability. Examples are briefly discussed which involve second-order parabolic systems, first-order hyperbolic systems, and distributed boundary control.

  13. An optimization based on simulation approach to the patient admission scheduling problem using a linear programing algorithm.

    Science.gov (United States)

    Granja, C; Almada-Lobo, B; Janela, F; Seabra, J; Mendes, A

    2014-12-01

    As patient's length of stay in waiting lists increases, governments are looking for strategies to control the problem. Agreements were created with private providers to diminish the workload in the public sector. However, the growth of the private sector is not following the demand for care. Given this context, new management strategies have to be considered in order to minimize patient length of stay in waiting lists while reducing the costs and increasing (or at least maintaining) the quality of care. Appointment scheduling systems are today known to be proficient in the optimization of health care services. Their utilization is focused on increasing the usage of human resources, medical equipment and reducing the patient waiting times. In this paper, a simulation-based optimization approach to the Patient Admission Scheduling Problem is presented. Modeling tools and simulation techniques are used in the optimization of a diagnostic imaging department. The proposed techniques have demonstrated to be effective in the evaluation of diagnostic imaging workflows. A simulated annealing algorithm was used to optimize the patient admission sequence towards minimizing the total completion and total waiting of patients. The obtained results showed average reductions of 5% on the total completion and 38% on the patients' total waiting time. Copyright © 2014 Elsevier Inc. All rights reserved.

  14. Elastic-net regularization versus ℓ 1-regularization for linear inverse problems with quasi-sparse solutions

    Science.gov (United States)

    Chen, De-Han; Hofmann, Bernd; Zou, Jun

    2017-01-01

    We consider the ill-posed operator equation Ax  =  y with an injective and bounded linear operator A mapping between {{\\ell}2} and a Hilbert space Y, possessing the unique solution {{x}\\dagger}=≤ft\\{{{x}\\dagger}k\\right\\}k=1∞ . For the cases that sparsity {{x}\\dagger}\\in {{\\ell}0} is expected but often slightly violated in practice, we investigate in comparison with the {{\\ell}1} -regularization the elastic-net regularization, where the penalty is a weighted superposition of the {{\\ell}1} -norm and the {{\\ell}2} -norm square, under the assumption that {{x}\\dagger}\\in {{\\ell}1} . There occur two positive parameters in this approach, the weight parameter η and the regularization parameter as the multiplier of the whole penalty in the Tikhonov functional, whereas only one regularization parameter arises in {{\\ell}1} -regularization. Based on the variational inequality approach for the description of the solution smoothness with respect to the forward operator A and exploiting the method of approximate source conditions, we present some results to estimate the rate of convergence for the elastic-net regularization. The occurring rate function contains the rate of the decay {{x}\\dagger}k\\to 0 for k\\to ∞ and the classical smoothness properties of {{x}\\dagger} as an element in {{\\ell}2} .

  15. High-order entropy-based closures for linear transport in slab geometry II: A computational study of the optimization problem

    Energy Technology Data Exchange (ETDEWEB)

    Hauck, Cory D [ORNL; Alldredge, Graham [University of Maryland; Tits, Andre [University of Maryland

    2012-01-01

    We present a numerical algorithm to implement entropy-based (M{sub N}) moment models in the context of a simple, linear kinetic equation for particles moving through a material slab. The closure for these models - as is the case for all entropy-based models - is derived through the solution of constrained, convex optimization problem. The algorithm has two components. The first component is a discretization of the moment equations which preserves the set of realizable moments, thereby ensuring that the optimization problem has a solution (in exact arithmetic). The discretization is a second-order kinetic scheme which uses MUSCL-type limiting in space and a strong-stability-preserving, Runge-Kutta time integrator. The second component of the algorithm is a Newton-based solver for the dual optimization problem, which uses an adaptive quadrature to evaluate integrals in the dual objective and its derivatives. The accuracy of the numerical solution to the dual problem plays a key role in the time step restriction for the kinetic scheme. We study in detail the difficulties in the dual problem that arise near the boundary of realizable moments, where quadrature formulas are less reliable and the Hessian of the dual objection function is highly ill-conditioned. Extensive numerical experiments are performed to illustrate these difficulties. In cases where the dual problem becomes 'too difficult' to solve numerically, we propose a regularization technique to artificially move moments away from the realizable boundary in a way that still preserves local particle concentrations. We present results of numerical simulations for two challenging test problems in order to quantify the characteristics of the optimization solver and to investigate when and how frequently the regularization is needed.

  16. Linear algebra

    CERN Document Server

    Allenby, Reg

    1995-01-01

    As the basis of equations (and therefore problem-solving), linear algebra is the most widely taught sub-division of pure mathematics. Dr Allenby has used his experience of teaching linear algebra to write a lively book on the subject that includes historical information about the founders of the subject as well as giving a basic introduction to the mathematics undergraduate. The whole text has been written in a connected way with ideas introduced as they occur naturally. As with the other books in the series, there are many worked examples.Solutions to the exercises are available onlin

  17. Feedback linearization of piecewise linear systems

    NARCIS (Netherlands)

    Camlibel, Kanat; Ustoglu, Ilker

    2005-01-01

    One of the classical problems of nonlinear systems and control theory is feedback linearization. Its obvious motivation is that one can utilize linear control theory if the nonlinear system at hand is linearizable by feedback. This problem is well-understood for the smooth nonlinear systems. In the

  18. Linear algebra

    CERN Document Server

    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

  19. OPTIMAL HARVESTING CONTROL PROBLEM FOR LINEAR AGE-DEPENDENT POPULATION DYNAMICS%具有年龄结构的种群线性动力系统的最优收获控制问题

    Institute of Scientific and Technical Information of China (English)

    雒志学; 王绵森

    2003-01-01

    An optimal harvesting problem for linear age-dependent population dynamics is investigated.By Mazur's Theorem,the existence of solutions of the optimal control problem (OH) is demonstrated.The first order necessary conditions of optimality for problem (OH) is obtained by the conception of normal cone. Finally,under suitable assumptions,the uniqueness of solutions of the optimal control problem (OH) is given.The results extend some known criteria.

  20. Classifying Linear Canonical Relations

    OpenAIRE

    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.

  1. Algoritmos Heurísticos para la Solución del Problema Lineal con Restricciones de Equilibrio (Heuristic Algorithms for Solving Linear Problems with Equilibrium Constraints

    Directory of Open Access Journals (Sweden)

    Dania Tamayo-Vera

    2016-04-01

    Full Text Available Spanish abstract Los problemas lineales con restricciones de equilibrio son un caso particular de los modelos de optimización con restricciones de equilibrio. Debido a la complejidad que presentan, la condición de equilibrio se sustituye por condiciones necesarias obteniéndose un problema con restricciones de complementariedad (MPCC. La estructura del conjunto de soluciones factibles del MPCC obtenido es compleja ya que es la unión de poliedros. Resolver todos los problemas correspondientes a minimizar la función objetivo sobre cada uno de estos poliedros es computacionalmente costoso. El presente trabajo utiliza un enfoque heurístico para dar solución al MPCC, adaptando los algoritmos de Búsqueda Local y Recocido Simulado. Este trabajo presenta un conjunto de funciones de prueba y los resultados computacionales más significativos obtenidos. English abstract Linear equilibrium constrained programming is a special class of optimization models with equilibrium constraints. Because of the complexity of the equilibrium condition it is replaced by necessary conditions, which leads to a complementarity constrained problem (MPCC. The set of feasible solutions in a MPCC is structured as a union of polyhedrons. Solving the MPCC problem would require the minimization of the objective function on each of these polyhedrons. The computation cost of this approach is unfeasible, thus, this work presents a new approach where heuristic algorithms such as Hill Climbing and Simulated Annealing are used to search for good solutions on the polyhedrons space. A new benchmark for linear equilibrium constrained optimization is introduced. The computational results achieved by the proposed heuristics on the new benchmark are presented.

  2. A Class of Quasi-Linear Riemann-Hilbert Problems for General Holomorphic Functions in the Unit Disk%一类圆域上广义解析函数拟线性Riemann-Hilbert问题

    Institute of Scientific and Technical Information of China (English)

    2000-01-01

    In this paper, a class of quasi-linear Rie mann-Hilbert problems for general holomorphic functions in the unit disk was studied. Under suitable hypotheses, the existence of solutions of the Hardy class H2 to this problem was proved by means of Tikhonov' s fixed point theorem and corresponding theories for general holomorphic functions

  3. Topics in computational linear optimization

    DEFF Research Database (Denmark)

    Hultberg, Tim Helge

    2000-01-01

    . Linear optimization problems covers both linear programming problems, which are polynomially solvable, and mixed integer linear programming problems, which belong to the class of NP-hard problems. The three main reasons for the practical succes of linear optimization are: wide applicability, availabilty...... of high quality solvers and the use of algebraic modelling systems to handle the communication between the modeller and the solver. This dissertation features four topics in computational linear optimization: A) automatic reformulation of mixed 0/1 linear programs, B) direct solution of sparse unsymmetric...... systems of linear equations, C) reduction of linear programs and D) integration of algebraic modelling of linear optimization problems in C++. Each of these topics is treated in a separate paper included in this dissertation. The efficiency of solving mixed 0-1 linear programs by linear programming based...

  4. Linear collider: a preview

    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.

  5. Effects of Triaxiality, Oblateness and Gravitational Potential from a Belt on the Linear Stability of 4,5 in the Restricted Three-Body Problem

    Indian Academy of Sciences (India)

    Jagadish Singh; Joel John Taura

    2014-12-01

    In this paper we have considered the restricted three body problem (R3BP) in which the more massive primary is triaxial, the less massive primary and infinitesimal body are oblate spheroids, and are encompassed by a belt of homogenous material points. Analytically and numerically, we have studied the effects of triaxiality of the more massive primary, oblateness of both the less massive primary and infinitesimal body and the gravitational potential generated by the belt on the location of the triangular libration points 4,5 and their linear stability. 4,5 do not form equilateral triangles with the primaries in the presence of all or any of the aforementioned perturbations. Due to triaxiality of the more massive primary and oblateness of the infinitesimal body the triangular libration points are seen to move away from the line linking the primaries, whereas they shift closer to the line owing to the oblateness of the less massive primary and the potential from the belt. The range 0 < < c of stability of the triangular points is reduced in the presence of any of the perturbations, except when considering the potential from the belt the range increases, where c is the critical mass ratio. The oblateness of a test particle (of infinitesimal mass) shifts the location of its libration positions away from the primaries and reduces its range of stability.

  6. Problem of grey bilevel multi-objective linear programming and its algorithm%灰色二层多目标线性规划问题及其解法

    Institute of Scientific and Technical Information of China (English)

    郭欢; 肖新平; Jeffrey Forrest

    2014-01-01

    针对二层多目标线性规划问题,结合灰色系统的特性,提出了一般灰色二层多目标线性规划问题,并给出了模型的相关定义和定理。针对漂移型灰色二层多目标线性规划问题,提出一种具有全局收敛性质的求解算法。首先通过线性加权模理想点法把多目标转化为单目标;然后当可行域为非空紧集时,利用库恩塔克条件把双层转化为单层,再利用粒子群算法搜索单目标单层线性规划即可得到原问题的解;最后通过算例表明了该算法的有效性。%Based on the bilevel multi-objective linear programming and the characteristic of grey system, the general gray bilevel multi-objective linear programming problem with its relevant definition and theorem are given. A globally convergent algorithm is given to solve the drifting grey bilevel multi-objective linear programming problem. Firstly, multi-objective programming is transformed into single programming by using linear plus power ideal point algorithm. Then, the grey bilevel linear programming can be transformed into a grey linear programming problem by its Kuhn-Tucker condition when the feasible domain is nonempty compact aggregate. So these problems can be solved by using the particle swarm optimization algorithm to obtain the solution of the gray bilevel multi-objective linear programming problem. Finally, an example shows the effectiveness of the proposed algorithm.

  7. Linearization Techniques

    Directory of Open Access Journals (Sweden)

    Gildeberto S. Cardoso

    2011-01-01

    Full Text Available This paper presents a study of linear control systems based on exact feedback linearization and approximate feedback linearization. As exact feedback linearization is applied, a linear controller can perform the control objectives. The approximate feedback linearization is required when a nonlinear system presents a noninvolutive property. It uses a Taylor series expansion in order to compute a nonlinear transformation of coordinates to satisfy the involutivity conditions.

  8. The Optimal Conditions of the Linear Fractional Programming Problem with Constraint%带有约束线性分式规划问题的最优性条件

    Institute of Scientific and Technical Information of China (English)

    孙建设; 叶留青

    2006-01-01

    In this article,the authors discuss the optimal conditions of the linear fractional programming problem and prove that a locally optional solution is a globally optional solution and the locally optimal solution can be attained at a basic feasible solution with constraint condition.

  9. Effectiveness in improving knowledge, practices, and intakes of "key problem nutrients" of a complementary feeding intervention developed by using linear programming: experience in Lombok, Indonesia.

    Science.gov (United States)

    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

  10. Linear Psoriasis

    Directory of Open Access Journals (Sweden)

    Agarwalla Arun

    2001-01-01

    Full Text Available Linear psoriasis, inflammatory linear varrucous epidermal naevus (ILVEN. Lichen straitus, linear lichen planus and invasion of epidermal naevi by psoriasis have clinical and histopathological overlap. We report two young male patients of true linear psoriasis without classical lesions elsewhere which were proved histopathologically. Seasonal variation and good response to topical antipsoriatic treatment supported the diagnosis.

  11. 一类基于区间模糊集的线性规划问题%A KIND OF FUZZY LINEAR PROGRAMMING PROBLEMS BASED ON INTERVAL-VALUED FUZZY SETS

    Institute of Scientific and Technical Information of China (English)

    2000-01-01

    The objective of this paper is to deal with a kind of fuzzy linear programming problem based on interval-valued fuzzy sets (IVFLP) through the medium of procedure that turns IVFLP into parametric linear programming via the mathematical programming.Some useful results for the benefit of solving IVFLP are expounded and proved,developed and discussed.Furthermore,that the proposed techniques in this paper allow the decision-maker to assign a different degree of importance can provide a useful way to efficiently help the decision-maker make their decisions.

  12. Finite-dimensional linear algebra

    CERN Document Server

    Gockenbach, Mark S

    2010-01-01

    Some Problems Posed on Vector SpacesLinear equationsBest approximationDiagonalizationSummaryFields and Vector SpacesFields Vector spaces Subspaces Linear combinations and spanning sets Linear independence Basis and dimension Properties of bases Polynomial interpolation and the Lagrange basis Continuous piecewise polynomial functionsLinear OperatorsLinear operatorsMore properties of linear operatorsIsomorphic vector spaces Linear operator equations Existence and uniqueness of solutions The fundamental theorem; inverse operatorsGaussian elimination Newton's method Linear ordinary differential eq

  13. A primer on linear models

    CERN Document Server

    Monahan, John F

    2008-01-01

    Preface Examples of the General Linear Model Introduction One-Sample Problem Simple Linear Regression Multiple Regression One-Way ANOVA First Discussion The Two-Way Nested Model Two-Way Crossed Model Analysis of Covariance Autoregression Discussion The Linear Least Squares Problem The Normal Equations The Geometry of Least Squares Reparameterization Gram-Schmidt Orthonormalization Estimability and Least Squares Estimators Assumptions for the Linear Mean Model Confounding, Identifiability, and Estimability Estimability and Least Squares Estimators F

  14. The calculation of ternary miscibility gaps using the linear contributions method: Problems, benchmark systems and an application to (K, Li, Na)Br

    NARCIS (Netherlands)

    Jacobs, M.H.G.; Oonk, H.A.J.

    2006-01-01

    Hypothetical systems are useful to enhance the rigor of computerized algorithms and to enhance the applicability of the developed software to physically realistic systems. This paper deals with the calculation of miscibility gaps using the method of the addition of linear contributions. We derived a

  15. A new preconditioner update strategy for the solution of sequences of linear systems in structural mechanics: application to saddle point problems in elasticity

    Science.gov (United States)

    Mercier, Sylvain; Gratton, Serge; Tardieu, Nicolas; Vasseur, Xavier

    2017-07-01

    Many applications in structural mechanics require the numerical solution of sequences of linear systems typically issued from a finite element discretization of the governing equations on fine meshes. The method of Lagrange multipliers is often used to take into account mechanical constraints. The resulting matrices then exhibit a saddle point structure and the iterative solution of such preconditioned linear systems is considered as challenging. A popular strategy is then to combine preconditioning and deflation to yield an efficient method. We propose an alternative that is applicable to the general case and not only to matrices with a saddle point structure. In this approach, we consider to update an existing algebraic or application-based preconditioner, using specific available information exploiting the knowledge of an approximate invariant subspace or of matrix-vector products. The resulting preconditioner has the form of a limited memory quasi-Newton matrix and requires a small number of linearly independent vectors. Numerical experiments performed on three large-scale applications in elasticity highlight the relevance of the new approach. We show that the proposed method outperforms the deflation method when considering sequences of linear systems with varying matrices.

  16. Expected value of sampling information for linear decision problem on two actions under (Pareto-U)model%(Pareto-U)模型下二行动线性决策问题的EVSI

    Institute of Scientific and Technical Information of China (English)

    杨艳秋; 宋立新

    2011-01-01

    讨论了均匀分布U(0,θ)共轭于Pareto分布模型下的二行动线性决策问题的抽样信息期望值(EVSI)的计算公式.%This study discusses the expected value of sampling information(EVSI) of the linear decision-making problem on two actions about the model of Pareto distribution conjugate in uniformly distribution (Pareto-U) model.

  17. On the linear programming bound for linear Lee codes.

    Science.gov (United States)

    Astola, Helena; Tabus, Ioan

    2016-01-01

    Based on an invariance-type property of the Lee-compositions of a linear Lee code, additional equality constraints can be introduced to the linear programming problem of linear Lee codes. In this paper, we formulate this property in terms of an action of the multiplicative group of the field [Formula: see text] on the set of Lee-compositions. We show some useful properties of certain sums of Lee-numbers, which are the eigenvalues of the Lee association scheme, appearing in the linear programming problem of linear Lee codes. Using the additional equality constraints, we formulate the linear programming problem of linear Lee codes in a very compact form, leading to a fast execution, which allows to efficiently compute the bounds for large parameter values of the linear codes.

  18. Differential Equations with Linear Algebra

    CERN Document Server

    Boelkins, Matthew R; Potter, Merle C

    2009-01-01

    Linearity plays a critical role in the study of elementary differential equations; linear differential equations, especially systems thereof, demonstrate a fundamental application of linear algebra. In Differential Equations with Linear Algebra, we explore this interplay between linear algebra and differential equations and examine introductory and important ideas in each, usually through the lens of important problems that involve differential equations. Written at a sophomore level, the text is accessible to students who have completed multivariable calculus. With a systems-first approach, t

  19. Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC and a modified branch-and-bound method (MBB

    Directory of Open Access Journals (Sweden)

    Mukhacheva E.A.

    2000-01-01

    Full Text Available Two algorithms for the one-dimensional cutting problem, namely, a modified branch-and-bound method (exact method and a heuristic sequential value correction method are suggested. In order to obtain a reliable assessment of the efficiency of the algorithms, hard instances of the problem were considered and from the computational experiment it seems that the efficiency of the heuristic method appears to be superior to that of the exact one, taking into account the computing time of the latter. A detailed description of the two methods is given along with suggestions for their improvements.

  20. Topics in computational linear optimization

    DEFF Research Database (Denmark)

    Hultberg, Tim Helge

    2000-01-01

    of high quality solvers and the use of algebraic modelling systems to handle the communication between the modeller and the solver. This dissertation features four topics in computational linear optimization: A) automatic reformulation of mixed 0/1 linear programs, B) direct solution of sparse unsymmetric...... systems of linear equations, C) reduction of linear programs and D) integration of algebraic modelling of linear optimization problems in C++. Each of these topics is treated in a separate paper included in this dissertation. The efficiency of solving mixed 0-1 linear programs by linear programming based...... reductions. In the fourth and last paper, a prototype implementation of a C++ class library, FLOPC++, for formulating linear optimization problems is presented. Using FLOPC++, linear optimization models can be specified in a declarative style, similar to algebraic modelling languages such as GAMS and AMPL...