WorldWideScience

Sample records for solve linear systems

  1. New approach to solve symmetric fully fuzzy linear systems

    Indian Academy of Sciences (India)

    concepts of fuzzy set theory and then define a fully fuzzy linear system of equations. .... To represent the above problem as fully fuzzy linear system, we represent x .... Fully fuzzy linear systems can be solved by Linear programming approach, ...

  2. A Proposed Method for Solving Fuzzy System of Linear Equations

    Directory of Open Access Journals (Sweden)

    Reza Kargar

    2014-01-01

    Full Text Available This paper proposes a new method for solving fuzzy system of linear equations with crisp coefficients matrix and fuzzy or interval right hand side. Some conditions for the existence of a fuzzy or interval solution of m×n linear system are derived and also a practical algorithm is introduced in detail. The method is based on linear programming problem. Finally the applicability of the proposed method is illustrated by some numerical examples.

  3. A convex optimization approach for solving large scale linear systems

    Directory of Open Access Journals (Sweden)

    Debora Cores

    2017-01-01

    Full Text Available The well-known Conjugate Gradient (CG method minimizes a strictly convex quadratic function for solving large-scale linear system of equations when the coefficient matrix is symmetric and positive definite. In this work we present and analyze a non-quadratic convex function for solving any large-scale linear system of equations regardless of the characteristics of the coefficient matrix. For finding the global minimizers, of this new convex function, any low-cost iterative optimization technique could be applied. In particular, we propose to use the low-cost globally convergent Spectral Projected Gradient (SPG method, which allow us to extend this optimization approach for solving consistent square and rectangular linear system, as well as linear feasibility problem, with and without convex constraints and with and without preconditioning strategies. Our numerical results indicate that the new scheme outperforms state-of-the-art iterative techniques for solving linear systems when the symmetric part of the coefficient matrix is indefinite, and also for solving linear feasibility problems.

  4. Solving Fully Fuzzy Linear System of Equations in General Form

    Directory of Open Access Journals (Sweden)

    A. Yousefzadeh

    2012-06-01

    Full Text Available In this work, we propose an approach for computing the positive solution of a fully fuzzy linear system where the coefficient matrix is a fuzzy $nimes n$ matrix. To do this, we use arithmetic operations on fuzzy numbers that introduced by Kaffman in and convert the fully fuzzy linear system into two $nimes n$ and $2nimes 2n$ crisp linear systems. If the solutions of these linear systems don't satisfy in positive fuzzy solution condition, we introduce the constrained least squares problem to obtain optimal fuzzy vector solution by applying the ranking function in given fully fuzzy linear system. Using our proposed method, the fully fuzzy linear system of equations always has a solution. Finally, we illustrate the efficiency of proposed method by solving some numerical examples.

  5. New approach to solve symmetric fully fuzzy linear systems

    Indian Academy of Sciences (India)

    In this paper, we present a method to solve fully fuzzy linear systems with symmetric coefficient matrix. The symmetric coefficient matrix is decomposed into two systems of equations by using Cholesky method and then a solution can be obtained. Numerical examples are given to illustrate our method.

  6. Experimental quantum computing to solve systems of linear equations.

    Science.gov (United States)

    Cai, X-D; Weedbrook, C; Su, Z-E; Chen, M-C; Gu, Mile; Zhu, M-J; Li, Li; Liu, Nai-Le; Lu, Chao-Yang; Pan, Jian-Wei

    2013-06-07

    Solving linear systems of equations is ubiquitous in all areas of science and engineering. With rapidly growing data sets, such a task can be intractable for classical computers, as the best known classical algorithms require a time proportional to the number of variables N. A recently proposed quantum algorithm shows that quantum computers could solve linear systems in a time scale of order log(N), giving an exponential speedup over classical computers. Here we realize the simplest instance of this algorithm, solving 2×2 linear equations for various input vectors on a quantum computer. We use four quantum bits and four controlled logic gates to implement every subroutine required, demonstrating the working principle of this algorithm.

  7. Galerkin projection methods for solving multiple related linear systems

    Energy Technology Data Exchange (ETDEWEB)

    Chan, T.F.; Ng, M.; Wan, W.L.

    1996-12-31

    We consider using Galerkin projection methods for solving multiple related linear systems A{sup (i)}x{sup (i)} = b{sup (i)} for 1 {le} i {le} s, where A{sup (i)} and b{sup (i)} are different in general. We start with the special case where A{sup (i)} = A and A is symmetric positive definite. The method generates a Krylov subspace from a set of direction vectors obtained by solving one of the systems, called the seed system, by the CG method and then projects the residuals of other systems orthogonally onto the generated Krylov subspace to get the approximate solutions. The whole process is repeated with another unsolved system as a seed until all the systems are solved. We observe in practice a super-convergence behaviour of the CG process of the seed system when compared with the usual CG process. We also observe that only a small number of restarts is required to solve all the systems if the right-hand sides are close to each other. These two features together make the method particularly effective. In this talk, we give theoretical proof to justify these observations. Furthermore, we combine the advantages of this method and the block CG method and propose a block extension of this single seed method. The above procedure can actually be modified for solving multiple linear systems A{sup (i)}x{sup (i)} = b{sup (i)}, where A{sup (i)} are now different. We can also extend the previous analytical results to this more general case. Applications of this method to multiple related linear systems arising from image restoration and recursive least squares computations are considered as examples.

  8. Comments on new iterative methods for solving linear systems

    Directory of Open Access Journals (Sweden)

    Wang Ke

    2017-06-01

    Full Text Available Some new iterative methods were presented by Du, Zheng and Wang for solving linear systems in [3], where it is shown that the new methods, comparing to the classical Jacobi or Gauss-Seidel method, can be applied to more systems and have faster convergence. This note shows that their methods are suitable for more matrices than positive matrices which the authors suggested through further analysis and numerical examples.

  9. CHEBYSHEV ACCELERATION TECHNIQUE FOR SOLVING FUZZY LINEAR SYSTEM

    Directory of Open Access Journals (Sweden)

    S.H. Nasseri

    2011-07-01

    Full Text Available In this paper, Chebyshev acceleration technique is used to solve the fuzzy linear system (FLS. This method is discussed in details and followed by summary of some other acceleration techniques. Moreover, we show that in some situations that the methods such as Jacobi, Gauss-Sidel, SOR and conjugate gradient is divergent, our proposed method is applicable and the acquired results are illustrated by some numerical examples.

  10. CHEBYSHEV ACCELERATION TECHNIQUE FOR SOLVING FUZZY LINEAR SYSTEM

    Directory of Open Access Journals (Sweden)

    S.H. Nasseri

    2009-10-01

    Full Text Available In this paper, Chebyshev acceleration technique is used to solve the fuzzy linear system (FLS. This method is discussed in details and followed by summary of some other acceleration techniques. Moreover, we show that in some situations that the methods such as Jacobi, Gauss-Sidel, SOR and conjugate gradient is divergent, our proposed method is applicable and the acquired results are illustrated by some numerical examples.

  11. AZTEC: A parallel iterative package for the solving linear systems

    Energy Technology Data Exchange (ETDEWEB)

    Hutchinson, S.A.; Shadid, J.N.; Tuminaro, R.S. [Sandia National Labs., Albuquerque, NM (United States)

    1996-12-31

    We describe a parallel linear system package, AZTEC. The package incorporates a number of parallel iterative methods (e.g. GMRES, biCGSTAB, CGS, TFQMR) and preconditioners (e.g. Jacobi, Gauss-Seidel, polynomial, domain decomposition with LU or ILU within subdomains). Additionally, AZTEC allows for the reuse of previous preconditioning factorizations within Newton schemes for nonlinear methods. Currently, a number of different users are using this package to solve a variety of PDE applications.

  12. New approach to solve fully fuzzy system of linear equations using ...

    Indian Academy of Sciences (India)

    Known example problems are solved to illustrate the efficacy and ... The concept of fuzzy set and fuzzy number were first introduced by Zadeh .... (iii) Fully fuzzy linear systems can be solved by linear programming approach, Gauss elim-.

  13. Krylov subspace methods for solving large unsymmetric linear systems

    International Nuclear Information System (INIS)

    Saad, Y.

    1981-01-01

    Some algorithms based upon a projection process onto the Krylov subspace K/sub m/ = Span(r 0 , Ar 0 ,...,A/sup m/-1r 0 ) are developed, generalizing the method of conjugate gradients to unsymmetric systems. These methods are extensions of Arnoldi's algorithm for solving eigenvalue problems. The convergence is analyzed in terms of the distance of the solution to the subspace K/sub m/ and some error bounds are established showing, in particular, a similarity with the conjugate gradient method (for symmetric matrices) when the eigenvalues are real. Several numerical experiments are described and discussed

  14. New approach to solve fully fuzzy system of linear equations using ...

    Indian Academy of Sciences (India)

    This paper proposes two new methods to solve fully fuzzy system of linear equations. The fuzzy system has been converted to a crisp system of linear equations by using single and double parametric form of fuzzy numbers to obtain the non-negative solution. Double parametric form of fuzzy numbers is defined and applied ...

  15. On Solving Linear Recurrences

    Science.gov (United States)

    Dobbs, David E.

    2013-01-01

    A direct method is given for solving first-order linear recurrences with constant coefficients. The limiting value of that solution is studied as "n to infinity." This classroom note could serve as enrichment material for the typical introductory course on discrete mathematics that follows a calculus course.

  16. Parallel computation for solving the tridiagonal linear system of equations

    International Nuclear Information System (INIS)

    Ishiguro, Misako; Harada, Hiroo; Fujii, Minoru; Fujimura, Toichiro; Nakamura, Yasuhiro; Nanba, Katsumi.

    1981-09-01

    Recently, applications of parallel computation for scientific calculations have increased from the need of the high speed calculation of large scale programs. At the JAERI computing center, an array processor FACOM 230-75 APU has installed to study the applicability of parallel computation for nuclear codes. We made some numerical experiments by using the APU on the methods of solution of tridiagonal linear equation which is an important problem in scientific calculations. Referring to the recent papers with parallel methods, we investigate eight ones. These are Gauss elimination method, Parallel Gauss method, Accelerated parallel Gauss method, Jacobi method, Recursive doubling method, Cyclic reduction method, Chebyshev iteration method, and Conjugate gradient method. The computing time and accuracy were compared among the methods on the basis of the numerical experiments. As the result, it is found that the Cyclic reduction method is best both in computing time and accuracy and the Gauss elimination method is the second one. (author)

  17. Chosen interval methods for solving linear interval systems with special type of matrix

    Science.gov (United States)

    Szyszka, Barbara

    2013-10-01

    The paper is devoted to chosen direct interval methods for solving linear interval systems with special type of matrix. This kind of matrix: band matrix with a parameter, from finite difference problem is obtained. Such linear systems occur while solving one dimensional wave equation (Partial Differential Equations of hyperbolic type) by using the central difference interval method of the second order. Interval methods are constructed so as the errors of method are enclosed in obtained results, therefore presented linear interval systems contain elements that determining the errors of difference method. The chosen direct algorithms have been applied for solving linear systems because they have no errors of method. All calculations were performed in floating-point interval arithmetic.

  18. Solving large-scale sparse eigenvalue problems and linear systems of equations for accelerator modeling

    International Nuclear Information System (INIS)

    Gene Golub; Kwok Ko

    2009-01-01

    The solutions of sparse eigenvalue problems and linear systems constitute one of the key computational kernels in the discretization of partial differential equations for the modeling of linear accelerators. The computational challenges faced by existing techniques for solving those sparse eigenvalue problems and linear systems call for continuing research to improve on the algorithms so that ever increasing problem size as required by the physics application can be tackled. Under the support of this award, the filter algorithm for solving large sparse eigenvalue problems was developed at Stanford to address the computational difficulties in the previous methods with the goal to enable accelerator simulations on then the world largest unclassified supercomputer at NERSC for this class of problems. Specifically, a new method, the Hemitian skew-Hemitian splitting method, was proposed and researched as an improved method for solving linear systems with non-Hermitian positive definite and semidefinite matrices.

  19. On a new iterative method for solving linear systems and comparison results

    Science.gov (United States)

    Jing, Yan-Fei; Huang, Ting-Zhu

    2008-10-01

    In Ujevic [A new iterative method for solving linear systems, Appl. Math. Comput. 179 (2006) 725-730], the author obtained a new iterative method for solving linear systems, which can be considered as a modification of the Gauss-Seidel method. In this paper, we show that this is a special case from a point of view of projection techniques. And a different approach is established, which is both theoretically and numerically proven to be better than (at least the same as) Ujevic's. As the presented numerical examples show, in most cases, the convergence rate is more than one and a half that of Ujevic.

  20. More on Generalizations and Modifications of Iterative Methods for Solving Large Sparse Indefinite Linear Systems

    Directory of Open Access Journals (Sweden)

    Jen-Yuan Chen

    2014-01-01

    Full Text Available Continuing from the works of Li et al. (2014, Li (2007, and Kincaid et al. (2000, we present more generalizations and modifications of iterative methods for solving large sparse symmetric and nonsymmetric indefinite systems of linear equations. We discuss a variety of iterative methods such as GMRES, MGMRES, MINRES, LQ-MINRES, QR MINRES, MMINRES, MGRES, and others.

  1. Solving linear systems in FLICA-4, thermohydraulic code for 3-D transient computations

    International Nuclear Information System (INIS)

    Allaire, G.

    1995-01-01

    FLICA-4 is a computer code, developed at the CEA (France), devoted to steady state and transient thermal-hydraulic analysis of nuclear reactor cores, for small size problems (around 100 mesh cells) as well as for large ones (more than 100000), on, either standard workstations or vector super-computers. As for time implicit codes, the largest time and memory consuming part of FLICA-4 is the routine dedicated to solve the linear system (the size of which is of the order of the number of cells). Therefore, the efficiency of the code is crucially influenced by the optimization of the algorithms used in assembling and solving linear systems: direct methods as the Gauss (or LU) decomposition for moderate size problems, iterative methods as the preconditioned conjugate gradient for large problems. 6 figs., 13 refs

  2. Projective-Dual Method for Solving Systems of Linear Equations with Nonnegative Variables

    Science.gov (United States)

    Ganin, B. V.; Golikov, A. I.; Evtushenko, Yu. G.

    2018-02-01

    In order to solve an underdetermined system of linear equations with nonnegative variables, the projection of a given point onto its solutions set is sought. The dual of this problem—the problem of unconstrained maximization of a piecewise-quadratic function—is solved by Newton's method. The problem of unconstrained optimization dual of the regularized problem of finding the projection onto the solution set of the system is considered. A connection of duality theory and Newton's method with some known algorithms of projecting onto a standard simplex is shown. On the example of taking into account the specifics of the constraints of the transport linear programming problem, the possibility to increase the efficiency of calculating the generalized Hessian matrix is demonstrated. Some examples of numerical calculations using MATLAB are presented.

  3. Using a grid platform for solving large sparse linear systems over GF(2)

    OpenAIRE

    Kleinjung , Thorsten; Nussbaum , Lucas; Thomé , Emmanuel

    2010-01-01

    International audience; In Fall 2009, the final step of the factorization of rsa768 was carried out on several clusters of the Grid'5000 platform, leading to a new record in integer factorization. This step involves solving a huge sparse linear system defined over the binary field GF(2). This article aims at describing the algorithm used, the difficulties encountered, and the methodology which led to success. In particular, we illustrate how our use of the block Wiedemann algorithm led to a m...

  4. Solving Linear Differential Equations

    NARCIS (Netherlands)

    Nguyen, K.A.; Put, M. van der

    2010-01-01

    The theme of this paper is to 'solve' an absolutely irreducible differential module explicitly in terms of modules of lower dimension and finite extensions of the differential field K. Representations of semi-simple Lie algebras and differential Galo is theory are the main tools. The results extend

  5. Development and adjustment of programs for solving systems of linear equations

    International Nuclear Information System (INIS)

    Fujimura, Toichiro

    1978-03-01

    Programs for solving the systems of linear equations have been adjusted and developed in expanding the scientific subroutine library SSL. The principal programs adjusted are based on the congruent method, method of product form of the inverse, orthogonal method, Crout's method for sparse system, and acceleration of iterative methods. The programs developed are based on the escalator method, direct parallel residue method and block tridiagonal method for band system. Described are usage of the programs developed and their future improvement. FORTRAN lists with simple examples in tests of the programs are also given. (auth.)

  6. A new modified conjugate gradient coefficient for solving system of linear equations

    Science.gov (United States)

    Hajar, N.; ‘Aini, N.; Shapiee, N.; Abidin, Z. Z.; Khadijah, W.; Rivaie, M.; Mamat, M.

    2017-09-01

    Conjugate gradient (CG) method is an evolution of computational method in solving unconstrained optimization problems. This approach is easy to implement due to its simplicity and has been proven to be effective in solving real-life application. Although this field has received copious amount of attentions in recent years, some of the new approaches of CG algorithm cannot surpass the efficiency of the previous versions. Therefore, in this paper, a new CG coefficient which retains the sufficient descent and global convergence properties of the original CG methods is proposed. This new CG is tested on a set of test functions under exact line search. Its performance is then compared to that of some of the well-known previous CG methods based on number of iterations and CPU time. The results show that the new CG algorithm has the best efficiency amongst all the methods tested. This paper also includes an application of the new CG algorithm for solving large system of linear equations

  7. A composite step conjugate gradients squared algorithm for solving nonsymmetric linear systems

    Science.gov (United States)

    Chan, Tony; Szeto, Tedd

    1994-03-01

    We propose a new and more stable variant of the CGS method [27] for solving nonsymmetric linear systems. The method is based on squaring the Composite Step BCG method, introduced recently by Bank and Chan [1,2], which itself is a stabilized variant of BCG in that it skips over steps for which the BCG iterate is not defined and causes one kind of breakdown in BCG. By doing this, we obtain a method (Composite Step CGS or CSCGS) which not only handles the breakdowns described above, but does so with the advantages of CGS, namely, no multiplications by the transpose matrix and a faster convergence rate than BCG. Our strategy for deciding whether to skip a step does not involve any machine dependent parameters and is designed to skip near breakdowns as well as produce smoother iterates. Numerical experiments show that the new method does produce improved performance over CGS on practical problems.

  8. Solving block linear systems with low-rank off-diagonal blocks is easily parallelizable

    Energy Technology Data Exchange (ETDEWEB)

    Menkov, V. [Indiana Univ., Bloomington, IN (United States)

    1996-12-31

    An easily and efficiently parallelizable direct method is given for solving a block linear system Bx = y, where B = D + Q is the sum of a non-singular block diagonal matrix D and a matrix Q with low-rank blocks. This implicitly defines a new preconditioning method with an operation count close to the cost of calculating a matrix-vector product Qw for some w, plus at most twice the cost of calculating Qw for some w. When implemented on a parallel machine the processor utilization can be as good as that of those operations. Order estimates are given for the general case, and an implementation is compared to block SSOR preconditioning.

  9. Instructional Supports for Representational Fluency in Solving Linear Equations with Computer Algebra Systems and Paper-and-Pencil

    Science.gov (United States)

    Fonger, Nicole L.; Davis, Jon D.; Rohwer, Mary Lou

    2018-01-01

    This research addresses the issue of how to support students' representational fluency--the ability to create, move within, translate across, and derive meaning from external representations of mathematical ideas. The context of solving linear equations in a combined computer algebra system (CAS) and paper-and-pencil classroom environment is…

  10. An implicit iterative scheme for solving large systems of linear equations

    International Nuclear Information System (INIS)

    Barry, J.M.; Pollard, J.P.

    1986-12-01

    An implicit iterative scheme for the solution of large systems of linear equations arising from neutron diffusion studies is presented. The method is applied to three-dimensional reactor studies and its performance is compared with alternative iterative approaches

  11. Algorithm for solving the linear Cauchy problem for large systems of ordinary differential equations with the use of parallel computations

    Energy Technology Data Exchange (ETDEWEB)

    Moryakov, A. V., E-mail: sailor@orc.ru [National Research Centre Kurchatov Institute (Russian Federation)

    2016-12-15

    An algorithm for solving the linear Cauchy problem for large systems of ordinary differential equations is presented. The algorithm for systems of first-order differential equations is implemented in the EDELWEISS code with the possibility of parallel computations on supercomputers employing the MPI (Message Passing Interface) standard for the data exchange between parallel processes. The solution is represented by a series of orthogonal polynomials on the interval [0, 1]. The algorithm is characterized by simplicity and the possibility to solve nonlinear problems with a correction of the operator in accordance with the solution obtained in the previous iterative process.

  12. A neural network method for solving a system of linear variational inequalities

    International Nuclear Information System (INIS)

    Lan Hengyou; Cui Yishun

    2009-01-01

    In this paper, we transmute the solution for a new system of linear variational inequalities to an equilibrium point of neural networks, and by using analytic technique, some sufficient conditions are presented. Further, the estimation of the exponential convergence rates of the neural networks is investigated. The new and useful results obtained in this paper generalize and improve the corresponding results of recent works.

  13. Performance prediction of gas turbines by solving a system of non-linear equations

    Energy Technology Data Exchange (ETDEWEB)

    Kaikko, J

    1998-09-01

    This study presents a novel method for implementing the performance prediction of gas turbines from the component models. It is based on solving the non-linear set of equations that corresponds to the process equations, and the mass and energy balances for the engine. General models have been presented for determining the steady state operation of single components. Single and multiple shad arrangements have been examined with consideration also being given to heat regeneration and intercooling. Emphasis has been placed upon axial gas turbines of an industrial scale. Applying the models requires no information of the structural dimensions of the gas turbines. On comparison with the commonly applied component matching procedures, this method incorporates several advantages. The application of the models for providing results is facilitated as less attention needs to be paid to calculation sequences and routines. Solving the set of equations is based on zeroing co-ordinate functions that are directly derived from the modelling equations. Therefore, controlling the accuracy of the results is easy. This method gives more freedom for the selection of the modelling parameters since, unlike for the matching procedures, exchanging these criteria does not itself affect the algorithms. Implicit relationships between the variables are of no significance, thus increasing the freedom for the modelling equations as well. The mathematical models developed in this thesis will provide facilities to optimise the operation of any major gas turbine configuration with respect to the desired process parameters. The computational methods used in this study may also be adapted to any other modelling problems arising in industry. (orig.) 36 refs.

  14. A frequency-domain method for solving linear time delay systems with constant coefficients

    Science.gov (United States)

    Jin, Mengshi; Chen, Wei; Song, Hanwen; Xu, Jian

    2018-03-01

    In an active control system, time delay will occur due to processes such as signal acquisition and transmission, calculation, and actuation. Time delay systems are usually described by delay differential equations (DDEs). Since it is hard to obtain an analytical solution to a DDE, numerical solution is of necessity. This paper presents a frequency-domain method that uses a truncated transfer function to solve a class of DDEs. The theoretical transfer function is the sum of infinite items expressed in terms of poles and residues. The basic idea is to select the dominant poles and residues to truncate the transfer function, thus ensuring the validity of the solution while improving the efficiency of calculation. Meanwhile, the guideline of selecting these poles and residues is provided. Numerical simulations of both stable and unstable delayed systems are given to verify the proposed method, and the results are presented and analysed in detail.

  15. A comparison of iterative methods to solve complex valued linear algebraic systems

    Czech Academy of Sciences Publication Activity Database

    Axelsson, Owe; Neytcheva, M.; Ahmad, B.

    2013-01-01

    Roč. 66, č. 4 (2013), s. 811-841 ISSN 1017-1398 R&D Projects: GA MŠk ED1.1.00/02.0070 Institutional support: RVO:68145535 Keywords : linear systems * complex symmetric * real valued form * preconditioning Subject RIV: BA - General Mathematics Impact factor: 1.005, year: 2013 http://www.it.uu.se/research/publications/reports/2013-005/2013-005-nc.pdf

  16. A Discrete-Time Recurrent Neural Network for Solving Rank-Deficient Matrix Equations With an Application to Output Regulation of Linear Systems.

    Science.gov (United States)

    Liu, Tao; Huang, Jie

    2017-04-17

    This paper presents a discrete-time recurrent neural network approach to solving systems of linear equations with two features. First, the system of linear equations may not have a unique solution. Second, the system matrix is not known precisely, but a sequence of matrices that converges to the unknown system matrix exponentially is known. The problem is motivated from solving the output regulation problem for linear systems. Thus, an application of our main result leads to an online solution to the output regulation problem for linear systems.

  17. Efficient Solving of Large Non-linear Arithmetic Constraint Systems with Complex Boolean Structure

    Czech Academy of Sciences Publication Activity Database

    Fränzle, M.; Herde, C.; Teige, T.; Ratschan, Stefan; Schubert, T.

    2007-01-01

    Roč. 1, - (2007), s. 209-236 ISSN 1574-0617 Grant - others:AVACS(DE) SFB/TR 14 Institutional research plan: CEZ:AV0Z10300504 Keywords : interval-based arithmetic constraint solving * SAT modulo theories Subject RIV: BA - General Mathematics

  18. Diomres (k,m): An efficient method based on Krylov subspaces to solve big, dispersed, unsymmetrical linear systems

    Energy Technology Data Exchange (ETDEWEB)

    de la Torre Vega, E. [Instituto de Investigaciones Electricas, Cuernavaca (Mexico); Cesar Suarez Arriaga, M. [Universidad Michoacana SNH, Michoacan (Mexico)

    1995-03-01

    In geothermal simulation processes, MULKOM uses Integrated Finite Differences to solve the corresponding partial differential equations. This method requires to resolve efficiently big linear dispersed systems of non-symmetrical nature on each temporal iteration. The order of the system is usually greater than one thousand its solution could represent around 80% of CPU total calculation time. If the elapsed time solving this class of linear systems is reduced, the duration of numerical simulation decreases notably. When the matrix is big (N{ge}500) and with holes, it is inefficient to handle all the system`s elements, because it is perfectly figured out by its elements distinct of zero, quantity greatly minor than N{sup 2}. In this area, iteration methods introduce advantages with respect to gaussian elimination methods, because these last replenish matrices not having any special distribution of their non-zero elements and because they do not make use of the available solution estimations. The iterating methods of the Conjugated Gradient family, based on the subspaces of Krylov, possess the advantage of improving the convergence speed by means of preconditioning techniques. The creation of DIOMRES(k,m) method guarantees the continuous descent of the residual norm, without incurring in division by zero. This technique converges at most in N iterations if the system`s matrix is symmetrical, it does not employ too much memory to converge and updates immediately the approximation by using incomplete orthogonalization and adequate restarting. A preconditioned version of DIOMRES was applied to problems related to unsymmetrical systems with 1000 unknowns and less than five terms per equation. We found that this technique could reduce notably the time needful to find the solution without requiring memory increment. The coupling of this method to geothermal versions of MULKOM is in process.

  19. hi-class: Horndeski in the Cosmic Linear Anisotropy Solving System

    Energy Technology Data Exchange (ETDEWEB)

    Zumalacárregui, Miguel [Nordita, KHT Royal Institute of Technology and Stockholm University, Roslagstullsbacken 23, SE-106 91 Stockholm (Sweden); Bellini, Emilio [Institut de Ciènces del Cosmos, Universitat de Barcelona, IEEC-UB, Martì i Franquè 1, E-08028 Barcelona (Spain); Sawicki, Ignacy [Central European Institute for Cosmology and Fundamental Physics, Fyzikální ustáv Akademie v\\v ed \\v CR, Na Slovance 2, 182 21 Praha 8 (Czech Republic); Lesgourgues, Julien [Institut für Theoretische Teilchenphysik und Kosmologie, RWTH Aachen University, D-52056 Aachen (Germany); Ferreira, Pedro G., E-mail: miguelzuma@berkeley.edu, E-mail: emilio.bellini@physics.ox.ac.uk, E-mail: ignacy.sawicki@fzu.cz, E-mail: lesgourg@physik.rwth-aachen.de, E-mail: pedro.ferreira@physics.ox.ac.uk [Astrophysics, University of Oxford, Denys Wilkinson Building, Keble Road, Oxford OX1 3RH (United Kingdom)

    2017-08-01

    We present the public version of hi-class (www.hiclass-code.net), an extension of the Boltzmann code CLASS to a broad ensemble of modifications to general relativity. In particular, hi-class can calculate predictions for models based on Horndeski's theory, which is the most general scalar-tensor theory described by second-order equations of motion and encompasses any perfect-fluid dark energy, quintessence, Brans-Dicke, f ( R ) and covariant Galileon models. hi-class has been thoroughly tested and can be readily used to understand the impact of alternative theories of gravity on linear structure formation as well as for cosmological parameter extraction.

  20. On the Evaluation of Computational Results Obtained from Solving System of linear Equations With matlab The Dual affine Scalling interior Point

    International Nuclear Information System (INIS)

    Murfi, Hendri; Basaruddin, T.

    2001-01-01

    The interior point method for linear programming has gained extraordinary interest as an alternative to simplex method since Karmarkar presented a polynomial-time algorithm for linear programming based on interior point method. In implementation of the algorithm of this method, there are two important things that have impact heavily to performance of the algorithm; they are data structure and used method to solve linear equation system in the algorithm. This paper describes about solving linear equation system in variants of the algorithm called dual-affine scaling algorithm. Next, we evaluate experimentally results of some used methods, either direct method or iterative method. The experimental evaluation used Matlab

  1. A Chess-Like Game for Teaching Engineering Students to Solve Large System of Simultaneous Linear Equations

    Science.gov (United States)

    Nguyen, Duc T.; Mohammed, Ahmed Ali; Kadiam, Subhash

    2010-01-01

    Solving large (and sparse) system of simultaneous linear equations has been (and continues to be) a major challenging problem for many real-world engineering/science applications [1-2]. For many practical/large-scale problems, the sparse, Symmetrical and Positive Definite (SPD) system of linear equations can be conveniently represented in matrix notation as [A] {x} = {b} , where the square coefficient matrix [A] and the Right-Hand-Side (RHS) vector {b} are known. The unknown solution vector {x} can be efficiently solved by the following step-by-step procedures [1-2]: Reordering phase, Matrix Factorization phase, Forward solution phase, and Backward solution phase. In this research work, a Game-Based Learning (GBL) approach has been developed to help engineering students to understand crucial details about matrix reordering and factorization phases. A "chess-like" game has been developed and can be played by either a single player, or two players. Through this "chess-like" open-ended game, the players/learners will not only understand the key concepts involved in reordering algorithms (based on existing algorithms), but also have the opportunities to "discover new algorithms" which are better than existing algorithms. Implementing the proposed "chess-like" game for matrix reordering and factorization phases can be enhanced by FLASH [3] computer environments, where computer simulation with animated human voice, sound effects, visual/graphical/colorful displays of matrix tables, score (or monetary) awards for the best game players, etc. can all be exploited. Preliminary demonstrations of the developed GBL approach can be viewed by anyone who has access to the internet web-site [4]!

  2. Convergence of hybrid methods for solving non-linear partial ...

    African Journals Online (AJOL)

    This paper is concerned with the numerical solution and convergence analysis of non-linear partial differential equations using a hybrid method. The solution technique involves discretizing the non-linear system of PDE to obtain a corresponding non-linear system of algebraic difference equations to be solved at each time ...

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

  4. Students’ difficulties in solving linear equation problems

    Science.gov (United States)

    Wati, S.; Fitriana, L.; Mardiyana

    2018-03-01

    A linear equation is an algebra material that exists in junior high school to university. It is a very important material for students in order to learn more advanced mathematics topics. Therefore, linear equation material is essential to be mastered. However, the result of 2016 national examination in Indonesia showed that students’ achievement in solving linear equation problem was low. This fact became a background to investigate students’ difficulties in solving linear equation problems. This study used qualitative descriptive method. An individual written test on linear equation tasks was administered, followed by interviews. Twenty-one sample students of grade VIII of SMPIT Insan Kamil Karanganyar did the written test, and 6 of them were interviewed afterward. The result showed that students with high mathematics achievement donot have difficulties, students with medium mathematics achievement have factual difficulties, and students with low mathematics achievement have factual, conceptual, operational, and principle difficulties. Based on the result there is a need of meaningfulness teaching strategy to help students to overcome difficulties in solving linear equation problems.

  5. Using the Multiplicative Schwarz Alternating Algorithm (MSAA) for Solving the Large Linear System of Equations Related to Global Gravity Field Recovery up to Degree and Order 120

    Science.gov (United States)

    Safari, A.; Sharifi, M. A.; Amjadiparvar, B.

    2010-05-01

    The GRACE mission has substantiated the low-low satellite-to-satellite tracking (LL-SST) concept. The LL-SST configuration can be combined with the previously realized high-low SST concept in the CHAMP mission to provide a much higher accuracy. The line of sight (LOS) acceleration difference between the GRACE satellite pair is the mostly used observable for mapping the global gravity field of the Earth in terms of spherical harmonic coefficients. In this paper, mathematical formulae for LOS acceleration difference observations have been derived and the corresponding linear system of equations has been set up for spherical harmonic up to degree and order 120. The total number of unknowns is 14641. Such a linear equation system can be solved with iterative solvers or direct solvers. However, the runtime of direct methods or that of iterative solvers without a suitable preconditioner increases tremendously. This is the reason why we need a more sophisticated method to solve the linear system of problems with a large number of unknowns. Multiplicative variant of the Schwarz alternating algorithm is a domain decomposition method, which allows it to split the normal matrix of the system into several smaller overlaped submatrices. In each iteration step the multiplicative variant of the Schwarz alternating algorithm solves linear systems with the matrices obtained from the splitting successively. It reduces both runtime and memory requirements drastically. In this paper we propose the Multiplicative Schwarz Alternating Algorithm (MSAA) for solving the large linear system of gravity field recovery. The proposed algorithm has been tested on the International Association of Geodesy (IAG)-simulated data of the GRACE mission. The achieved results indicate the validity and efficiency of the proposed algorithm in solving the linear system of equations from accuracy and runtime points of view. Keywords: Gravity field recovery, Multiplicative Schwarz Alternating Algorithm, Low

  6. Combining the CORS and BiCORSTAB Iterative Methods with MLFMA and SAI Preconditioning for Solving Large Linear Systems in Electromagnetics

    NARCIS (Netherlands)

    Carpentieri, Bruno; Jing, Yan-Fei; Huang, Ting-Zhu; Pi, Wei-Chao; Sheng, Xin-Qing

    We report on experiments with a novel family of Krylov subspace methods for solving dense, complex, non-Hermitian systems of linear equations arising from the Galerkin discretization of surface integral equation models in Electromagnetics. By some experiments on realistic radar-cross-section

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

    African Journals Online (AJOL)

    The paper presents a new approach for solving a fractional linear programming problem in which the objective function is a linear fractional function, while the constraint functions are in the form of linear inequalities. The approach adopted is based mainly upon solving the problem algebraically using the concept of duality ...

  8. A logic circuit for solving linear function by digital method

    International Nuclear Information System (INIS)

    Ma Yonghe

    1986-01-01

    A mathematical method for determining the linear relation of physical quantity with rediation intensity is described. A logic circuit has been designed for solving linear function by digital method. Some applications and the circuit function are discussed

  9. Some Applications of Algebraic System Solving

    Science.gov (United States)

    Roanes-Lozano, Eugenio

    2011-01-01

    Technology and, in particular, computer algebra systems, allows us to change both the way we teach mathematics and the mathematical curriculum. Curiously enough, unlike what happens with linear system solving, algebraic system solving is not widely known. The aim of this paper is to show that, although the theory lying behind the "exact…

  10. An Approach for Solving Linear Fractional Programming Problems

    OpenAIRE

    Andrew Oyakhobo Odior

    2012-01-01

    Linear fractional programming problems are useful tools in production planning, financial and corporate planning, health care and hospital planning and as such have attracted considerable research interest. The paper presents a new approach for solving a fractional linear programming problem in which the objective function is a linear fractional function, while the constraint functions are in the form of linear inequalities. The approach adopted is based mainly upon solving the problem algebr...

  11. Solving linear inequalities in a least squares sense

    Energy Technology Data Exchange (ETDEWEB)

    Bramley, R.; Winnicka, B. [Indiana Univ., Bloomington, IN (United States)

    1994-12-31

    Let A {element_of} {Re}{sup mxn} be an arbitrary real matrix, and let b {element_of} {Re}{sup m} a given vector. A familiar problem in computational linear algebra is to solve the system Ax = b in a least squares sense; that is, to find an x* minimizing {parallel}Ax {minus} b{parallel}, where {parallel} {center_dot} {parallel} refers to the vector two-norm. Such an x* solves the normal equations A{sup T}(Ax {minus} b) = 0, and the optimal residual r* = b {minus} Ax* is unique (although x* need not be). The least squares problem is usually interpreted as corresponding to multiple observations, represented by the rows of A and b, on a vector of data x. The observations may be inconsistent, and in this case a solution is sought that minimizes the norm of the residuals. A less familiar problem to numerical linear algebraists is the solution of systems of linear inequalities Ax {le} b in a least squares sense, but the motivation is similar: if a set of observations places upper or lower bounds on linear combinations of variables, the authors want to find x* minimizing {parallel} (Ax {minus} b){sub +} {parallel}, where the i{sup th} component of the vector v{sub +} is the maximum of zero and the i{sup th} component of v.

  12. Fuzzy linear programming approach for solving transportation

    Indian Academy of Sciences (India)

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

  13. Computing Low-Rank Approximation of a Dense Matrix on Multicore CPUs with a GPU and Its Application to Solving a Hierarchically Semiseparable Linear System of Equations

    Directory of Open Access Journals (Sweden)

    Ichitaro Yamazaki

    2015-01-01

    of their low-rank properties. To compute a low-rank approximation of a dense matrix, in this paper, we study the performance of QR factorization with column pivoting or with restricted pivoting on multicore CPUs with a GPU. We first propose several techniques to reduce the postprocessing time, which is required for restricted pivoting, on a modern CPU. We then examine the potential of using a GPU to accelerate the factorization process with both column and restricted pivoting. Our performance results on two eight-core Intel Sandy Bridge CPUs with one NVIDIA Kepler GPU demonstrate that using the GPU, the factorization time can be reduced by a factor of more than two. In addition, to study the performance of our implementations in practice, we integrate them into a recently developed software StruMF which algebraically exploits such low-rank structures for solving a general sparse linear system of equations. Our performance results for solving Poisson's equations demonstrate that the proposed techniques can significantly reduce the preconditioner construction time of StruMF on the CPUs, and the construction time can be further reduced by 10%–50% using the GPU.

  14. Students' errors in solving linear equation word problems: Case ...

    African Journals Online (AJOL)

    The study examined errors students make in solving linear equation word problems with a view to expose the nature of these errors and to make suggestions for classroom teaching. A diagnostic test comprising 10 linear equation word problems, was administered to a sample (n=130) of senior high school first year Home ...

  15. Planning under uncertainty solving large-scale stochastic linear programs

    Energy Technology Data Exchange (ETDEWEB)

    Infanger, G. [Stanford Univ., CA (United States). Dept. of Operations Research]|[Technische Univ., Vienna (Austria). Inst. fuer Energiewirtschaft

    1992-12-01

    For many practical problems, solutions obtained from deterministic models are unsatisfactory because they fail to hedge against certain contingencies that may occur in the future. Stochastic models address this shortcoming, but up to recently seemed to be intractable due to their size. Recent advances both in solution algorithms and in computer technology now allow us to solve important and general classes of practical stochastic problems. We show how large-scale stochastic linear programs can be efficiently solved by combining classical decomposition and Monte Carlo (importance) sampling techniques. We discuss the methodology for solving two-stage stochastic linear programs with recourse, present numerical results of large problems with numerous stochastic parameters, show how to efficiently implement the methodology on a parallel multi-computer and derive the theory for solving a general class of multi-stage problems with dependency of the stochastic parameters within a stage and between different stages.

  16. Approximate Method for Solving the Linear Fuzzy Delay Differential Equations

    Directory of Open Access Journals (Sweden)

    S. Narayanamoorthy

    2015-01-01

    Full Text Available We propose an algorithm of the approximate method to solve linear fuzzy delay differential equations using Adomian decomposition method. The detailed algorithm of the approach is provided. The approximate solution is compared with the exact solution to confirm the validity and efficiency of the method to handle linear fuzzy delay differential equation. To show this proper features of this proposed method, numerical example is illustrated.

  17. Insights into the School Mathematics Tradition from Solving Linear Equations

    Science.gov (United States)

    Buchbinder, Orly; Chazan, Daniel; Fleming, Elizabeth

    2015-01-01

    In this article, we explore how the solving of linear equations is represented in English­-language algebra text books from the early nineteenth century when schooling was becoming institutionalized, and then survey contemporary teachers. In the text books, we identify the increasing presence of a prescribed order of steps (a canonical method) for…

  18. Students' errors in solving linear equation word problems: Case ...

    African Journals Online (AJOL)

    kofi.mereku

    Development in most areas of life is based on effective knowledge of science and ... Problem solving, as used in mathematics education literature, refers ... word problems, on the other hand, are those linear equation tasks or ... taught LEWPs in the junior high school, many of them reach the senior high school without a.

  19. Non linear system become linear system

    Directory of Open Access Journals (Sweden)

    Petre Bucur

    2007-01-01

    Full Text Available The present paper refers to the theory and the practice of the systems regarding non-linear systems and their applications. We aimed the integration of these systems to elaborate their response as well as to highlight some outstanding features.

  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. Numerical method for solving linear Fredholm fuzzy integral equations of the second kind

    Energy Technology Data Exchange (ETDEWEB)

    Abbasbandy, S. [Department of Mathematics, Imam Khomeini International University, P.O. Box 288, Ghazvin 34194 (Iran, Islamic Republic of)]. E-mail: saeid@abbasbandy.com; Babolian, E. [Faculty of Mathematical Sciences and Computer Engineering, Teacher Training University, Tehran 15618 (Iran, Islamic Republic of); Alavi, M. [Department of Mathematics, Arak Branch, Islamic Azad University, Arak 38135 (Iran, Islamic Republic of)

    2007-01-15

    In this paper we use parametric form of fuzzy number and convert a linear fuzzy Fredholm integral equation to two linear system of integral equation of the second kind in crisp case. We can use one of the numerical method such as Nystrom and find the approximation solution of the system and hence obtain an approximation for fuzzy solution of the linear fuzzy Fredholm integral equations of the second kind. The proposed method is illustrated by solving some numerical examples.

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

  3. Mathematics Literacy of Secondary Students in Solving Simultanenous Linear Equations

    Science.gov (United States)

    Sitompul, R. S. I.; Budayasa, I. K.; Masriyah

    2018-01-01

    This study examines the profile of secondary students’ mathematical literacy in solving simultanenous linear equations problems in terms of cognitive style of visualizer and verbalizer. This research is a descriptive research with qualitative approach. The subjects in this research consist of one student with cognitive style of visualizer and one student with cognitive style of verbalizer. The main instrument in this research is the researcher herself and supporting instruments are cognitive style tests, mathematics skills tests, problem-solving tests and interview guidelines. Research was begun by determining the cognitive style test and mathematics skill test. The subjects chosen were given problem-solving test about simultaneous linear equations and continued with interview. To ensure the validity of the data, the researcher conducted data triangulation; the steps of data reduction, data presentation, data interpretation, and conclusion drawing. The results show that there is a similarity of visualizer and verbalizer-cognitive style in identifying and understanding the mathematical structure in the process of formulating. There are differences in how to represent problems in the process of implementing, there are differences in designing strategies and in the process of interpreting, and there are differences in explaining the logical reasons.

  4. Confluent-Functional solving systems

    Directory of Open Access Journals (Sweden)

    V.N. Koval

    2001-08-01

    Full Text Available The paper proposes a statistical knowledge-acquision approach. The solving systems are considered, which are able to find unknown structural dependences between situational and transforming variables on the basis of statistically analyzed input information. Situational variables describe features, states and relations between environment objects. Transforming variables describe transforming influences, exerted by a goal-oriented system onto an environment. Unknown environment rules are simulated by a structural equations system, associating situational and transforming variables.

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

  6. Solving large mixed linear models using preconditioned conjugate gradient iteration.

    Science.gov (United States)

    Strandén, I; Lidauer, M

    1999-12-01

    Continuous evaluation of dairy cattle with a random regression test-day model requires a fast solving method and algorithm. A new computing technique feasible in Jacobi and conjugate gradient based iterative methods using iteration on data is presented. In the new computing technique, the calculations in multiplication of a vector by a matrix were recorded to three steps instead of the commonly used two steps. The three-step method was implemented in a general mixed linear model program that used preconditioned conjugate gradient iteration. Performance of this program in comparison to other general solving programs was assessed via estimation of breeding values using univariate, multivariate, and random regression test-day models. Central processing unit time per iteration with the new three-step technique was, at best, one-third that needed with the old technique. Performance was best with the test-day model, which was the largest and most complex model used. The new program did well in comparison to other general software. Programs keeping the mixed model equations in random access memory required at least 20 and 435% more time to solve the univariate and multivariate animal models, respectively. Computations of the second best iteration on data took approximately three and five times longer for the animal and test-day models, respectively, than did the new program. Good performance was due to fast computing time per iteration and quick convergence to the final solutions. Use of preconditioned conjugate gradient based methods in solving large breeding value problems is supported by our findings.

  7. Linear system theory

    Science.gov (United States)

    Callier, Frank M.; Desoer, Charles A.

    1991-01-01

    The aim of this book is to provide a systematic and rigorous access to the main topics of linear state-space system theory in both the continuous-time case and the discrete-time case; and the I/O description of linear systems. The main thrusts of the work are the analysis of system descriptions and derivations of their properties, LQ-optimal control, state feedback and state estimation, and MIMO unity-feedback systems.

  8. Fast Solvers for Dense Linear Systems

    Energy Technology Data Exchange (ETDEWEB)

    Kauers, Manuel [Research Institute for Symbolic Computation (RISC), Altenbergerstrasse 69, A4040 Linz (Austria)

    2008-10-15

    It appears that large scale calculations in particle physics often require to solve systems of linear equations with rational number coefficients exactly. If classical Gaussian elimination is applied to a dense system, the time needed to solve such a system grows exponentially in the size of the system. In this tutorial paper, we present a standard technique from computer algebra that avoids this exponential growth: homomorphic images. Using this technique, big dense linear systems can be solved in a much more reasonable time than using Gaussian elimination over the rationals.

  9. High-order quantum algorithm for solving linear differential equations

    International Nuclear Information System (INIS)

    Berry, Dominic W

    2014-01-01

    Linear differential equations are ubiquitous in science and engineering. Quantum computers can simulate quantum systems, which are described by a restricted type of linear differential equations. Here we extend quantum simulation algorithms to general inhomogeneous sparse linear differential equations, which describe many classical physical systems. We examine the use of high-order methods (where the error over a time step is a high power of the size of the time step) to improve the efficiency. These provide scaling close to Δt 2 in the evolution time Δt. As with other algorithms of this type, the solution is encoded in amplitudes of the quantum state, and it is possible to extract global features of the solution. (paper)

  10. The H-N method for solving linear transport equation: theory and application

    International Nuclear Information System (INIS)

    Kaskas, A.; Gulecyuz, M.C.; Tezcan, C.

    2002-01-01

    The system of singular integral equation which is obtained from the integro-differential form of the linear transport equation as a result of Placzec lemma is solved. Application are given using the exit distributions and the infinite medium Green's function. The same theoretical results are also obtained with the use of the singular eigenfunction of the method of elementary solutions

  11. Numerical solution of large sparse linear systems

    International Nuclear Information System (INIS)

    Meurant, Gerard; Golub, Gene.

    1982-02-01

    This note is based on one of the lectures given at the 1980 CEA-EDF-INRIA Numerical Analysis Summer School whose aim is the study of large sparse linear systems. The main topics are solving least squares problems by orthogonal transformation, fast Poisson solvers and solution of sparse linear system by iterative methods with a special emphasis on preconditioned conjuguate gradient method [fr

  12. Systems of Inhomogeneous Linear Equations

    Science.gov (United States)

    Scherer, Philipp O. J.

    Many problems in physics and especially computational physics involve systems of linear equations which arise e.g. from linearization of a general nonlinear problem or from discretization of differential equations. If the dimension of the system is not too large standard methods like Gaussian elimination or QR decomposition are sufficient. Systems with a tridiagonal matrix are important for cubic spline interpolation and numerical second derivatives. They can be solved very efficiently with a specialized Gaussian elimination method. Practical applications often involve very large dimensions and require iterative methods. Convergence of Jacobi and Gauss-Seidel methods is slow and can be improved by relaxation or over-relaxation. An alternative for large systems is the method of conjugate gradients.

  13. Matrix form of Legendre polynomials for solving linear integro-differential equations of high order

    Science.gov (United States)

    Kammuji, M.; Eshkuvatov, Z. K.; Yunus, Arif A. M.

    2017-04-01

    This paper presents an effective approximate solution of high order of Fredholm-Volterra integro-differential equations (FVIDEs) with boundary condition. Legendre truncated series is used as a basis functions to estimate the unknown function. Matrix operation of Legendre polynomials is used to transform FVIDEs with boundary conditions into matrix equation of Fredholm-Volterra type. Gauss Legendre quadrature formula and collocation method are applied to transfer the matrix equation into system of linear algebraic equations. The latter equation is solved by Gauss elimination method. The accuracy and validity of this method are discussed by solving two numerical examples and comparisons with wavelet and methods.

  14. ITMETH, Iterative Routines for Linear System

    International Nuclear Information System (INIS)

    Greenbaum, A.

    1989-01-01

    1 - Description of program or function: ITMETH is a collection of iterative routines for solving large, sparse linear systems. 2 - Method of solution: ITMETH solves general linear systems of the form AX=B using a variety of methods: Jacobi iteration; Gauss-Seidel iteration; incomplete LU decomposition or matrix splitting with iterative refinement; diagonal scaling, matrix splitting, or incomplete LU decomposition with the conjugate gradient method for the problem AA'Y=B, X=A'Y; bi-conjugate gradient method with diagonal scaling, matrix splitting, or incomplete LU decomposition; and ortho-min method with diagonal scaling, matrix splitting, or incomplete LU decomposition. ITMETH also solves symmetric positive definite linear systems AX=B using the conjugate gradient method with diagonal scaling or matrix splitting, or the incomplete Cholesky conjugate gradient method

  15. Solving the linear inviscid shallow water equations in one dimension, with variable depth, using a recursion formula

    International Nuclear Information System (INIS)

    Hernandez-Walls, R; Martín-Atienza, B; Salinas-Matus, M; Castillo, J

    2017-01-01

    When solving the linear inviscid shallow water equations with variable depth in one dimension using finite differences, a tridiagonal system of equations must be solved. Here we present an approach, which is more efficient than the commonly used numerical method, to solve this tridiagonal system of equations using a recursion formula. We illustrate this approach with an example in which we solve for a rectangular channel to find the resonance modes. Our numerical solution agrees very well with the analytical solution. This new method is easy to use and understand by undergraduate students, so it can be implemented in undergraduate courses such as Numerical Methods, Lineal Algebra or Differential Equations. (paper)

  16. Solving the linear inviscid shallow water equations in one dimension, with variable depth, using a recursion formula

    Science.gov (United States)

    Hernandez-Walls, R.; Martín-Atienza, B.; Salinas-Matus, M.; Castillo, J.

    2017-11-01

    When solving the linear inviscid shallow water equations with variable depth in one dimension using finite differences, a tridiagonal system of equations must be solved. Here we present an approach, which is more efficient than the commonly used numerical method, to solve this tridiagonal system of equations using a recursion formula. We illustrate this approach with an example in which we solve for a rectangular channel to find the resonance modes. Our numerical solution agrees very well with the analytical solution. This new method is easy to use and understand by undergraduate students, so it can be implemented in undergraduate courses such as Numerical Methods, Lineal Algebra or Differential Equations.

  17. Linear System of Equations, Matrix Inversion, and Linear Programming Using MS Excel

    Science.gov (United States)

    El-Gebeily, M.; Yushau, B.

    2008-01-01

    In this note, we demonstrate with illustrations two different ways that MS Excel can be used to solve Linear Systems of Equation, Linear Programming Problems, and Matrix Inversion Problems. The advantage of using MS Excel is its availability and transparency (the user is responsible for most of the details of how a problem is solved). Further, we…

  18. Ten-Year-Old Students Solving Linear Equations

    Science.gov (United States)

    Brizuela, Barbara; Schliemann, Analucia

    2004-01-01

    In this article, the authors seek to re-conceptualize the perspective regarding students' difficulties with algebra. While acknowledging that students "do" have difficulties when learning algebra, they also argue that the generally espoused criteria for algebra as the ability to work with the syntactical rules for solving equations is…

  19. Clock Math — a System for Solving SLEs Exactly

    Directory of Open Access Journals (Sweden)

    Jakub Hladík

    2013-01-01

    Full Text Available In this paper, we present a GPU-accelerated hybrid system that solves ill-conditioned systems of linear equations exactly. Exactly means without rounding errors due to using integer arithmetics. First, we scale floating-point numbers up to integers, then we solve dozens of SLEs within different modular arithmetics and then we assemble sub-solutions back using the Chinese remainder theorem. This approach effectively bypasses current CPU floating-point limitations. The system is capable of solving Hilbert’s matrix without losing a single bit of precision, and with a significant speedup compared to existing CPU solvers.

  20. A Smoothing-Type Algorithm for Solving Linear Complementarity Problems with Strong Convergence Properties

    International Nuclear Information System (INIS)

    Huang Zhenghai; Gu Weizhe

    2008-01-01

    In this paper, we construct an augmented system of the standard monotone linear complementarity problem (LCP), and establish the relations between the augmented system and the LCP. We present a smoothing-type algorithm for solving the augmented system. The algorithm is shown to be globally convergent without assuming any prior knowledge of feasibility/infeasibility of the problem. In particular, if the LCP has a solution, then the algorithm either generates a maximal complementary solution of the LCP or detects correctly solvability of the LCP, and in the latter case, an existing smoothing-type algorithm can be directly applied to solve the LCP without any additional assumption and it generates a maximal complementary solution of the LCP; and that if the LCP is infeasible, then the algorithm detect correctly infeasibility of the LCP. To the best of our knowledge, such properties have not appeared in the existing literature for smoothing-type algorithms

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

  2. A program package for solving linear optimization problems

    International Nuclear Information System (INIS)

    Horikami, Kunihiko; Fujimura, Toichiro; Nakahara, Yasuaki

    1980-09-01

    Seven computer programs for the solution of linear, integer and quadratic programming (four programs for linear programming, one for integer programming and two for quadratic programming) have been prepared and tested on FACOM M200 computer, and auxiliary programs have been written to make it easy to use the optimization program package. The characteristics of each program are explained and the detailed input/output descriptions are given in order to let users know how to use them. (author)

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

  4. A parallel algorithm for solving linear equations arising from one-dimensional network problems

    International Nuclear Information System (INIS)

    Mesina, G.L.

    1991-01-01

    One-dimensional (1-D) network problems, such as those arising from 1- D fluid simulations and electrical circuitry, produce systems of sparse linear equations which are nearly tridiagonal and contain a few non-zero entries outside the tridiagonal. Most direct solution techniques for such problems either do not take advantage of the special structure of the matrix or do not fully utilize parallel computer architectures. We describe a new parallel direct linear equation solution algorithm, called TRBR, which is especially designed to take advantage of this structure on MIMD shared memory machines. The new method belongs to a family of methods which split the coefficient matrix into the sum of a tridiagonal matrix T and a matrix comprised of the remaining coefficients R. Efficient tridiagonal methods are used to algebraically simplify the linear system. A smaller auxiliary subsystem is created and solved and its solution is used to calculate the solution of the original system. The newly devised BR method solves the subsystem. The serial and parallel operation counts are given for the new method and related earlier methods. TRBR is shown to have the smallest operation count in this class of direct methods. Numerical results are given. Although the algorithm is designed for one-dimensional networks, it has been applied successfully to three-dimensional problems as well. 20 refs., 2 figs., 4 tabs

  5. Solving Conic Systems via Projection and Rescaling

    OpenAIRE

    Pena, Javier; Soheili, Negar

    2015-01-01

    We propose a simple projection and rescaling algorithm to solve the feasibility problem \\[ \\text{ find } x \\in L \\cap \\Omega, \\] where $L$ and $\\Omega$ are respectively a linear subspace and the interior of a symmetric cone in a finite-dimensional vector space $V$. This projection and rescaling algorithm is inspired by previous work on rescaled versions of the perceptron algorithm and by Chubanov's projection-based method for linear feasibility problems. As in these predecessors, each main it...

  6. Uzawa method for fuzzy linear system

    OpenAIRE

    Ke Wang

    2013-01-01

    An Uzawa method is presented for solving fuzzy linear systems whose coefficient matrix is crisp and the right-hand side column is arbitrary fuzzy number vector. The explicit iterative scheme is given. The convergence is analyzed with convergence theorems and the optimal parameter is obtained. Numerical examples are given to illustrate the procedure and show the effectiveness and efficiency of the method.

  7. The intelligence of dual simplex method to solve linear fractional fuzzy transportation problem.

    Science.gov (United States)

    Narayanamoorthy, S; Kalyani, S

    2015-01-01

    An approach is presented to solve a fuzzy transportation problem with linear fractional fuzzy objective function. In this proposed approach the fractional fuzzy transportation problem is decomposed into two linear fuzzy transportation problems. The optimal solution of the two linear fuzzy transportations is solved by dual simplex method and the optimal solution of the fractional fuzzy transportation problem is obtained. The proposed method is explained in detail with an example.

  8. The Intelligence of Dual Simplex Method to Solve Linear Fractional Fuzzy Transportation Problem

    Directory of Open Access Journals (Sweden)

    S. Narayanamoorthy

    2015-01-01

    Full Text Available An approach is presented to solve a fuzzy transportation problem with linear fractional fuzzy objective function. In this proposed approach the fractional fuzzy transportation problem is decomposed into two linear fuzzy transportation problems. The optimal solution of the two linear fuzzy transportations is solved by dual simplex method and the optimal solution of the fractional fuzzy transportation problem is obtained. The proposed method is explained in detail with an example.

  9. Linearly Ordered Attribute Grammar Scheduling Using SAT-Solving

    NARCIS (Netherlands)

    Bransen, Jeroen; van Binsbergen, L.Thomas; Claessen, Koen; Dijkstra, Atze

    2015-01-01

    Many computations over trees can be specified using attribute grammars. Compilers for attribute grammars need to find an evaluation order (or schedule) in order to generate efficient code. For the class of linearly ordered attribute grammars such a schedule can be found statically, but this problem

  10. Preconditioned Iterative Methods for Solving Weighted Linear Least Squares Problems

    Czech Academy of Sciences Publication Activity Database

    Bru, R.; Marín, J.; Mas, J.; Tůma, Miroslav

    2014-01-01

    Roč. 36, č. 4 (2014), A2002-A2022 ISSN 1064-8275 Institutional support: RVO:67985807 Keywords : preconditioned iterative methods * incomplete decompositions * approximate inverses * linear least squares Subject RIV: BA - General Mathematics Impact factor: 1.854, year: 2014

  11. Hybrid Method for Solving Inventory Problems with a Linear ...

    African Journals Online (AJOL)

    Osagiede and Omosigho (2004) proposed a direct search method for identifying the number of replenishment when the demand pattern is linearly increasing. The main computational task in this direct search method was associated with finding the optimal number of replenishments. To accelerate the use of this method, the ...

  12. Operational matrices with respect to Hermite polynomials and their applications in solving linear dierential equations with variable coecients

    Directory of Open Access Journals (Sweden)

    A. Aminataei

    2014-05-01

    Full Text Available In this paper, a new and ecient approach is applied for numerical approximation of the linear dierential equations with variable coecients based on operational matrices with respect to Hermite polynomials. Explicit formulae which express the Hermite expansioncoecients for the moments of derivatives of any dierentiable function in terms of the original expansion coecients of the function itself are given in the matrix form. The mainimportance of this scheme is that using this approach reduces solving the linear dierentialequations to solve a system of linear algebraic equations, thus greatly simplifying the problem. In addition, two experiments are given to demonstrate the validity and applicability of the method

  13. Linearization of the Lorenz system

    International Nuclear Information System (INIS)

    Li, Chunbiao; Sprott, Julien Clinton; Thio, Wesley

    2015-01-01

    A partial and complete piecewise linearized version of the Lorenz system is proposed. The linearized versions have an independent total amplitude control parameter. Additional further linearization leads naturally to a piecewise linear version of the diffusionless Lorenz system. A chaotic circuit with a single amplitude controller is then implemented using a new switch element, producing a chaotic oscillation that agrees with the numerical calculation for the piecewise linear diffusionless Lorenz system. - Highlights: • A partial and complete piecewise linearized version of the Lorenz system are addressed. • The linearized versions have an independent total amplitude control parameter. • A piecewise linear version of the diffusionless Lorenz system is derived by further linearization. • A corresponding chaotic circuit without any multiplier is implemented for the chaotic oscillation

  14. Linearization of the Lorenz system

    Energy Technology Data Exchange (ETDEWEB)

    Li, Chunbiao, E-mail: goontry@126.com [School of Electronic & Information Engineering, Nanjing University of Information Science & Technology, Nanjing 210044 (China); Engineering Technology Research and Development Center of Jiangsu Circulation Modernization Sensor Network, Jiangsu Institute of Commerce, Nanjing 211168 (China); Sprott, Julien Clinton [Department of Physics, University of Wisconsin–Madison, Madison, WI 53706 (United States); Thio, Wesley [Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH 43210 (United States)

    2015-05-08

    A partial and complete piecewise linearized version of the Lorenz system is proposed. The linearized versions have an independent total amplitude control parameter. Additional further linearization leads naturally to a piecewise linear version of the diffusionless Lorenz system. A chaotic circuit with a single amplitude controller is then implemented using a new switch element, producing a chaotic oscillation that agrees with the numerical calculation for the piecewise linear diffusionless Lorenz system. - Highlights: • A partial and complete piecewise linearized version of the Lorenz system are addressed. • The linearized versions have an independent total amplitude control parameter. • A piecewise linear version of the diffusionless Lorenz system is derived by further linearization. • A corresponding chaotic circuit without any multiplier is implemented for the chaotic oscillation.

  15. ADM For Solving Linear Second-Order Fredholm Integro-Differential Equations

    Science.gov (United States)

    Karim, Mohd F.; Mohamad, Mahathir; Saifullah Rusiman, Mohd; Che-Him, Norziha; Roslan, Rozaini; Khalid, Kamil

    2018-04-01

    In this paper, we apply Adomian Decomposition Method (ADM) as numerically analyse linear second-order Fredholm Integro-differential Equations. The approximate solutions of the problems are calculated by Maple package. Some numerical examples have been considered to illustrate the ADM for solving this equation. The results are compared with the existing exact solution. Thus, the Adomian decomposition method can be the best alternative method for solving linear second-order Fredholm Integro-Differential equation. It converges to the exact solution quickly and in the same time reduces computational work for solving the equation. The result obtained by ADM shows the ability and efficiency for solving these equations.

  16. Analysis of the efficiency of the linearization techniques for solving multi-objective linear fractional programming problems by goal programming

    Directory of Open Access Journals (Sweden)

    Tunjo Perić

    2017-01-01

    Full Text Available This paper presents and analyzes the applicability of three linearization techniques used for solving multi-objective linear fractional programming problems using the goal programming method. The three linearization techniques are: (1 Taylor’s polynomial linearization approximation, (2 the method of variable change, and (3 a modification of the method of variable change proposed in [20]. All three linearization techniques are presented and analyzed in two variants: (a using the optimal value of the objective functions as the decision makers’ aspirations, and (b the decision makers’ aspirations are given by the decision makers. As the criteria for the analysis we use the efficiency of the obtained solutions and the difficulties the analyst comes upon in preparing the linearization models. To analyze the applicability of the linearization techniques incorporated in the linear goal programming method we use an example of a financial structure optimization problem.

  17. Correlated Levy Noise in Linear Dynamical Systems

    International Nuclear Information System (INIS)

    Srokowski, T.

    2011-01-01

    Linear dynamical systems, driven by a non-white noise which has the Levy distribution, are analysed. Noise is modelled by a specific stochastic process which is defined by the Langevin equation with a linear force and the Levy distributed symmetric white noise. Correlation properties of the process are discussed. The Fokker-Planck equation driven by that noise is solved. Distributions have the Levy shape and their width, for a given time, is smaller than for processes in the white noise limit. Applicability of the adiabatic approximation in the case of the linear force is discussed. (author)

  18. Dynamical systems and linear algebra

    OpenAIRE

    Colonius, Fritz (Prof.)

    2007-01-01

    Dynamical systems and linear algebra / F. Colonius, W. Kliemann. - In: Handbook of linear algebra / ed. by Leslie Hogben. - Boca Raton : Chapman & Hall/CRC, 2007. - S. 56,1-56,22. - (Discrete mathematics and its applications)

  19. Solving or resolving inadequate and noisy tomographic systems

    NARCIS (Netherlands)

    Nolet, G.

    1985-01-01

    Tomography in seismology often leads to underdetermined and inconsistent systems of linear equations. When solving, care must be taken to keep the propagation of data errors under control. In this paper I test the applicability of three types of damped least-squares algorithms to the kind of

  20. Problem solving using soft systems methodology.

    Science.gov (United States)

    Land, L

    This article outlines a method of problem solving which considers holistic solutions to complex problems. Soft systems methodology allows people involved in the problem situation to have control over the decision-making process.

  1. Optimal Homotopy Asymptotic Method for Solving the Linear Fredholm Integral Equations of the First Kind

    Directory of Open Access Journals (Sweden)

    Mohammad Almousa

    2013-01-01

    Full Text Available The aim of this study is to present the use of a semi analytical method called the optimal homotopy asymptotic method (OHAM for solving the linear Fredholm integral equations of the first kind. Three examples are discussed to show the ability of the method to solve the linear Fredholm integral equations of the first kind. The results indicated that the method is very effective and simple.

  2. Solving polynomial differential equations by transforming them to linear functional-differential equations

    OpenAIRE

    Nahay, John Michael

    2008-01-01

    We present a new approach to solving polynomial ordinary differential equations by transforming them to linear functional equations and then solving the linear functional equations. We will focus most of our attention upon the first-order Abel differential equation with two nonlinear terms in order to demonstrate in as much detail as possible the computations necessary for a complete solution. We mention in our section on further developments that the basic transformation idea can be generali...

  3. Solving Linear Equations by Classical Jacobi-SR Based Hybrid Evolutionary Algorithm with Uniform Adaptation Technique

    OpenAIRE

    Jamali, R. M. Jalal Uddin; Hashem, M. M. A.; Hasan, M. Mahfuz; Rahman, Md. Bazlar

    2013-01-01

    Solving a set of simultaneous linear equations is probably the most important topic in numerical methods. For solving linear equations, iterative methods are preferred over the direct methods especially when the coefficient matrix is sparse. The rate of convergence of iteration method is increased by using Successive Relaxation (SR) technique. But SR technique is very much sensitive to relaxation factor, {\\omega}. Recently, hybridization of classical Gauss-Seidel based successive relaxation t...

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

    Directory of Open Access Journals (Sweden)

    Tunjo Perić

    2014-12-01

    Full Text Available This paper presents a modification of Pal, Moitra and Maulik's goal programming procedure for fuzzy multiobjective linear fractional programming problem solving. The proposed modification of the method allows simpler solving of economic multiple objective fractional linear programming (MOFLP problems, enabling the obtained solutions to express the preferences of the decision maker defined by the objective function weights. The proposed method is tested on the production planning example.

  5. Solving the Linear 1D Thermoelasticity Equations with Pure Delay

    Directory of Open Access Journals (Sweden)

    Denys Ya. Khusainov

    2015-01-01

    Full Text Available We propose a system of partial differential equations with a single constant delay τ>0 describing the behavior of a one-dimensional thermoelastic solid occupying a bounded interval of R1. For an initial-boundary value problem associated with this system, we prove a well-posedness result in a certain topology under appropriate regularity conditions on the data. Further, we show the solution of our delayed model to converge to the solution of the classical equations of thermoelasticity as τ→0. Finally, we deduce an explicit solution representation for the delay problem.

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

    OpenAIRE

    M. ZANGIABADI; H. R. MALEKI

    2007-01-01

    In the real-world optimization problems, coefficients of the objective function are not known precisely and can be interpreted as fuzzy numbers. In this paper we define the concepts of optimality for linear programming problems with fuzzy parameters based on those for multiobjective linear programming problems. Then by using the concept of comparison of fuzzy numbers, we transform a linear programming problem with fuzzy parameters to a multiobjective linear programming problem. To this end, w...

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

  8. Solving non-linear Horn clauses using a linear Horn clause solver

    DEFF Research Database (Denmark)

    Kafle, Bishoksan; Gallagher, John Patrick; Ganty, Pierre

    2016-01-01

    In this paper we show that checking satisfiability of a set of non-linear Horn clauses (also called a non-linear Horn clause program) can be achieved using a solver for linear Horn clauses. We achieve this by interleaving a program transformation with a satisfiability checker for linear Horn...... clauses (also called a solver for linear Horn clauses). The program transformation is based on the notion of tree dimension, which we apply to a set of non-linear clauses, yielding a set whose derivation trees have bounded dimension. Such a set of clauses can be linearised. The main algorithm...... dimension. We constructed a prototype implementation of this approach and performed some experiments on a set of verification problems, which shows some promise....

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

    and fluid mechanics. Design/methodology/approach – Two new but powerful analytical methods, namely, He's VIM and HPM, are introduced to solve some boundary value problems in structural engineering and fluid mechanics. Findings – Analytical solutions often fit under classical perturbation methods. However......, as with other analytical techniques, certain limitations restrict the wide application of perturbation methods, most important of which is the dependence of these methods on the existence of a small parameter in the equation. Disappointingly, the majority of nonlinear problems have no small parameter at all......Purpose – In the last two decades with the rapid development of nonlinear science, there has appeared ever-increasing interest of scientists and engineers in the analytical techniques for nonlinear problems. This paper considers linear and nonlinear systems that are not only regarded as general...

  10. Two-dimensional differential transform method for solving linear and non-linear Schroedinger equations

    International Nuclear Information System (INIS)

    Ravi Kanth, A.S.V.; Aruna, K.

    2009-01-01

    In this paper, we propose a reliable algorithm to develop exact and approximate solutions for the linear and nonlinear Schroedinger equations. The approach rest mainly on two-dimensional differential transform method which is one of the approximate methods. The method can easily be applied to many linear and nonlinear problems and is capable of reducing the size of computational work. Exact solutions can also be achieved by the known forms of the series solutions. Several illustrative examples are given to demonstrate the effectiveness of the present method.

  11. Discovering Steiner Triple Systems through Problem Solving

    Science.gov (United States)

    Sriraman, Bharath

    2004-01-01

    An attempt to implement problem solving as a teacher of ninth grade algebra is described. The problems selected were not general ones, they involved combinations and represented various situations and were more complex which lead to the discovery of Steiner triple systems.

  12. 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. Copyright © 2017 Elsevier Ltd. All rights reserved.

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

  14. Novel methods for Solving Economic Dispatch of Security-Constrained Unit Commitment Based on Linear Programming

    Science.gov (United States)

    Guo, Sangang

    2017-09-01

    There are two stages in solving security-constrained unit commitment problems (SCUC) within Lagrangian framework: one is to obtain feasible units’ states (UC), the other is power economic dispatch (ED) for each unit. The accurate solution of ED is more important for enhancing the efficiency of the solution to SCUC for the fixed feasible units’ statues. Two novel methods named after Convex Combinatorial Coefficient Method and Power Increment Method respectively based on linear programming problem for solving ED are proposed by the piecewise linear approximation to the nonlinear convex fuel cost functions. Numerical testing results show that the methods are effective and efficient.

  15. Feedback systems for linear colliders

    CERN Document Server

    Hendrickson, L; Himel, Thomas M; Minty, Michiko G; Phinney, N; Raimondi, Pantaleo; Raubenheimer, T O; Shoaee, H; Tenenbaum, P G

    1999-01-01

    Feedback systems are essential for stable operation of a linear collider, providing a cost-effective method for relaxing tight tolerances. In the Stanford Linear Collider (SLC), feedback controls beam parameters such as trajectory, energy, and intensity throughout the accelerator. A novel dithering optimization system which adjusts final focus parameters to maximize luminosity contributed to achieving record performance in the 1997-98 run. Performance limitations of the steering feedback have been investigated, and improvements have been made. For the Next Linear Collider (NLC), extensive feedback systems are planned as an intregal part of the design. Feedback requiremetns for JLC (the Japanese Linear Collider) are essentially identical to NLC; some of the TESLA requirements are similar but there are significant differences. For NLC, algorithms which incorporate improvements upon the SLC implementation are being prototyped. Specialized systems for the damping rings, rf and interaction point will operate at hi...

  16. Local Fractional Laplace Variational Iteration Method for Solving Linear Partial Differential Equations with Local Fractional Derivative

    Directory of Open Access Journals (Sweden)

    Ai-Min Yang

    2014-01-01

    Full Text Available The local fractional Laplace variational iteration method was applied to solve the linear local fractional partial differential equations. The local fractional Laplace variational iteration method is coupled by the local fractional variational iteration method and Laplace transform. The nondifferentiable approximate solutions are obtained and their graphs are also shown.

  17. Feedback Systems for Linear Colliders

    International Nuclear Information System (INIS)

    1999-01-01

    Feedback systems are essential for stable operation of a linear collider, providing a cost-effective method for relaxing tight tolerances. In the Stanford Linear Collider (SLC), feedback controls beam parameters such as trajectory, energy, and intensity throughout the accelerator. A novel dithering optimization system which adjusts final focus parameters to maximize luminosity contributed to achieving record performance in the 1997-98 run. Performance limitations of the steering feedback have been investigated, and improvements have been made. For the Next Linear Collider (NLC), extensive feedback systems are planned as an integral part of the design. Feedback requirements for JLC (the Japanese Linear Collider) are essentially identical to NLC; some of the TESLA requirements are similar but there are significant differences. For NLC, algorithms which incorporate improvements upon the SLC implementation are being prototyped. Specialized systems for the damping rings, rf and interaction point will operate at high bandwidth and fast response. To correct for the motion of individual bunches within a train, both feedforward and feedback systems are planned. SLC experience has shown that feedback systems are an invaluable operational tool for decoupling systems, allowing precision tuning, and providing pulse-to-pulse diagnostics. Feedback systems for the NLC will incorporate the key SLC features and the benefits of advancing technologies

  18. Window observers for linear systems

    Directory of Open Access Journals (Sweden)

    Utkin Vadim

    2000-01-01

    Full Text Available Given a linear system x ˙ = A x + B u with output y = C x and a window function ω ( t , i.e., ∀ t , ω ( t ∈ {0,1 }, and assuming that the window function is Lebesgue measurable, we refer to the following observer, x ˆ = A x + B u + ω ( t L C ( x − x ˆ as a window observer. The stability issue is treated in this paper. It is proven that for linear time-invariant systems, the window observer can be stabilized by an appropriate design under a very mild condition on the window functions, albeit for linear time-varying system, some regularity of the window functions is required to achieve observer designs with the asymptotic stability. The corresponding design methods are developed. An example is included to illustrate the possible applications

  19. Identification problems in linear transformation system

    International Nuclear Information System (INIS)

    Delforge, Jacques.

    1975-01-01

    An attempt was made to solve the theoretical and numerical difficulties involved in the identification problem relative to the linear part of P. Delattre's theory of transformation systems. The theoretical difficulties are due to the very important problem of the uniqueness of the solution, which must be demonstrated in order to justify the value of the solution found. Simple criteria have been found when measurements are possible on all the equivalence classes, but the problem remains imperfectly solved when certain evolution curves are unknown. The numerical difficulties are of two kinds: a slow convergence of iterative methods and a strong repercussion of numerical and experimental errors on the solution. In the former case a fast convergence was obtained by transformation of the parametric space, while in the latter it was possible, from sensitivity functions, to estimate the errors, to define and measure the conditioning of the identification problem then to minimize this conditioning as a function of the experimental conditions [fr

  20. 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 condition leads to the research questions concerning students' attempt on solving a simple linear inequality problem in this form. In order to do so, the written test was administered to 58 students from two schools in Bandung followed by interviews. The other sources of the data are from teachers' interview and mathematics books used by students. After that, the constant comparative method was used to analyse the data. The result shows that the majority approached the question by doing algebraic operations. Interestingly, most of them did it incorrectly. In contrast, algebraic operations were correctly used by some of them. Moreover, the others performed expected-numbers solution, rewriting the question, translating the inequality into words, and blank answer. Furthermore, we found that there is no one who was conscious of the existence of all-numbers solution. It was found that this condition is reasonably due to how little the learning components concern about why a procedure of solving a linear inequality works and possibilities of linear inequality solution.

  1. Solution of generalized shifted linear systems with complex symmetric matrices

    International Nuclear Information System (INIS)

    Sogabe, Tomohiro; Hoshi, Takeo; Zhang, Shao-Liang; Fujiwara, Takeo

    2012-01-01

    We develop the shifted COCG method [R. Takayama, T. Hoshi, T. Sogabe, S.-L. Zhang, T. Fujiwara, Linear algebraic calculation of Green’s function for large-scale electronic structure theory, Phys. Rev. B 73 (165108) (2006) 1–9] and the shifted WQMR method [T. Sogabe, T. Hoshi, S.-L. Zhang, T. Fujiwara, On a weighted quasi-residual minimization strategy of the QMR method for solving complex symmetric shifted linear systems, Electron. Trans. Numer. Anal. 31 (2008) 126–140] for solving generalized shifted linear systems with complex symmetric matrices that arise from the electronic structure theory. The complex symmetric Lanczos process with a suitable bilinear form plays an important role in the development of the methods. The numerical examples indicate that the methods are highly attractive when the inner linear systems can efficiently be solved.

  2. Reduction of Linear Functional Systems using Fuhrmann's Equivalence

    Directory of Open Access Journals (Sweden)

    Mohamed S. Boudellioua

    2016-11-01

    Full Text Available Functional systems arise in the treatment of systems of partial differential equations, delay-differential equations, multidimensional equations, etc. The problem of reducing a linear functional system to a system containing fewer equations and unknowns was first studied by Serre. Finding an equivalent presentation of a linear functional system containing fewer equations and fewer unknowns can generally simplify both the study of the structural properties of the linear functional system and of different numerical analysis issues, and it can sometimes help in solving the linear functional system. In this paper, Fuhrmann's equivalence is used to present a constructive result on the reduction of under-determined linear functional systems to a single equation involving a single unknown. This equivalence transformation has been studied by a number of authors and has been shown to play an important role in the theory of linear functional systems.

  3. Solving a class of generalized fractional programming problems using the feasibility of linear programs.

    Science.gov (United States)

    Shen, Peiping; Zhang, Tongli; Wang, Chunfeng

    2017-01-01

    This article presents a new approximation algorithm for globally solving a class of generalized fractional programming problems (P) whose objective functions are defined as an appropriate composition of ratios of affine functions. To solve this problem, the algorithm solves an equivalent optimization problem (Q) via an exploration of a suitably defined nonuniform grid. The main work of the algorithm involves checking the feasibility of linear programs associated with the interesting grid points. It is proved that the proposed algorithm is a fully polynomial time approximation scheme as the ratio terms are fixed in the objective function to problem (P), based on the computational complexity result. In contrast to existing results in literature, the algorithm does not require the assumptions on quasi-concavity or low-rank of the objective function to problem (P). Numerical results are given to illustrate the feasibility and effectiveness of the proposed algorithm.

  4. Linear collider systems and costs

    International Nuclear Information System (INIS)

    Loew, G.A.

    1993-05-01

    The purpose of this paper is to examine some of the systems and sub-systems involved in so-called ''conventional'' e + e - linear colliders and to study how their design affects the overall cost of these machines. There are presently a total of at least six 500 GeV c. of m. linear collider projects under study in the world. Aside from TESLA (superconducting linac at 1.3 GHz) and CLIC (two-beam accelerator with main linac at 30GHz), the other four proposed e + e - linear colliders can be considered ''conventional'' in that their main linacs use the proven technique of driving room temperature accelerator sections with pulsed klystrons and modulators. The centrally distinguishing feature between these projects is their main linac rf frequency: 3 GHz for the DESY machine, 11.424 GHz for the SLAC and JLC machines, and 14 GHz for the VLEPP machine. The other systems, namely the electron and positron sources, preaccelerators, compressors, damping rings and final foci, are fairly similar from project to project. Probably more than 80% of the cost of these linear colliders will be incurred in the two main linacs facing each other and it is therefore in their design and construction that major savings or extra costs may be found

  5. Fibonacci collocation method with a residual error Function to solve linear Volterra integro differential equations

    Directory of Open Access Journals (Sweden)

    Salih Yalcinbas

    2016-01-01

    Full Text Available In this paper, a new collocation method based on the Fibonacci polynomials is introduced to solve the high-order linear Volterra integro-differential equations under the conditions. Numerical examples are included to demonstrate the applicability and validity of the proposed method and comparisons are made with the existing results. In addition, an error estimation based on the residual functions is presented for this method. The approximate solutions are improved by using this error estimation.

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

  7. Solution of systems of linear algebraic equations by the method of summation of divergent series

    International Nuclear Information System (INIS)

    Kirichenko, G.A.; Korovin, Ya.S.; Khisamutdinov, M.V.; Shmojlov, V.I.

    2015-01-01

    A method for solving systems of linear algebraic equations has been proposed on the basis on the summation of the corresponding continued fractions. The proposed algorithm for solving systems of linear algebraic equations is classified as direct algorithms providing an exact solution in a finite number of operations. Examples of solving systems of linear algebraic equations have been presented and the effectiveness of the algorithm has been estimated [ru

  8. Operator approach to linear control systems

    CERN Document Server

    Cheremensky, A

    1996-01-01

    Within the framework of the optimization problem for linear control systems with quadratic performance index (LQP), the operator approach allows the construction of a systems theory including a number of particular infinite-dimensional optimization problems with hardly visible concreteness. This approach yields interesting interpretations of these problems and more effective feedback design methods. This book is unique in its emphasis on developing methods for solving a sufficiently general LQP. Although this is complex material, the theory developed here is built on transparent and relatively simple principles, and readers with less experience in the field of operator theory will find enough material to give them a good overview of the current state of LQP theory and its applications. Audience: Graduate students and researchers in the fields of mathematical systems theory, operator theory, cybernetics, and control systems.

  9. Stability and response bounds of non-conservative linear systems

    DEFF Research Database (Denmark)

    Pommer, Christian

    2003-01-01

    For a linear system of second order differential equations the stability is studied by Lyapunov's direct method. The Lyapunov matrix equation is solved and a sufficient condition for stability is expressed by the system matrices. For a system which satisfies the condition for stability the Lyapunov...

  10. He's homotopy perturbation method for solving systems of Volterra integral equations of the second kind

    International Nuclear Information System (INIS)

    Biazar, J.; Ghazvini, H.

    2009-01-01

    In this paper, the He's homotopy perturbation method is applied to solve systems of Volterra integral equations of the second kind. Some examples are presented to illustrate the ability of the method for linear and non-linear such systems. The results reveal that the method is very effective and simple.

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

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

  13. ON THE STABILIZATION OF THE LINEAR HYBRID SYSTEM STRUCTURE

    Directory of Open Access Journals (Sweden)

    Kirillov

    2014-11-01

    Full Text Available The linear control hybrid system, consisting of a fi- nite set of subsystems (modes having different dimensions, is considered. The moments of reset time are determined by some complementary function – evolutionary time. This function satisfies the special complementary ordinary differential equation. The mode stabilization problem is solved for some class of piecewise linear controls. The method of stabilization relies on the set of invariant planes, the existence of which is due to the special form of the hybrid system.

  14. Iterative algorithms for large sparse linear systems on parallel computers

    Science.gov (United States)

    Adams, L. M.

    1982-01-01

    Algorithms for assembling in parallel the sparse system of linear equations that result from finite difference or finite element discretizations of elliptic partial differential equations, such as those that arise in structural engineering are developed. Parallel linear stationary iterative algorithms and parallel preconditioned conjugate gradient algorithms are developed for solving these systems. In addition, a model for comparing parallel algorithms on array architectures is developed and results of this model for the algorithms are given.

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

  16. Linear operator inequalities for strongly stable weakly regular linear systems

    NARCIS (Netherlands)

    Curtain, RF

    2001-01-01

    We consider the question of the existence of solutions to certain linear operator inequalities (Lur'e equations) for strongly stable, weakly regular linear systems with generating operators A, B, C, 0. These operator inequalities are related to the spectral factorization of an associated Popov

  17. Using Systemic Problem Solving (SPS) to Assess Student ...

    African Journals Online (AJOL)

    This paper focuses on the uses of systemic problem solving in chemistry at the tertiary level. Traditional problem solving (TPS) is a useful tool to help teachers examine recall of information, comprehension, and application. However, systemic problem solving (SPS) can challenge students and probe higher cognitive skills ...

  18. A new methodological development for solving linear bilevel integer programming problems in hybrid fuzzy environment

    Directory of Open Access Journals (Sweden)

    Animesh Biswas

    2016-04-01

    Full Text Available This paper deals with fuzzy goal programming approach to solve fuzzy linear bilevel integer programming problems with fuzzy probabilistic constraints following Pareto distribution and Frechet distribution. In the proposed approach a new chance constrained programming methodology is developed from the view point of managing those probabilistic constraints in a hybrid fuzzy environment. A method of defuzzification of fuzzy numbers using ?-cut has been adopted to reduce the problem into a linear bilevel integer programming problem. The individual optimal value of the objective of each DM is found in isolation to construct the fuzzy membership goals. Finally, fuzzy goal programming approach is used to achieve maximum degree of each of the membership goals by minimizing under deviational variables in the decision making environment. To demonstrate the efficiency of the proposed approach, a numerical example is provided.

  19. Application of Nearly Linear Solvers to Electric Power System Computation

    Science.gov (United States)

    Grant, Lisa L.

    To meet the future needs of the electric power system, improvements need to be made in the areas of power system algorithms, simulation, and modeling, specifically to achieve a time frame that is useful to industry. If power system time-domain simulations could run in real-time, then system operators would have situational awareness to implement online control and avoid cascading failures, significantly improving power system reliability. Several power system applications rely on the solution of a very large linear system. As the demands on power systems continue to grow, there is a greater computational complexity involved in solving these large linear systems within reasonable time. This project expands on the current work in fast linear solvers, developed for solving symmetric and diagonally dominant linear systems, in order to produce power system specific methods that can be solved in nearly-linear run times. The work explores a new theoretical method that is based on ideas in graph theory and combinatorics. The technique builds a chain of progressively smaller approximate systems with preconditioners based on the system's low stretch spanning tree. The method is compared to traditional linear solvers and shown to reduce the time and iterations required for an accurate solution, especially as the system size increases. A simulation validation is performed, comparing the solution capabilities of the chain method to LU factorization, which is the standard linear solver for power flow. The chain method was successfully demonstrated to produce accurate solutions for power flow simulation on a number of IEEE test cases, and a discussion on how to further improve the method's speed and accuracy is included.

  20. Iterative solution of linear systems in the 20­th century

    NARCIS (Netherlands)

    Saad, Y.; Vorst, H.A. van der

    2000-01-01

    This paper sketches the main research developments in the area of iterative methods for solving linear systems during the 20th century. Although iterative methods for solving linear systems find their origin in the early nineteenth century (work by Gauss), the field has seen an explosion of

  1. Structured Control of Affine Linear Parameter Varying Systems

    DEFF Research Database (Denmark)

    Adegas, Fabiano Daher; Stoustrup, Jakob

    2011-01-01

    This paper presents a new procedure to design structured controllers for discrete-time affine linear parametervarying systems (A LPV). The class of control structures includes decentralized of any order, fixed order output feedback, simultaneous plant-control design, among others. A parametervarying...... non-convex condition for an upper bound on the induced L2-norm performance is solved by an iterative linear matrix inequalities (LMI) optimization algorithm. Numerical examples demostrate the effectiveness of the proposed approach....

  2. SLAP, Large Sparse Linear System Solution Package

    International Nuclear Information System (INIS)

    Greenbaum, A.

    1987-01-01

    1 - Description of program or function: SLAP is a set of routines for solving large sparse systems of linear equations. One need not store the entire matrix - only the nonzero elements and their row and column numbers. Any nonzero structure is acceptable, so the linear system solver need not be modified when the structure of the matrix changes. Auxiliary storage space is acquired and released within the routines themselves by use of the LRLTRAN POINTER statement. 2 - Method of solution: SLAP contains one direct solver, a band matrix factorization and solution routine, BAND, and several interactive solvers. The iterative routines are as follows: JACOBI, Jacobi iteration; GS, Gauss-Seidel Iteration; ILUIR, incomplete LU decomposition with iterative refinement; DSCG and ICCG, diagonal scaling and incomplete Cholesky decomposition with conjugate gradient iteration (for symmetric positive definite matrices only); DSCGN and ILUGGN, diagonal scaling and incomplete LU decomposition with conjugate gradient interaction on the normal equations; DSBCG and ILUBCG, diagonal scaling and incomplete LU decomposition with bi-conjugate gradient iteration; and DSOMN and ILUOMN, diagonal scaling and incomplete LU decomposition with ORTHOMIN iteration

  3. An Improved Method for Solving Multiobjective Integer Linear Fractional Programming Problem

    Directory of Open Access Journals (Sweden)

    Meriem Ait Mehdi

    2014-01-01

    Full Text Available We describe an improvement of Chergui and Moulaï’s method (2008 that generates the whole efficient set of a multiobjective integer linear fractional program based on the branch and cut concept. The general step of this method consists in optimizing (maximizing without loss of generality one of the fractional objective functions over a subset of the original continuous feasible set; then if necessary, a branching process is carried out until obtaining an integer feasible solution. At this stage, an efficient cut is built from the criteria’s growth directions in order to discard a part of the feasible domain containing only nonefficient solutions. Our contribution concerns firstly the optimization process where a linear program that we define later will be solved at each step rather than a fractional linear program. Secondly, local ideal and nadir points will be used as bounds to prune some branches leading to nonefficient solutions. The computational experiments show that the new method outperforms the old one in all the treated instances.

  4. Kalman filtering for time-delayed linear systems

    Institute of Scientific and Technical Information of China (English)

    LU Xiao; WANG Wei

    2006-01-01

    This paper is to study the linear minimum variance estimation for discrete- time systems. A simple approach to the problem is presented by developing re-organized innovation analysis for the systems with instantaneous and double time-delayed measurements. It is shown that the derived estimator involves solving three different standard Kalman filtering with the same dimension as the original system. The obtained results form the basis for solving some complicated problems such as H∞ fixed-lag smoothing, preview control, H∞ filtering and control with time delays.

  5. Non-linear algorithms solved with the help of the GIBIANE macro-language

    International Nuclear Information System (INIS)

    Ebersolt, L.; Combescure, A.; Millard, A.; Verpeaux, P.

    1987-01-01

    Non linear finite element problems are often solved with the help of iteratives procedures. In the finite element program CASTEM 2000, the syntax of the dataset permits the user to derive his own algorithm and tune it to his problem. These basic ideas, simple to imagine, needed a proper frame to be materialized in a general purpose finite element program, and three concepts emerged: Operators, the Gibiane macro-language. In the two first paragraphs, we will detail these concepts, in the third paragraph, we will describe the different possibilities of the program, in the fourth paragraph, we will show, by combining operators in a proper order, how to obtain the desired algorithm. (orig./GL)

  6. A novel algebraic procedure for solving non-linear evolution equations of higher order

    International Nuclear Information System (INIS)

    Huber, Alfred

    2007-01-01

    We report here a systematic approach that can easily be used for solving non-linear partial differential equations (nPDE), especially of higher order. We restrict the analysis to the so called evolution equations describing any wave propagation. The proposed new algebraic approach leads us to traveling wave solutions and moreover, new class of solution can be obtained. The crucial step of our method is the basic assumption that the solutions satisfy an ordinary differential equation (ODE) of first order that can be easily integrated. The validity and reliability of the method is tested by its application to some non-linear evolution equations. The important aspect of this paper however is the fact that we are able to calculate distinctive class of solutions which cannot be found in the current literature. In other words, using this new algebraic method the solution manifold is augmented to new class of solution functions. Simultaneously we would like to stress the necessity of such sophisticated methods since a general theory of nPDE does not exist. Otherwise, for practical use the algebraic construction of new class of solutions is of fundamental interest

  7. Solving-Problems and Hypermedia Systems

    Directory of Open Access Journals (Sweden)

    Ricardo LÓPEZ FERNÁNDEZ

    2009-06-01

    Full Text Available The solving problems like the transfer constitute two nuclei, related, essential in the cognitive investigation and in the mathematical education. No is in and of itself casual that, from the first moment, in the investigations on the application gives the computer science to the teaching the mathematics, cybernetic models were developed that simulated processes problem solving and transfer cotexts (GPS, 1969 and IDEA (Interactive Decision Envisioning Aid, Pea, BrunerCohen, Webster & Mellen, 1987. The present articulates it analyzes, that can contribute to the development in this respect the new technologies hypermedias, give applications that are good to implement processes of learning the heuristic thought and give the capacity of «transfer». From our perspective and from the experience that we have developed in this field, to carry out a function gives analysis and the theories on the problem solving, it requires that we exercise a previous of interpretation the central aspsects over the theories gives the solving problem and transfer starting from the classic theories on the prosecution of the information. In this sense, so much the theory gives the dual memory as the most recent, J. Anderson (1993 based on the mechanisms activation nodes information they allow to establish an interpretation suggester over the mental mechanism that you/they operate in the heuristic processes. On this analysis, the present articulates it develops a theoritical interpretation over the function gives the supports based on technology hypermedia advancing in the definition of a necessary theoretical body, having in it counts that on the other hand the practical experimentation is permanent concluding in the efficiency and effectiveness gives the support hypermedia like mechanism of comunication in the processes heuristic learning.

  8. Linear local stability of electrostatic drift modes in helical systems

    International Nuclear Information System (INIS)

    Yamagishi, O.; Nakajima, N.; Sugama, H.; Nakamura, Y.

    2003-01-01

    We investigate the stability of the drift wave in helical systems. For this purpose, we solve the linear local gyrokinetic-Poisson equation, in the electrostatic regime. As a model of helical plasmas, Large helical Device (LHD) is considered. The equation we apply is rather exact in the framework of linear gyrokinetic theory, where only the approximation is the ballooning representation. In this paper, we consider only collisionless cases. All the frequency regime can be naturally reated without any assumptions, and in such cases, ion temperature gradient modes (ITG), trapped electron modes (TEM), and electron temperature gradient modes (ETG) are expected to become unstable linearly independently. (orig.)

  9. Dynamic linearization system for a radiation gauge

    International Nuclear Information System (INIS)

    Panarello, J.A.

    1977-01-01

    The linearization system and process converts a high resolution non-linear analog input signal, representative of the thickness of an object, into a high resolution linear analog output signal suitable for use in driving a variety of output devices. The system requires only a small amount of memory for storing pre-calculated non-linear correction coefficients. The system channels the input signal to separate circuit paths so that it may be used directly to; locate an appropriate correction coefficient; develop a correction term after an appropriate correction coefficient is located; and develop a linearized signal having the same high resolution inherent in the input signal. The system processes the linearized signal to compensate for the possible errors introduced by radiation source noise. The processed linearized signal is the high resolution linear analog output signal which accurately represents the thickness of the object being gauged

  10. Linear quadratic optimization for positive LTI system

    Science.gov (United States)

    Muhafzan, Yenti, Syafrida Wirma; Zulakmal

    2017-05-01

    Nowaday the linear quadratic optimization subject to positive linear time invariant (LTI) system constitute an interesting study considering it can become a mathematical model of variety of real problem whose variables have to nonnegative and trajectories generated by these variables must be nonnegative. In this paper we propose a method to generate an optimal control of linear quadratic optimization subject to positive linear time invariant (LTI) system. A sufficient condition that guarantee the existence of such optimal control is discussed.

  11. The semantic system is involved in mathematical problem solving.

    Science.gov (United States)

    Zhou, Xinlin; Li, Mengyi; Li, Leinian; Zhang, Yiyun; Cui, Jiaxin; Liu, Jie; Chen, Chuansheng

    2018-02-01

    Numerous studies have shown that the brain regions around bilateral intraparietal cortex are critical for number processing and arithmetical computation. However, the neural circuits for more advanced mathematics such as mathematical problem solving (with little routine arithmetical computation) remain unclear. Using functional magnetic resonance imaging (fMRI), this study (N = 24 undergraduate students) compared neural bases of mathematical problem solving (i.e., number series completion, mathematical word problem solving, and geometric problem solving) and arithmetical computation. Direct subject- and item-wise comparisons revealed that mathematical problem solving typically had greater activation than arithmetical computation in all 7 regions of the semantic system (which was based on a meta-analysis of 120 functional neuroimaging studies on semantic processing). Arithmetical computation typically had greater activation in the supplementary motor area and left precentral gyrus. The results suggest that the semantic system in the brain supports mathematical problem solving. Copyright © 2017 Elsevier Inc. All rights reserved.

  12. Multistage Spectral Relaxation Method for Solving the Hyperchaotic Complex Systems

    Directory of Open Access Journals (Sweden)

    Hassan Saberi Nik

    2014-01-01

    Full Text Available We present a pseudospectral method application for solving the hyperchaotic complex systems. The proposed method, called the multistage spectral relaxation method (MSRM is based on a technique of extending Gauss-Seidel type relaxation ideas to systems of nonlinear differential equations and using the Chebyshev pseudospectral methods to solve the resulting system on a sequence of multiple intervals. In this new application, the MSRM is used to solve famous hyperchaotic complex systems such as hyperchaotic complex Lorenz system and the complex permanent magnet synchronous motor. We compare this approach to the Runge-Kutta based ode45 solver to show that the MSRM gives accurate results.

  13. Linear differential equations to solve nonlinear mechanical problems: A novel approach

    OpenAIRE

    Nair, C. Radhakrishnan

    2004-01-01

    Often a non-linear mechanical problem is formulated as a non-linear differential equation. A new method is introduced to find out new solutions of non-linear differential equations if one of the solutions of a given non-linear differential equation is known. Using the known solution of the non-linear differential equation, linear differential equations are set up. The solutions of these linear differential equations are found using standard techniques. Then the solutions of the linear differe...

  14. On pole structure assignment in linear systems

    Czech Academy of Sciences Publication Activity Database

    Loiseau, J.-J.; Zagalak, Petr

    2009-01-01

    Roč. 82, č. 7 (2009), s. 1179-1192 ISSN 0020-7179 R&D Projects: GA ČR(CZ) GA102/07/1596 Institutional research plan: CEZ:AV0Z10750506 Keywords : linear systems * linear state feedback * pole structure assignment Subject RIV: BC - Control Systems Theory Impact factor: 1.124, year: 2009 http://library.utia.cas.cz/separaty/2009/AS/zagalak-on pole structure assignment in linear systems.pdf

  15. Solving modified systems with multiple right-hand sides

    Energy Technology Data Exchange (ETDEWEB)

    Simoncini, V.; Gallopoulos, E. [Univ. of Patras (Greece)

    1996-12-31

    In this talk we discuss the iterative solution of large linear systems of the form (A + USV{sup H})X = B, where A is an n x n non-Hermitian matrix, USV{sup H} is a rank-r modification of A and B is of rank s with s, r {much_lt} n. We analyze several approaches that exploit the structure of the coefficient matrix so as to solve the systems more efficiently than if one were to apply a non-hermitian solver to the original systems. In the development of procedures, we take into account the presence of both the low-rank modification and the several right-hand sides. Interesting issues connected to this problem originate from the quest for techniques that accelerate the underlying iterative solvers: preconditioning (e.g. inner-outer iteration strategies), domain decomposition, and continuation methods. Experiments are provided to analyze the behavior of the methods depending on the structure of the rectangular matrices. Preconditioning strategies are explored for an efficient implementation on the transformed systems.

  16. Programmable Solution for Solving Non-linearity Characteristics of Smart Sensor Applications

    Directory of Open Access Journals (Sweden)

    S. Khan

    2007-10-01

    Full Text Available This paper presents a simple but programmable technique to solve the problem of non-linear characteristics of sensors used in more sensitive applications. The nonlinearity of the output response becomes a very sensitive issue in cases where a proportional increase in the physical quantity fails to bring about a proportional increase in the signal measured. The nonlinearity is addressed by using the interpolation method on the characteristics of a given sensor, approximating it to a set of tangent lines, the tangent points of which are recognized in the code of the processor by IF-THEN code. The method suggested here eliminates the use of external circuits for interfacing, and eases the programming burden on the processor at the cost of proportionally reduced memory requirements. The mathematically worked out results are compared with the simulation and experimental results for an IR sensor selected for the purpose and used for level measurement. This work will be of paramount importance and significance in applications where the controlled signal is required to follow the input signal precisely particularly in sensitive robotic applications.

  17. Displacement measurement system for linear array detector

    International Nuclear Information System (INIS)

    Zhang Pengchong; Chen Ziyu; Shen Ji

    2011-01-01

    It presents a set of linear displacement measurement system based on encoder. The system includes displacement encoders, optical lens and read out circuit. Displacement read out unit includes linear CCD and its drive circuit, two amplifier circuits, second order Butterworth low-pass filter and the binarization circuit. The coding way is introduced, and various parts of the experimental signal waveforms are given, and finally a linear experimental test results are given. The experimental results are satisfactory. (authors)

  18. Solution of the fully fuzzy linear systems using iterative techniques

    International Nuclear Information System (INIS)

    Dehghan, Mehdi; Hashemi, Behnam; Ghatee, Mehdi

    2007-01-01

    This paper mainly intends to discuss the iterative solution of fully fuzzy linear systems which we call FFLS. We employ Dubois and Prade's approximate arithmetic operators on LR fuzzy numbers for finding a positive fuzzy vector x-tilde which satisfies A-tildex-tilde=b, where A-tilde and b-tilde are a fuzzy matrix and a fuzzy vector, respectively. Please note that the positivity assumption is not so restrictive in applied problems. We transform FFLS and propose iterative techniques such as Richardson, Jacobi, Jacobi overrelaxation (JOR), Gauss-Seidel, successive overrelaxation (SOR), accelerated overrelaxation (AOR), symmetric and unsymmetric SOR (SSOR and USSOR) and extrapolated modified Aitken (EMA) for solving FFLS. In addition, the methods of Newton, quasi-Newton and conjugate gradient are proposed from nonlinear programming for solving a fully fuzzy linear system. Various numerical examples are also given to show the efficiency of the proposed schemes

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

    OpenAIRE

    Aihong Ren

    2016-01-01

    This paper is concerned with a class of fully fuzzy bilevel linear programming problems where all the coefficients and decision variables of both objective functions and the constraints are fuzzy numbers. A new approach based on deviation degree measures and a ranking function method is proposed to solve these problems. We first introduce concepts of the feasible region and the fuzzy optimal solution of a fully fuzzy bilevel linear programming problem. In order to obtain a fuzzy optimal solut...

  20. Effective quadrature formula in solving linear integro-differential equations of order two

    Science.gov (United States)

    Eshkuvatov, Z. K.; Kammuji, M.; Long, N. M. A. Nik; Yunus, Arif A. M.

    2017-08-01

    In this note, we solve general form of Fredholm-Volterra integro-differential equations (IDEs) of order 2 with boundary condition approximately and show that proposed method is effective and reliable. Initially, IDEs is reduced into integral equation of the third kind by using standard integration techniques and identity between multiple and single integrals then truncated Legendre series are used to estimate the unknown function. For the kernel integrals, we have applied Gauss-Legendre quadrature formula and collocation points are chosen as the roots of the Legendre polynomials. Finally, reduce the integral equations of the third kind into the system of algebraic equations and Gaussian elimination method is applied to get approximate solutions. Numerical examples and comparisons with other methods reveal that the proposed method is very effective and dominated others in many cases. General theory of existence of the solution is also discussed.

  1. A parallel solver for huge dense linear systems

    Science.gov (United States)

    Badia, J. M.; Movilla, J. L.; Climente, J. I.; Castillo, M.; Marqués, M.; Mayo, R.; Quintana-Ortí, E. S.; Planelles, J.

    2011-11-01

    HDSS (Huge Dense Linear System Solver) is a Fortran Application Programming Interface (API) to facilitate the parallel solution of very large dense systems to scientists and engineers. The API makes use of parallelism to yield an efficient solution of the systems on a wide range of parallel platforms, from clusters of processors to massively parallel multiprocessors. It exploits out-of-core strategies to leverage the secondary memory in order to solve huge linear systems O(100.000). The API is based on the parallel linear algebra library PLAPACK, and on its Out-Of-Core (OOC) extension POOCLAPACK. Both PLAPACK and POOCLAPACK use the Message Passing Interface (MPI) as the communication layer and BLAS to perform the local matrix operations. The API provides a friendly interface to the users, hiding almost all the technical aspects related to the parallel execution of the code and the use of the secondary memory to solve the systems. In particular, the API can automatically select the best way to store and solve the systems, depending of the dimension of the system, the number of processes and the main memory of the platform. Experimental results on several parallel platforms report high performance, reaching more than 1 TFLOP with 64 cores to solve a system with more than 200 000 equations and more than 10 000 right-hand side vectors. New version program summaryProgram title: Huge Dense System Solver (HDSS) Catalogue identifier: AEHU_v1_1 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEHU_v1_1.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 87 062 No. of bytes in distributed program, including test data, etc.: 1 069 110 Distribution format: tar.gz Programming language: Fortran90, C Computer: Parallel architectures: multiprocessors, computer clusters Operating system

  2. Balanced truncation for linear switched systems

    DEFF Research Database (Denmark)

    Petreczky, Mihaly; Wisniewski, Rafal; Leth, John-Josef

    2013-01-01

    In this paper, we present a theoretical analysis of the model reduction algorithm for linear switched systems from Shaker and Wisniewski (2011, 2009) and . This algorithm is a reminiscence of the balanced truncation method for linear parameter varying systems (Wood et al., 1996) [3]. Specifically...

  3. Multiobjective CVaR Optimization Model and Solving Method for Hydrothermal System Considering Uncertain Load Demand

    Directory of Open Access Journals (Sweden)

    Zhongfu Tan

    2015-01-01

    Full Text Available In order to solve the influence of load uncertainty on hydrothermal power system operation and achieve the optimal objectives of system power generation consumption, pollutant emissions, and first-stage hydropower station storage capacity, this paper introduced CVaR method and built a multiobjective optimization model and its solving method. In the optimization model, load demand’s actual values and deviation values are regarded as random variables, scheduling objective is redefined to meet confidence level requirement and system operation constraints and loss function constraints are taken into consideration. To solve the proposed model, this paper linearized nonlinear constraints, applied fuzzy satisfaction, fuzzy entropy, and weighted multiobjective function theories to build a fuzzy entropy multiobjective CVaR model. The model is a mixed integer linear programming problem. Then, six thermal power plants and three cascade hydropower stations are taken as the hydrothermal system for numerical simulation. The results verified that multiobjective CVaR method is applicable to solve hydrothermal scheduling problems. It can better reflect risk level of the scheduling result. The fuzzy entropy satisfaction degree solving algorithm can simplify solving difficulty and get the optimum operation scheduling scheme.

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

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

    Science.gov (United States)

    Salleh, Faridah Hani Mohamed; Zainudin, Suhaila; Arif, Shereena M

    2017-01-01

    Gene regulatory network (GRN) reconstruction is the process of identifying regulatory gene interactions from experimental data through computational analysis. One of the main reasons for the reduced performance of previous GRN methods had been inaccurate prediction of cascade motifs. Cascade error is defined as the wrong prediction of cascade motifs, where an indirect interaction is misinterpreted as a direct interaction. Despite the active research on various GRN prediction methods, the discussion on specific methods to solve problems related to cascade errors is still lacking. In fact, the experiments conducted by the past studies were not specifically geared towards proving the ability of GRN prediction methods in avoiding the occurrences of cascade errors. Hence, this research aims to propose Multiple Linear Regression (MLR) to infer GRN from gene expression data and to avoid wrongly inferring of an indirect interaction (A → B → C) as a direct interaction (A → C). Since the number of observations of the real experiment datasets was far less than the number of predictors, some predictors were eliminated by extracting the random subnetworks from global interaction networks via an established extraction method. In addition, the experiment was extended to assess the effectiveness of MLR in dealing with cascade error by using a novel experimental procedure that had been proposed in this work. The experiment revealed that the number of cascade errors had been very minimal. Apart from that, the Belsley collinearity test proved that multicollinearity did affect the datasets used in this experiment greatly. All the tested subnetworks obtained satisfactory results, with AUROC values above 0.5.

  6. Observability of linear systems with saturated outputs

    NARCIS (Netherlands)

    Koplon, R.; Sontag, E.D.; Hautus, M.L.J.

    1994-01-01

    We present necessary and sufficient conditions for observability of the class of output-saturated systems. These are linear systems whose output passes through a saturation function before it can be measured.

  7. Solved problems in dynamical systems and control

    CERN Document Server

    Tenreiro-Machado, J; Valério, Duarte; Galhano, Alexandra M

    2016-01-01

    This book presents a collection of exercises on dynamical systems, modelling and control. Each topic covered includes a summary of the theoretical background, problems with solutions, and further exercises.

  8. Study of solving a Toda dynamic system with loop algebra

    International Nuclear Information System (INIS)

    Zhu Qiao; Yang Zhanying; Shi Kangjie; Wen Junqing

    2006-01-01

    The authors construct a Toda system with Loop algebra, and prove that the Lax equation L=[L,M] can be solved by means of solving a regular Riemann-Hilbert problem. In our system, M in Lax pair is an antisymmetrical matrix, while L=L + + M, and L + is a quasi-upper triangular matrix of loop algebra. In order to check our result, the authors exactly solve an R-H problem under a given initial condition as an example. (authors)

  9. GPU acceleration of preconditioned solvers for ill-conditioned linear systems

    NARCIS (Netherlands)

    Gupta, R.

    2015-01-01

    In this work we study the implementations of deflation and preconditioning techniques for solving ill-conditioned linear systems using iterative methods. Solving such systems can be a time-consuming process because of the jumps in the coefficients due to large difference in material properties. We

  10. Algebraic polynomial system solving and applications

    NARCIS (Netherlands)

    Bleylevens, I.W.M.

    2010-01-01

    The problem of computing the solutions of a system of multivariate polynomial equations can be approached by the Stetter-Möller matrix method which casts the problem into a large eigenvalue problem. This Stetter-Möller matrix method forms the starting point for the development of computational

  11. Solving large linear systems in an implicit thermohaline ocean model

    NARCIS (Netherlands)

    de Niet, Arie Christiaan

    2007-01-01

    The climate on earth is largely determined by the global ocean circulation. Hence it is important to predict how the flow will react to perturbation by for example melting icecaps. To answer questions about the stability of the global ocean flow, a computer model has been developed that is able to

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

  13. Isolators Including Main Spring Linear Guide Systems

    Science.gov (United States)

    Goold, Ryan (Inventor); Buchele, Paul (Inventor); Hindle, Timothy (Inventor); Ruebsamen, Dale Thomas (Inventor)

    2017-01-01

    Embodiments of isolators, such as three parameter isolators, including a main spring linear guide system are provided. In one embodiment, the isolator includes first and second opposing end portions, a main spring mechanically coupled between the first and second end portions, and a linear guide system extending from the first end portion, across the main spring, and toward the second end portion. The linear guide system expands and contracts in conjunction with deflection of the main spring along the working axis, while restricting displacement and rotation of the main spring along first and second axes orthogonal to the working axis.

  14. Constraints to solve parallelogram grid problems in 2D non separable linear canonical transform

    Science.gov (United States)

    Zhao, Liang; Healy, John J.; Muniraj, Inbarasan; Cui, Xiao-Guang; Malallah, Ra'ed; Ryle, James P.; Sheridan, John T.

    2017-05-01

    The 2D non-separable linear canonical transform (2D-NS-LCT) can model a range of various paraxial optical systems. Digital algorithms to evaluate the 2D-NS-LCTs are important in modeling the light field propagations and also of interest in many digital signal processing applications. In [Zhao 14] we have reported that a given 2D input image with rectangular shape/boundary, in general, results in a parallelogram output sampling grid (generally in an affine coordinates rather than in a Cartesian coordinates) thus limiting the further calculations, e.g. inverse transform. One possible solution is to use the interpolation techniques; however, it reduces the speed and accuracy of the numerical approximations. To alleviate this problem, in this paper, some constraints are derived under which the output samples are located in the Cartesian coordinates. Therefore, no interpolation operation is required and thus the calculation error can be significantly eliminated.

  15. Linear systems a measurement based approach

    CERN Document Server

    Bhattacharyya, S P; Mohsenizadeh, D N

    2014-01-01

    This brief presents recent results obtained on the analysis, synthesis and design of systems described by linear equations. It is well known that linear equations arise in most branches of science and engineering as well as social, biological and economic systems. The novelty of this approach is that no models of the system are assumed to be available, nor are they required. Instead, a few measurements made on the system can be processed strategically to directly extract design values that meet specifications without constructing a model of the system, implicitly or explicitly. These new concepts are illustrated by applying them to linear DC and AC circuits, mechanical, civil and hydraulic systems, signal flow block diagrams and control systems. These applications are preliminary and suggest many open problems. The results presented in this brief are the latest effort in this direction and the authors hope these will lead to attractive alternatives to model-based design of engineering and other systems.

  16. Final focus systems for linear colliders

    International Nuclear Information System (INIS)

    Erickson, R.A.

    1987-11-01

    The final focus system of a linear collider must perform two primary functions, it must focus the two opposing beams so that their transverse dimensions at the interaction point are small enough to yield acceptable luminosity, and it must steer the beams together to maintain collisions. In addition, the final focus system must transport the outgoing beams to a location where they can be recycled or safely dumped. Elementary optical considerations for linear collider final focus systems are discussed, followed by chromatic aberrations. The design of the final focus system of the SLAC Linear Collider (SLC) is described. Tuning and diagnostics and steering to collision are discussed. Most of the examples illustrating the concepts covered are drawn from the SLC, but the principles and conclusions are said to be generally applicable to other linear collider designs as well. 26 refs., 17 figs

  17. On deformations of linear differential systems

    NARCIS (Netherlands)

    Gontsov, R.R.; Poberezhnyi, V.A.; Helminck, G.F.

    2011-01-01

    This article concerns deformations of meromorphic linear differential systems. Problems relating to their existence and classification are reviewed, and the global and local behaviour of solutions to deformation equations in a neighbourhood of their singular set is analysed. Certain classical

  18. Superconducting linear accelerator system for NSC

    Indian Academy of Sciences (India)

    59, No. 5. — journal of. November 2002 physics pp. 849–858. Superconducting linear accelerator system for NSC ... cryogenics facility, RF electronics development, facilities for fabricating niobium resonators indige- ... Prototype resonator was.

  19. Row Reduced Echelon Form for Solving Fully Fuzzy System with Unknown Coefficients

    Directory of Open Access Journals (Sweden)

    Ghassan Malkawi

    2014-08-01

    Full Text Available This study proposes a new method for finding a feasible fuzzy solution in positive Fully Fuzzy Linear System (FFLS, where the coefficients are unknown. The fully fuzzy system is transferred to linear system in order to obtain the solution using row reduced echelon form, thereafter; the crisp solution is restricted in obtaining the positive fuzzy solution. The fuzzy solution of FFLS is included crisp intervals, to assign alternative values of unknown entries of fuzzy numbers. To illustrate the proposed method, numerical examples are solved, where the entries of coefficients are unknown in right or left hand side, to demonstrate the contributions in this study.

  20. Signals and transforms in linear systems analysis

    CERN Document Server

    Wasylkiwskyj, Wasyl

    2013-01-01

    Signals and Transforms in Linear Systems Analysis covers the subject of signals and transforms, particularly in the context of linear systems theory. Chapter 2 provides the theoretical background for the remainder of the text. Chapter 3 treats Fourier series and integrals. Particular attention is paid to convergence properties at step discontinuities. This includes the Gibbs phenomenon and its amelioration via the Fejer summation techniques. Special topics include modulation and analytic signal representation, Fourier transforms and analytic function theory, time-frequency analysis and frequency dispersion. Fundamentals of linear system theory for LTI analogue systems, with a brief account of time-varying systems, are covered in Chapter 4 . Discrete systems are covered in Chapters 6 and 7.  The Laplace transform treatment in Chapter 5 relies heavily on analytic function theory as does Chapter 8 on Z -transforms. The necessary background on complex variables is provided in Appendix A. This book is intended to...

  1. Linear integral equations and soliton systems

    International Nuclear Information System (INIS)

    Quispel, G.R.W.

    1983-01-01

    A study is presented of classical integrable dynamical systems in one temporal and one spatial dimension. The direct linearizations are given of several nonlinear partial differential equations, for example the Korteweg-de Vries equation, the modified Korteweg-de Vries equation, the sine-Gordon equation, the nonlinear Schroedinger equation, and the equation of motion for the isotropic Heisenberg spin chain; the author also discusses several relations between these equations. The Baecklund transformations of these partial differential equations are treated on the basis of a singular transformation of the measure (or equivalently of the plane-wave factor) occurring in the corresponding linear integral equations, and the Baecklund transformations are used to derive the direct linearization of a chain of so-called modified partial differential equations. Finally it is shown that the singular linear integral equations lead in a natural way to the direct linearizations of various nonlinear difference-difference equations. (Auth.)

  2. Solving the linearized forward-speed radiation problem using a high-order finite difference method on overlapping grids

    DEFF Research Database (Denmark)

    Amini Afshar, Mostafa; Bingham, Harry B.

    2017-01-01

    . Frequency-domain results are then obtained from a Fourier transform of the force and motion signals. In order to make a robust Fourier transform, and capture the response around the critical frequency, the tail of the force signal is asymptotically extrapolated assuming a linear decay rate. Fourth......The linearized potential flow approximation for the forward speed radiation problem is solved in the time domain using a high-order finite difference method. The finite-difference discretization is developed on overlapping, curvilinear body-fitted grids. To ensure numerical stability...

  3. STABILITY OF LINEAR SYSTEMS WITH MARKOVIAN JUMPS

    Directory of Open Access Journals (Sweden)

    Jorge Enrique Mayta Guillermo

    2016-12-01

    Full Text Available In this work we will analyze the stability of linear systems governed by a Markov chain, this family is known in the specialized literature as linear systems with Markov jumps or by its acronyms in English MJLS as it is denoted in [1]. Linear systems governed by a Markov chain are dynamic systems with abrupt changes. We give some denitions of stability for the MJLS system, where these types of stability are equivalent as long as the state space of the Markov chain is nite. Finally we present a theorem that characterizes the stochastic stability by means of an equation of the Lyapunov type. The result is a generalization of a theorem in classical theory.

  4. Multiparameter extrapolation and deflation methods for solving equation systems

    Directory of Open Access Journals (Sweden)

    A. J. Hughes Hallett

    1984-01-01

    Full Text Available Most models in economics and the applied sciences are solved by first order iterative techniques, usually those based on the Gauss-Seidel algorithm. This paper examines the convergence of multiparameter extrapolations (accelerations of first order iterations, as an improved approximation to the Newton method for solving arbitrary nonlinear equation systems. It generalises my earlier results on single parameter extrapolations. Richardson's generalised method and the deflation method for detecting successive solutions in nonlinear equation systems are also presented as multiparameter extrapolations of first order iterations. New convergence results are obtained for those methods.

  5. Introduction to linear systems of differential equations

    CERN Document Server

    Adrianova, L Ya

    1995-01-01

    The theory of linear systems of differential equations is one of the cornerstones of the whole theory of differential equations. At its root is the concept of the Lyapunov characteristic exponent. In this book, Adrianova presents introductory material and further detailed discussions of Lyapunov exponents. She also discusses the structure of the space of solutions of linear systems. Classes of linear systems examined are from the narrowest to widest: 1)�autonomous, 2)�periodic, 3)�reducible to autonomous, 4)�nearly reducible to autonomous, 5)�regular. In addition, Adrianova considers the following: stability of linear systems and the influence of perturbations of the coefficients on the stability the criteria of uniform stability and of uniform asymptotic stability in terms of properties of the solutions several estimates of the growth rate of solutions of a linear system in terms of its coefficients How perturbations of the coefficients change all the elements of the spectrum of the system is defin...

  6. Representation of Students in Solving Simultaneous Linear Equation Problems Based on Multiple Intelligence

    Science.gov (United States)

    Yanti, Y. R.; Amin, S. M.; Sulaiman, R.

    2018-01-01

    This study described representation of students who have musical, logical-mathematic and naturalist intelligence in solving a problem. Subjects were selected on the basis of multiple intelligence tests (TPM) consists of 108 statements, with 102 statements adopted from Chislet and Chapman and 6 statements equal to eksistensial intelligences. Data were analyzed based on problem-solving tests (TPM) and interviewing. See the validity of the data then problem-solving tests (TPM) and interviewing is given twice with an analyzed using the representation indikator and the problem solving step. The results showed that: the stage of presenting information known, stage of devising a plan, and stage of carrying out the plan those three subjects were using same form of representation. While he stage of presenting information asked and stage of looking back, subject of logical-mathematic was using different forms of representation with subjects of musical and naturalist intelligence. From this research is expected to provide input to the teacher in determining the learning strategy that will be used by considering the representation of students with the basis of multiple intelligences.

  7. Final Focus Systems in Linear Colliders

    International Nuclear Information System (INIS)

    Raubenheimer, Tor

    1998-01-01

    In colliding beam facilities, the ''final focus system'' must demagnify the beams to attain the very small spot sizes required at the interaction points. The first final focus system with local chromatic correction was developed for the Stanford Linear Collider where very large demagnifications were desired. This same conceptual design has been adopted by all the future linear collider designs as well as the SuperConducting Supercollider, the Stanford and KEK B-Factories, and the proposed Muon Collider. In this paper, the over-all layout, physics constraints, and optimization techniques relevant to the design of final focus systems for high-energy electron-positron linear colliders are reviewed. Finally, advanced concepts to avoid some of the limitations of these systems are discussed

  8. Generalized Cross-Gramian for Linear Systems

    DEFF Research Database (Denmark)

    Shaker, Hamid Reza

    2012-01-01

    The cross-gramian is a well-known matrix with embedded controllability and observability information. The cross-gramian is related to the Hankel operator and the Hankel singular values of a linear square system and it has several interesting properties. These properties make the cross...... square symmetric systems, the ordinary cross-gramian does not exist. To cope with this problem, a new generalized cross-gramian is introduced in this paper. In contrast to the ordinary cross-gramian, the generalized cross-gramian can be easily obtained for general linear systems and therefore can be used...

  9. Linear dynamic coupling in geared rotor systems

    Science.gov (United States)

    David, J. W.; Mitchell, L. D.

    1986-01-01

    The effects of high frequency oscillations caused by the gear mesh, on components of a geared system that can be modeled as rigid discs are analyzed using linear dynamic coupling terms. The coupled, nonlinear equations of motion for a disc attached to a rotating shaft are presented. The results of a trial problem analysis show that the inclusion of the linear dynamic coupling terms can produce significant changes in the predicted response of geared rotor systems, and that the produced sideband responses are greater than the unbalanced response. The method is useful in designing gear drives for heavy-lift helicopters, industrial speed reducers, naval propulsion systems, and heavy off-road equipment.

  10. On output regulation for linear systems

    NARCIS (Netherlands)

    Saberi, Ali; Stoorvogel, Antonie Arij; Sannuti, Peddapullaiah

    For both continuous- and discrete-time systems, we revisit the output regulation problem for linear systems. We generalize the problem formulation in order • to expand the class of reference or disturbance signals, • to utilize the derivative or feedforward information of reference signals whenever

  11. Linear response theory for quantum open systems

    OpenAIRE

    Wei, J. H.; Yan, YiJing

    2011-01-01

    Basing on the theory of Feynman's influence functional and its hierarchical equations of motion, we develop a linear response theory for quantum open systems. Our theory provides an effective way to calculate dynamical observables of a quantum open system at its steady-state, which can be applied to various fields of non-equilibrium condensed matter physics.

  12. When to call a linear system nonnegative

    NARCIS (Netherlands)

    Nieuwenhuis, J.W.

    1998-01-01

    In this paper we will consider discrete time invariant linear systems that allow for an input-state-output representation with a finite dimensional state space, and that have a finite number of inputs and outputs. The basic issue in this paper is when to call these systems nonnegative. An important

  13. Tikhonov theorem for linear hyperbolic systems

    OpenAIRE

    Tang , Ying; Prieur , Christophe; Girard , Antoine

    2015-01-01

    International audience; A class of linear systems of conservation laws with a small perturbation parameter is introduced. By setting the perturbation parameter to zero, two subsystems, the reduced system standing for the slow dynamics and the boundary-layer system representing the fast dynamics, are computed. It is first proved that the exponential stability of the full system implies the stability of both subsystems. Secondly, a counter example is given to indicate that the converse is not t...

  14. On Solving the Lorenz System by Differential Transformation Method

    International Nuclear Information System (INIS)

    Al-Sawalha, M. Mossa; Noorani, M. S. M.

    2008-01-01

    The differential transformation method (DTM) is employed to solve a nonlinear differential equation, namely the Lorenz system. Numerical results are compared to those obtained by the Runge–Kutta method to illustrate the preciseness and effectiveness of the proposed method. In particular, we examine the accuracy of the (DTM) as the Lorenz system changes from a non-chaotic system to a chaotic one. It is shown that the (DTM) is robust, accurate and easy to apply

  15. Linear homotopy solution of nonlinear systems of equations in geodesy

    Science.gov (United States)

    Paláncz, Béla; Awange, Joseph L.; Zaletnyik, Piroska; Lewis, Robert H.

    2010-01-01

    A fundamental task in geodesy is solving systems of equations. Many geodetic problems are represented as systems of multivariate polynomials. A common problem in solving such systems is improper initial starting values for iterative methods, leading to convergence to solutions with no physical meaning, or to convergence that requires global methods. Though symbolic methods such as Groebner bases or resultants have been shown to be very efficient, i.e., providing solutions for determined systems such as 3-point problem of 3D affine transformation, the symbolic algebra can be very time consuming, even with special Computer Algebra Systems (CAS). This study proposes the Linear Homotopy method that can be implemented easily in high-level computer languages like C++ and Fortran that are faster than CAS by at least two orders of magnitude. Using Mathematica, the power of Homotopy is demonstrated in solving three nonlinear geodetic problems: resection, GPS positioning, and affine transformation. The method enlarging the domain of convergence is found to be efficient, less sensitive to rounding of numbers, and has lower complexity compared to other local methods like Newton-Raphson.

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

  17. Fourth order Douglas implicit scheme for solving three dimension reaction diffusion equation with non-linear source term

    Directory of Open Access Journals (Sweden)

    Shahid Hasnain

    2017-07-01

    Full Text Available This research paper represents a numerical approximation to non-linear three dimension reaction diffusion equation with non-linear source term from population genetics. Since various initial and boundary value problems exist in three dimension reaction diffusion phenomena, which are studied numerically by different numerical methods, here we use finite difference schemes (Alternating Direction Implicit and Fourth Order Douglas Implicit to approximate the solution. Accuracy is studied in term of L2, L∞ and relative error norms by random selected grids along time levels for comparison with analytical results. The test example demonstrates the accuracy, efficiency and versatility of the proposed schemes. Numerical results showed that Fourth Order Douglas Implicit scheme is very efficient and reliable for solving 3-D non-linear reaction diffusion equation.

  18. Fourth order Douglas implicit scheme for solving three dimension reaction diffusion equation with non-linear source term

    Science.gov (United States)

    Hasnain, Shahid; Saqib, Muhammad; Mashat, Daoud Suleiman

    2017-07-01

    This research paper represents a numerical approximation to non-linear three dimension reaction diffusion equation with non-linear source term from population genetics. Since various initial and boundary value problems exist in three dimension reaction diffusion phenomena, which are studied numerically by different numerical methods, here we use finite difference schemes (Alternating Direction Implicit and Fourth Order Douglas Implicit) to approximate the solution. Accuracy is studied in term of L2, L∞ and relative error norms by random selected grids along time levels for comparison with analytical results. The test example demonstrates the accuracy, efficiency and versatility of the proposed schemes. Numerical results showed that Fourth Order Douglas Implicit scheme is very efficient and reliable for solving 3-D non-linear reaction diffusion equation.

  19. Conduction cooling systems for linear accelerator cavities

    Science.gov (United States)

    Kephart, Robert

    2017-05-02

    A conduction cooling system for linear accelerator cavities. The system conducts heat from the cavities to a refrigeration unit using at least one cavity cooler interconnected with a cooling connector. The cavity cooler and cooling connector are both made from solid material having a very high thermal conductivity of approximately 1.times.10.sup.4 W m.sup.-1 K.sup.-1 at temperatures of approximately 4 degrees K. This allows for very simple and effective conduction of waste heat from the linear accelerator cavities to the cavity cooler, along the cooling connector, and thence to the refrigeration unit.

  20. Rf system specifications for a linear accelerator

    International Nuclear Information System (INIS)

    Young, A.; Eaton, L.E.

    1992-01-01

    A linear accelerator contains many systems; however, the most complex and costly is the RF system. The goal of an RF system is usually simply stated as maintaining the phase and amplitude of the RF signal within a given tolerance to accelerate the charged particle beam. An RF system that drives a linear accelerator needs a complete system specification, which should contain specifications for all the subsystems (i.e., high-power RF, low-level RF, RF generation/distribution, and automation control). This paper defines a format for the specifications of these subsystems and discusses each RF subsystem independently to provide a comprehensive understanding of the function of each subsystem. This paper concludes with an example of a specification spreadsheet allowing one to input the specifications of a subsystem. Thus, some fundamental parameters (i.e., the cost and size) of the RF system can be determined

  1. Optimal linear precoding for indoor visible light communication system

    KAUST Repository

    Sifaou, Houssem

    2017-07-31

    Visible light communication (VLC) is an emerging technique that uses light-emitting diodes (LED) to combine communication and illumination. It is considered as a promising scheme for indoor wireless communication that can be deployed at reduced costs while offering high data rate performance. In this paper, we focus on the design of the downlink of a multi-user VLC system. Inherent to multi-user systems is the interference caused by the broadcast nature of the medium. Linear precoding based schemes are among the most popular solutions that have recently been proposed to mitigate inter-user interference. This paper focuses on the design of the optimal linear precoding scheme that solves the max-min signal-to-interference-plus-noise ratio (SINR) problem. The performance of the proposed precoding scheme is studied under different working conditions and compared with the classical zero-forcing precoding. Simulations have been provided to illustrate the high gain of the proposed scheme.

  2. Solution methods for large systems of linear equations in BACCHUS

    International Nuclear Information System (INIS)

    Homann, C.; Dorr, B.

    1993-05-01

    The computer programme BACCHUS is used to describe steady state and transient thermal-hydraulic behaviour of a coolant in a fuel element with intact geometry in a fast breeder reactor. In such computer programmes generally large systems of linear equations with sparse matrices of coefficients, resulting from discretization of coolant conservation equations, must be solved thousands of times giving rise to large demands of main storage and CPU time. Direct and iterative solution methods of the systems of linear equations, available in BACCHUS, are described, giving theoretical details and experience with their use in the programme. Besides use of a method of lines, a Runge-Kutta-method, for solution of the partial differential equation is outlined. (orig.) [de

  3. Chaos as an intermittently forced linear system.

    Science.gov (United States)

    Brunton, Steven L; Brunton, Bingni W; Proctor, Joshua L; Kaiser, Eurika; Kutz, J Nathan

    2017-05-30

    Understanding the interplay of order and disorder in chaos is a central challenge in modern quantitative science. Approximate linear representations of nonlinear dynamics have long been sought, driving considerable interest in Koopman theory. We present a universal, data-driven decomposition of chaos as an intermittently forced linear system. This work combines delay embedding and Koopman theory to decompose chaotic dynamics into a linear model in the leading delay coordinates with forcing by low-energy delay coordinates; this is called the Hankel alternative view of Koopman (HAVOK) analysis. This analysis is applied to the Lorenz system and real-world examples including Earth's magnetic field reversal and measles outbreaks. In each case, forcing statistics are non-Gaussian, with long tails corresponding to rare intermittent forcing that precedes switching and bursting phenomena. The forcing activity demarcates coherent phase space regions where the dynamics are approximately linear from those that are strongly nonlinear.The huge amount of data generated in fields like neuroscience or finance calls for effective strategies that mine data to reveal underlying dynamics. Here Brunton et al.develop a data-driven technique to analyze chaotic systems and predict their dynamics in terms of a forced linear model.

  4. Time-optimal feedback control for linear systems

    International Nuclear Information System (INIS)

    Mirica, S.

    1976-01-01

    The paper deals with the results of qualitative investigations of the time-optimal feedback control for linear systems with constant coefficients. In the first section, after some definitions and notations, two examples are given and it is shown that even the time-optimal control problem for linear systems with constant coefficients which looked like ''completely solved'' requires a further qualitative investigation of the stability to ''permanent perturbations'' of optimal feedback control. In the second section some basic results of the linear time-optimal control problem are reviewed. The third section deals with the definition of Boltyanskii's ''regular synthesis'' and its connection to Filippov's theory of right-hand side discontinuous differential equations. In the fourth section a theorem is proved concerning the stability to perturbations of time-optimal feedback control for linear systems with scalar control. In the last two sections it is proved that, if the matrix which defines the system has only real eigenvalues or is three-dimensional, the time-optimal feedback control defines a regular synthesis and therefore is stable to perturbations. (author)

  5. Optimal Robust Fault Detection for Linear Discrete Time Systems

    Directory of Open Access Journals (Sweden)

    Nike Liu

    2008-01-01

    Full Text Available This paper considers robust fault-detection problems for linear discrete time systems. It is shown that the optimal robust detection filters for several well-recognized robust fault-detection problems, such as ℋ−/ℋ∞, ℋ2/ℋ∞, and ℋ∞/ℋ∞ problems, are the same and can be obtained by solving a standard algebraic Riccati equation. Optimal filters are also derived for many other optimization criteria and it is shown that some well-studied and seeming-sensible optimization criteria for fault-detection filter design could lead to (optimal but useless fault-detection filters.

  6. Final focus systems for linear colliders

    International Nuclear Information System (INIS)

    Helm, R.; Irwin, J.

    1992-08-01

    Final focus systems for linear colliders present many exacting challenges in beam optics, component design, and beam quality. Efforts to resolve these problems as they relate to a new generation of linear colliders are under way at several laboratories around the world. We will outline criteria for final focus systems and discuss the current state of understanding and resolution of the outstanding problems. We will discuss tolerances on alignment, field quality and stability for optical elements, and the implications for beam parameters such as emittance, energy spread, bunch length, and stability in position and energy. Beam-based correction procedures, which in principle can alleviate many of the tolerances, will be described. Preliminary results from the Final Focus Test Beam (FFTB) under construction at SLAC will be given. Finally, we mention conclusions from operating experience at the Stanford Linear Collider (SLC)

  7. Final focus systems for linear colliders

    International Nuclear Information System (INIS)

    Helm, R.; Irwing, J.

    1992-01-01

    Final focus systems for linear colliders present many exacting challenges in beam optics, component design, and beam quality. Efforts to resolve these problems as they relate to a new generation of linear colliders are under way at several laboratories around the world. We outline criteria for final focus systems and discuss the current state of understanding and resolution of the outstanding problems. We discuss tolerances on alignment, field quality and stability for optical elements, and the implications for beam parameters such as emittance, energy spread , bunch length, and stability in position and energy. Beam-based correction procedures, which in principle can alleviate many of the tolerances, are described. Preliminary results from the Final Focus Test Beam (FFTB) under construction at SLAC are given. Finally, we mention conclusions from operating experience at the Stanford Linear Collider (SLC). (Author) 16 refs., 4 tabs., 6 figs

  8. Dual-range linearized transimpedance amplifier system

    Science.gov (United States)

    Wessendorf, Kurt O.

    2010-11-02

    A transimpedance amplifier system is disclosed which simultaneously generates a low-gain output signal and a high-gain output signal from an input current signal using a single transimpedance amplifier having two different feedback loops with different amplification factors to generate two different output voltage signals. One of the feedback loops includes a resistor, and the other feedback loop includes another resistor in series with one or more diodes. The transimpedance amplifier system includes a signal linearizer to linearize one or both of the low- and high-gain output signals by scaling and adding the two output voltage signals from the transimpedance amplifier. The signal linearizer can be formed either as an analog device using one or two summing amplifiers, or alternately can be formed as a digital device using two analog-to-digital converters and a digital signal processor (e.g. a microprocessor or a computer).

  9. Solving wave propagation within finite-sized composite media with linear embedding via Green's operators

    NARCIS (Netherlands)

    Lancellotti, V.; Tijhuis, A.G.

    2012-01-01

    The calculation of electromagnetic (EM) fields and waves inside finite-sized structures comprised of different media can benefit from a diakoptics method such as linear embedding via Green's operators (LEGO). Unlike scattering problems, the excitation of EM waves within the bulk dielectric requires

  10. An Interactive Method to Solve Infeasibility in Linear Programming Test Assembling Models

    Science.gov (United States)

    Huitzing, Hiddo A.

    2004-01-01

    In optimal assembly of tests from item banks, linear programming (LP) models have proved to be very useful. Assembly by hand has become nearly impossible, but these LP techniques are able to find the best solutions, given the demands and needs of the test to be assembled and the specifics of the item bank from which it is assembled. However,…

  11. Consys Linear Control System Design Software Package

    International Nuclear Information System (INIS)

    Diamantidis, Z.

    1987-01-01

    This package is created in order to help engineers, researchers, students and all who work on linear control systems. The software includes all time and frequency domain analysises, spectral analysises and networks, active filters and regulators design aids. The programmes are written on Hewlett Packard computer in Basic 4.0

  12. Disturbance Decoupling of Switched Linear Systems

    NARCIS (Netherlands)

    Yurtseven, E.; Heemels, W.P.M.H.; Camlibel, M.K.

    2010-01-01

    In this paper we consider disturbance decoupling problems for switched linear systems. We will provide necessary and sufficient conditions for three different versions of disturbance decoupling, which differ based on which signals are considered to be the disturbance. In the first version the

  13. Collimation systems in the next linear collider

    International Nuclear Information System (INIS)

    Merminga, N.; Irwin, J.; Helm, R.; Ruth, R.D.

    1991-02-01

    Experience indicates that beam collimation will be an essential element of the next generation e + E - linear colliders. A proposal for using nonlinear lenses to drive beam tails to large amplitudes was presented in a previous paper. Here we study the optimization of such systems including effects of wakefields and optical aberrations. Protection and design of the scrapers in these systems are discussed. 9 refs., 7 figs

  14. Standard diffusive systems are well-posed linear systems

    NARCIS (Netherlands)

    Matignon, Denis; Zwart, Heiko J.

    2004-01-01

    The class of well-posed linear systems as introduced by Salamon has become a well-understood class of systems, see e.g. the work of Weiss and the book of Staffans. Many partial partial differential equations with boundary control and point observation can be formulated as a well-posed linear system.

  15. An Improved Search Approach for Solving Non-Convex Mixed-Integer Non Linear Programming Problems

    Science.gov (United States)

    Sitopu, Joni Wilson; Mawengkang, Herman; Syafitri Lubis, Riri

    2018-01-01

    The nonlinear mathematical programming problem addressed in this paper has a structure characterized by a subset of variables restricted to assume discrete values, which are linear and separable from the continuous variables. The strategy of releasing nonbasic variables from their bounds, combined with the “active constraint” method, has been developed. This strategy is used to force the appropriate non-integer basic variables to move to their neighbourhood integer points. Successful implementation of these algorithms was achieved on various test problems.

  16. Solution of linear and nonlinear matrix systems. Application to a nonlinear diffusion equation

    International Nuclear Information System (INIS)

    Bonnet, M.; Meurant, G.

    1978-01-01

    The object of this study is to compare different methods of solving linear and nonlinear algebraic systems and to apply them to the nonlinear system obtained by discretizing a nonlinear diffusion equation. For linear systems the conventional methods of alternating direction type or Gauss Seidel's methods are compared to more recent ones of the type of generalized conjugate gradient; the superiority of the latter is shown by numerical examples. For nonlinear systems, a method of nonlinear conjugate gradient is studied together with Newton's method and some of its variants. It should be noted, however, that Newton's method is found to be more efficient when coupled with a good method for solving the linear system. As a conclusion, these methods are used to solve a nonlinear diffusion problem and the numerical results obtained are compared [fr

  17. Parameter identifiability of linear dynamical systems

    Science.gov (United States)

    Glover, K.; Willems, J. C.

    1974-01-01

    It is assumed that the system matrices of a stationary linear dynamical system were parametrized by a set of unknown parameters. The question considered here is, when can such a set of unknown parameters be identified from the observed data? Conditions for the local identifiability of a parametrization are derived in three situations: (1) when input/output observations are made, (2) when there exists an unknown feedback matrix in the system and (3) when the system is assumed to be driven by white noise and only output observations are made. Also a sufficient condition for global identifiability is derived.

  18. Stability problems for linear hyperbolic systems

    International Nuclear Information System (INIS)

    Eckhoff, K.S.

    1975-05-01

    The stability properties for the trivial solution of a general linear hyperbolic system of partial differential equations of the first order are studied. It is shown that results may be obtained by studying the stability properties of certain systems of ordinary differential equations which can be constructed from the hyperbolic system (the so-called transport equations). In some cases the associated stability problem for the transport equations can in fact be shown to be equivalent to the stability problem for the hyperbolic system, but in general the transport equations will only give the necessary conditions for stability. (Auth.)

  19. Identification of general linear mechanical systems

    Science.gov (United States)

    Sirlin, S. W.; Longman, R. W.; Juang, J. N.

    1983-01-01

    Previous work in identification theory has been concerned with the general first order time derivative form. Linear mechanical systems, a large and important class, naturally have a second order form. This paper utilizes this additional structural information for the purpose of identification. A realization is obtained from input-output data, and then knowledge of the system input, output, and inertia matrices is used to determine a set of linear equations whereby we identify the remaining unknown system matrices. Necessary and sufficient conditions on the number, type and placement of sensors and actuators are given which guarantee identificability, and less stringent conditions are given which guarantee generic identifiability. Both a priori identifiability and a posteriori identifiability are considered, i.e., identifiability being insured prior to obtaining data, and identifiability being assured with a given data set.

  20. Linear systems optimal and robust control

    CERN Document Server

    Sinha, Alok

    2007-01-01

    Introduction Overview Contents of the Book State Space Description of a Linear System Transfer Function of a Single Input/Single Output (SISO) System State Space Realizations of a SISO System SISO Transfer Function from a State Space Realization Solution of State Space Equations Observability and Controllability of a SISO System Some Important Similarity Transformations Simultaneous Controllability and Observability Multiinput/Multioutput (MIMO) Systems State Space Realizations of a Transfer Function Matrix Controllability and Observability of a MIMO System Matrix-Fraction Description (MFD) MFD of a Transfer Function Matrix for the Minimal Order of a State Space Realization Controller Form Realization from a Right MFD Poles and Zeros of a MIMO Transfer Function Matrix Stability Analysis State Feedback Control and Optimization State Variable Feedback for a Single Input System Computation of State Feedback Gain Matrix for a Multiinput System State Feedback Gain Matrix for a Multi...

  1. MODLP program description: A program for solving linear optimal hydraulic control of groundwater contamination based on MODFLOW simulation. Version 1.0

    International Nuclear Information System (INIS)

    Ahlfeld, D.P.; Dougherty, D.E.

    1994-11-01

    MODLP is a computational tool that may help design capture zones for controlling the movement of contaminated groundwater. It creates and solves linear optimization programs that contain constraints on hydraulic head or head differences in a groundwater system. The groundwater domain is represented by USGS MODFLOW groundwater flow simulation model. This document describes the general structure of the computer program, MODLP, the types of constraints that may be imposed, detailed input instructions, interpretation of the output, and the interaction with the MODFLOW simulation kernel

  2. Solving the linear radiation problem using a volume method on an overset grid

    DEFF Research Database (Denmark)

    Read, Robert; Bingham, Harry B.

    2012-01-01

    of numerical results with established analytical solutions. The linear radiation problem is considered in this paper. A two-dimensional computational tool has been developed to calculate the force applied to a floating body of arbitrary form in response to a prescribed displacement. Fourier transforms......This paper describes recent progress towards the development of a computational tool, based on potential ow theory, that can accurately and effciently simulate wave-induced loadings on marine structures. Engsig-Karup et al. (2009) have successfully developed an arbitrary-order, finite...

  3. Exp-function method for solving Maccari's system

    International Nuclear Information System (INIS)

    Zhang Sheng

    2007-01-01

    In this Letter, the Exp-function method is used to seek exact solutions of Maccari's system. As a result, single and combined generalized solitonary solutions are obtained, from which some known solutions obtained by extended sine-Gordon equation method and improved hyperbolic function method are recovered as special cases. It is shown that the Exp-function method provides a very effective and powerful mathematical tool for solving nonlinear evolution equations in mathematical physics

  4. System to solve three designs of the fuel management

    International Nuclear Information System (INIS)

    Castillo M, J. A.; Ortiz S, J. J.; Montes T, J. L.; Perusquia del C, R.; Marinez R, R.

    2015-09-01

    In this paper preliminary results are presented, obtained with the development of a computer system that resolves three stages of the nuclear fuel management, which are: the axial and radial designs of fuel, as well as the design of nuclear fuel reloads. The novelty of the system is that the solution is obtained solving the 3 mentioned stages, in coupled form. For this, heuristic techniques are used for each stage, in each one of these has a function objective that is applied to particular problems, but in all cases the obtained partial results are used as input data for the next stage. The heuristic techniques that were used to solve the coupled problem are: tabu search, neural networks and a hybrid between the scatter search and path re linking. The system applies an iterative process from the design of a fuel cell to the reload design, since are preliminary results the reload is designed using the operation strategy Haling type. In each one of the stages nuclear parameters inherent to the design are monitored. The results so far show the advantage of solving the problem in a coupled manner, even when a large amount of computer resources is used. (Author)

  5. An extended GS method for dense linear systems

    Science.gov (United States)

    Niki, Hiroshi; Kohno, Toshiyuki; Abe, Kuniyoshi

    2009-09-01

    Davey and Rosindale [K. Davey, I. Rosindale, An iterative solution scheme for systems of boundary element equations, Internat. J. Numer. Methods Engrg. 37 (1994) 1399-1411] derived the GSOR method, which uses an upper triangular matrix [Omega] in order to solve dense linear systems. By applying functional analysis, the authors presented an expression for the optimum [Omega]. Moreover, Davey and Bounds [K. Davey, S. Bounds, A generalized SOR method for dense linear systems of boundary element equations, SIAM J. Comput. 19 (1998) 953-967] also introduced further interesting results. In this note, we employ a matrix analysis approach to investigate these schemes, and derive theorems that compare these schemes with existing preconditioners for dense linear systems. We show that the convergence rate of the Gauss-Seidel method with preconditioner PG is superior to that of the GSOR method. Moreover, we define some splittings associated with the iterative schemes. Some numerical examples are reported to confirm the theoretical analysis. We show that the EGS method with preconditioner produces an extremely small spectral radius in comparison with the other schemes considered.

  6. Numerical Platon: A unified linear equation solver interface by CEA for solving open foe scientific applications

    International Nuclear Information System (INIS)

    Secher, Bernard; Belliard, Michel; Calvin, Christophe

    2009-01-01

    This paper describes a tool called 'Numerical Platon' developed by the French Atomic Energy Commission (CEA). It provides a freely available (GNU LGPL license) interface for coupling scientific computing applications to various freeware linear solver libraries (essentially PETSc, SuperLU and HyPre), together with some proprietary CEA solvers, for high-performance computers that may be used in industrial software written in various programming languages. This tool was developed as part of considerable efforts by the CEA Nuclear Energy Division in the past years to promote massively parallel software and on-shelf parallel tools to help develop new generation simulation codes. After the presentation of the package architecture and the available algorithms, we show examples of how Numerical Platon is used in sequential and parallel CEA codes. Comparing with in-house solvers, the gain in terms of increases in computation capacities or in terms of parallel performances is notable, without considerable extra development cost

  7. Numerical Platon: A unified linear equation solver interface by CEA for solving open foe scientific applications

    Energy Technology Data Exchange (ETDEWEB)

    Secher, Bernard [French Atomic Energy Commission (CEA), Nuclear Energy Division (DEN) (France); CEA Saclay DM2S/SFME/LGLS, Bat. 454, F-91191 Gif-sur-Yvette Cedex (France)], E-mail: bsecher@cea.fr; Belliard, Michel [French Atomic Energy Commission (CEA), Nuclear Energy Division (DEN) (France); CEA Cadarache DER/SSTH/LMDL, Bat. 238, F-13108 Saint-Paul-lez-Durance Cedex (France); Calvin, Christophe [French Atomic Energy Commission (CEA), Nuclear Energy Division (DEN) (France); CEA Saclay DM2S/SERMA/LLPR, Bat. 470, F-91191 Gif-sur-Yvette Cedex (France)

    2009-01-15

    This paper describes a tool called 'Numerical Platon' developed by the French Atomic Energy Commission (CEA). It provides a freely available (GNU LGPL license) interface for coupling scientific computing applications to various freeware linear solver libraries (essentially PETSc, SuperLU and HyPre), together with some proprietary CEA solvers, for high-performance computers that may be used in industrial software written in various programming languages. This tool was developed as part of considerable efforts by the CEA Nuclear Energy Division in the past years to promote massively parallel software and on-shelf parallel tools to help develop new generation simulation codes. After the presentation of the package architecture and the available algorithms, we show examples of how Numerical Platon is used in sequential and parallel CEA codes. Comparing with in-house solvers, the gain in terms of increases in computation capacities or in terms of parallel performances is notable, without considerable extra development cost.

  8. Global stabilization of linear continuous time-varying systems with bounded controls

    International Nuclear Information System (INIS)

    Phat, V.N.

    2004-08-01

    This paper deals with the problem of global stabilization of a class of linear continuous time-varying systems with bounded controls. Based on the controllability of the nominal system, a sufficient condition for the global stabilizability is proposed without solving any Riccati differential equation. Moreover, we give sufficient conditions for the robust stabilizability of perturbation/uncertain linear time-varying systems with bounded controls. (author)

  9. Lectures on algebraic system theory: Linear systems over rings

    Science.gov (United States)

    Kamen, E. W.

    1978-01-01

    The presentation centers on four classes of systems that can be treated as linear systems over a ring. These are: (1) discrete-time systems over a ring of scalars such as the integers; (2) continuous-time systems containing time delays; (3) large-scale discrete-time systems; and (4) time-varying discrete-time systems.

  10. A toolbox to solve coupled systems of differential and difference equations

    International Nuclear Information System (INIS)

    Ablinger, Jakob; Schneider, Carsten; Bluemlein, Johannes; Freitas, Abilio de

    2016-01-01

    We present algorithms to solve coupled systems of linear differential equations, arising in the calculation of massive Feynman diagrams with local operator insertions at 3-loop order, which do not request special choices of bases. Here we assume that the desired solution has a power series representation and we seek for the coefficients in closed form. In particular, if the coefficients depend on a small parameter ε (the dimensional parameter), we assume that the coefficients themselves can be expanded in formal Laurent series w.r.t. ε and we try to compute the first terms in closed form. More precisely, we have a decision algorithm which solves the following problem: if the terms can be represented by an indefinite nested hypergeometric sum expression (covering as special cases the harmonic sums, cyclotomic sums, generalized harmonic sums or nested binomial sums), then we can calculate them. If the algorithm fails, we obtain a proof that the terms cannot be represented by the class of indefinite nested hypergeometric sum expressions. Internally, this problem is reduced by holonomic closure properties to solving a coupled system of linear difference equations. The underlying method in this setting relies on decoupling algorithms, difference ring algorithms and recurrence solving. We demonstrate by a concrete example how this algorithm can be applied with the new Mathematica package SolveCoupledSystem which is based on the packages Sigma, HarmonicSums and OreSys. In all applications the representation in x-space is obtained as an iterated integral representation over general alphabets, generalizing Poincare iterated integrals.

  11. A toolbox to solve coupled systems of differential and difference equations

    Energy Technology Data Exchange (ETDEWEB)

    Ablinger, Jakob; Schneider, Carsten [Linz Univ. (Austria). Research Inst. for Symbolic Computation (RISC); Bluemlein, Johannes; Freitas, Abilio de [DESY Zeuthen (Germany)

    2016-01-15

    We present algorithms to solve coupled systems of linear differential equations, arising in the calculation of massive Feynman diagrams with local operator insertions at 3-loop order, which do not request special choices of bases. Here we assume that the desired solution has a power series representation and we seek for the coefficients in closed form. In particular, if the coefficients depend on a small parameter ε (the dimensional parameter), we assume that the coefficients themselves can be expanded in formal Laurent series w.r.t. ε and we try to compute the first terms in closed form. More precisely, we have a decision algorithm which solves the following problem: if the terms can be represented by an indefinite nested hypergeometric sum expression (covering as special cases the harmonic sums, cyclotomic sums, generalized harmonic sums or nested binomial sums), then we can calculate them. If the algorithm fails, we obtain a proof that the terms cannot be represented by the class of indefinite nested hypergeometric sum expressions. Internally, this problem is reduced by holonomic closure properties to solving a coupled system of linear difference equations. The underlying method in this setting relies on decoupling algorithms, difference ring algorithms and recurrence solving. We demonstrate by a concrete example how this algorithm can be applied with the new Mathematica package SolveCoupledSystem which is based on the packages Sigma, HarmonicSums and OreSys. In all applications the representation in x-space is obtained as an iterated integral representation over general alphabets, generalizing Poincare iterated integrals.

  12. Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory

    KAUST Repository

    Richtarik, Peter; Taká č, Martin

    2017-01-01

    We develop a family of reformulations of an arbitrary consistent linear system into a stochastic problem. The reformulations are governed by two user-defined parameters: a positive definite matrix defining a norm, and an arbitrary discrete or continuous distribution over random matrices. Our reformulation has several equivalent interpretations, allowing for researchers from various communities to leverage their domain specific insights. In particular, our reformulation can be equivalently seen as a stochastic optimization problem, stochastic linear system, stochastic fixed point problem and a probabilistic intersection problem. We prove sufficient, and necessary and sufficient conditions for the reformulation to be exact. Further, we propose and analyze three stochastic algorithms for solving the reformulated problem---basic, parallel and accelerated methods---with global linear convergence rates. The rates can be interpreted as condition numbers of a matrix which depends on the system matrix and on the reformulation parameters. This gives rise to a new phenomenon which we call stochastic preconditioning, and which refers to the problem of finding parameters (matrix and distribution) leading to a sufficiently small condition number. Our basic method can be equivalently interpreted as stochastic gradient descent, stochastic Newton method, stochastic proximal point method, stochastic fixed point method, and stochastic projection method, with fixed stepsize (relaxation parameter), applied to the reformulations.

  13. Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory

    KAUST Repository

    Richtarik, Peter

    2017-06-04

    We develop a family of reformulations of an arbitrary consistent linear system into a stochastic problem. The reformulations are governed by two user-defined parameters: a positive definite matrix defining a norm, and an arbitrary discrete or continuous distribution over random matrices. Our reformulation has several equivalent interpretations, allowing for researchers from various communities to leverage their domain specific insights. In particular, our reformulation can be equivalently seen as a stochastic optimization problem, stochastic linear system, stochastic fixed point problem and a probabilistic intersection problem. We prove sufficient, and necessary and sufficient conditions for the reformulation to be exact. Further, we propose and analyze three stochastic algorithms for solving the reformulated problem---basic, parallel and accelerated methods---with global linear convergence rates. The rates can be interpreted as condition numbers of a matrix which depends on the system matrix and on the reformulation parameters. This gives rise to a new phenomenon which we call stochastic preconditioning, and which refers to the problem of finding parameters (matrix and distribution) leading to a sufficiently small condition number. Our basic method can be equivalently interpreted as stochastic gradient descent, stochastic Newton method, stochastic proximal point method, stochastic fixed point method, and stochastic projection method, with fixed stepsize (relaxation parameter), applied to the reformulations.

  14. Conjugate gradient type methods for linear systems with complex symmetric coefficient matrices

    Science.gov (United States)

    Freund, Roland

    1989-01-01

    We consider conjugate gradient type methods for the solution of large sparse linear system Ax equals b with complex symmetric coefficient matrices A equals A(T). Such linear systems arise in important applications, such as the numerical solution of the complex Helmholtz equation. Furthermore, most complex non-Hermitian linear systems which occur in practice are actually complex symmetric. We investigate conjugate gradient type iterations which are based on a variant of the nonsymmetric Lanczos algorithm for complex symmetric matrices. We propose a new approach with iterates defined by a quasi-minimal residual property. The resulting algorithm presents several advantages over the standard biconjugate gradient method. We also include some remarks on the obvious approach to general complex linear systems by solving equivalent real linear systems for the real and imaginary parts of x. Finally, numerical experiments for linear systems arising from the complex Helmholtz equation are reported.

  15. Robust linear discriminant models to solve financial crisis in banking sectors

    Science.gov (United States)

    Lim, Yai-Fung; Yahaya, Sharipah Soaad Syed; Idris, Faoziah; Ali, Hazlina; Omar, Zurni

    2014-12-01

    Linear discriminant analysis (LDA) is a widely-used technique in patterns classification via an equation which will minimize the probability of misclassifying cases into their respective categories. However, the performance of classical estimators in LDA highly depends on the assumptions of normality and homoscedasticity. Several robust estimators in LDA such as Minimum Covariance Determinant (MCD), S-estimators and Minimum Volume Ellipsoid (MVE) are addressed by many authors to alleviate the problem of non-robustness of the classical estimates. In this paper, we investigate on the financial crisis of the Malaysian banking institutions using robust LDA and classical LDA methods. Our objective is to distinguish the "distress" and "non-distress" banks in Malaysia by using the LDA models. Hit ratio is used to validate the accuracy predictive of LDA models. The performance of LDA is evaluated by estimating the misclassification rate via apparent error rate. The results and comparisons show that the robust estimators provide a better performance than the classical estimators for LDA.

  16. Yager’s ranking method for solving the trapezoidal fuzzy number linear programming

    Science.gov (United States)

    Karyati; Wutsqa, D. U.; Insani, N.

    2018-03-01

    In the previous research, the authors have studied the fuzzy simplex method for trapezoidal fuzzy number linear programming based on the Maleki’s ranking function. We have found some theories related to the term conditions for the optimum solution of fuzzy simplex method, the fuzzy Big-M method, the fuzzy two-phase method, and the sensitivity analysis. In this research, we study about the fuzzy simplex method based on the other ranking function. It is called Yager's ranking function. In this case, we investigate the optimum term conditions. Based on the result of research, it is found that Yager’s ranking function is not like Maleki’s ranking function. Using the Yager’s function, the simplex method cannot work as well as when using the Maleki’s function. By using the Yager’s function, the value of the subtraction of two equal fuzzy numbers is not equal to zero. This condition makes the optimum table of the fuzzy simplex table is undetected. As a result, the simplified fuzzy simplex table becomes stopped and does not reach the optimum solution.

  17. An injection system for a linear accelerator

    International Nuclear Information System (INIS)

    Santos, A.C.R.

    1978-03-01

    An injection system for the Linear Accelerator is developed using the parameters of machines at the Centro Brasileiro de Pesquisas Fisicas and the Instituto Militar de Engenharia. The proposed system consists basically of a prebuncher and a chopper. The pre-buncher is used to improve the energy resolution and also to increase the accelerator target current. The chopper is used to remove from the beam the electrons that have no possibility of attaining the desired energy and that are usually lost in the walls and the cavity tube, thus producing undesirable background. Theoretical development of the chopper is performed in order to obtain its dimensions for future construction. The complete design the pre-buncher and its feed supply system and the experimental verication of its performance are also presented. It is intended to give the necessary information for the design and construction of the complete injection system proposed. (Author) [pt

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

  19. Solving the stability-accuracy-diversity dilemma of recommender systems

    Science.gov (United States)

    Hou, Lei; Liu, Kecheng; Liu, Jianguo; Zhang, Runtong

    2017-02-01

    Recommender systems are of great significance in predicting the potential interesting items based on the target user's historical selections. However, the recommendation list for a specific user has been found changing vastly when the system changes, due to the unstable quantification of item similarities, which is defined as the recommendation stability problem. To improve the similarity stability and recommendation stability is crucial for the user experience enhancement and the better understanding of user interests. While the stability as well as accuracy of recommendation could be guaranteed by recommending only popular items, studies have been addressing the necessity of diversity which requires the system to recommend unpopular items. By ranking the similarities in terms of stability and considering only the most stable ones, we present a top- n-stability method based on the Heat Conduction algorithm (denoted as TNS-HC henceforth) for solving the stability-accuracy-diversity dilemma. Experiments on four benchmark data sets indicate that the TNS-HC algorithm could significantly improve the recommendation stability and accuracy simultaneously and still retain the high-diversity nature of the Heat Conduction algorithm. Furthermore, we compare the performance of the TNS-HC algorithm with a number of benchmark recommendation algorithms. The result suggests that the TNS-HC algorithm is more efficient in solving the stability-accuracy-diversity triple dilemma of recommender systems.

  20. Efficient Method to Approximately Solve Retrial Systems with Impatience

    Directory of Open Access Journals (Sweden)

    Jose Manuel Gimenez-Guzman

    2012-01-01

    Full Text Available We present a novel technique to solve multiserver retrial systems with impatience. Unfortunately these systems do not present an exact analytic solution, so it is mandatory to resort to approximate techniques. This novel technique does not rely on the numerical solution of the steady-state Kolmogorov equations of the Continuous Time Markov Chain as it is common for this kind of systems but it considers the system in its Markov Decision Process setting. This technique, known as value extrapolation, truncates the infinite state space using a polynomial extrapolation method to approach the states outside the truncated state space. A numerical evaluation is carried out to evaluate this technique and to compare its performance with previous techniques. The obtained results show that value extrapolation greatly outperforms the previous approaches appeared in the literature not only in terms of accuracy but also in terms of computational cost.

  1. Application of ANNs approach for solving fully fuzzy polynomials system

    Directory of Open Access Journals (Sweden)

    R. Novin

    2017-11-01

    Full Text Available In processing indecisive or unclear information, the advantages of fuzzy logic and neurocomputing disciplines should be taken into account and combined by fuzzy neural networks. The current research intends to present a fuzzy modeling method using multi-layer fuzzy neural networks for solving a fully fuzzy polynomials system. To clarify the point, it is necessary to inform that a supervised gradient descent-based learning law is employed. The feasibility of the method is examined using computer simulations on a numerical example. The experimental results obtained from the investigation of the proposed method are valid and delivers very good approximation results.

  2. Multicriteria vehicle routing problem solved by artificial immune system

    Directory of Open Access Journals (Sweden)

    Bogna MRÓWCZYŃSKA

    2015-09-01

    Full Text Available Vehicles route planning in large transportation companies, where drivers are workers, usually takes place on the basis of experience or intuition of the employees. Because of the cost and environmental protection, it is important to save fuel, thus planning routes in an optimal way. In this article an example of the problem is presented solving delivery vans route planning taking into account the distance and travel time within the constraints of vehicle capacities, restrictions on working time of drivers and having varying degrees of movement. An artificial immune system was used for the calculations.

  3. A new efficient analytical method for a system of vibration. Structural analysis using a new technique of partially solving method

    International Nuclear Information System (INIS)

    Gunyasu, Kenzo; Hiramoto, Tsuneyuki; Tanimoto, Mitsumori; Osano, Minetada

    2002-01-01

    We describe a new method for solving large-scale system of linear equations resulting from discretization of ordinary differential equation and partial differential equation directly. This new method effectively reduces the memory capacity requirements and computing time problems for analyses using finite difference method and finite element method. In this paper we have tried to solve one-million linear equations directly for the case that initial displacement and boundary displacement are known about the finite difference scheme of second order inhomogeneous differential equation for vibration of a 10 story structure. Excellent results were got. (author)

  4. Iterative solution of large linear systems

    CERN Document Server

    Young, David Matheson

    1971-01-01

    This self-contained treatment offers a systematic development of the theory of iterative methods. Its focal point resides in an analysis of the convergence properties of the successive overrelaxation (SOR) method, as applied to a linear system with a consistently ordered matrix. The text explores the convergence properties of the SOR method and related techniques in terms of the spectral radii of the associated matrices as well as in terms of certain matrix norms. Contents include a review of matrix theory and general properties of iterative methods; SOR method and stationary modified SOR meth

  5. a Continuous-Time Positive Linear System

    Directory of Open Access Journals (Sweden)

    Kyungsup Kim

    2013-01-01

    Full Text Available This paper discusses a computational method to construct positive realizations with sparse matrices for continuous-time positive linear systems with multiple complex poles. To construct a positive realization of a continuous-time system, we use a Markov sequence similar to the impulse response sequence that is used in the discrete-time case. The existence of the proposed positive realization can be analyzed with the concept of a polyhedral convex cone. We provide a constructive algorithm to compute positive realizations with sparse matrices of some positive systems under certain conditions. A sufficient condition for the existence of a positive realization, under which the proposed constructive algorithm works well, is analyzed.

  6. Stability and Linear Quadratic Differential Games of Discrete-Time Markovian Jump Linear Systems with State-Dependent Noise

    Directory of Open Access Journals (Sweden)

    Huiying Sun

    2014-01-01

    Full Text Available We mainly consider the stability of discrete-time Markovian jump linear systems with state-dependent noise as well as its linear quadratic (LQ differential games. A necessary and sufficient condition involved with the connection between stochastic Tn-stability of Markovian jump linear systems with state-dependent noise and Lyapunov equation is proposed. And using the theory of stochastic Tn-stability, we give the optimal strategies and the optimal cost values for infinite horizon LQ stochastic differential games. It is demonstrated that the solutions of infinite horizon LQ stochastic differential games are concerned with four coupled generalized algebraic Riccati equations (GAREs. Finally, an iterative algorithm is presented to solve the four coupled GAREs and a simulation example is given to illustrate the effectiveness of it.

  7. Linear and non-linear energy barriers in systems of interacting single-domain ferromagnetic particles

    International Nuclear Information System (INIS)

    Petrila, Iulian; Bodale, Ilie; Rotarescu, Cristian; Stancu, Alexandru

    2011-01-01

    A comparative analysis between linear and non-linear energy barriers used for modeling statistical thermally-excited ferromagnetic systems is presented. The linear energy barrier is obtained by new symmetry considerations about the anisotropy energy and the link with the non-linear energy barrier is also presented. For a relevant analysis we compare the effects of linear and non-linear energy barriers implemented in two different models: Preisach-Neel and Ising-Metropolis. The differences between energy barriers which are reflected in different coercive field dependence of the temperature are also presented. -- Highlights: → The linear energy barrier is obtained from symmetry considerations. → The linear and non-linear energy barriers are calibrated and implemented in Preisach-Neel and Ising-Metropolis models. → The temperature and time effects of the linear and non-linear energy barriers are analyzed.

  8. Synthesis of models for order-sorted first-order theories using linear algebra and constraint solving

    Directory of Open Access Journals (Sweden)

    Salvador Lucas

    2015-12-01

    Full Text Available Recent developments in termination analysis for declarative programs emphasize the use of appropriate models for the logical theory representing the program at stake as a generic approach to prove termination of declarative programs. In this setting, Order-Sorted First-Order Logic provides a powerful framework to represent declarative programs. It also provides a target logic to obtain models for other logics via transformations. We investigate the automatic generation of numerical models for order-sorted first-order logics and its use in program analysis, in particular in termination analysis of declarative programs. We use convex domains to give domains to the different sorts of an order-sorted signature; we interpret the ranked symbols of sorted signatures by means of appropriately adapted convex matrix interpretations. Such numerical interpretations permit the use of existing algorithms and tools from linear algebra and arithmetic constraint solving to synthesize the models.

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

  10. ROBUST MPC FOR STABLE LINEAR SYSTEMS

    Directory of Open Access Journals (Sweden)

    M.A. Rodrigues

    2002-03-01

    Full Text Available In this paper, a new model predictive controller (MPC, which is robust for a class of model uncertainties, is developed. Systems with stable dynamics and time-invariant model uncertainty are treated. The development herein proposed is focused on real industrial systems where the controller is part of an on-line optimization scheme and works in the output-tracking mode. In addition, the system has a time-varying number of degrees of freedom since some of the manipulated inputs may become constrained. Moreover, the number of controlled outputs may also vary during system operation. Consequently, the actual system may show operating conditions with a number of controlled outputs larger than the number of available manipulated inputs. The proposed controller uses a state-space model, which is aimed at the representation of the output-predicted trajectory. Based on this model, a cost function is proposed whereby the output error is integrated along an infinite prediction horizon. It is considered the case of multiple operating points, where the controller stabilizes a set of models corresponding to different operating conditions for the system. It is shown that closed-loop stability is guaranteed by the feasibility of a linear matrix optimization problem.

  11. Optimal Control of Switching Linear Systems

    Directory of Open Access Journals (Sweden)

    Ali Benmerzouga

    2004-06-01

    Full Text Available A solution to the control of switching linear systems with input constraints was given in Benmerzouga (1997 for both the conventional enumeration approach and the new approach. The solution given there turned out to be not unique. The main objective in this work is to determine the optimal control sequences {Ui(k ,  i = 1,..., M ;  k = 0, 1, ...,  N -1} which transfer the system from a given initial state  X0  to a specific target state  XT  (or to be as close as possible by using the same discrete time solution obtained in Benmerzouga (1997 and minimizing a running cost-to-go function. By using the dynamic programming technique, the optimal solution is found for both approaches given in Benmerzouga (1997. The computational complexity of the modified algorithm is also given.

  12. Well logging system with linearity control

    International Nuclear Information System (INIS)

    Jones, J.M.

    1973-01-01

    Apparatus is described for controlling the gain of a nuclear well logging system comprising: (1) means for measuring the energy spectrum of gamma rays produced by earth formation materials surrounding a well borehole; (2) means for measuring the number of counts of a gamma rays having an energy falling within each of at least two predetermined energy band portions of the gamma ray energy spectrum; (3) means for generating a signal proportional to the ratio of the gamma ray counts and for comparing the ratio signal with at least one constant ratio calibration signal; (4) means for generating an error signal representative of the difference of the ratio signal and the constant ratio calibration signal; and (5) means for using the error signal to control the linearity of the well logging system. (author)

  13. Linear concentration system; Sistema de concentracion lineal

    Energy Technology Data Exchange (ETDEWEB)

    Gonzalez Lugo, J.I; Leon Rovira, N; Aguayo Tellez, H [Instituto Tecnologico y de Estudios Superiores de Monterrey, Monterrey, Nuevo Leon (Mexico)]. E-mails: a00812662@itesm.mx; noel.leon@itesm.mx; haguayo@itesm.mx

    2013-03-15

    Solar linear concentration technologies to generate high temperatures are limited to the ranges of 200 to 500 degrees Celsius. While its performance has been tested through prototypes and pilot plants around the world, there are still areas of opportunity that can be exploited to obtain a linear concentration that achieves temperatures above this range in order to have a better use of the available solar energy. Because of this: It is possible to develop a linear concentration system that can track the sun with minimal movement of the absorber-receiver while maintaining temperatures above 850 degrees Celsius sufficient for industrial processes that require that temperature. The methodology consists of a series of stages (conceptual design, simulation, evaluation, development concept, results and validation) through which concepts are generated that allow design and evaluation of solar concentrator configurations with the help of simulation software. We have designed a linear parabolic concentrating system which comprises a set of mirrors segments with different focal lengths that works within the range of 600 degrees Celsius; however, it is advancing in the development of a double concentration to reach 850 degrees Celsius. [Spanish] Las tecnologias de concentracion lineal solar para generar altas temperaturas se ven limitadas a los rangos de 200 a 500 grados centigrados. Si bien su funcionamiento ha sido probado a traves de prototipos y plantas piloto alrededor del mundo, aun existen areas de oportunidad que pueden ser aprovechadas para obtener un sistema de concentracion lineal que permita alcanzar temperaturas mayores a este rango para asi tener un mejor aprovechamiento de la energia solar disponible. Debido a esto: Es posible desarrollar un sistema de concentracion lineal capaz de seguir la trayectoria del Sol con minimo movimiento del absorbedor-recibidor al mismo tiempo que mantiene temperaturas superiores a los 850 grados centigrados suficientes para

  14. Linear Actuator System for the NASA Docking System

    Science.gov (United States)

    Dick, Brandon N.; Oesch, Christopher; Rupp, Timothy W.

    2017-01-01

    The Linear Actuator System (LAS) is a major sub-system within the NASA Docking System (NDS). The NDS Block 1 will be used on the Boeing Crew Space Transportation (CST-100) system to achieve docking with the International Space Station. Critical functions in the Soft Capture aspect of docking are performed by the LAS. This paper describes the general function of the LAS, the system's key requirements and technical challenges, and the development and qualification approach for the system.

  15. Relative null controllability of linear systems with multiple delays in ...

    African Journals Online (AJOL)

    varying multiple delays in state and control are developed. If the uncontrolled system is uniformly asymptotically stable, and if the linear system is controllable, then the linear system is null controllable. Journal of the Nigerian Association of ...

  16. Linear optical response of finite systems using multishift linear system solvers

    Energy Technology Data Exchange (ETDEWEB)

    Hübener, Hannes; Giustino, Feliciano [Department of Materials, University of Oxford, Oxford OX1 3PH (United Kingdom)

    2014-07-28

    We discuss the application of multishift linear system solvers to linear-response time-dependent density functional theory. Using this technique the complete frequency-dependent electronic density response of finite systems to an external perturbation can be calculated at the cost of a single solution of a linear system via conjugate gradients. We show that multishift time-dependent density functional theory yields excitation energies and oscillator strengths in perfect agreement with the standard diagonalization of the response matrix (Casida's method), while being computationally advantageous. We present test calculations for benzene, porphin, and chlorophyll molecules. We argue that multishift solvers may find broad applicability in the context of excited-state calculations within density-functional theory and beyond.

  17. Control system analysis for the perturbed linear accelerator rf system

    CERN Document Server

    Sung Il Kwon

    2002-01-01

    This paper addresses the modeling problem of the linear accelerator RF system in SNS. Klystrons are modeled as linear parameter varying systems. The effect of the high voltage power supply ripple on the klystron output voltage and the output phase is modeled as an additive disturbance. The cavity is modeled as a linear system and the beam current is modeled as the exogenous disturbance. The output uncertainty of the low level RF system which results from the uncertainties in the RF components and cabling is modeled as multiplicative uncertainty. Also, the feedback loop uncertainty and digital signal processing signal conditioning subsystem uncertainties are lumped together and are modeled as multiplicative uncertainty. Finally, the time delays in the loop are modeled as a lumped time delay. For the perturbed open loop system, the closed loop system performance, and stability are analyzed with the PI feedback controller.

  18. CONTROL SYSTEM ANALYSIS FOR THE PERTURBED LINEAR ACCELERATOR RF SYSTEM

    International Nuclear Information System (INIS)

    SUNG-IL KWON; AMY H. REGAN

    2002-01-01

    This paper addresses the modeling problem of the linear accelerator RF system in SNS. Klystrons are modeled as linear parameter varying systems. The effect of the high voltage power supply ripple on the klystron output voltage and the output phase is modeled as an additive disturbance. The cavity is modeled as a linear system and the beam current is modeled as the exogenous disturbance. The output uncertainty of the low level RF system which results from the uncertainties in the RF components and cabling is modeled as multiplicative uncertainty. Also, the feedback loop uncertainty and digital signal processing signal conditioning subsystem uncertainties are lumped together and are modeled as multiplicative uncertainty. Finally, the time delays in the loop are modeled as a lumped time delay. For the perturbed open loop system, the closed loop system performance, and stability are analyzed with the PI feedback controller

  19. Incomplete factorization technique for positive definite linear systems

    International Nuclear Information System (INIS)

    Manteuffel, T.A.

    1980-01-01

    This paper describes a technique for solving the large sparse symmetric linear systems that arise from the application of finite element methods. The technique combines an incomplete factorization method called the shifted incomplete Cholesky factorization with the method of generalized conjugate gradients. The shifted incomplete Cholesky factorization produces a splitting of the matrix A that is dependent upon a parameter α. It is shown that if A is positive definite, then there is some α for which this splitting is possible and that this splitting is at least as good as the Jacobi splitting. The method is shown to be more efficient on a set of test problems than either direct methods or explicit iteration schemes

  20. IMPROVING THE PERFORMANCE OF THE LINEAR SYSTEMS SOLVERS USING CUDA

    Directory of Open Access Journals (Sweden)

    BOGDAN OANCEA

    2012-05-01

    Full Text Available Parallel computing can offer an enormous advantage regarding the performance for very large applications in almost any field: scientific computing, computer vision, databases, data mining, and economics. GPUs are high performance many-core processors that can obtain very high FLOP rates. Since the first idea of using GPU for general purpose computing, things have evolved and now there are several approaches to GPU programming: CUDA from NVIDIA and Stream from AMD. CUDA is now a popular programming model for general purpose computations on GPU for C/C++ programmers. A great number of applications were ported to CUDA programming model and they obtain speedups of orders of magnitude comparing to optimized CPU implementations. In this paper we present an implementation of a library for solving linear systems using the CCUDA framework. We present the results of performance tests and show that using GPU one can obtain speedups of about of approximately 80 times comparing with a CPU implementation.

  1. Linear-array systems for aerospace NDE

    International Nuclear Information System (INIS)

    Smith, Robert A.; Willsher, Stephen J.; Bending, Jamie M.

    1999-01-01

    Rapid large-area inspection of composite structures for impact damage and multi-layered aluminum skins for corrosion has been a recognized priority for several years in both military and civil aerospace applications. Approaches to this requirement have followed two clearly different routes: the development of novel large-area inspection systems, and the enhancement of current ultrasonic or eddy-current methods to reduce inspection times. Ultrasonic inspection is possible with standard flaw detection equipment but the addition of a linear ultrasonic array could reduce inspection times considerably. In order to investigate their potential, 9-element and 17-element linear ultrasonic arrays for composites, and 64-element arrays for aluminum skins, have been developed to DERA specifications for use with the ANDSCAN area scanning system. A 5 m 2 composite wing surface has been scanned with a scan resolution of approximately 3 mm in 6 hours. With subsequent software and hardware improvements all four composite wing surfaces (top/bottom, left/right) of a military fighter aircraft can potentially be inspected in less than a day. Array technology has been very widely used in the medical ultrasound field although rarely above 10 MHz, whereas lap-joint inspection requires a pulse center-frequency of 12 to 20 MHz in order to resolve the separate interfaces in the lap joint. A 128 mm-long multi-element array of 5 mmx2 mm ultrasonic elements for use with the ANDSCAN scanning software was produced to a DERA specification by an NDT manufacturer with experience in the medical imaging field. This paper analyses the performance of the transducers that have been produced and evaluates their use in scanning systems of different configurations

  2. Model Predictive Control for Linear Complementarity and Extended Linear Complementarity Systems

    Directory of Open Access Journals (Sweden)

    Bambang Riyanto

    2005-11-01

    Full Text Available In this paper, we propose model predictive control method for linear complementarity and extended linear complementarity systems by formulating optimization along prediction horizon as mixed integer quadratic program. Such systems contain interaction between continuous dynamics and discrete event systems, and therefore, can be categorized as hybrid systems. As linear complementarity and extended linear complementarity systems finds applications in different research areas, such as impact mechanical systems, traffic control and process control, this work will contribute to the development of control design method for those areas as well, as shown by three given examples.

  3. Web-Based Problem-Solving Assignment and Grading System

    Science.gov (United States)

    Brereton, Giles; Rosenberg, Ronald

    2014-11-01

    In engineering courses with very specific learning objectives, such as fluid mechanics and thermodynamics, it is conventional to reinforce concepts and principles with problem-solving assignments and to measure success in problem solving as an indicator of student achievement. While the modern-day ease of copying and searching for online solutions can undermine the value of traditional assignments, web-based technologies also provide opportunities to generate individualized well-posed problems with an infinite number of different combinations of initial/final/boundary conditions, so that the probability of any two students being assigned identical problems in a course is vanishingly small. Such problems can be designed and programmed to be: single or multiple-step, self-grading, allow students single or multiple attempts; provide feedback when incorrect; selectable according to difficulty; incorporated within gaming packages; etc. In this talk, we discuss the use of a homework/exam generating program of this kind in a single-semester course, within a web-based client-server system that ensures secure operation.

  4. Krylov Subspace Methods for Complex Non-Hermitian Linear Systems. Thesis

    Science.gov (United States)

    Freund, Roland W.

    1991-01-01

    We consider Krylov subspace methods for the solution of large sparse linear systems Ax = b with complex non-Hermitian coefficient matrices. Such linear systems arise in important applications, such as inverse scattering, numerical solution of time-dependent Schrodinger equations, underwater acoustics, eddy current computations, numerical computations in quantum chromodynamics, and numerical conformal mapping. Typically, the resulting coefficient matrices A exhibit special structures, such as complex symmetry, or they are shifted Hermitian matrices. In this paper, we first describe a Krylov subspace approach with iterates defined by a quasi-minimal residual property, the QMR method, for solving general complex non-Hermitian linear systems. Then, we study special Krylov subspace methods designed for the two families of complex symmetric respectively shifted Hermitian linear systems. We also include some results concerning the obvious approach to general complex linear systems by solving equivalent real linear systems for the real and imaginary parts of x. Finally, numerical experiments for linear systems arising from the complex Helmholtz equation are reported.

  5. An efficient parallel algorithm for the solution of a tridiagonal linear system of equations

    Science.gov (United States)

    Stone, H. S.

    1971-01-01

    Tridiagonal linear systems of equations are solved on conventional serial machines in a time proportional to N, where N is the number of equations. The conventional algorithms do not lend themselves directly to parallel computations on computers of the ILLIAC IV class, in the sense that they appear to be inherently serial. An efficient parallel algorithm is presented in which computation time grows as log sub 2 N. The algorithm is based on recursive doubling solutions of linear recurrence relations, and can be used to solve recurrence relations of all orders.

  6. Thermodynamics of (1-alkanol + linear monoether) systems

    International Nuclear Information System (INIS)

    Gonzalez, Juan Antonio; Mozo, Ismael; Garcia de la Fuente, Isaias; Cobos, Jose Carlos; Riesco, Nicolas

    2008-01-01

    Densities, ρ, and speeds of sound, u, of systems formed by 1-heptanol, or 1-octanol, or 1-decanol and dibutylether have been measured at a temperature of (293.15, 298.15, and 303.15) K and atmospheric pressure using a vibrating tube densimeter and sound analyser Anton Paar model DSA-5000. The ρ and u values were used to calculate excess molar volumes, V E , and deviations from the ideal behaviour of the thermal expansion coefficient, Δα p and of the isentropic compressibilities, Δκ S . The available database on molar excess enthalpies, H E , and V E for (1-alkanol + linear monoether) systems was used to investigate interactional and structural effects in such mixtures. The enthalpy of the OH...O bonds is lower for methanol solutions, and for the remainder systems, it is practically independent of the mixture compounds. The V E variation with the chain length of the 1-alkanol points out the existence of structural effects for systems including longer 1-alkanols. The ERAS model is applied to the studied mixtures. ERAS represents quite accurately H E and V E data using parameters which consistently depend on the molecular structure

  7. Model-based verification method for solving the parameter uncertainty in the train control system

    International Nuclear Information System (INIS)

    Cheng, Ruijun; Zhou, Jin; Chen, Dewang; Song, Yongduan

    2016-01-01

    This paper presents a parameter analysis method to solve the parameter uncertainty problem for hybrid system and explore the correlation of key parameters for distributed control system. For improving the reusability of control model, the proposed approach provides the support for obtaining the constraint sets of all uncertain parameters in the abstract linear hybrid automata (LHA) model when satisfying the safety requirements of the train control system. Then, in order to solve the state space explosion problem, the online verification method is proposed to monitor the operating status of high-speed trains online because of the real-time property of the train control system. Furthermore, we construct the LHA formal models of train tracking model and movement authority (MA) generation process as cases to illustrate the effectiveness and efficiency of the proposed method. In the first case, we obtain the constraint sets of uncertain parameters to avoid collision between trains. In the second case, the correlation of position report cycle and MA generation cycle is analyzed under both the normal and the abnormal condition influenced by packet-loss factor. Finally, considering stochastic characterization of time distributions and real-time feature of moving block control system, the transient probabilities of wireless communication process are obtained by stochastic time petri nets. - Highlights: • We solve the parameters uncertainty problem by using model-based method. • We acquire the parameter constraint sets by verifying linear hybrid automata models. • Online verification algorithms are designed to monitor the high-speed trains. • We analyze the correlation of key parameters and uncritical parameters. • The transient probabilities are obtained by using reliability analysis.

  8. Noise analysis of fluid-valve system in a linear compressor using CAE

    International Nuclear Information System (INIS)

    Lee, Jun Ho; Jeong, Weui Bong; Kim, Dang Ju

    2009-01-01

    A linear compressor in a refrigerator uses piston motion to transfer refrigerant so its efficiency is higher than a previous reciprocal compressor. Because of interaction between refrigerant and valves system in the linear compressor, however, noise has been a main issue. In spite of doing many experimental researches, there is no way to rightly predict the noise. In order to solve this limitation, the CAE analysis is applied. For giving credit to these computational data, all of the data are experimentally validated.

  9. Solving the Coupled System Improves Computational Efficiency of the Bidomain Equations

    KAUST Repository

    Southern, J.A.; Plank, G.; Vigmond, E.J.; Whiteley, J.P.

    2009-01-01

    The bidomain equations are frequently used to model the propagation of cardiac action potentials across cardiac tissue. At the whole organ level, the size of the computational mesh required makes their solution a significant computational challenge. As the accuracy of the numerical solution cannot be compromised, efficiency of the solution technique is important to ensure that the results of the simulation can be obtained in a reasonable time while still encapsulating the complexities of the system. In an attempt to increase efficiency of the solver, the bidomain equations are often decoupled into one parabolic equation that is computationally very cheap to solve and an elliptic equation that is much more expensive to solve. In this study, the performance of this uncoupled solution method is compared with an alternative strategy in which the bidomain equations are solved as a coupled system. This seems counterintuitive as the alternative method requires the solution of a much larger linear system at each time step. However, in tests on two 3-D rabbit ventricle benchmarks, it is shown that the coupled method is up to 80% faster than the conventional uncoupled method-and that parallel performance is better for the larger coupled problem.

  10. Solving the Coupled System Improves Computational Efficiency of the Bidomain Equations

    KAUST Repository

    Southern, J.A.

    2009-10-01

    The bidomain equations are frequently used to model the propagation of cardiac action potentials across cardiac tissue. At the whole organ level, the size of the computational mesh required makes their solution a significant computational challenge. As the accuracy of the numerical solution cannot be compromised, efficiency of the solution technique is important to ensure that the results of the simulation can be obtained in a reasonable time while still encapsulating the complexities of the system. In an attempt to increase efficiency of the solver, the bidomain equations are often decoupled into one parabolic equation that is computationally very cheap to solve and an elliptic equation that is much more expensive to solve. In this study, the performance of this uncoupled solution method is compared with an alternative strategy in which the bidomain equations are solved as a coupled system. This seems counterintuitive as the alternative method requires the solution of a much larger linear system at each time step. However, in tests on two 3-D rabbit ventricle benchmarks, it is shown that the coupled method is up to 80% faster than the conventional uncoupled method-and that parallel performance is better for the larger coupled problem.

  11. Robust optimal control design using a differential game approach for open-loop linear quadratic descriptor systems

    NARCIS (Netherlands)

    Musthofa, M.W.; Salmah, S.; Engwerda, Jacob; Suparwanto, A.

    This paper studies the robust optimal control problem for descriptor systems. We applied differential game theory to solve the disturbance attenuation problem. The robust control problem was converted into a reduced ordinary zero-sum game. Within a linear quadratic setting, we solved the problem for

  12. Comparison results on preconditioned SOR-type iterative method for Z-matrices linear systems

    Science.gov (United States)

    Wang, Xue-Zhong; Huang, Ting-Zhu; Fu, Ying-Ding

    2007-09-01

    In this paper, we present some comparison theorems on preconditioned iterative method for solving Z-matrices linear systems, Comparison results show that the rate of convergence of the Gauss-Seidel-type method is faster than the rate of convergence of the SOR-type iterative method.

  13. Modelling and Inverse-Modelling: Experiences with O.D.E. Linear Systems in Engineering Courses

    Science.gov (United States)

    Martinez-Luaces, Victor

    2009-01-01

    In engineering careers courses, differential equations are widely used to solve problems concerned with modelling. In particular, ordinary differential equations (O.D.E.) linear systems appear regularly in Chemical Engineering, Food Technology Engineering and Environmental Engineering courses, due to the usefulness in modelling chemical kinetics,…

  14. A block Krylov subspace time-exact solution method for linear ordinary differential equation systems

    NARCIS (Netherlands)

    Bochev, Mikhail A.

    2013-01-01

    We propose a time-exact Krylov-subspace-based method for solving linear ordinary differential equation systems of the form $y'=-Ay+g(t)$ and $y"=-Ay+g(t)$, where $y(t)$ is the unknown function. The method consists of two stages. The first stage is an accurate piecewise polynomial approximation of

  15. Examining the Differences of Linear Systems between Finnish and Taiwanese Textbooks

    Science.gov (United States)

    Yang, Der-Ching; Lin, Yung-Chi

    2015-01-01

    The purpose of this study was to examine the differences between Finnish and Taiwanese textbooks for grades 7 to 9 on the topic of solving systems of linear equations (simultaneous equations). The specific textbooks examined were TK in Taiwan and FL in Finland. The content analysis method was used to examine (a) the teaching sequence, (b)…

  16. A Decomposition Algorithm for Mean-Variance Economic Model Predictive Control of Stochastic Linear Systems

    DEFF Research Database (Denmark)

    Sokoler, Leo Emil; Dammann, Bernd; Madsen, Henrik

    2014-01-01

    This paper presents a decomposition algorithm for solving the optimal control problem (OCP) that arises in Mean-Variance Economic Model Predictive Control of stochastic linear systems. The algorithm applies the alternating direction method of multipliers to a reformulation of the OCP...

  17. On the solution of a class of fuzzy system of linear equations

    Indian Academy of Sciences (India)

    J. Mathematics and Comput. Sci. 1: 1–5. Salkuyeh D K 2011 On the solution of the fuzzy Sylvester matrix equation. Soft Computing 15: 953–961. Senthilkumar P and Rajendran G 2011 New approach to solve symmetric fully fuzzy linear systems. S¯adhan¯a 36: 933–940. Wang K and Zheng B 2007 Block iterative methods ...

  18. System theory as applied differential geometry. [linear system

    Science.gov (United States)

    Hermann, R.

    1979-01-01

    The invariants of input-output systems under the action of the feedback group was examined. The approach used the theory of Lie groups and concepts of modern differential geometry, and illustrated how the latter provides a basis for the discussion of the analytic structure of systems. Finite dimensional linear systems in a single independent variable are considered. Lessons of more general situations (e.g., distributed parameter and multidimensional systems) which are increasingly encountered as technology advances are presented.

  19. Normal form of linear systems depending on parameters

    International Nuclear Information System (INIS)

    Nguyen Huynh Phan.

    1995-12-01

    In this paper we resolve completely the problem to find normal forms of linear systems depending on parameters for the feedback action that we have studied for the special case of controllable linear systems. (author). 24 refs

  20. Solving Graph Laplacian Systems Through Recursive Bisections and Two-Grid Preconditioning

    Energy Technology Data Exchange (ETDEWEB)

    Ponce, Colin [Cornell Univ., Ithaca, NY (United States); Vassilevski, Panayot S. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

    2016-02-18

    We present a parallelizable direct method for computing the solution to graph Laplacian-based linear systems derived from graphs that can be hierarchically bipartitioned with small edge cuts. For a graph of size n with constant-size edge cuts, our method decomposes a graph Laplacian in time O(n log n), and then uses that decomposition to perform a linear solve in time O(n log n). We then use the developed technique to design a preconditioner for graph Laplacians that do not have this property. Finally, we augment this preconditioner with a two-grid method that accounts for much of the preconditioner's weaknesses. We present an analysis of this method, as well as a general theorem for the condition number of a general class of two-grid support graph-based preconditioners. Numerical experiments illustrate the performance of the studied methods.

  1. PWR control system design using advanced linear and non-linear methodologies

    International Nuclear Information System (INIS)

    Rabindran, N.; Whitmarsh-Everiss, M.J.

    2004-01-01

    Consideration is here given to the methodology deployed for non-linear heuristic analysis in the time domain supported by multi-variable linear control system design methods for the purposes of operational dynamics and control system analysis. This methodology is illustrated by the application of structural singular value μ analysis to Pressurised Water Reactor control system design. (author)

  2. Identification of Nonlinear Dynamic Systems Possessing Some Non-linearities

    Directory of Open Access Journals (Sweden)

    Y. N. Pavlov

    2015-01-01

    system of the second-order with nonlinearity of the type "quadratic friction" in combination with nonlinearity of the type "dry friction", was developed a software to simulate a process for providing pseudo experimental data containing random accuracy and to determine the parameters of the system. A conducted computational experiment enabled an estimate of the accuracy with which the proposed algorithm determines the parameters of the system. The illustrative numerical simulation has demonstrated that with using the proposed nonlinear dynamic system identification algorithm in frequency hodograph the accuracy of determining the coefficient values of the frequency transfer function of the second order system with a dry and quadratic friction is comparable with the range of measurement accuracy of experimental samples of this system hodograph. Well-known publications do not mention this identification method of the nonlinear dynamic systems. The nonlinear dynamical systems identification method the article describes can find application when determining parameters of various kinds of actuators. The using method of harmonic linearization and identification of dynamical systems by hodographs is promising for solving the problem of the identification of nonlinear systems with different types of nonlinearities.

  3. Minimum Energy Control of 2D Positive Continuous-Discrete Linear Systems

    Directory of Open Access Journals (Sweden)

    Kaczorek Tadeusz

    2014-09-01

    Full Text Available The minimum energy control problem for the 2D positive continuous-discrete linear systems is formulated and solved. Necessary and sufficient conditions for the reachability at the point of the systems are given. Sufficient conditions for the existence of solution to the problem are established. It is shown that if the system is reachable then there exists an optimal input that steers the state from zero boundary conditions to given final state and minimizing the performance index for only one step (q = 1. A procedure for solving of the problem is proposed and illustrated by a numerical example.

  4. Superconducting linear accelerator system for NSC

    Indian Academy of Sciences (India)

    This paper reports the construction of a superconducting linear accelerator as a booster to the 15 UD Pelletron accelerator at Nuclear Science Centre, New Delhi. The LINAC will use superconducting niobium quarter wave resonators as the accelerating element. Construction of the linear accelerator has progressed ...

  5. Adams Predictor-Corrector Systems for Solving Fuzzy Differential Equations

    Directory of Open Access Journals (Sweden)

    Dequan Shang

    2013-01-01

    Full Text Available A predictor-corrector algorithm and an improved predictor-corrector (IPC algorithm based on Adams method are proposed to solve first-order differential equations with fuzzy initial condition. These algorithms are generated by updating the Adams predictor-corrector method and their convergence is also analyzed. Finally, the proposed methods are illustrated by solving an example.

  6. ORACLS: A system for linear-quadratic-Gaussian control law design

    Science.gov (United States)

    Armstrong, E. S.

    1978-01-01

    A modern control theory design package (ORACLS) for constructing controllers and optimal filters for systems modeled by linear time-invariant differential or difference equations is described. Numerical linear-algebra procedures are used to implement the linear-quadratic-Gaussian (LQG) methodology of modern control theory. Algorithms are included for computing eigensystems of real matrices, the relative stability of a matrix, factored forms for nonnegative definite matrices, the solutions and least squares approximations to the solutions of certain linear matrix algebraic equations, the controllability properties of a linear time-invariant system, and the steady state covariance matrix of an open-loop stable system forced by white noise. Subroutines are provided for solving both the continuous and discrete optimal linear regulator problems with noise free measurements and the sampled-data optimal linear regulator problem. For measurement noise, duality theory and the optimal regulator algorithms are used to solve the continuous and discrete Kalman-Bucy filter problems. Subroutines are also included which give control laws causing the output of a system to track the output of a prescribed model.

  7. The integration of marketing problem-solving modes and marketing management support systems

    NARCIS (Netherlands)

    B. Wierenga (Berend); G.H. van Bruggen (Gerrit)

    1997-01-01

    textabstractFocuses on the issue of problem solving in marketing and develops a classification of marketing problem-solving modes (MPSMs). Typology of MPSMs; Relationship among MPSMs; Marketing management support systems.

  8. Symmetric linear systems - An application of algebraic systems theory

    Science.gov (United States)

    Hazewinkel, M.; Martin, C.

    1983-01-01

    Dynamical systems which contain several identical subsystems occur in a variety of applications ranging from command and control systems and discretization of partial differential equations, to the stability augmentation of pairs of helicopters lifting a large mass. Linear models for such systems display certain obvious symmetries. In this paper, we discuss how these symmetries can be incorporated into a mathematical model that utilizes the modern theory of algebraic systems. Such systems are inherently related to the representation theory of algebras over fields. We will show that any control scheme which respects the dynamical structure either implicitly or explicitly uses the underlying algebra.

  9. Robustness-tracking control based on sliding mode and H∞ theory for linear servo system

    Institute of Scientific and Technical Information of China (English)

    TIAN Yan-feng; GUO Qing-ding

    2005-01-01

    A robustness-tracking control scheme based on combining H∞ robust control and sliding mode control is proposed for a direct drive AC permanent-magnet linear motor servo system to solve the conflict between tracking and robustness of the linear servo system. The sliding mode tracking controller is designed to ensure the system has a fast tracking characteristic to the command, and the H∞ robustness controller suppresses the disturbances well within the close loop( including the load and the end effect force of linear motor etc. ) and effectively minimizes the chattering of sliding mode control which influences the steady state performance of the system. Simulation results show that this control scheme enhances the track-command-ability and the robustness of the linear servo system, and in addition, it has a strong robustness to parameter variations and resistance disturbances.

  10. Algorithms to solve coupled systems of differential equations in terms of power series

    International Nuclear Information System (INIS)

    Ablinger, Jakob; Schneider, Carsten

    2016-08-01

    Using integration by parts relations, Feynman integrals can be represented in terms of coupled systems of differential equations. In the following we suppose that the unknown Feynman integrals can be given in power series representations, and that sufficiently many initial values of the integrals are given. Then there exist algorithms that decide constructively if the coefficients of their power series representations can be given within the class of nested sums over hypergeometric products. In this article we work out the calculation steps that solve this problem. First, we present a successful tactic that has been applied recently to challenging problems coming from massive 3-loop Feynman integrals. Here our main tool is to solve scalar linear recurrences within the class of nested sums over hypergeometric products. Second, we will present a new variation of this tactic which relies on more involved summation technologies but succeeds in reducing the problem to solve scalar recurrences with lower recurrence orders. The article works out the different challenges of this new tactic and demonstrates how they can be treated efficiently with our existing summation technologies.

  11. A study on switched linear system identification using game ...

    African Journals Online (AJOL)

    A study on switched linear system identification using game-theoretic strategies and neural computing. ... This study deals with application of game-theoretic strategies and neural computing to switched linear ... AJOL African Journals Online.

  12. Solving polynomial systems using no-root elimination blending schemes

    KAUST Repository

    Barton, Michael

    2011-12-01

    Searching for the roots of (piecewise) polynomial systems of equations is a crucial problem in computer-aided design (CAD), and an efficient solution is in strong demand. Subdivision solvers are frequently used to achieve this goal; however, the subdivision process is expensive, and a vast number of subdivisions is to be expected, especially for higher-dimensional systems. Two blending schemes that efficiently reveal domains that cannot contribute by any root, and therefore significantly reduce the number of subdivisions, are proposed. Using a simple linear blend of functions of the given polynomial system, a function is sought after to be no-root contributing, with all control points of its BernsteinBézier representation of the same sign. If such a function exists, the domain is purged away from the subdivision process. The applicability is demonstrated on several CAD benchmark problems, namely surfacesurfacesurface intersection (SSSI) and surfacecurve intersection (SCI) problems, computation of the Hausdorff distance of two planar curves, or some kinematic-inspired tasks. © 2011 Elsevier Ltd. All rights reserved.

  13. Solution of single linear tridiagonal systems and vectorization of the ICCG algorithm on the Cray 1

    International Nuclear Information System (INIS)

    Kershaw, D.S.

    1981-01-01

    The numerical algorithms used to solve the physics equation in codes which model laser fusion are examined, it is found that a large number of subroutines require the solution of tridiagonal linear systems of equations. One dimensional radiation transport, thermal and suprathermal electron transport, ion thermal conduction, charged particle and neutron transport, all require the solution of tridiagonal systems of equations. The standard algorithm that has been used in the past on CDC 7600's will not vectorize and so cannot take advantage of the large speed increases possible on the Cray-1 through vectorization. There is however, an alternate algorithm for solving tridiagonal systems, called cyclic reduction, which allows for vectorization, and which is optimal for the Cray-1. Software based on this algorithm is now being used in LASNEX to solve tridiagonal linear systems in the subroutines mentioned above. The new algorithm runs as much as five times faster than the standard algorithm on the Cray-1. The ICCG method is being used to solve the diffusion equation with a nine-point coupling scheme on the CDC 7600. In going from the CDC 7600 to the Cray-1, a large part of the algorithm consists of solving tridiagonal linear systems on each L line of the Lagrangian mesh in a manner which is not vectorizable. An alternate ICCG algorithm for the Cray-1 was developed which utilizes a block form of the cyclic reduction algorithm. This new algorithm allows full vectorization and runs as much as five times faster than the old algorithm on the Cray-1. It is now being used in Cray LASNEX to solve the two-dimensional diffusion equation in all the physics subroutines mentioned above

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

  15. High density linear systems for fusion power

    International Nuclear Information System (INIS)

    Ellis, W.R.; Krakowski, R.A.

    1975-01-01

    The physics and technological limitations and uncertainties associated with the linear theta pinch are discussed in terms of a generalized energy balance, which has as its basis the ratio (Q/sub E/) of total electrical energy generated to net electrical energy consumed. Included in this total is the virtual energy of bred fissile fuel, if a hybrid blanket is used, as well as the actual of real energy deposited in the blanket by the fusion neutron. The advantages and disadvantages of the pulsed operation demanded by the linear theta pinch are also discussed

  16. Estimation of Multiple Point Sources for Linear Fractional Order Systems Using Modulating Functions

    KAUST Repository

    Belkhatir, Zehor

    2017-06-28

    This paper proposes an estimation algorithm for the characterization of multiple point inputs for linear fractional order systems. First, using polynomial modulating functions method and a suitable change of variables the problem of estimating the locations and the amplitudes of a multi-pointwise input is decoupled into two algebraic systems of equations. The first system is nonlinear and solves for the time locations iteratively, whereas the second system is linear and solves for the input’s amplitudes. Second, closed form formulas for both the time location and the amplitude are provided in the particular case of single point input. Finally, numerical examples are given to illustrate the performance of the proposed technique in both noise-free and noisy cases. The joint estimation of pointwise input and fractional differentiation orders is also presented. Furthermore, a discussion on the performance of the proposed algorithm is provided.

  17. Computer programs for solving systems of nonlinear equations

    International Nuclear Information System (INIS)

    Asaoka, Takumi

    1978-03-01

    Computer programs to find a solution, usually the one closest to some guess, of a system of simultaneous nonlinear equations are provided for real functions of the real arguments. These are based on quasi-Newton methods or projection methods, which are briefly reviewed in the present report. Benchmark tests were performed on these subroutines to grasp their characteristics. As the program not requiring analytical forms of the derivatives of the Jacobian matrix, we have dealt with NS01A of Powell, NS03A of Reid for a system with the sparse Jacobian and NONLIN of Brown. Of these three subroutines of quasi-Newton methods, NONLIN is shown to be the most useful because of its stable algorithm and short computation time. On the other hand, as the subroutine for which the derivatives of the Jacobian are to be supplied analytically, we have tested INTECH of a quasi-Newton method based on the Boggs' algorithm, PROJA of Georg and Keller based on the projection method and an option of NS03A. The results have shown that INTECH, treating variables which appear only linearly in the functions separately, takes the shortest computation time, on the whole, while the projection method requires further research to find an optimal algorithm. (auth.)

  18. Low-Rank Linear Dynamical Systems for Motor Imagery EEG.

    Science.gov (United States)

    Zhang, Wenchang; Sun, Fuchun; Tan, Chuanqi; Liu, Shaobo

    2016-01-01

    The common spatial pattern (CSP) and other spatiospectral feature extraction methods have become the most effective and successful approaches to solve the problem of motor imagery electroencephalography (MI-EEG) pattern recognition from multichannel neural activity in recent years. However, these methods need a lot of preprocessing and postprocessing such as filtering, demean, and spatiospectral feature fusion, which influence the classification accuracy easily. In this paper, we utilize linear dynamical systems (LDSs) for EEG signals feature extraction and classification. LDSs model has lots of advantages such as simultaneous spatial and temporal feature matrix generation, free of preprocessing or postprocessing, and low cost. Furthermore, a low-rank matrix decomposition approach is introduced to get rid of noise and resting state component in order to improve the robustness of the system. Then, we propose a low-rank LDSs algorithm to decompose feature subspace of LDSs on finite Grassmannian and obtain a better performance. Extensive experiments are carried out on public dataset from "BCI Competition III Dataset IVa" and "BCI Competition IV Database 2a." The results show that our proposed three methods yield higher accuracies compared with prevailing approaches such as CSP and CSSP.

  19. Analysis of Linear Hybrid Systems in CLP

    DEFF Research Database (Denmark)

    Banda, Gourinath; Gallagher, John Patrick

    2009-01-01

    In this paper we present a procedure for representing the semantics of linear hybrid automata (LHAs) as constraint logic programs (CLP); flexible and accurate analysis and verification of LHAs can then be performed using generic CLP analysis and transformation tools. LHAs provide an expressive...

  20. Finite-Time Robust H∞ Control for Uncertain Linear Continuous-Time Singular Systems with Exogenous Disturbances

    Directory of Open Access Journals (Sweden)

    Songlin Wo

    2018-01-01

    Full Text Available Singular systems arise in a great deal of domains of engineering and can be used to solve problems which are more difficult and more extensive than regular systems to solve. Therefore, in this paper, the definition of finite-time robust H∞ control for uncertain linear continuous-time singular systems is presented. The problem we address is to design a robust state feedback controller which can deal with the singular system with time-varying norm-bounded exogenous disturbance, such that the singular system is finite-time robust bounded (FTRB with disturbance attenuation γ. Sufficient conditions for the existence of solutions to this problem are obtained in terms of linear matrix equalities (LMIs. When these LMIs are feasible, the desired robust controller is given. A detailed solving method is proposed for the restricted linear matrix inequalities. Finally, examples are given to show the validity of the methodology.

  1. TOEPLITZ, Solution of Linear Equation System with Toeplitz or Circulant Matrix

    International Nuclear Information System (INIS)

    Garbow, B.

    1984-01-01

    Description of program or function: TOEPLITZ is a collection of FORTRAN subroutines for solving linear systems Ax=b, where A is a Toeplitz matrix, a Circulant matrix, or has one or several block structures based on Toeplitz or Circulant matrices. Such systems arise in problems of electrodynamics, acoustics, mathematical statistics, algebra, in the numerical solution of integral equations with a difference kernel, and in the theory of stationary time series and signals

  2. Advances in the control of markov jump linear systems with no mode observation

    CERN Document Server

    Vargas, Alessandro N; do Val, João B R

    2016-01-01

    This brief broadens readers’ understanding of stochastic control by highlighting recent advances in the design of optimal control for Markov jump linear systems (MJLS). It also presents an algorithm that attempts to solve this open stochastic control problem, and provides a real-time application for controlling the speed of direct current motors, illustrating the practical usefulness of MJLS. Particularly, it offers novel insights into the control of systems when the controller does not have access to the Markovian mode.

  3. Development of an efficient iterative solver for linear systems in FE structural analysis

    International Nuclear Information System (INIS)

    Saint-Georges, P.; Warzee, G.; Beauwens, R.; Notay, Y.

    1993-01-01

    The preconditioned conjugate gradient is a well-known and powerful method to solve sparse symmetric positive definite systems of linear equations. Such systems are generated by the finite element discretization in structural analysis but users of finite element in this context generally still rely on direct methods. It is our purpose in the present paper to highlight the improvement brought forward by some new preconditioning techniques and show that the preconditioned conjugate gradient method is more performant than any direct method. (author)

  4. Computer programs for the solution of systems of linear algebraic equations

    Science.gov (United States)

    Sequi, W. T.

    1973-01-01

    FORTRAN subprograms for the solution of systems of linear algebraic equations are described, listed, and evaluated in this report. Procedures considered are direct solution, iteration, and matrix inversion. Both incore methods and those which utilize auxiliary data storage devices are considered. Some of the subroutines evaluated require the entire coefficient matrix to be in core, whereas others account for banding or sparceness of the system. General recommendations relative to equation solving are made, and on the basis of tests, specific subprograms are recommended.

  5. A SYSTEMIC VISION OF BIOLOGY: OVERCOMING LINEARITY

    Directory of Open Access Journals (Sweden)

    M. Mayer

    2005-07-01

    were used to build  a hipermedia  material.  This  technology  permit  overcomes a linear  communication, improving the  comprehension  of the network perspective.   The teachers  speeches revealed  their  conceptual  con- structions along the  course,  showed the development of the  competences  in identify  interconnection points  in the flow and chemical cycling of energy, compatible  with a systemic view of life.

  6. Dynamics of unsymmetric piecewise-linear/non-linear systems using finite elements in time

    Science.gov (United States)

    Wang, Yu

    1995-08-01

    The dynamic response and stability of a single-degree-of-freedom system with unsymmetric piecewise-linear/non-linear stiffness are analyzed using the finite element method in the time domain. Based on a Hamilton's weak principle, this method provides a simple and efficient approach for predicting all possible fundamental and sub-periodic responses. The stability of the steady state response is determined by using Floquet's theory without any special effort for calculating transition matrices. This method is applied to a number of examples, demonstrating its effectiveness even for a strongly non-linear problem involving both clearance and continuous stiffness non-linearities. Close agreement is found between available published findings and the predictions of the finite element in time approach, which appears to be an efficient and reliable alternative technique for non-linear dynamic response and stability analysis of periodic systems.

  7. Robust distributed model predictive control of linear systems with structured time-varying uncertainties

    Science.gov (United States)

    Zhang, Langwen; Xie, Wei; Wang, Jingcheng

    2017-11-01

    In this work, synthesis of robust distributed model predictive control (MPC) is presented for a class of linear systems subject to structured time-varying uncertainties. By decomposing a global system into smaller dimensional subsystems, a set of distributed MPC controllers, instead of a centralised controller, are designed. To ensure the robust stability of the closed-loop system with respect to model uncertainties, distributed state feedback laws are obtained by solving a min-max optimisation problem. The design of robust distributed MPC is then transformed into solving a minimisation optimisation problem with linear matrix inequality constraints. An iterative online algorithm with adjustable maximum iteration is proposed to coordinate the distributed controllers to achieve a global performance. The simulation results show the effectiveness of the proposed robust distributed MPC algorithm.

  8. Reliability modelling and simulation of switched linear system ...

    African Journals Online (AJOL)

    Reliability modelling and simulation of switched linear system control using temporal databases. ... design of fault-tolerant real-time switching systems control and modelling embedded micro-schedulers for complex systems maintenance.

  9. Solution of linear and nonlinear matrix systems. Application to a nonlinear diffusion equation

    International Nuclear Information System (INIS)

    Bonnet, M.; Meurant, G.

    1978-01-01

    Different methods of solution of linear and nonlinear algebraic systems are applied to the nonlinear system obtained by discretizing a nonlinear diffusion equation. For linear systems, methods in general use of alternating directions type or Gauss Seidel's methods are compared to more recent ones of the type of generalized conjugate gradient; the superiority of the latter is shown by numerical examples. For nonlinear systems, a method on nonlinear conjugate gradient is studied as also Newton's method and some of its variants. It should be noted, however that Newton's method is found to be more efficient when coupled with a good method for solution of the linear system. To conclude, such methods are used to solve a nonlinear diffusion problem and the numerical results obtained are to be compared [fr

  10. LMI-based gain scheduled controller synthesis for a class of linear parameter varying systems

    DEFF Research Database (Denmark)

    Bendtsen, Jan Dimon; Anderson, Brian; Lanzon, Alexander

    2006-01-01

    This paper presents a novel method for constructing controllers for a class of single-input multiple-output (SIMO) linear parameter varying (LPV) systems. This class of systems encompasses many physical systems, in particular systems where individual components vary with time, and is therefore...... of significant practical relevance to control designers. The control design presented in this paper has the properties that the system matrix of the closed loop is multi-affine in the various scalar parameters, and that the resulting controller ensures a certain degree of stability for the closed loop even when...... as a standard linear time-invariant (LTI) design combined with a set of linear matrix inequalities, which can be solved efficiently with software tools. The design procedure is illustrated by a numerical example....

  11. A duality approach for solving bounded linear programming problems with fuzzy variables based on ranking functions and its application in bounded transportation problems

    Science.gov (United States)

    Ebrahimnejad, Ali

    2015-08-01

    There are several methods, in the literature, for solving fuzzy variable linear programming problems (fuzzy linear programming in which the right-hand-side vectors and decision variables are represented by trapezoidal fuzzy numbers). In this paper, the shortcomings of some existing methods are pointed out and to overcome these shortcomings a new method based on the bounded dual simplex method is proposed to determine the fuzzy optimal solution of that kind of fuzzy variable linear programming problems in which some or all variables are restricted to lie within lower and upper bounds. To illustrate the proposed method, an application example is solved and the obtained results are given. The advantages of the proposed method over existing methods are discussed. Also, one application of this algorithm in solving bounded transportation problems with fuzzy supplies and demands is dealt with. The proposed method is easy to understand and to apply for determining the fuzzy optimal solution of bounded fuzzy variable linear programming problems occurring in real-life situations.

  12. Energy balance in a system with quasispherical linear compression

    International Nuclear Information System (INIS)

    Es'kov, A.G.; Kozlov, N.P.; Kurtmullaev, R.K.; Semenov, V.N.; Khvesyuk, V.I.; Yaminskii, A.V.

    1983-01-01

    This letter reports the resists of some experimental studies and a numerical simulation of the Tor-linear fusion system, 1 in which a heavy plasma shell with a closed magnetic structure is compressed in a quasispherical manner. The parameters of the Tor-Linear, at the Kurchatov Institute of Atomic Energy in Moscow are as follows: The energy stored in the system which accelerates the linear is E = 0.5 MJ; the linear mass is m = 0.2 kg; the working volume of the linear module is 1.5 x 10 -3 m 3 ; the linear velocity is approx.10 3 m/s; the guiding field in the toriod in the linear is 1--10 x 10 21 m -3 ; and the intial volume of the plasma in the linear chamber is 2.5 x 10 -4 m 3 . In this series of experiments, new solutions were developed for all the systems of the plasma--linear complex of the Tor-Linear: to produce a plasma toroid, to transport it, and to trap it in the linear cavity

  13. Integrator Performance Analysis In Solving Stiff Differential Equation System

    International Nuclear Information System (INIS)

    B, Alhadi; Basaruddin, T.

    2001-01-01

    In this paper we discuss the four-stage index-2 singly diagonally implicit Runge-Kutta method, which is used to solve stiff ordinary differential equations (SODE). Stiff problems require a method where step size is not restricted by the method's stability. We desire SDIRK to be A-stable that has no stability restrictions when solving y'= λy with Reλ>0 and h>0, so by choosing suitable stability function we can determine appropriate constant g) to formulate SDIRK integrator to solve SODE. We select the second stage of the internal stage as embedded method to perform low order estimate for error predictor. The strategy for choosing the step size is adopted from the strategy proposed by Hall(1996:6). And the algorithm that is developed in this paper is implemented using MATLAB 5.3, which is running on Window's 95 environment. Our performance measurement's local truncation error accuracy, and efficiency were evaluated by statistical results of sum of steps, sum of calling functions, average of Newton iterations and elapsed times.As the results, our numerical experiment show that SDIRK is unconditionally stable. By using Hall's step size strategy, the method can be implemented efficiently, provided that suitable parameters are used

  14. Compact tunable silicon photonic differential-equation solver for general linear time-invariant systems.

    Science.gov (United States)

    Wu, Jiayang; Cao, Pan; Hu, Xiaofeng; Jiang, Xinhong; Pan, Ting; Yang, Yuxing; Qiu, Ciyuan; Tremblay, Christine; Su, Yikai

    2014-10-20

    We propose and experimentally demonstrate an all-optical temporal differential-equation solver that can be used to solve ordinary differential equations (ODEs) characterizing general linear time-invariant (LTI) systems. The photonic device implemented by an add-drop microring resonator (MRR) with two tunable interferometric couplers is monolithically integrated on a silicon-on-insulator (SOI) wafer with a compact footprint of ~60 μm × 120 μm. By thermally tuning the phase shifts along the bus arms of the two interferometric couplers, the proposed device is capable of solving first-order ODEs with two variable coefficients. The operation principle is theoretically analyzed, and system testing of solving ODE with tunable coefficients is carried out for 10-Gb/s optical Gaussian-like pulses. The experimental results verify the effectiveness of the fabricated device as a tunable photonic ODE solver.

  15. Two new modified Gauss-Seidel methods for linear system with M-matrices

    Science.gov (United States)

    Zheng, Bing; Miao, Shu-Xin

    2009-12-01

    In 2002, H. Kotakemori et al. proposed the modified Gauss-Seidel (MGS) method for solving the linear system with the preconditioner [H. Kotakemori, K. Harada, M. Morimoto, H. Niki, A comparison theorem for the iterative method with the preconditioner () J. Comput. Appl. Math. 145 (2002) 373-378]. Since this preconditioner is constructed by only the largest element on each row of the upper triangular part of the coefficient matrix, the preconditioning effect is not observed on the nth row. In the present paper, to deal with this drawback, we propose two new preconditioners. The convergence and comparison theorems of the modified Gauss-Seidel methods with these two preconditioners for solving the linear system are established. The convergence rates of the new proposed preconditioned methods are compared. In addition, numerical experiments are used to show the effectiveness of the new MGS methods.

  16. Simultaneous Robust Fault and State Estimation for Linear Discrete-Time Uncertain Systems

    Directory of Open Access Journals (Sweden)

    Feten Gannouni

    2017-01-01

    Full Text Available We consider the problem of robust simultaneous fault and state estimation for linear uncertain discrete-time systems with unknown faults which affect both the state and the observation matrices. Using transformation of the original system, a new robust proportional integral filter (RPIF having an error variance with an optimized guaranteed upper bound for any allowed uncertainty is proposed to improve robust estimation of unknown time-varying faults and to improve robustness against uncertainties. In this study, the minimization problem of the upper bound of the estimation error variance is formulated as a convex optimization problem subject to linear matrix inequalities (LMI for all admissible uncertainties. The proportional and the integral gains are optimally chosen by solving the convex optimization problem. Simulation results are given in order to illustrate the performance of the proposed filter, in particular to solve the problem of joint fault and state estimation.

  17. Indirect synthesis of multi-degree of freedom transient systems. [linear programming for a kinematically linear system

    Science.gov (United States)

    Pilkey, W. D.; Chen, Y. H.

    1974-01-01

    An indirect synthesis method is used in the efficient optimal design of multi-degree of freedom, multi-design element, nonlinear, transient systems. A limiting performance analysis which requires linear programming for a kinematically linear system is presented. The system is selected using system identification methods such that the designed system responds as closely as possible to the limiting performance. The efficiency is a result of the method avoiding the repetitive systems analyses accompanying other numerical optimization methods.

  18. The Inverse System Method Applied to the Derivation of Power System Non—linear Control Laws

    Institute of Scientific and Technical Information of China (English)

    DonghaiLI; XuezhiJIANG; 等

    1997-01-01

    The differential geometric method has been applied to a series of power system non-linear control problems effectively.However a set of differential equations must be solved for obtaining the required diffeomorphic transformation.Therefore the derivation of control laws is very complicated.In fact because of the specificity of power system models the required diffeomorphic transformation may be obtained directly,so it is unnecessary to solve a set of differential equations.In addition inverse system method is equivalent to differential geometric method in reality and not limited to affine nonlinear systems,Its physical meaning is able to be viewed directly and its deduction needs only algebraic operation and derivation,so control laws can be obtained easily and the application to engineering is very convenient.Authors of this paper take steam valving control of power system as a typical case to be studied.It is demonstrated that the control law deduced by inverse system method is just the same as one by differential geometric method.The conclusion will simplify the control law derivations of steam valving,excitation,converter and static var compensator by differential geometric method and may be suited to similar control problems in other areas.

  19. Minimal solution of general dual fuzzy linear systems

    International Nuclear Information System (INIS)

    Abbasbandy, S.; Otadi, M.; Mosleh, M.

    2008-01-01

    Fuzzy linear systems of equations, play a major role in several applications in various area such as engineering, physics and economics. In this paper, we investigate the existence of a minimal solution of general dual fuzzy linear equation systems. Two necessary and sufficient conditions for the minimal solution existence are given. Also, some examples in engineering and economic are considered

  20. Partial Linearization of Mechanical Systems with Application to Observer Design

    NARCIS (Netherlands)

    Sarras, Ioannis; Venkatraman, Aneesh; Ortega, Romeo; Schaft, Arjan van der

    2008-01-01

    We consider general mechanical systems and establish a necessary and sufficient condition for the existence of a suitable change in the generalized momentum coordinates such that the new dynamics become linear in the transformed momenta. The class of systems which can be (partially) linearized by

  1. Simultaneous Balancing and Model Reduction of Switched Linear Systems

    NARCIS (Netherlands)

    Monshizadeh, Nima; Trentelman, Hendrikus; Camlibel, M.K.

    2011-01-01

    In this paper, first, balanced truncation of linear systems is revisited. Then, simultaneous balancing of multiple linear systems is investigated. Necessary and sufficient conditions are introduced to identify the case where simultaneous balancing is possible. The validity of these conditions is not

  2. Problems of systems dataware using optoelectronic measuring means of linear displacement

    Science.gov (United States)

    Bazykin, S. N.; Bazykina, N. A.; Samohina, K. S.

    2017-10-01

    Problems of the dataware of the systems with the use of optoelectronic means of the linear displacement are considered in the article. The classification of the known physical effects, realized by the means of information-measuring systems, is given. The organized analysis of information flows in technical systems from the standpoint of determination of inaccuracies of measurement and management was conducted. In spite of achieved successes in automation of machine-building and instruments-building equipment in the field of dataware of the technical systems, there are unresolved problems, concerning the qualitative aspect of the production process. It was shown that the given problem can be solved using optoelectronic lazer information-measuring systems. Such information-measuring systems are capable of not only executing the measuring functions, but also solving the problems of management and control during processing, thereby guaranteeing the quality of final products.

  3. Stability Analysis for Fractional-Order Linear Singular Delay Differential Systems

    Directory of Open Access Journals (Sweden)

    Hai Zhang

    2014-01-01

    Full Text Available We investigate the delay-independently asymptotic stability of fractional-order linear singular delay differential systems. Based on the algebraic approach, the sufficient conditions are presented to ensure the asymptotic stability for any delay parameter. By applying the stability criteria, one can avoid solving the roots of transcendental equations. An example is also provided to illustrate the effectiveness and applicability of the theoretical results.

  4. Linear System Control Using Stochastic Learning Automata

    Science.gov (United States)

    Ziyad, Nigel; Cox, E. Lucien; Chouikha, Mohamed F.

    1998-01-01

    This paper explains the use of a Stochastic Learning Automata (SLA) to control switching between three systems to produce the desired output response. The SLA learns the optimal choice of the damping ratio for each system to achieve a desired result. We show that the SLA can learn these states for the control of an unknown system with the proper choice of the error criteria. The results of using a single automaton are compared to using multiple automata.

  5. Useful tools for non-linear systems: Several non-linear integral inequalities

    Czech Academy of Sciences Publication Activity Database

    Agahi, H.; Mohammadpour, A.; Mesiar, Radko; Vaezpour, M. S.

    2013-01-01

    Roč. 49, č. 1 (2013), s. 73-80 ISSN 0950-7051 R&D Projects: GA ČR GAP402/11/0378 Institutional support: RVO:67985556 Keywords : Monotone measure * Comonotone functions * Integral inequalities * Universal integral Subject RIV: BA - General Mathematics Impact factor: 3.058, year: 2013 http://library.utia.cas.cz/separaty/2013/E/mesiar-useful tools for non-linear systems several non-linear integral inequalities.pdf

  6. Decentralized linear quadratic power system stabilizers for multi ...

    Indian Academy of Sciences (India)

    Introduction. Modern excitation systems considerably enhance the overall transient stability of power systems ..... to the local bus rather than the angle δ measured with respect to the remote bus. ... With this in view, the linear and nonlinear per-.

  7. Application of Homotopy Analysis Method to Solve Relativistic Toda Lattice System

    International Nuclear Information System (INIS)

    Wang Qi

    2010-01-01

    In this letter, the homotopy analysis method is successfully applied to solve the Relativistic Toda lattice system. Comparisons are made between the results of the proposed method and exact solutions. Analysis results show that homotopy analysis method is a powerful and easy-to-use analytic tool to solve systems of differential-difference equations. (general)

  8. Solving nonlinear evolution equation system using two different methods

    Science.gov (United States)

    Kaplan, Melike; Bekir, Ahmet; Ozer, Mehmet N.

    2015-12-01

    This paper deals with constructing more general exact solutions of the coupled Higgs equation by using the (G0/G, 1/G)-expansion and (1/G0)-expansion methods. The obtained solutions are expressed by three types of functions: hyperbolic, trigonometric and rational functions with free parameters. It has been shown that the suggested methods are productive and will be used to solve nonlinear partial differential equations in applied mathematics and engineering. Throughout the paper, all the calculations are made with the aid of the Maple software.

  9. The numerical solution of linear multi-term fractional differential equations: systems of equations

    Science.gov (United States)

    Edwards, John T.; Ford, Neville J.; Simpson, A. Charles

    2002-11-01

    In this paper, we show how the numerical approximation of the solution of a linear multi-term fractional differential equation can be calculated by reduction of the problem to a system of ordinary and fractional differential equations each of order at most unity. We begin by showing how our method applies to a simple class of problems and we give a convergence result. We solve the Bagley Torvik equation as an example. We show how the method can be applied to a general linear multi-term equation and give two further examples.

  10. Finite-Time Stability Analysis of Discrete-Time Linear Singular Systems

    Directory of Open Access Journals (Sweden)

    Songlin Wo

    2014-01-01

    Full Text Available The finite-time stability (FTS problem of discrete-time linear singular systems (DTLSS is considered in this paper. A necessary and sufficient condition for FTS is obtained, which can be expressed in terms of matrix inequalities. Then, another form of the necessary and sufficient condition for FTS is also given by using matrix-null space technology. In order to solve the stability problem expediently, a sufficient condition for FTS is given via linear matrix inequality (LMI approach; this condition can be expressed in terms of LMIs. Finally, an illustrating example is also given to show the effectiveness of the proposed method.

  11. Finite-Time H∞ Filtering for Linear Continuous Time-Varying Systems with Uncertain Observations

    Directory of Open Access Journals (Sweden)

    Huihong Zhao

    2012-01-01

    Full Text Available This paper is concerned with the finite-time H∞ filtering problem for linear continuous time-varying systems with uncertain observations and ℒ2-norm bounded noise. The design of finite-time H∞ filter is equivalent to the problem that a certain indefinite quadratic form has a minimum and the filter is such that the minimum is positive. The quadratic form is related to a Krein state-space model according to the Krein space linear estimation theory. By using the projection theory in Krein space, the finite-time H∞ filtering problem is solved. A numerical example is given to illustrate the performance of the H∞ filter.

  12. A new active absorption system and its performance to linear and non-linear waves

    DEFF Research Database (Denmark)

    Andersen, Thomas Lykke; Clavero, M.; Frigaard, Peter Bak

    2016-01-01

    Highlights •An active absorption system for wavemakers has been developed. •The theory for flush mounted gauges has been extended to cover also small gaps. •The new system has been validated in a wave flume with wavemakers in both ends. •A generation and absorption procedure for highly non-linear...

  13. Supersymmetric Yang-Mills fields as an integrable system and connections with other non-linear systems

    International Nuclear Information System (INIS)

    Chau, L.L.

    1983-01-01

    Integrable properties, i.e., existence of linear systems, infinite number of conservation laws, Reimann-Hilbert transforms, affine Lie algebra of Kac-Moody, and Bianchi-Baecklund transformation, are discussed for the constraint equations of the supersymmetric Yang-Mills fields. For N greater than or equal to 3 these constraint equations give equations of motion of the fields. These equations of motion reduce to the ordinary Yang-Mills equations as the spinor and scalar fields are eliminated. These understandings provide a possible method to solve the full Yang-Mills equations. Connections with other non-linear systems are also discussed. 53 references

  14. Utilizing a Coupled Nonlinear Schrödinger Model to Solve the Linear Modal Problem for Stratified Flows

    Science.gov (United States)

    Liu, Tianyang; Chan, Hiu Ning; Grimshaw, Roger; Chow, Kwok Wing

    2017-11-01

    The spatial structure of small disturbances in stratified flows without background shear, usually named the `Taylor-Goldstein equation', is studied by employing the Boussinesq approximation (variation in density ignored except in the buoyancy). Analytical solutions are derived for special wavenumbers when the Brunt-Väisälä frequency is quadratic in hyperbolic secant, by comparison with coupled systems of nonlinear Schrödinger equations intensively studied in the literature. Cases of coupled Schrödinger equations with four, five and six components are utilized as concrete examples. Dispersion curves for arbitrary wavenumbers are obtained numerically. The computations of the group velocity, second harmonic, induced mean flow, and the second derivative of the angular frequency can all be facilitated by these exact linear eigenfunctions of the Taylor-Goldstein equation in terms of hyperbolic function, leading to a cubic Schrödinger equation for the evolution of a wavepacket. The occurrence of internal rogue waves can be predicted if the dispersion and cubic nonlinearity terms of the Schrödinger equations are of the same sign. Partial financial support has been provided by the Research Grants Council contract HKU 17200815.

  15. On Optimal Feedback Control for Stationary Linear Systems

    International Nuclear Information System (INIS)

    Russell, David L.

    2010-01-01

    We study linear-quadratic optimal control problems for finite dimensional stationary linear systems AX+BU=Z with output Y=CX+DU from the viewpoint of linear feedback solution. We interpret solutions in relation to system robustness with respect to disturbances Z and relate them to nonlinear matrix equations of Riccati type and eigenvalue-eigenvector problems for the corresponding Hamiltonian system. Examples are included along with an indication of extensions to continuous, i.e., infinite dimensional, systems, primarily of elliptic type.

  16. Virtual Estimator for Piecewise Linear Systems Based on Observability Analysis

    Science.gov (United States)

    Morales-Morales, Cornelio; Adam-Medina, Manuel; Cervantes, Ilse; Vela-Valdés and, Luis G.; García Beltrán, Carlos Daniel

    2013-01-01

    This article proposes a virtual sensor for piecewise linear systems based on observability analysis that is in function of a commutation law related with the system's outpu. This virtual sensor is also known as a state estimator. Besides, it presents a detector of active mode when the commutation sequences of each linear subsystem are arbitrary and unknown. For the previous, this article proposes a set of virtual estimators that discern the commutation paths of the system and allow estimating their output. In this work a methodology in order to test the observability for piecewise linear systems with discrete time is proposed. An academic example is presented to show the obtained results. PMID:23447007

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

  18. Increase of nonlinear signal distortions due to linear mode coupling in space division multiplexed systems

    DEFF Research Database (Denmark)

    Kutluyarov, Ruslan V.; Bagmanov, Valeriy Kh; Antonov, Vyacheslav V.

    2017-01-01

    This paper is focused on the analysis of linear and nonlinear mode coupling in space division multiplexed (SDM) optical communications over step-index fiber in few-mode regime. Linear mode coupling is caused by the fiber imperfections, while the nonlinear coupling is caused by the Kerr......-nonlinearities. Therefore, we use the system of generalized coupled nonlinear Schrödinger equations (GCNLSE) to describe the signal propagation. We analytically show that the presence of linear mode coupling may cause increasing of the nonlinear signal distortions. For the detailed study we solve GCNLSE numerically...... for the standard step index fiber at the wavelength of 850 nm in the basis of spatial modes with helical phase front (vortex modes) and for a special kind of few-mode fiber with enlarged core, providing propagation of five spatial modes at 1550 nm. Simulation results confirm that the linear mode coupling may lead...

  19. Gradient remediability in linear distributed parabolic systems ...

    African Journals Online (AJOL)

    The aim of this paper is the introduction of a new concept that concerned the analysis of a large class of distributed parabolic systems. It is the general concept of gradient remediability. More precisely, we study with respect to the gradient observation, the existence of an input operator (gradient efficient actuators) ensuring ...

  20. Explicit/multi-parametric model predictive control (MPC) of linear discrete-time systems by dynamic and multi-parametric programming

    KAUST Repository

    Kouramas, K.I.; Faí sca, N.P.; Panos, C.; Pistikopoulos, E.N.

    2011-01-01

    This work presents a new algorithm for solving the explicit/multi- parametric model predictive control (or mp-MPC) problem for linear, time-invariant discrete-time systems, based on dynamic programming and multi-parametric programming techniques

  1. Linearization of Nonautonomous Impulsive System with Nonuniform Exponential Dichotomy

    Directory of Open Access Journals (Sweden)

    Yongfei Gao

    2014-01-01

    Full Text Available This paper gives a version of Hartman-Grobman theorem for the impulsive differential equations. We assume that the linear impulsive system has a nonuniform exponential dichotomy. Under some suitable conditions, we proved that the nonlinear impulsive system is topologically conjugated to its linear system. Indeed, we do construct the topologically equivalent function (the transformation. Moreover, the method to prove the topological conjugacy is quite different from those in previous works (e.g., see Barreira and Valls, 2006.

  2. On the discretization of linear fractional representations of LPV systems

    NARCIS (Netherlands)

    Toth, R.; Lovera, M.; Heuberger, P.S.C.; Corno, M.; Hof, Van den P.M.J.

    2012-01-01

    Commonly, controllers for linear parameter-varying (LPV) systems are designed in continuous time using a linear fractional representation (LFR) of the plant. However, the resulting controllers are implemented on digital hardware. Furthermore, discrete-time LPV synthesis approaches require a

  3. Automatic frequency control system for driving a linear accelerator

    International Nuclear Information System (INIS)

    Helgesson, A.L.

    1976-01-01

    An automatic frequency control system is described for maintaining the drive frequency applied to a linear accelerator to produce maximum particle output from the accelerator. The particle output amplitude is measured and the frequency of the radio frequency source powering the linear accelerator is adjusted to maximize particle output amplitude

  4. Feedback linearizing control of a MIMO power system

    Science.gov (United States)

    Ilyes, Laszlo

    Prior research has demonstrated that either the mechanical or electrical subsystem of a synchronous electric generator may be controlled using single-input single-output (SISO) nonlinear feedback linearization. This research suggests a new approach which applies nonlinear feedback linearization to a multi-input multi-output (MIMO) model of the synchronous electric generator connected to an infinite bus load model. In this way, the electrical and mechanical subsystems may be linearized and simultaneously decoupled through the introduction of a pair of auxiliary inputs. This allows well known, linear, SISO control methods to be effectively applied to the resulting systems. The derivation of the feedback linearizing control law is presented in detail, including a discussion on the use of symbolic math processing as a development tool. The linearizing and decoupling properties of the control law are validated through simulation. And finally, the robustness of the control law is demonstrated.

  5. Stochastic linear hybrid systems: Modeling, estimation, and application

    Science.gov (United States)

    Seah, Chze Eng

    Hybrid systems are dynamical systems which have interacting continuous state and discrete state (or mode). Accurate modeling and state estimation of hybrid systems are important in many applications. We propose a hybrid system model, known as the Stochastic Linear Hybrid System (SLHS), to describe hybrid systems with stochastic linear system dynamics in each mode and stochastic continuous-state-dependent mode transitions. We then develop a hybrid estimation algorithm, called the State-Dependent-Transition Hybrid Estimation (SDTHE) algorithm, to estimate the continuous state and discrete state of the SLHS from noisy measurements. It is shown that the SDTHE algorithm is more accurate or more computationally efficient than existing hybrid estimation algorithms. Next, we develop a performance analysis algorithm to evaluate the performance of the SDTHE algorithm in a given operating scenario. We also investigate sufficient conditions for the stability of the SDTHE algorithm. The proposed SLHS model and SDTHE algorithm are illustrated to be useful in several applications. In Air Traffic Control (ATC), to facilitate implementations of new efficient operational concepts, accurate modeling and estimation of aircraft trajectories are needed. In ATC, an aircraft's trajectory can be divided into a number of flight modes. Furthermore, as the aircraft is required to follow a given flight plan or clearance, its flight mode transitions are dependent of its continuous state. However, the flight mode transitions are also stochastic due to navigation uncertainties or unknown pilot intents. Thus, we develop an aircraft dynamics model in ATC based on the SLHS. The SDTHE algorithm is then used in aircraft tracking applications to estimate the positions/velocities of aircraft and their flight modes accurately. Next, we develop an aircraft conformance monitoring algorithm to detect any deviations of aircraft trajectories in ATC that might compromise safety. In this application, the SLHS

  6. Portable, x-band, linear accelerator systems

    International Nuclear Information System (INIS)

    Schonberg, R.G.; Deruyter, H.; Fowkes, W.R.; Johnson, W.A.; Miller, R.H.; Potter, J.M.; Weaver, J.N.

    1985-01-01

    Three light-weight, x-band, electron accelerators have been developed to provide a series of highly portable sources of x-rays and neutrons for nondestructive testing. The 1.5 MeV x-ray unit has a 200 kW magnetron for an RF source and an air-cooled, traveling wave accelerating structure to minimize its weight. The 4 and 6 MeV units share the same drive system which contains a 1.2 MW magnetron. The 4 MeV unit uses a traveling-wave guide to produce x-rays and the 6MeV unit uses a standing-wave guide to produce x-rays or neutrons. The choice of 9.3 GHz was dictated by the availability of a high power coaxial magnetron and by the obvious dimensional and weight advantages of a higher frequency over the more common S-band frequencies around 3 GHz

  7. Using a Recommendation System to Support Problem Solving and Case-Based Reasoning Retrieval

    Science.gov (United States)

    Tawfik, Andrew A.; Alhoori, Hamed; Keene, Charles Wayne; Bailey, Christian; Hogan, Maureen

    2018-01-01

    In case library learning environments, learners are presented with an array of narratives that can be used to guide their problem solving. However, according to theorists, learners struggle to identify and retrieve the optimal case to solve a new problem. Given the challenges novice face during case retrieval, recommender systems can be embedded…

  8. Workflow Agents vs. Expert Systems: Problem Solving Methods in Work Systems Design

    Science.gov (United States)

    Clancey, William J.; Sierhuis, Maarten; Seah, Chin

    2009-01-01

    During the 1980s, a community of artificial intelligence researchers became interested in formalizing problem solving methods as part of an effort called "second generation expert systems" (2nd GES). How do the motivations and results of this research relate to building tools for the workplace today? We provide an historical review of how the theory of expertise has developed, a progress report on a tool for designing and implementing model-based automation (Brahms), and a concrete example how we apply 2nd GES concepts today in an agent-based system for space flight operations (OCAMS). Brahms incorporates an ontology for modeling work practices, what people are doing in the course of a day, characterized as "activities." OCAMS was developed using a simulation-to-implementation methodology, in which a prototype tool was embedded in a simulation of future work practices. OCAMS uses model-based methods to interactively plan its actions and keep track of the work to be done. The problem solving methods of practice are interactive, employing reasoning for and through action in the real world. Analogously, it is as if a medical expert system were charged not just with interpreting culture results, but actually interacting with a patient. Our perspective shifts from building a "problem solving" (expert) system to building an actor in the world. The reusable components in work system designs include entire "problem solvers" (e.g., a planning subsystem), interoperability frameworks, and workflow agents that use and revise models dynamically in a network of people and tools. Consequently, the research focus shifts so "problem solving methods" include ways of knowing that models do not fit the world, and ways of interacting with other agents and people to gain or verify information and (ultimately) adapt rules and procedures to resolve problematic situations.

  9. Structure Learning in Stochastic Non-linear Dynamical Systems

    Science.gov (United States)

    Morris, R. D.; Smelyanskiy, V. N.; Luchinsky, D. G.

    2005-12-01

    A great many systems can be modeled in the non-linear dynamical systems framework, as x˙ = f(x) + ξ(t), where f(x) is the potential function for the system, and ξ(t) is the driving noise. Modeling the potential using a set of basis functions, we derive the posterior for the basis coefficients. A more challenging problem is to determine the set of basis functions that are required to model a particular system. We show that using the Bayesian Information Criteria (BIC) to rank models, and the beam search technique, that we can accurately determine the structure of simple non-linear dynamical system models, and the structure of the coupling between non-linear dynamical systems where the individual systems are known. This last case has important ecological applications, for example in predator-prey systems, where the very structure of the coupling between predator-prey pairs can have great ecological significance.

  10. Fractional order differentiation by integration: An application to fractional linear systems

    KAUST Repository

    Liu, Dayan

    2013-02-04

    In this article, we propose a robust method to compute the output of a fractional linear system defined through a linear fractional differential equation (FDE) with time-varying coefficients, where the input can be noisy. We firstly introduce an estimator of the fractional derivative of an unknown signal, which is defined by an integral formula obtained by calculating the fractional derivative of a truncated Jacobi polynomial series expansion. We then approximate the FDE by applying to each fractional derivative this formal algebraic integral estimator. Consequently, the fractional derivatives of the solution are applied on the used Jacobi polynomials and then we need to identify the unknown coefficients of the truncated series expansion of the solution. Modulating functions method is used to estimate these coefficients by solving a linear system issued from the approximated FDE and some initial conditions. A numerical result is given to confirm the reliability of the proposed method. © 2013 IFAC.

  11. An Offline Formulation of MPC for LPV Systems Using Linear Matrix Inequalities

    Directory of Open Access Journals (Sweden)

    P. Bumroongsri

    2014-01-01

    Full Text Available An offline model predictive control (MPC algorithm for linear parameter varying (LPV systems is presented. The main contribution is to develop an offline MPC algorithm for LPV systems that can deal with both time-varying scheduling parameter and persistent disturbance. The norm-bounding technique is used to derive an offline MPC algorithm based on the parameter-dependent state feedback control law and the parameter-dependent Lyapunov functions. The online computational time is reduced by solving offline the linear matrix inequality (LMI optimization problems to find the sequences of explicit state feedback control laws. At each sampling instant, a parameter-dependent state feedback control law is computed by linear interpolation between the precomputed state feedback control laws. The algorithm is illustrated with two examples. The results show that robust stability can be ensured in the presence of both time-varying scheduling parameter and persistent disturbance.

  12. Portable, x-band, linear accelerator systems

    International Nuclear Information System (INIS)

    Schonberg, R.G.; Deruyter, H.; Fowkes, W.R.; Johnson, W.A.; Miller, R.H.; Potter, J.M.; Weaver, J.N.

    1985-01-01

    Three light-weight, x-band, electron accelerators have been developed to provide a series of highly portable sources of x-rays and neutrons for non-destructive testing. The 1.5 MeV x-ray unit has a 200 kW magnetron for an RF source and an air-cooled, traveling wave accelerating structure to minimize its weight. The 4 and 6 MeV units share the same drive system which contains a 1.2 MW magnetron. The 4 MeV unit uses a traveling-wave guide to produce x-rays and the 6MeV unit uses a standing-wave guide to produce x-rays or neutrons. The choice of 9.3 GHz was dictated by the availability of a high power coaxial magnetron and by the obvious dimensional and weight advantages of a higher frequency over the more common S-band frequencies around 3 GHz

  13. Linear quadratic Gaussian balancing for discrete-time infinite-dimensional linear systems

    NARCIS (Netherlands)

    Opmeer, MR; Curtain, RF

    2004-01-01

    In this paper, we study the existence of linear quadratic Gaussian (LQG)-balanced realizations for discrete-time infinite-dimensional systems. LQG-balanced realizations are those for which the smallest nonnegative self-adjoint solutions of the control and filter Riccati equations are equal. We show

  14. Sparse Linear Solver for Power System Analysis Using FPGA

    National Research Council Canada - National Science Library

    Johnson, J. R; Nagvajara, P; Nwankpa, C

    2005-01-01

    .... Numerical solution to load flow equations are typically computed using Newton-Raphson iteration, and the most time consuming component of the computation is the solution of a sparse linear system...

  15. Perfect commuting-operator strategies for linear system games

    Science.gov (United States)

    Cleve, Richard; Liu, Li; Slofstra, William

    2017-01-01

    Linear system games are a generalization of Mermin's magic square game introduced by Cleve and Mittal. They show that perfect strategies for linear system games in the tensor-product model of entanglement correspond to finite-dimensional operator solutions of a certain set of non-commutative equations. We investigate linear system games in the commuting-operator model of entanglement, where Alice and Bob's measurement operators act on a joint Hilbert space, and Alice's operators must commute with Bob's operators. We show that perfect strategies in this model correspond to possibly infinite-dimensional operator solutions of the non-commutative equations. The proof is based around a finitely presented group associated with the linear system which arises from the non-commutative equations.

  16. Knowledge acquisition from natural language for expert systems based on classification problem-solving methods

    Science.gov (United States)

    Gomez, Fernando

    1989-01-01

    It is shown how certain kinds of domain independent expert systems based on classification problem-solving methods can be constructed directly from natural language descriptions by a human expert. The expert knowledge is not translated into production rules. Rather, it is mapped into conceptual structures which are integrated into long-term memory (LTM). The resulting system is one in which problem-solving, retrieval and memory organization are integrated processes. In other words, the same algorithm and knowledge representation structures are shared by these processes. As a result of this, the system can answer questions, solve problems or reorganize LTM.

  17. A conceptual design of Final Focus Systems for linear colliders

    International Nuclear Information System (INIS)

    Brown, K.L.

    1987-06-01

    Linear colliders are a relatively recent development in the evolution of particle accelerators. This report discusses some of the approaches that have been considered for the design of Final Focus Systems to demagnify the beam exiting from a linac to the small size suitable for collisions at the interaction point. The system receiving the most attention is the one adopted for the SLAC Linear Collider. However, the theory and optical techniques discussed should be applicable to the design efforts for future machines

  18. Simultaneous Balancing and Model Reduction of Switched Linear Systems

    OpenAIRE

    Monshizadeh, Nima; Trentelman, Hendrikus; Camlibel, M.K.

    2011-01-01

    In this paper, first, balanced truncation of linear systems is revisited. Then, simultaneous balancing of multiple linear systems is investigated. Necessary and sufficient conditions are introduced to identify the case where simultaneous balancing is possible. The validity of these conditions is not limited to a certain type of balancing, and they are applicable for different types of balancing corresponding to different equations, like Lyapunov or Riccati equations. The results obtained are ...

  19. Solar photovoltaic water pumping system using a new linear actuator

    OpenAIRE

    Andrada Gascón, Pedro; Castro, Javier

    2007-01-01

    In this paper a photovoltaic solar pumping system using a new linear actuator is presented. This linear actuator is a double-sided flat two-phase variable-reluctance linear stepper motor that moves a piston-type water pump with the help of a rope, a pulley and a counterweight. The entire actuator pump ensemble is controlled by a simple electronic unit that manages the electric power generated by a photovoltaic array. The proposed system is suitable for rural communities in developing...

  20. Exploring inductive linearization for pharmacokinetic-pharmacodynamic systems of nonlinear ordinary differential equations.

    Science.gov (United States)

    Hasegawa, Chihiro; Duffull, Stephen B

    2018-02-01

    Pharmacokinetic-pharmacodynamic systems are often expressed with nonlinear ordinary differential equations (ODEs). While there are numerous methods to solve such ODEs these methods generally rely on time-stepping solutions (e.g. Runge-Kutta) which need to be matched to the characteristics of the problem at hand. The primary aim of this study was to explore the performance of an inductive approximation which iteratively converts nonlinear ODEs to linear time-varying systems which can then be solved algebraically or numerically. The inductive approximation is applied to three examples, a simple nonlinear pharmacokinetic model with Michaelis-Menten elimination (E1), an integrated glucose-insulin model and an HIV viral load model with recursive feedback systems (E2 and E3, respectively). The secondary aim of this study was to explore the potential advantages of analytically solving linearized ODEs with two examples, again E3 with stiff differential equations and a turnover model of luteinizing hormone with a surge function (E4). The inductive linearization coupled with a matrix exponential solution provided accurate predictions for all examples with comparable solution time to the matched time-stepping solutions for nonlinear ODEs. The time-stepping solutions however did not perform well for E4, particularly when the surge was approximated by a square wave. In circumstances when either a linear ODE is particularly desirable or the uncertainty in matching the integrator to the ODE system is of potential risk, then the inductive approximation method coupled with an analytical integration method would be an appropriate alternative.

  1. Phase and amplitude detection system for the Stanford Linear Accelerator

    International Nuclear Information System (INIS)

    Fox, J.D.; Schwarz, H.D.

    1983-01-01

    A computer controlled phase and amplitude detection system to measure and stabilize the rf power sources in the Stanford Linear Accelerator is described. This system measures the instantaneous phase and amplitude of a 1 microsecond 2856 MHz rf pulse and will be used for phase feedback control and for amplitude and phase jitter detection. This paper discusses the measurement system performance requirements for the operation of the Stanford Linear Collider, and the design and implementation of the phase and amplitude detection system. The fundamental software algorithms used in the measurement are described, as is the performance of the prototype phase and amplitude detector system

  2. Synchronization of linearly coupled unified chaotic systems based on linear balanced feedback scheme with constraints

    International Nuclear Information System (INIS)

    Chen, H.-H.; Chen, C.-S.; Lee, C.-I

    2009-01-01

    This paper investigates the synchronization of unidirectional and bidirectional coupled unified chaotic systems. A balanced coupling coefficient control method is presented for global asymptotic synchronization using the Lyapunov stability theorem and a minimum scheme with no constraints/constraints. By using the result of the above analysis, the balanced coupling coefficients are then designed to achieve the chaos synchronization of linearly coupled unified chaotic systems. The feasibility and effectiveness of the proposed chaos synchronization scheme are verified via numerical simulations.

  3. Should Pruning be a Pre-Processor of any Linear System?

    Science.gov (United States)

    Sen, Syamal K.; Ramakrishnan, Suja; Agarwal, Ravi P.; Shaykhian, Gholam Ali

    2011-01-01

    There are many real-world problems whose mathematical models turn out to be linear systems Ax = b, where A is an m x n matrix. Each equation of the linear system is an information. An information, in a physical problem, such as 4 mangoes, 6 bananas, and 5 oranges cost $10, is mathematically modeled as an equation 4x(sub 1) + 6x(sub 2) + 5x(sub 3) = 10 , where x(sub 1), x(sub 2), x(sub 3) are each cost of one mango, that of one banana, and that of one orange, respectively. All the information put together in a specified context, constitutes the physical problem and need not be all distinct. Some of these could be redundant, which cannot be readily identified by inspection. The resulting mathematical model will thus have equations corresponding to this redundant information and hence are linearly dependent and thus superfluous. Consequently, these equations once identified should be better pruned in the process of solving the system. The benefits are (i) less computation and hence less error and consequently a better quality of solution and (ii) reduced storage requirements. In literature, the pruning concept is not in vogue so far although it is most desirable. It is assumed that at least one information, i.e. one equation is known to be correct and which will be our first equation. In a numerical linear system, the system could be slightly inconsistent or inconsistent of varying degree. If the system is too inconsistent, then we should fall back on to the physical problem (PP), check the correctness of the PP derived from the material universe, modify it, if necessary, and then check the corresponding mathematical model (MM) and correct it. In nature/material universe, inconsistency is completely nonexistent. If the MM becomes inconsistent, it could be due to error introduced by the concerned measuring device and/or due to assumptions made on the PP to obtain an MM which is relatively easily solvable or simply due to human error. No measuring device can usually

  4. EDDYMULT: a computing system for solving eddy current problems in a multi-torus system

    International Nuclear Information System (INIS)

    Nakamura, Yukiharu; Ozeki, Takahisa

    1989-03-01

    A new computing system EDDYMULT based on the finite element circuit method has been developed to solve actual eddy current problems in a multi-torus system, which consists of many torus-conductors and various kinds of axisymmetric poloidal field coils. The EDDYMULT computing system can deal three-dimensionally with the modal decomposition of eddy current in a multi-torus system, the transient phenomena of eddy current distributions and the resultant magnetic field. Therefore, users can apply the computing system to the solution of the eddy current problems in a tokamak fusion device, such as the design of poloidal field coil power supplies, the mechanical stress design of the intensive electromagnetic loading on device components and the control analysis of plasma position. The present report gives a detailed description of the EDDYMULT system as an user's manual: 1) theory, 2) structure of the code system, 3) input description, 4) problem restrictions, 5) description of the subroutines, etc. (author)

  5. Economic MPC for a linear stochastic system of energy units

    DEFF Research Database (Denmark)

    Jørgensen, John Bagterp; Sokoler, Leo Emil; Standardi, Laura

    2016-01-01

    This paper summarizes comprehensively the work in four recent PhD theses from the Technical University of Denmark related to Economic MPC of future power systems. Future power systems will consist of a large number of decentralized power producers and a large number of controllable power consumers...... in addition to stochastic power producers such as wind turbines and solar power plants. Control of such large scale systems requires new control algorithms. In this paper, we formulate the control of such a system as an Economic Model Predictive Control (MPC) problem. When the power producers and controllable...... power consumers have linear dynamics, the Economic MPC may be expressed as a linear program. We provide linear models for a number of energy units in an energy system, formulate an Economic MPC for coordination of such a system. We indicate how advances in computational MPC makes the solutions...

  6. Stability analysis of switched linear systems defined by graphs

    NARCIS (Netherlands)

    Athanasopoulos, N.; Lazar, M.

    2014-01-01

    We present necessary and sufficient conditions for global exponential stability for switched discrete-time linear systems, under arbitrary switching, which is constrained within a set of admissible transitions. The class of systems studied includes the family of systems under arbitrary switching,

  7. Euclidean null controllability of linear systems with delays in state ...

    African Journals Online (AJOL)

    Sufficient conditions are developed for the Euclidean controllability of linear systems with delay in state and in control. Namely, if the uncontrolled system is uniformly asymptotically stable and the control equation proper, then the control system is Euclidean null controllable. Journal of the Nigerian Association of ...

  8. Incremental Closed-loop Identification of Linear Parameter Varying Systems

    DEFF Research Database (Denmark)

    Bendtsen, Jan Dimon; Trangbæk, Klaus

    2011-01-01

    , closed-loop system identification is more difficult than open-loop identification. In this paper we prove that the so-called Hansen Scheme, a technique known from linear time-invariant systems theory for transforming closed-loop system identification problems into open-loop-like problems, can be extended...

  9. Linear Optimization of Frequency Spectrum Assignments Across System

    Science.gov (United States)

    2016-03-01

    selection tools, frequency allocation, transmission optimization, electromagnetic maneuver warfare, electronic protection, assignment model 15. NUMBER ...Characteristics Modeled ...............................................................29 Table 10.   Antenna Systems Modeled , Number of Systems and...surveillance EW early warning GAMS general algebraic modeling system GHz gigahertz IDE integrated development environment ILP integer linear program

  10. Solving system of DAEs by homotopy analysis method

    International Nuclear Information System (INIS)

    Awawdeh, Fadi; Jaradat, H.M.; Alsayyed, O.

    2009-01-01

    Homotopy analysis method (HAM) is applied to systems of differential-algebraic equations (DAEs). The HAM is proved to be very effective, simple and convenient to give approximate analytical solutions to DAEs.

  11. Solving polynomial systems using no-root elimination blending schemes

    KAUST Repository

    Barton, Michael

    2011-01-01

    Searching for the roots of (piecewise) polynomial systems of equations is a crucial problem in computer-aided design (CAD), and an efficient solution is in strong demand. Subdivision solvers are frequently used to achieve this goal; however

  12. Analytical-Algebraic Approach to Solving Chaotic System

    Czech Academy of Sciences Publication Activity Database

    Beran, Zdeněk; Čelikovský, Sergej

    2016-01-01

    Roč. 26, č. 3 (2016), č. článku 1650051. ISSN 0218-1274 R&D Projects: GA ČR GA13-20433S Institutional support: RVO:67985556 Keywords : Laplace transform * Laplace-Adomian decomposition * Adomian polynomials * nonlinear systems * chaos Subject RIV: BC - Control Systems Theory Impact factor: 1.329, year: 2016 http://library.utia.cas.cz/separaty/2016/TR/beran-0458430.pdf

  13. Solve: a non linear least-squares code and its application to the optimal placement of torsatron vertical field coils

    International Nuclear Information System (INIS)

    Aspinall, J.

    1982-01-01

    A computational method was developed which alleviates the need for lengthy parametric scans as part of a design process. The method makes use of a least squares algorithm to find the optimal value of a parameter vector. Optimal is defined in terms of a utility function prescribed by the user. The placement of the vertical field coils of a torsatron is such a non linear problem

  14. Investigating the Composite Step Biconjugate A-Orthogonal Residual Method for Non-Hermitian Dense Linear Systems in Electromagnetics

    NARCIS (Netherlands)

    Jing, Yan-Fei; Huang, Ting-Zhu; Carpentieri, Bruno; Duan, Yong

    An interesting stabilizing variant of the biconjugate A-orthogonal residual (BiCOR) method is investigated for solving dense complex non-Hermitian systems of linear equations arising from the Galerlcin discretization of surface integral equations in electromagnetics. The novel variant is naturally

  15. A general digital computer procedure for synthesizing linear automatic control systems

    International Nuclear Information System (INIS)

    Cummins, J.D.

    1961-10-01

    The fundamental concepts required for synthesizing a linear automatic control system are considered. A generalized procedure for synthesizing automatic control systems is demonstrated. This procedure has been programmed for the Ferranti Mercury and the IBM 7090 computers. Details of the programmes are given. The procedure uses the linearized set of equations which describe the plant to be controlled as the starting point. Subsequent computations determine the transfer functions between any desired variables. The programmes also compute the root and phase loci for any linear (and some non-linear) configurations in the complex plane, the open loop and closed loop frequency responses of a system, the residues of a function of the complex variable 's' and the time response corresponding to these residues. With these general programmes available the design of 'one point' automatic control systems becomes a routine scientific procedure. Also dynamic assessments of plant may be carried out. Certain classes of multipoint automatic control problems may also be solved with these procedures. Autonomous systems, invariant systems and orthogonal systems may also be studied. (author)

  16. Stability analysis of switched linear systems defined by graphs

    OpenAIRE

    Athanasopoulos, Nikolaos; Lazar, Mircea

    2015-01-01

    We present necessary and sufficient conditions for global exponential stability for switched discrete-time linear systems, under arbitrary switching, which is constrained within a set of admissible transitions. The class of systems studied includes the family of systems under arbitrary switching, periodic systems, and systems with minimum and maximum dwell time specifications. To reach the result, we describe the set of rules that define the admissible transitions with a weighted directed gra...

  17. Modeling and analysis of linear hyperbolic systems of balance laws

    CERN Document Server

    Bartecki, Krzysztof

    2016-01-01

    This monograph focuses on the mathematical modeling of distributed parameter systems in which mass/energy transport or wave propagation phenomena occur and which are described by partial differential equations of hyperbolic type. The case of linear (or linearized) 2 x 2 hyperbolic systems of balance laws is considered, i.e., systems described by two coupled linear partial differential equations with two variables representing physical quantities, depending on both time and one-dimensional spatial variable. Based on practical examples of a double-pipe heat exchanger and a transportation pipeline, two typical configurations of boundary input signals are analyzed: collocated, wherein both signals affect the system at the same spatial point, and anti-collocated, in which the input signals are applied to the two different end points of the system. The results of this book emerge from the practical experience of the author gained during his studies conducted in the experimental installation of a heat exchange cente...

  18. A spectral analysis of the domain decomposed Monte Carlo method for linear systems

    Energy Technology Data Exchange (ETDEWEB)

    Slattery, S. R.; Wilson, P. P. H. [Engineering Physics Department, University of Wisconsin - Madison, 1500 Engineering Dr., Madison, WI 53706 (United States); Evans, T. M. [Oak Ridge National Laboratory, 1 Bethel Valley Road, Oak Ridge, TN 37830 (United States)

    2013-07-01

    The domain decomposed behavior of the adjoint Neumann-Ulam Monte Carlo method for solving linear systems is analyzed using the spectral properties of the linear operator. Relationships for the average length of the adjoint random walks, a measure of convergence speed and serial performance, are made with respect to the eigenvalues of the linear operator. In addition, relationships for the effective optical thickness of a domain in the decomposition are presented based on the spectral analysis and diffusion theory. Using the effective optical thickness, the Wigner rational approximation and the mean chord approximation are applied to estimate the leakage fraction of stochastic histories from a domain in the decomposition as a measure of parallel performance and potential communication costs. The one-speed, two-dimensional neutron diffusion equation is used as a model problem to test the models for symmetric operators. In general, the derived approximations show good agreement with measured computational results. (authors)

  19. A spectral analysis of the domain decomposed Monte Carlo method for linear systems

    International Nuclear Information System (INIS)

    Slattery, S. R.; Wilson, P. P. H.; Evans, T. M.

    2013-01-01

    The domain decomposed behavior of the adjoint Neumann-Ulam Monte Carlo method for solving linear systems is analyzed using the spectral properties of the linear operator. Relationships for the average length of the adjoint random walks, a measure of convergence speed and serial performance, are made with respect to the eigenvalues of the linear operator. In addition, relationships for the effective optical thickness of a domain in the decomposition are presented based on the spectral analysis and diffusion theory. Using the effective optical thickness, the Wigner rational approximation and the mean chord approximation are applied to estimate the leakage fraction of stochastic histories from a domain in the decomposition as a measure of parallel performance and potential communication costs. The one-speed, two-dimensional neutron diffusion equation is used as a model problem to test the models for symmetric operators. In general, the derived approximations show good agreement with measured computational results. (authors)

  20. Australian health system restructuring - what problem is being solved?

    Science.gov (United States)

    Dwyer, Judith M

    2004-11-19

    BACKGROUND: In recent years, Australian state and territory governments have reviewed and restructured the health systems they lead and regulate. This paper examines the outcomes of the most recent official published reviews of systems and structures; identifies the common themes; and addresses two questions: what problems are being addressed? And how would we know if the changes were successful? RESULTS: In all the broad, systemic reviews, the main health system problems identified were money, hospital utilisation and a weak primary health care system. The solutions are various, but there is a common trend towards centralisation of governance, often at state health authority level, and stronger accountability measures. Other common themes are hospital substitution (services to avoid the need for admission); calls for cooperation across the Commonwealth:state divide, or for its abolition; and the expected range of current efficiency and effectiveness measures (eg amalgamate pathology and support services) and ideas in good currency (eg call centres). The top-down nature of the public review process is noted, along with the political nature of the immediate catalysts for calling on a review. CONCLUSION: The long-standing tension between the pull to centralisation of authority and the need for innovation in care models is heightened by recent changes, which may be counterproductive in an era dominated by the burden of chronic disease. I argue that the current reforms will not succeed in achieving the stated goals unless they make a difference for people with chronic illness. And if this is correct, the most useful focus for evaluation of the success of the reforms may be their impact on the system's ability to develop and deliver better models of care for this growing group of patients.

  1. On H∞ Fault Estimator Design for Linear Discrete Time-Varying Systems under Unreliable Communication Link

    Directory of Open Access Journals (Sweden)

    Yueyang Li

    2014-01-01

    Full Text Available This paper investigates the H∞ fixed-lag fault estimator design for linear discrete time-varying (LDTV systems with intermittent measurements, which is described by a Bernoulli distributed random variable. Through constructing a novel partially equivalent dynamic system, the fault estimator design is converted into a deterministic quadratic minimization problem. By applying the innovation reorganization technique and the projection formula in Krein space, a necessary and sufficient condition is obtained for the existence of the estimator. The parameter matrices of the estimator are derived by recursively solving two standard Riccati equations. An illustrative example is provided to show the effectiveness and applicability of the proposed algorithm.

  2. Testing reactive systems with data: enumerative methods and constraint solving

    NARCIS (Netherlands)

    Calamé, Jens Rüdiger

    2008-01-01

    Software faults are a well-known phenomenon. In most cases, they are just annoying – if the computer game does not work as expected – or expensive – if once again a space project fails due to some faulty data conversion. In critical systems, however, faults can have life-threatening consequences. It

  3. A comparison between linear and toroidal Extrap systems

    International Nuclear Information System (INIS)

    Lehnert, B.

    1988-09-01

    The Extrap scheme consists of a Z-pinch immersed in an octupole field generated by currents in a set of external conductors. A comparison between linear and toroidal Extrap geometry is made in this paper. As compared to toroidal systems, linear geometry has the advantages of relative simplicity and of a current drive by means of electrodes. Linear devices are convenient for basic studies of Extrap, at moderately high pinch currents and plasma temperatures. Within the parameter ranges of experiments at high pinch currents and plasma temperatures, linear systems have on the other hand some substantial disadvantages, on account of the plasma interaction with the end regions. This results in a limitation of the energy confinement time, and leads in the case of an ohmically heated plasma to excessively high plasma densities and small pinch radii which also complicate the introduction of the external conductors. (author)

  4. Mixed H∞ and passive control for linear switched systems via hybrid control approach

    Science.gov (United States)

    Zheng, Qunxian; Ling, Youzhu; Wei, Lisheng; Zhang, Hongbin

    2018-03-01

    This paper investigates the mixed H∞ and passive control problem for linear switched systems based on a hybrid control strategy. To solve this problem, first, a new performance index is proposed. This performance index can be viewed as the mixed weighted H∞ and passivity performance. Then, the hybrid controllers are used to stabilise the switched systems. The hybrid controllers consist of dynamic output-feedback controllers for every subsystem and state updating controllers at the switching instant. The design of state updating controllers not only depends on the pre-switching subsystem and the post-switching subsystem, but also depends on the measurable output signal. The hybrid controllers proposed in this paper can include some existing ones as special cases. Combine the multiple Lyapunov functions approach with the average dwell time technique, new sufficient conditions are obtained. Under the new conditions, the closed-loop linear switched systems are globally uniformly asymptotically stable with a mixed H∞ and passivity performance index. Moreover, the desired hybrid controllers can be constructed by solving a set of linear matrix inequalities. Finally, a numerical example and a practical example are given.

  5. Derivative free Davidon-Fletcher-Powell (DFP) for solving symmetric systems of nonlinear equations

    Science.gov (United States)

    Mamat, M.; Dauda, M. K.; Mohamed, M. A. bin; Waziri, M. Y.; Mohamad, F. S.; Abdullah, H.

    2018-03-01

    Research from the work of engineers, economist, modelling, industry, computing, and scientist are mostly nonlinear equations in nature. Numerical solution to such systems is widely applied in those areas of mathematics. Over the years, there has been significant theoretical study to develop methods for solving such systems, despite these efforts, unfortunately the methods developed do have deficiency. In a contribution to solve systems of the form F(x) = 0, x ∈ Rn , a derivative free method via the classical Davidon-Fletcher-Powell (DFP) update is presented. This is achieved by simply approximating the inverse Hessian matrix with {Q}k+1-1 to θkI. The modified method satisfied the descent condition and possess local superlinear convergence properties. Interestingly, without computing any derivative, the proposed method never fail to converge throughout the numerical experiments. The output is based on number of iterations and CPU time, different initial starting points were used on a solve 40 benchmark test problems. With the aid of the squared norm merit function and derivative-free line search technique, the approach yield a method of solving symmetric systems of nonlinear equations that is capable of significantly reducing the CPU time and number of iteration, as compared to its counterparts. A comparison between the proposed method and classical DFP update were made and found that the proposed methodis the top performer and outperformed the existing method in almost all the cases. In terms of number of iterations, out of the 40 problems solved, the proposed method solved 38 successfully, (95%) while classical DFP solved 2 problems (i.e. 05%). In terms of CPU time, the proposed method solved 29 out of the 40 problems given, (i.e.72.5%) successfully whereas classical DFP solves 11 (27.5%). The method is valid in terms of derivation, reliable in terms of number of iterations and accurate in terms of CPU time. Thus, suitable and achived the objective.

  6. H 2 guaranteed cost control of discrete linear systems

    Directory of Open Access Journals (Sweden)

    Colmenares W.

    2000-01-01

    Full Text Available This paper presents necessary and sufficient conditions for the existence of a quadratically stabilizing output feedback controller which also assures H 2 guaranteed cost performance on a discrete linear uncertain system where the uncertainty is of the norm bounded type. The conditions are presented as a collection of linear matrix inequalities.The solution, however requires a search over a scalar parameter space.

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

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

  9. Solving Complex Logistics Problems with Multi-Artificial Intelligent System

    Directory of Open Access Journals (Sweden)

    Y.K. Tse

    2009-10-01

    Full Text Available The economy, which has become more information intensive, more global and more technologically dependent, is undergoing dramatic changes. The role of logistics is also becoming more and more important. In logistics, the objective of service providers is to fulfill all customers? demands while adapting to the dynamic changes of logistics networks so as to achieve a higher degree of customer satisfaction and therefore a higher return on investment. In order to provide high quality service, knowledge and information sharing among departments becomes a must in this fast changing market environment. In particular, artificial intelligence (AI technologies have achieved significant attention for enhancing the agility of supply chain management, as well as logistics operations. In this research, a multi-artificial intelligence system, named Integrated Intelligent Logistics System (IILS is proposed. The objective of IILS is to provide quality logistics solutions to achieve high levels of service performance in the logistics industry. The new feature of this agile intelligence system is characterized by the incorporation of intelligence modules through the capabilities of the case-based reasoning, multi-agent, fuzzy logic and artificial neural networks, achieving the optimization of the performance of organizations.

  10. Disturbance attenuation of nonlinear control systems using an observer-based fuzzy feedback linearization control

    International Nuclear Information System (INIS)

    Chen, C.-C.; Hsu, C.-H.; Chen, Y.-J.; Lin, Y.-F.

    2007-01-01

    The almost disturbance decoupling and trajectory tracking of nonlinear control systems using an observer-based fuzzy feedback linearization control (FLC) is developed. Because not all of the state variables of the nonlinear dynamic equations are available, a nonlinear state observer is employed to estimate the state variables. The feedback linearization control guarantees the almost disturbance decoupling performance and the uniform ultimate bounded stability of the tracking error system. Once the tracking errors are driven to touch the global final attractor with the desired radius, the fuzzy logic control is immediately applied via human expert's knowledge to improve the convergence rate. One example, which cannot be solved by the first paper on the almost disturbance decoupling problem, is proposed in this paper to exploit the fact that the tracking and the almost disturbance decoupling performances are easily achieved by our proposed approach. In order to demonstrate the practical applicability, the study has investigated a pendulum control system

  11. Weighted H∞ Filtering for a Class of Switched Linear Systems with Additive Time-Varying Delays

    Directory of Open Access Journals (Sweden)

    Li-li Li

    2015-01-01

    Full Text Available This paper is concerned with the problem of weighted H∞ filtering for a class of switched linear systems with two additive time-varying delays, which represent a general class of switched time-delay systems with strong practical background. Combining average dwell time (ADT technique with piecewise Lyapunov functionals, sufficient conditions are established to guarantee the exponential stability and weighted H∞ performance for the filtering error systems. The parameters of the designed switched filters are obtained by solving linear matrix inequalities (LMIs. A modification of Jensen integral inequality is exploited to derive results with less theoretical conservatism and computational complexity. Finally, two examples are given to demonstrate the effectiveness of the proposed method.

  12. On the stability of non-linear systems

    International Nuclear Information System (INIS)

    Guelman, M.

    1968-09-01

    A study is made of the absolute stability of nonlinear systems, using Liapounov's second method and taking into account the results obtained from V.M. Popov's work. The results already established are first presented, in particular concerning the frequency domain criterions for absolute stability of automatic control systems containing one single non linearity. The results have been extended to show the existence of a limiting parabola. New use is then made of the methods studied for deriving absolute stability criterions for a system containing a different type of non linearity. Finally, the results obtained are considered from the point of view of Aizerman's conjecture. (author) [fr

  13. Applications of equivalent linearization approaches to nonlinear piping systems

    International Nuclear Information System (INIS)

    Park, Y.; Hofmayer, C.; Chokshi, N.

    1997-01-01

    The piping systems in nuclear power plants, even with conventional snubber supports, are highly complex nonlinear structures under severe earthquake loadings mainly due to various mechanical gaps in support structures. Some type of nonlinear analysis is necessary to accurately predict the piping responses under earthquake loadings. The application of equivalent linearization approaches (ELA) to seismic analyses of nonlinear piping systems is presented. Two types of ELA's are studied; i.e., one based on the response spectrum method and the other based on the linear random vibration theory. The test results of main steam and feedwater piping systems supported by snubbers and energy absorbers are used to evaluate the numerical accuracy and limitations

  14. State space and input-output linear systems

    CERN Document Server

    Delchamps, David F

    1988-01-01

    It is difficult for me to forget the mild sense of betrayal I felt some ten years ago when I discovered, with considerable dismay, that my two favorite books on linear system theory - Desoer's Notes for a Second Course on Linear Systems and Brockett's Finite Dimensional Linear Systems - were both out of print. Since that time, of course, linear system theory has undergone a transformation of the sort which always attends the maturation of a theory whose range of applicability is expanding in a fashion governed by technological developments and by the rate at which such advances become a part of engineering practice. The growth of the field has inspired the publication of some excellent books; the encyclopedic treatises by Kailath and Chen, in particular, come immediately to mind. Nonetheless, I was inspired to write this book primarily by my practical needs as a teacher and researcher in the field. For the past five years, I have taught a one semester first year gradu­ ate level linear system theory course i...

  15. Unification of three linear models for the transient visual system

    NARCIS (Netherlands)

    Brinker, den A.C.

    1989-01-01

    Three different linear filters are considered as a model describing the experimentally determined triphasic impulse responses of discs. These impulse responses arc associated with the transient visual system. Each model reveals a different feature of the system. Unification of the models is

  16. Punctuated equilibrium in a non-linear system of action

    NARCIS (Netherlands)

    J.S. Timmermans (Jos)

    2008-01-01

    textabstractColeman's equilibrium model of social development, the Linear System of Action, is extended to cover the dynamics of societal transitions. The model implemented has the characteristics of a dissipative system. A variation and selection algorithm favoring the retention of relatively

  17. Lag synchronization of chaotic systems with time-delayed linear

    Indian Academy of Sciences (India)

    In this paper, the lag synchronization of chaotic systems with time-delayed linear terms via impulsive control is investigated. Based on the stability theory of impulsive delayed differential equations, some sufficient conditions are obtained guaranteeing the synchronized behaviours between two delayed chaotic systems.

  18. INPUT-OUTPUT STRUCTURE OF LINEAR-DIFFERENTIAL ALGEBRAIC SYSTEMS

    NARCIS (Netherlands)

    KUIJPER, M; SCHUMACHER, JM

    Systems of linear differential and algebraic equations occur in various ways, for instance, as a result of automated modeling procedures and in problems involving algebraic constraints, such as zero dynamics and exact model matching. Differential/algebraic systems may represent an input-output

  19. Frequency Interval Cross Gramians for Linear and Bilinear Systems

    DEFF Research Database (Denmark)

    Jazlan, Ahmad; Sreeram, Victor; Shaker, Hamid Reza

    2017-01-01

    In many control engineering problems, it is desired to analyze the systems at particular frequency intervals of interest. This paper focuses on the development of frequency interval cross gramians for both linear and bilinear systems. New generalized Sylvester equations for calculating the freque...

  20. Switching control of linear systems for generating chaos

    International Nuclear Information System (INIS)

    Liu Xinzhi; Teo, Kok-Lay; Zhang Hongtao; Chen Guanrong

    2006-01-01

    In this paper, a new switching method is developed, which can be applied to generating different types of chaos or chaos-like dynamics from two or more linear systems. A numerical simulation is given to illustrate the generated chaotic dynamic behavior of the systems with some variable parameters. Finally, a circuit is built to realize various chaotic dynamical behaviors

  1. Criteria for stability of linear dynamical systems with multiple delays ...

    African Journals Online (AJOL)

    In this study we considered a linear Dynamical system with multiple delays and find suitable conditions on the systems parameters such that for a given initial function, we can define a mapping in a carefully chosen complete metric space on which the mapping has a unique fixed point. An asymptotic stability theory for the ...

  2. A data-acquisition system for high speed linear CCD

    International Nuclear Information System (INIS)

    Liu Zhiyan; Chen Xiangcai; Jiang Xiaoshan; Zhang Hongyu; Liang Zhongwang; Xiang Haisheng; Hu Jun

    2010-01-01

    A data-acquisition system for high speed linear CCD (Charge Coupled device) is mainly introduced. The optical fiber transmission technology is used. The data is sent to PC through USB or PCI interface. The construction of the system, the design of the PCI interface hardware, software design and the design of the control program running on host computer are also introduced. (authors)

  3. Nonlinear evolution equations and solving algebraic systems: the importance of computer algebra

    International Nuclear Information System (INIS)

    Gerdt, V.P.; Kostov, N.A.

    1989-01-01

    In the present paper we study the application of computer algebra to solve the nonlinear polynomial systems which arise in investigation of nonlinear evolution equations. We consider several systems which are obtained in classification of integrable nonlinear evolution equations with uniform rank. Other polynomial systems are related with the finding of algebraic curves for finite-gap elliptic potentials of Lame type and generalizations. All systems under consideration are solved using the method based on construction of the Groebner basis for corresponding polynomial ideals. The computations have been carried out using computer algebra systems. 20 refs

  4. Partial Synchronization Manifolds for Linearly Time-Delay Coupled Systems

    OpenAIRE

    Steur, Erik; van Leeuwen, Cees; Michiels, Wim

    2014-01-01

    Sometimes a network of dynamical systems shows a form of incomplete synchronization characterized by synchronization of some but not all of its systems. This type of incomplete synchronization is called partial synchronization. Partial synchronization is associated with the existence of partial synchronization manifolds, which are linear invariant subspaces of C, the state space of the network of systems. We focus on partial synchronization manifolds in networks of system...

  5. The linear sizes tolerances and fits system modernization

    Science.gov (United States)

    Glukhov, V. I.; Grinevich, V. A.; Shalay, V. V.

    2018-04-01

    The study is carried out on the urgent topic for technical products quality providing in the tolerancing process of the component parts. The aim of the paper is to develop alternatives for improving the system linear sizes tolerances and dimensional fits in the international standard ISO 286-1. The tasks of the work are, firstly, to classify as linear sizes the elements additionally linear coordinating sizes that determine the detail elements location and, secondly, to justify the basic deviation of the tolerance interval for the element's linear size. The geometrical modeling method of real details elements, the analytical and experimental methods are used in the research. It is shown that the linear coordinates are the dimensional basis of the elements linear sizes. To standardize the accuracy of linear coordinating sizes in all accuracy classes, it is sufficient to select in the standardized tolerance system only one tolerance interval with symmetrical deviations: Js for internal dimensional elements (holes) and js for external elements (shafts). The main deviation of this coordinating tolerance is the average zero deviation, which coincides with the nominal value of the coordinating size. Other intervals of the tolerance system are remained for normalizing the accuracy of the elements linear sizes with a fundamental change in the basic deviation of all tolerance intervals is the maximum deviation corresponding to the limit of the element material: EI is the lower tolerance for the of the internal elements (holes) sizes and es is the upper tolerance deviation for the outer elements (shafts) sizes. It is the sizes of the material maximum that are involved in the of the dimensional elements mating of the shafts and holes and determine the fits type.

  6. Solving the Bateman equations in CASMO5 using implicit ode numerical methods for stiff systems

    International Nuclear Information System (INIS)

    Hykes, J. M.; Ferrer, R. M.

    2013-01-01

    The Bateman equations, which describe the transmutation of nuclides over time as a result of radioactive decay, absorption, and fission, are often numerically stiff. This is especially true if short-lived nuclides are included in the system. This paper describes the use of implicit numerical methods for o D Es applied to the stiff Bateman equations, specifically employing the Backward Differentiation Formulas (BDF) form of the linear multistep method. As is true in other domains, using an implicit method removes or lessens the (sometimes severe) step-length constraints by which explicit methods must abide. To gauge its accuracy and speed, the BDF method is compared to a variety of other solution methods, including Runge-Kutta explicit methods and matrix exponential methods such as the Chebyshev Rational Approximation Method (CRAM). A preliminary test case was chosen as representative of a PWR lattice depletion step and was solved with numerical libraries called from a Python front-end. The Figure of Merit (a combined measure of accuracy and efficiency) for the BDF method was nearly identical to that for CRAM, while explicit methods and other matrix exponential approximations trailed behind. The test case includes 319 nuclides, in which the shortest-lived nuclide is 98 Nb with a half-life of 2.86 seconds. Finally, the BDF and CRAM methods were compared within CASMO5, where CRAM had a FOM about four times better than BDF, although the BDF implementation was not fully optimized. (authors)

  7. Solving the apparent diversity-accuracy dilemma of recommender systems.

    Science.gov (United States)

    Zhou, Tao; Kuscsik, Zoltán; Liu, Jian-Guo; Medo, Matús; Wakeling, Joseph Rushton; Zhang, Yi-Cheng

    2010-03-09

    Recommender systems use data on past user preferences to predict possible future likes and interests. A key challenge is that while the most useful individual recommendations are to be found among diverse niche objects, the most reliably accurate results are obtained by methods that recommend objects based on user or object similarity. In this paper we introduce a new algorithm specifically to address the challenge of diversity and show how it can be used to resolve this apparent dilemma when combined in an elegant hybrid with an accuracy-focused algorithm. By tuning the hybrid appropriately we are able to obtain, without relying on any semantic or context-specific information, simultaneous gains in both accuracy and diversity of recommendations.

  8. A Direct Algorithm for Pole Placement by State-derivative Feedback for Single-input Linear Systems

    Directory of Open Access Journals (Sweden)

    Taha H. S. Abdelaziz

    2003-01-01

    Full Text Available This paper deals with the direct solution of the pole placement problem for single-input linear systems using state-derivative feedback. This pole placement problem is always solvable for any controllable systems if all eigenvalues of the original system are nonzero. Then any arbitrary closed-loop poles can be placed in order to achieve the desired system performance. The solving procedure results in a formula similar to the Ackermann formula. Its derivation is based on the transformation of a linear single-input system into Frobenius canonical form by a special coordinate transformation, then solving the pole placement problem by state derivative feedback. Finally the solution is extended also for single-input time-varying control systems. The simulation results are included to show the effectiveness of the proposed approach.

  9. COMPARISON OF IMPLICIT SCHEMES TO SOLVE EQUATIONS OF RADIATION HYDRODYNAMICS WITH A FLUX-LIMITED DIFFUSION APPROXIMATION: NEWTON–RAPHSON, OPERATOR SPLITTING, AND LINEARIZATION

    Energy Technology Data Exchange (ETDEWEB)

    Tetsu, Hiroyuki; Nakamoto, Taishi, E-mail: h.tetsu@geo.titech.ac.jp [Earth and Planetary Sciences, Tokyo Institute of Technology, Tokyo 152-8551 (Japan)

    2016-03-15

    Radiation is an important process of energy transport, a force, and a basis for synthetic observations, so radiation hydrodynamics (RHD) calculations have occupied an important place in astrophysics. However, although the progress in computational technology is remarkable, their high numerical cost is still a persistent problem. In this work, we compare the following schemes used to solve the nonlinear simultaneous equations of an RHD algorithm with the flux-limited diffusion approximation: the Newton–Raphson (NR) method, operator splitting, and linearization (LIN), from the perspective of the computational cost involved. For operator splitting, in addition to the traditional simple operator splitting (SOS) scheme, we examined the scheme developed by Douglas and Rachford (DROS). We solve three test problems (the thermal relaxation mode, the relaxation and the propagation of linear waves, and radiating shock) using these schemes and then compare their dependence on the time step size. As a result, we find the conditions of the time step size necessary for adopting each scheme. The LIN scheme is superior to other schemes if the ratio of radiation pressure to gas pressure is sufficiently low. On the other hand, DROS can be the most efficient scheme if the ratio is high. Although the NR scheme can be adopted independently of the regime, especially in a problem that involves optically thin regions, the convergence tends to be worse. In all cases, SOS is not practical.

  10. Linear systems solvers - recent developments and implications for lattice computations

    International Nuclear Information System (INIS)

    Frommer, A.

    1996-01-01

    We review the numerical analysis' understanding of Krylov subspace methods for solving (non-hermitian) systems of equations and discuss its implications for lattice gauge theory computations using the example of the Wilson fermion matrix. Our thesis is that mature methods like QMR, BiCGStab or restarted GMRES are close to optimal for the Wilson fermion matrix. Consequently, preconditioning appears to be the crucial issue for further improvements. (orig.)

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

  12. Damped oscillations of linear systems a mathematical introduction

    CERN Document Server

    Veselić, Krešimir

    2011-01-01

    The theory of linear damped oscillations was originally developed more than hundred years ago and is still of vital research interest to engineers, mathematicians and physicists alike. This theory plays a central role in explaining the stability of mechanical structures in civil engineering, but it also has applications in other fields such as electrical network systems and quantum mechanics. This volume gives an introduction to linear finite dimensional damped systems as they are viewed by an applied mathematician. After a short overview of the physical principles leading to the linear system model, a largely self-contained mathematical theory for this model is presented. This includes the geometry of the underlying indefinite metric space, spectral theory of J-symmetric matrices and the associated quadratic eigenvalue problem. Particular attention is paid to the sensitivity issues which influence numerical computations. Finally, several recent research developments are included, e.g. Lyapunov stability and ...

  13. Ultra-high Frequency Linear Fiber Optic Systems

    CERN Document Server

    Lau, Kam

    2011-01-01

    This book provides an in-depth treatment of both linear fiber-optic systems and their key enabling devices. It presents a concise but rigorous treatment of the theory and practice of analog (linear) fiber-optics links and systems that constitute the foundation of Hybrid Fiber Coax infrastructure in present-day CATV distribution and cable modem Internet access. Emerging applications in remote fiber-optic feed for free-space millimeter wave enterprise campus networks are also described. Issues such as dispersion and interferometric noise are treated quantitatively, and means for mitigating them are explained. This broad but concise text will thus be invaluable not only to students of fiber-optics communication but also to practicing engineers. To the second edition of this book important new aspects of linear fiber-optic transmission technologies are added, such as high level system architectural issues, algorithms for deriving the optimal frequency assignment, directly modulated or externally modulated laser t...

  14. The Improvement of Communication and Inference Skills in Colloid System Material by Problem Solving Learning Model

    OpenAIRE

    maisarera, yunita; diawati, chansyanah; fadiawati, noor

    2012-01-01

    The aim of this research is to describe the effectiveness of problem solving learning in improving communication and inference skills in colloid system material. Subjects in this research were students of XIIPA1 and XI IPA2 classrooms in Persada Junior High School in Bandar Lampung in academic year 2011-2012 where students of both classrooms had the same characteristics. This research used quasi experiment method and pretest-posttest control group design. Effectiveness of problem solving le...

  15. System identication of a linearized hysteretic system using covariance driven stochastic subspace identication

    DEFF Research Database (Denmark)

    Bajric, Anela

    A single mass Bouc-Wen oscillator with linear static restoring force contribution is approximated by an equivalent linear system. The aim of the linearized model is to emulate the correct force-displacement response of the Bouc-Wenmodel with characteristic hysteretic behaviour. The linearized mod...

  16. Linearly and nonlinearly bidirectionally coupled synchronization of hyperchaotic systems

    International Nuclear Information System (INIS)

    Zhou Jin; Lu Junan; Wu Xiaoqun

    2007-01-01

    To date, there have been many results about unidirectionally coupled synchronization of chaotic systems. However, much less work is reported on bidirectionally-coupled synchronization. In this paper, we investigate the synchronization of two bidirectionally coupled Chen hyperchaotic systems, which are coupled linearly and nonlinearly respectively. Firstly, linearly coupled synchronization of two hyperchaotic Chen systems is investigated, and a theorem on how to choose the coupling coefficients are developed to guarantee the global asymptotical synchronization of two coupled hyperchaotic systems. Analysis shows that the choice of the coupling coefficients relies on the bound of the chaotic system. Secondly, the nonlinearly coupled synchronization is studied; a sufficient condition for the locally asymptotical synchronization is derived, which is independent of the bound of the hyperchaotic system. Finally, numerical simulations are included to verify the effectiveness and feasibility of the developed theorems

  17. Linear dynamical quantum systems analysis, synthesis, and control

    CERN Document Server

    Nurdin, Hendra I

    2017-01-01

    This monograph provides an in-depth treatment of the class of linear-dynamical quantum systems. The monograph presents a detailed account of the mathematical modeling of these systems using linear algebra and quantum stochastic calculus as the main tools for a treatment that emphasizes a system-theoretic point of view and the control-theoretic formulations of quantum versions of familiar problems from the classical (non-quantum) setting, including estimation and filtering, realization theory, and feedback control. Both measurement-based feedback control (i.e., feedback control by a classical system involving a continuous-time measurement process) and coherent feedback control (i.e., feedback control by another quantum system without the intervention of any measurements in the feedback loop) are treated. Researchers and graduates studying systems and control theory, quantum probability and stochastics or stochastic control whether from backgrounds in mechanical or electrical engineering or applied mathematics ...

  18. Finite-time H∞ control for linear continuous system with norm-bounded disturbance

    Science.gov (United States)

    Meng, Qingyi; Shen, Yanjun

    2009-04-01

    In this paper, the definition of finite-time H∞ control is presented. The system under consideration is subject to time-varying norm-bounded exogenous disturbance. The main aim of this paper is focused on the design a state feedback controller which ensures that the closed-loop system is finite-time bounded (FTB) and reduces the effect of the disturbance input on the controlled output to a prescribed level. A sufficient condition is presented for the solvability of this problem, which can be reduced to a feasibility problem involving linear matrix inequalities (LMIs). A detailed solving method is proposed for the restricted linear matrix inequalities. Finally, examples are given to show the validity of the methodology.

  19. Nonautonomous linear system of the terrestrial carbon cycle

    Science.gov (United States)

    Luo, Y.

    2012-12-01

    Carbon cycle has been studied by uses of observation through various networks, field and laboratory experiments, and simulation models. Much less has been done on theoretical thinking and analysis to understand fundament properties of carbon cycle and then guide observatory, experimental, and modeling research. This presentation is to explore what would be the theoretical properties of terrestrial carbon cycle and how those properties can be used to make observatory, experimental, and modeling research more effective. Thousands of published data sets from litter decomposition and soil incubation studies almost all indicate that decay processes of litter and soil organic carbon can be well described by first order differential equations with one or more pools. Carbon pool dynamics in plants and soil after disturbances (e.g., wildfire, clear-cut of forests, and plows of soil for cropping) and during natural recovery or ecosystem restoration also exhibit characteristics of first-order linear systems. Thus, numerous lines of empirical evidence indicate that the terrestrial carbon cycle can be adequately described as a nonautonomous linear system. The linearity reflects the nature of the carbon cycle that carbon, once fixed by photosynthesis, is linearly transferred among pools within an ecosystem. The linear carbon transfer, however, is modified by nonlinear functions of external forcing variables. In addition, photosynthetic carbon influx is also nonlinearly influenced by external variables. This nonautonomous linear system can be mathematically expressed by a first-order linear ordinary matrix equation. We have recently used this theoretical property of terrestrial carbon cycle to develop a semi-analytic solution of spinup. The new methods have been applied to five global land models, including NCAR's CLM and CABLE models and can computationally accelerate spinup by two orders of magnitude. We also use this theoretical property to develop an analytic framework to

  20. Refined Fuchs inequalities for systems of linear differential equations

    International Nuclear Information System (INIS)

    Gontsov, R R

    2004-01-01

    We refine the Fuchs inequalities obtained by Corel for systems of linear meromorphic differential equations given on the Riemann sphere. Fuchs inequalities enable one to estimate the sum of exponents of the system over all its singular points. We refine these well-known inequalities by considering the Jordan structure of the leading coefficient of the Laurent series for the matrix of the right-hand side of the system in the neighbourhood of a singular point

  1. The graphics software of the Saclay linear accelerator control system

    International Nuclear Information System (INIS)

    Gournay, J.F.

    1987-06-01

    The Control system of the Saclay Linear Accelerator is based upon modern technology hardware. In the graphic software, pictures are created in exactly the same manner for all the graphic devices supported by the system. The informations used to draw a picture are stored in an array called a graphic segment. Three output primitives are used to add graphic material in a segment. Three coordinate systems are defined

  2. Stability analysis of linear switching systems with time delays

    International Nuclear Information System (INIS)

    Li Ping; Zhong Shouming; Cui Jinzhong

    2009-01-01

    The issue of stability analysis of linear switching system with discrete and distributed time delays is studied in this paper. An appropriate switching rule is applied to guarantee the stability of the whole switching system. Our results use a Riccati-type Lyapunov functional under a condition on the time delay. So, switching systems with mixed delays are developed. A numerical example is given to illustrate the effectiveness of our results.

  3. Chaos synchronization of a unified chaotic system via partial linearization

    International Nuclear Information System (INIS)

    Yu Yongguang; Li Hanxiong; Duan Jian

    2009-01-01

    A partial linearization method is proposed for realizing the chaos synchronization of an unified chaotic system. Through synchronizing partial state of the chaotic systems can result in the synchronization of their entire states, and the resulting controller is singularity free. The results can be easily extended to the synchronization of other similar chaotic systems. Simulation results are conducted to show the effectiveness of the method.

  4. A convergence analysis for a sweeping preconditioner for block tridiagonal systems of linear equations

    KAUST Repository

    Bagci, Hakan

    2014-11-11

    We study sweeping preconditioners for symmetric and positive definite block tridiagonal systems of linear equations. The algorithm provides an approximate inverse that can be used directly or in a preconditioned iterative scheme. These algorithms are based on replacing the Schur complements appearing in a block Gaussian elimination direct solve by hierarchical matrix approximations with reduced off-diagonal ranks. This involves developing low rank hierarchical approximations to inverses. We first provide a convergence analysis for the algorithm for reduced rank hierarchical inverse approximation. These results are then used to prove convergence and preconditioning estimates for the resulting sweeping preconditioner.

  5. The solution of linear and nonlinear systems of Volterra functional equations using Adomian-Pade technique

    International Nuclear Information System (INIS)

    Dehghan, Mehdi; Shakourifar, Mohammad; Hamidi, Asgar

    2009-01-01

    The purpose of this study is to implement Adomian-Pade (Modified Adomian-Pade) technique, which is a combination of Adomian decomposition method (Modified Adomian decomposition method) and Pade approximation, for solving linear and nonlinear systems of Volterra functional equations. The results obtained by using Adomian-Pade (Modified Adomian-Pade) technique, are compared to those obtained by using Adomian decomposition method (Modified Adomian decomposition method) alone. The numerical results, demonstrate that ADM-PADE (MADM-PADE) technique, gives the approximate solution with faster convergence rate and higher accuracy than using the standard ADM (MADM).

  6. A convergence analysis for a sweeping preconditioner for block tridiagonal systems of linear equations

    KAUST Repository

    Bagci, Hakan; Pasciak, Joseph E.; Sirenko, Kostyantyn

    2014-01-01

    We study sweeping preconditioners for symmetric and positive definite block tridiagonal systems of linear equations. The algorithm provides an approximate inverse that can be used directly or in a preconditioned iterative scheme. These algorithms are based on replacing the Schur complements appearing in a block Gaussian elimination direct solve by hierarchical matrix approximations with reduced off-diagonal ranks. This involves developing low rank hierarchical approximations to inverses. We first provide a convergence analysis for the algorithm for reduced rank hierarchical inverse approximation. These results are then used to prove convergence and preconditioning estimates for the resulting sweeping preconditioner.

  7. SNR Estimation in Linear Systems with Gaussian Matrices

    KAUST Repository

    Suliman, Mohamed Abdalla Elhag; Alrashdi, Ayed; Ballal, Tarig; Al-Naffouri, Tareq Y.

    2017-01-01

    This letter proposes a highly accurate algorithm to estimate the signal-to-noise ratio (SNR) for a linear system from a single realization of the received signal. We assume that the linear system has a Gaussian matrix with one sided left correlation. The unknown entries of the signal and the noise are assumed to be independent and identically distributed with zero mean and can be drawn from any distribution. We use the ridge regression function of this linear model in company with tools and techniques adapted from random matrix theory to achieve, in closed form, accurate estimation of the SNR without prior statistical knowledge on the signal or the noise. Simulation results show that the proposed method is very accurate.

  8. SNR Estimation in Linear Systems with Gaussian Matrices

    KAUST Repository

    Suliman, Mohamed Abdalla Elhag

    2017-09-27

    This letter proposes a highly accurate algorithm to estimate the signal-to-noise ratio (SNR) for a linear system from a single realization of the received signal. We assume that the linear system has a Gaussian matrix with one sided left correlation. The unknown entries of the signal and the noise are assumed to be independent and identically distributed with zero mean and can be drawn from any distribution. We use the ridge regression function of this linear model in company with tools and techniques adapted from random matrix theory to achieve, in closed form, accurate estimation of the SNR without prior statistical knowledge on the signal or the noise. Simulation results show that the proposed method is very accurate.

  9. Periodic solutions of asymptotically linear Hamiltonian systems without twist conditions

    Energy Technology Data Exchange (ETDEWEB)

    Cheng Rong [Coll. of Mathematics and Physics, Nanjing Univ. of Information Science and Tech., Nanjing (China); Dept. of Mathematics, Southeast Univ., Nanjing (China); Zhang Dongfeng [Dept. of Mathematics, Southeast Univ., Nanjing (China)

    2010-05-15

    In dynamical system theory, especially in many fields of applications from mechanics, Hamiltonian systems play an important role, since many related equations in mechanics can be written in an Hamiltonian form. In this paper, we study the existence of periodic solutions for a class of Hamiltonian systems. By applying the Galerkin approximation method together with a result of critical point theory, we establish the existence of periodic solutions of asymptotically linear Hamiltonian systems without twist conditions. Twist conditions play crucial roles in the study of periodic solutions for asymptotically linear Hamiltonian systems. The lack of twist conditions brings some difficulty to the study. To the authors' knowledge, very little is known about the case, where twist conditions do not hold. (orig.)

  10. Theoretical analysis of balanced truncation for linear switched systems

    DEFF Research Database (Denmark)

    Petreczky, Mihaly; Wisniewski, Rafal; Leth, John-Josef

    2012-01-01

    In this paper we present theoretical analysis of model reduction of linear switched systems based on balanced truncation, presented in [1,2]. More precisely, (1) we provide a bound on the estimation error using L2 gain, (2) we provide a system theoretic interpretation of grammians and their singu......In this paper we present theoretical analysis of model reduction of linear switched systems based on balanced truncation, presented in [1,2]. More precisely, (1) we provide a bound on the estimation error using L2 gain, (2) we provide a system theoretic interpretation of grammians...... for showing this independence is realization theory of linear switched systems. [1] H. R. Shaker and R. Wisniewski, "Generalized gramian framework for model/controller order reduction of switched systems", International Journal of Systems Science, Vol. 42, Issue 8, 2011, 1277-1291. [2] H. R. Shaker and R....... Wisniewski, "Switched Systems Reduction Framework Based on Convex Combination of Generalized Gramians", Journal of Control Science and Engineering, 2009....

  11. Models of resource allocation optimization when solving the control problems in organizational systems

    Science.gov (United States)

    Menshikh, V.; Samorokovskiy, A.; Avsentev, O.

    2018-03-01

    The mathematical model of optimizing the allocation of resources to reduce the time for management decisions and algorithms to solve the general problem of resource allocation. The optimization problem of choice of resources in organizational systems in order to reduce the total execution time of a job is solved. This problem is a complex three-level combinatorial problem, for the solving of which it is necessary to implement the solution to several specific problems: to estimate the duration of performing each action, depending on the number of performers within the group that performs this action; to estimate the total execution time of all actions depending on the quantitative composition of groups of performers; to find such a distribution of the existing resource of performers in groups to minimize the total execution time of all actions. In addition, algorithms to solve the general problem of resource allocation are proposed.

  12. A New Numerical Technique for Solving Systems Of Nonlinear Fractional Partial Differential Equations

    Directory of Open Access Journals (Sweden)

    Mountassir Hamdi Cherif

    2017-11-01

    Full Text Available In this paper, we apply an efficient method called the Aboodh decomposition method to solve systems of nonlinear fractional partial differential equations. This method is a combined form of Aboodh transform with Adomian decomposition method. The theoretical analysis of this investigated for systems of nonlinear fractional partial differential equations is calculated in the explicit form of a power series with easily computable terms. Some examples are given to shows that this method is very efficient and accurate. This method can be applied to solve others nonlinear systems problems.

  13. Effective methods of solving of model equations of certain class of thermal systems

    International Nuclear Information System (INIS)

    Lach, J.

    1985-01-01

    A number of topics connected with solving of model equations of certain class of thermal systems by the method of successive approximations is touched. A system of partial differential equations of the first degree, appearing most frequently in practical applications of heat and mass transfer theory is reduced to an equivalent system of Volterra integral equations of the second kind. Among a few sample applications the thermal processes appearing in the fuel channel of nuclear reactor are solved. The theoretical analysis is illustrated by the results of numerical calculations given in tables and diagrams. 111 refs., 17 figs., 16 tabs. (author)

  14. Linear-constraint wavefront control for exoplanet coronagraphic imaging systems

    Science.gov (United States)

    Sun, He; Eldorado Riggs, A. J.; Kasdin, N. Jeremy; Vanderbei, Robert J.; Groff, Tyler Dean

    2017-01-01

    A coronagraph is a leading technology for achieving high-contrast imaging of exoplanets in a space telescope. It uses a system of several masks to modify the diffraction and achieve extremely high contrast in the image plane around target stars. However, coronagraphic imaging systems are very sensitive to optical aberrations, so wavefront correction using deformable mirrors (DMs) is necessary to avoid contrast degradation in the image plane. Electric field conjugation (EFC) and Stroke minimization (SM) are two primary high-contrast wavefront controllers explored in the past decade. EFC minimizes the average contrast in the search areas while regularizing the strength of the control inputs. Stroke minimization calculates the minimum DM commands under the constraint that a target average contrast is achieved. Recently in the High Contrast Imaging Lab at Princeton University (HCIL), a new linear-constraint wavefront controller based on stroke minimization was developed and demonstrated using numerical simulation. Instead of only constraining the average contrast over the entire search area, the new controller constrains the electric field of each single pixel using linear programming, which could led to significant increases in speed of the wavefront correction and also create more uniform dark holes. As a follow-up of this work, another linear-constraint controller modified from EFC is demonstrated theoretically and numerically and the lab verification of the linear-constraint controllers is reported. Based on the simulation and lab results, the pros and cons of linear-constraint controllers are carefully compared with EFC and stroke minimization.

  15. Seismic analysis of equipment system with non-linearities such as gap and friction using equivalent linearization method

    International Nuclear Information System (INIS)

    Murakami, H.; Hirai, T.; Nakata, M.; Kobori, T.; Mizukoshi, K.; Takenaka, Y.; Miyagawa, N.

    1989-01-01

    Many of the equipment systems of nuclear power plants contain a number of non-linearities, such as gap and friction, due to their mechanical functions. It is desirable to take such non-linearities into account appropriately for the evaluation of the aseismic soundness. However, in usual design works, linear analysis method with rough assumptions is applied from engineering point of view. An equivalent linearization method is considered to be one of the effective analytical techniques to evaluate non-linear responses, provided that errors to a certain extent are tolerated, because it has greater simplicity in analysis and economization in computing time than non-linear analysis. The objective of this paper is to investigate the applicability of the equivalent linearization method to evaluate the maximum earthquake response of equipment systems such as the CANDU Fuelling Machine which has multiple non- linearities

  16. Design techniques for large scale linear measurement systems

    International Nuclear Information System (INIS)

    Candy, J.V.

    1979-03-01

    Techniques to design measurement schemes for systems modeled by large scale linear time invariant systems, i.e., physical systems modeled by a large number (> 5) of ordinary differential equations, are described. The techniques are based on transforming the physical system model to a coordinate system facilitating the design and then transforming back to the original coordinates. An example of a three-stage, four-species, extraction column used in the reprocessing of spent nuclear fuel elements is presented. The basic ideas are briefly discussed in the case of noisy measurements. An example using a plutonium nitrate storage vessel (reprocessing) with measurement uncertainty is also presented

  17. MACEDONIAN ADMINISTRATIVE JUDICIAL SYSTEM FOR SOLVING ADMINISTRATIVE DISPUTES COMPARABLE TO EUROPEAN SYSTEMS

    Directory of Open Access Journals (Sweden)

    Sladjana Eftimova

    2015-07-01

    Full Text Available The structure of the legal system, through history until today mostly depends on law and policy which is conducted by the country. In European countries, there is position for historical and cultural conceptions for administrative judicature, differences and similarity that leave mark for solving administrative disputes. The obligation – an internal judicial reform to be established in legal system, is conducted by each of the countries after the breaking down and division of Social Federative Republic of Yugoslavia or SFRY due to following the European law for constitution of legitimacy and constitutionality of acts as well as implementing of independent administrative judicature. Analyze of the current condition regarding the independency and objectiveness of the judicature is necessary in our country and it is important to be seen how the conditions for working of the administrative judicature can be improved.

  18. Decentralized linear quadratic power system stabilizers for multi ...

    Indian Academy of Sciences (India)

    Linear quadratic stabilizers are well-known for their superior control capabilities when compared to the conventional lead–lag power system stabilizers. However, they have not seen much of practical importance as the state variables are generally not measurable; especially the generator rotor angle measurement is not ...

  19. Force analysis of linear induction motor for magnetic levitation system

    NARCIS (Netherlands)

    Kuijpers, A.A.; Nemlioglu, C.; Sahin, F.; Verdel, A.J.D.; Compter, J.C.; Lomonova, E.

    2010-01-01

    This paper presents the analyses of thrust and normal forces of linear induction motor (LIM) segments which are implemented in a rotating ring system. To obtain magnetic levitation in a cost effective and sustainable way, decoupled control of thrust and normal forces is required. This study includes

  20. Input design for linear dynamic systems using maxmin criteria

    DEFF Research Database (Denmark)

    Sadegh, Payman; Hansen, Lars H.; Madsen, Henrik

    1998-01-01

    This paper considers the problem of input design for maximizing the smallest eigenvalue of the information matrix for linear dynamic systems. The optimization of the smallest eigenvalue is of interest in parameter estimation and parameter change detection problems. We describe a simple cutting...

  1. Generating Nice Linear Systems for Matrix Gaussian Elimination

    Science.gov (United States)

    Homewood, L. James

    2004-01-01

    In this article an augmented matrix that represents a system of linear equations is called nice if a sequence of elementary row operations that reduces the matrix to row-echelon form, through matrix Gaussian elimination, does so by restricting all entries to integers in every step. Many instructors wish to use the example of matrix Gaussian…

  2. Daylighting System Based on Novel Design of Linear Fresnel lens

    Directory of Open Access Journals (Sweden)

    Thanh Tuan Pham

    2017-10-01

    Full Text Available In this paper, we present a design and optical simulation of a daylighting system using a novel design of linear Fresnel lens, which is constructed based on the conservation of optical path length and edge ray theorem. The linear Fresnel lens can achieve a high uniformity by using a new idea of design in which each groove of the lens distributes sunlight uniformly over the receiver so that the whole lens also uniformly distributes sunlight over the receiver. In this daylighting system, the novel design of linear Fresnel lens significantly improves the uniformity of collector and distributor. Therefore, it can help to improve the performance of the daylighting system. The structure of the linear Fresnel lenses is designed by using Matlab. Then, the structure of lenses is appreciated by ray tracing in LightToolsTM to find out the optimum lens shape. In addition, the simulation is performed by using LightToolsTM to estimate the efficiency of the daylighting system. The results show that the designed collector can achieve the efficiency of ~80% with the tolerance of ~0.60 and the concentration ratio of 340 times, while the designed distributor can reach a high uniformity of >90%.

  3. Robust self-triggered MPC for constrained linear systems

    NARCIS (Netherlands)

    Brunner, F.D.; Heemels, W.P.M.H.; Allgöwer, F.

    2014-01-01

    In this paper we propose a robust self-triggered model predictive control algorithm for linear systems with additive bounded disturbances and hard constraints on the inputs and state. In self-triggered control, at every sampling instant the time until the next sampling instant is computed online

  4. Stability Analysis for Multi-Parameter Linear Periodic Systems

    DEFF Research Database (Denmark)

    Seyranian, A.P.; Solem, Frederik; Pedersen, Pauli

    1999-01-01

    This paper is devoted to stability analysis of general linear periodic systems depending on real parameters. The Floquet method and perturbation technique are the basis of the development. We start out with the first and higher-order derivatives of the Floquet matrix with respect to problem...

  5. Relative controllability and null controllability of linear delay systems ...

    African Journals Online (AJOL)

    Necessary and sufficient conditions are established for the relative, absolute controllability and null controllability of the generalized linear delay system and its discrete prototype. The paper presents illuminating examples on previous controllability results by Manitius and Olbrot [7] and carries over the results of Onwuatu [8] ...

  6. СREATION OF CORRELATION FUNCTIONS OF LINEAR CONTINUOUS SYSTEMS BASED ON THEIR FUNDAMENTAL MATRICES

    Directory of Open Access Journals (Sweden)

    N. A. Vunder

    2015-11-01

    Full Text Available The paper presents a method of creating correlation matrices and functions of the state vectors and outputs of the linear continuous systems functioning under the conditions of stochastic stationary, in a broad sense, effects. Fundamental matrices form the basis of the method. We have shown that for the linear continuous systems with single dimensional input and single dimensional output the correlation output function of such system can be found as the free movement of this system generated by its initial state. This state is constructed from the variance matrix of the state vector and the transposed output matrix. We have elucidated that when a continuous system belongs to a class of multi-dimensional input – multi-dimensional output systems, the following options are available for solving the problem of creation of the correlation function of a linear system. The first option is to partition the system into separate channels. Then the approach developed for systems with onedimensional input and one-dimensional output is applied to each of the separate channels. The second option is used to preserve the vector nature of the stochastic external influence. It consists in partition of output vector to scalar components by separating output matrix into separate rows with subsequent formation of the correlation function according to the scheme for single dimensional input and single dimensional output type systems. The third option is based on the scalarization of matrix correlation output function by applying the singular value decomposition to it. That gives the possibility to form scalar majorant and minorant of correlation output functions. We have established that a key component of a computational procedure of creating the correlation function of continuous linear system is a variance matrix of the system state vector. In the case of functioning under an exogenous stochastic effect like "white noise" the variance matrix is calculated by

  7. Conservation laws for multidimensional systems and related linear algebra problems

    International Nuclear Information System (INIS)

    Igonin, Sergei

    2002-01-01

    We consider multidimensional systems of PDEs of generalized evolution form with t-derivatives of arbitrary order on the left-hand side and with the right-hand side dependent on lower order t-derivatives and arbitrary space derivatives. For such systems we find an explicit necessary condition for the existence of higher conservation laws in terms of the system's symbol. For systems that violate this condition we give an effective upper bound on the order of conservation laws. Using this result, we completely describe conservation laws for viscous transonic equations, for the Brusselator model and the Belousov-Zhabotinskii system. To achieve this, we solve over an arbitrary field the matrix equations SA=A t S and SA=-A t S for a quadratic matrix A and its transpose A t , which may be of independent interest

  8. Supporting second grade lower secondary school students’ understanding of linear equation system in two variables using ethnomathematics

    Science.gov (United States)

    Nursyahidah, F.; Saputro, B. A.; Rubowo, M. R.

    2018-03-01

    The aim of this research is to know the students’ understanding of linear equation system in two variables using Ethnomathematics and to acquire learning trajectory of linear equation system in two variables for the second grade of lower secondary school students. This research used methodology of design research that consists of three phases, there are preliminary design, teaching experiment, and retrospective analysis. Subject of this study is 28 second grade students of Sekolah Menengah Pertama (SMP) 37 Semarang. The result of this research shows that the students’ understanding in linear equation system in two variables can be stimulated by using Ethnomathematics in selling buying tradition in Peterongan traditional market in Central Java as a context. All of strategies and model that was applied by students and also their result discussion shows how construction and contribution of students can help them to understand concept of linear equation system in two variables. All the activities that were done by students produce learning trajectory to gain the goal of learning. Each steps of learning trajectory of students have an important role in understanding the concept from informal to the formal level. Learning trajectory using Ethnomathematics that is produced consist of watching video of selling buying activity in Peterongan traditional market to construct linear equation in two variables, determine the solution of linear equation in two variables, construct model of linear equation system in two variables from contextual problem, and solving a contextual problem related to linear equation system in two variables.

  9. A Flowchart-Based Intelligent Tutoring System for Improving Problem-Solving Skills of Novice Programmers

    Science.gov (United States)

    Hooshyar, D.; Ahmad, R. B.; Yousefi, M.; Yusop, F. D.; Horng, S.-J.

    2015-01-01

    Intelligent tutoring and personalization are considered as the two most important factors in the research of learning systems and environments. An effective tool that can be used to improve problem-solving ability is an Intelligent Tutoring System which is capable of mimicking a human tutor's actions in implementing a one-to-one personalized and…

  10. Linear and non-linear systems identification for adaptive control in mechanical applications vibration suppression

    Science.gov (United States)

    Cazzulani, Gabriele; Resta, Ferruccio; Ripamonti, Francesco

    2012-04-01

    During the last years, more and more mechanical applications saw the introduction of active control strategies. In particular, the need of improving the performances and/or the system health is very often associated to vibration suppression. This goal can be achieved considering both passive and active solutions. In this sense, many active control strategies have been developed, such as the Independent Modal Space Control (IMSC) or the resonant controllers (PPF, IRC, . . .). In all these cases, in order to tune and optimize the control strategy, the knowledge of the system dynamic behaviour is very important and it can be achieved both considering a numerical model of the system or through an experimental identification process. Anyway, dealing with non-linear or time-varying systems, a tool able to online identify the system parameters becomes a key-point for the control logic synthesis. The aim of the present work is the definition of a real-time technique, based on ARMAX models, that estimates the system parameters starting from the measurements of piezoelectric sensors. These parameters are returned to the control logic, that automatically adapts itself to the system dynamics. The problem is numerically investigated considering a carbon-fiber plate model forced through a piezoelectric patch.

  11. Observability of linear control systems on Lie groups

    International Nuclear Information System (INIS)

    Ayala, V.; Hacibekiroglu, A.K.

    1995-01-01

    In this paper, we study the observability problem for a linear control system Σ on a Lie group G. The drift vector field of Σ is an infinitesimal automorphism of G and the control vectors are elements in the Lie algebra of G. We establish algebraic conditions to characterize locally and globally observability for Σ. As in the linear case on R n , these conditions are independent of the control vector. We give an algorithm on the co-tangent bundle of G to calculate the equivalence class of the neutral element. (author). 6 refs

  12. A Complete Parametric Solutions of Eigenstructure Assignment by State-Derivative Feedback for Linear Control Systems

    Directory of Open Access Journals (Sweden)

    T. H. S. Abdelaziz

    2005-01-01

    Full Text Available In this paper we introduce a complete parametric approach for solving the problem of eigenstructure assignment via state-derivative feedback for linear systems. This problem is always solvable for any controllable systems iff the open-loop system matrix is nonsingular. In this work, two parametric solutions to the feedback gain matrix are introduced that describe the available degrees of freedom offered by the state-derivative feedback in selecting the associated eigenvectors from an admissible class. These freedoms can be utilized to improve robustness of the closed-loop system. Accordingly, the sensitivity of the assigned eigenvalues to perturbations in the system and gain matrix is minimized. Numerical examples are included to show the effectiveness of the proposed approach. 

  13. Monitoring and control system of the Saclay electron linear accelerator

    International Nuclear Information System (INIS)

    Lafontaine, Antoine

    1974-01-01

    A description is given of the automatic monitoring and control system of the 60MeV electron linear accelerator of the Centre d'Etudes Nucleaires de Saclay. The paper is mostly concerned with the programmation of the system. However, in a real time device, there is a very close association between computer and electronics, the latter are therefore described in details and make up most of the paper. [fr

  14. A new timing system for the Stanford Linear Collider

    International Nuclear Information System (INIS)

    Paffrath, L.; Bernstein, D.; Kang, H.; Koontz, R.; Leger, G.; Pierce, W.; Ross, M.; Wilmunder, A.

    1985-01-01

    In order to be able to meet the goals of the Stanford Linear Collider, a much more precise timing system had to be implemented. This paper describes the specification and design of this system, and the results obtained from its use on 1/3 of the SLAC linac. The functions of various elements are described, and a programmable delay unit (PDU) is described in detail

  15. Hyperchaotic encryption based on multi-scroll piecewise linear Systems

    Czech Academy of Sciences Publication Activity Database

    García-Martínez, M.; Ontanon-García, L.J.; Campos-Cantón, E.; Čelikovský, Sergej

    2015-01-01

    Roč. 270, č. 1 (2015), s. 413-424 ISSN 0096-3003 R&D Projects: GA ČR GA13-20433S Institutional support: RVO:67985556 Keywords : Hyperchaotic encryption * Piecewise linear systems * Stream cipher * Pseudo-random bit generator * Chaos theory * Multi-scrollattractors Subject RIV: BC - Control Systems Theory Impact factor: 1.345, year: 2015 http://library.utia.cas.cz/separaty/2015/TR/celikovsky-0446895.pdf

  16. Global Linear Representations of Nonlinear Systems and the Adjoint Map

    OpenAIRE

    Banks, S.P.

    1988-01-01

    In this paper we shall study the global linearization of nonlinear systems on a manifold by two methods. The first consists of an expansion of the vector field in the space of square integrable vector fields. In the second method we use the adjoint representation of the Lie algebra vector fields to obtain an infinite-dimensional matrix representation of the system. A connection between the two approaches will be developed.

  17. A representation theorem for linear discrete-space systems

    Directory of Open Access Journals (Sweden)

    Sandberg Irwin W.

    1998-01-01

    Full Text Available The cornerstone of the theory of discrete-time single-input single-output linear systems is the idea that every such system has an input–output map H that can be represented by a convolution or the familiar generalization of a convolution. This thinking involves an oversight which is corrected in this note by adding an additional term to the representation.

  18. A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems

    Czech Academy of Sciences Publication Activity Database

    Benzi, M.; Tůma, Miroslav

    1998-01-01

    Roč. 19, č. 3 (1998), s. 968-994 ISSN 1064-8275 R&D Projects: GA ČR GA201/93/0067; GA AV ČR IAA230401 Keywords : large sparse systems * interative methods * preconditioning * approximate inverse * sparse linear systems * sparse matrices * incomplete factorizations * conjugate gradient -type methods Subject RIV: BA - General Mathematics Impact factor: 1.378, year: 1998

  19. Design and performance of the Stanford Linear Collider Control System

    International Nuclear Information System (INIS)

    Melen, R.E.

    1984-10-01

    The success of the Stanford Linear Collider (SLC) will be dependent upon the implementation of a very large advanced computer-based instrumentation and control system. This paper describes the architectural design of this system as well as a critique of its performance. This critique is based on experience obtained from its use in the control and monitoring of 1/3 of the SLAC linac and in support of an expensive experimental machine physics experimental program. 11 references, 3 figures

  20. The mathematical statement for the solving of the problem of N-version software system design

    Science.gov (United States)

    Kovalev, I. V.; Kovalev, D. I.; Zelenkov, P. V.; Voroshilova, A. A.

    2015-10-01

    The N-version programming, as a methodology of the fault-tolerant software systems design, allows successful solving of the mentioned tasks. The use of N-version programming approach turns out to be effective, since the system is constructed out of several parallel executed versions of some software module. Those versions are written to meet the same specification but by different programmers. The problem of developing an optimal structure of N-version software system presents a kind of very complex optimization problem. This causes the use of deterministic optimization methods inappropriate for solving the stated problem. In this view, exploiting heuristic strategies looks more rational. In the field of pseudo-Boolean optimization theory, the so called method of varied probabilities (MVP) has been developed to solve problems with a large dimensionality.

  1. Linearization-based method for solving a multicomponent diffusion phase-field model with arbitrary solution thermodynamics

    Science.gov (United States)

    Welland, M. J.; Tenuta, E.; Prudil, A. A.

    2017-06-01

    This article describes a phase-field model for an isothermal multicomponent, multiphase system which avoids implicit interfacial energy contributions by starting from a grand potential formulation. A method is developed for incorporating arbitrary forms of the equilibrium thermodynamic potentials in all phases to determine an explicit relationship between chemical potentials and species concentrations. The model incorporates variable densities between adjacent phases, defect migration, and dependence of internal pressure on object dimensions ranging from the macro- to nanoscale. A demonstrative simulation of an overpressurized nanoscopic intragranular bubble in nuclear fuel migrating to a grain boundary under kinetically limited vacancy diffusion is shown.

  2. Universal Linear Precoding for NBI-Proof Widely Linear Equalization in MC Systems

    Directory of Open Access Journals (Sweden)

    Donatella Darsena

    2007-09-01

    Full Text Available In multicarrier (MC systems, transmitter redundancy, which is introduced by means of finite-impulse response (FIR linear precoders, allows for perfect or zero-forcing (ZF equalization of FIR channels (in the absence of noise. Recently, it has been shown that the noncircular or improper nature of some symbol constellations offers an intrinsic source of redundancy, which can be exploited to design efficient FIR widely-linear (WL receiving structures for MC systems operating in the presence of narrowband interference (NBI. With regard to both cyclic-prefixed and zero-padded transmission techniques, it is shown in this paper that, with appropriately designed precoders, it is possible to synthesize in both cases WL-ZF universal equalizers, which guarantee perfect symbol recovery for any FIR channel. Furthermore, it is theoretically shown that the intrinsic redundancy of the improper symbol sequence also enables WL-ZF equalization, based on the minimum mean output-energy criterion, with improved NBI suppression capabilities. Finally, results of numerical simulations are presented, which assess the merits of the proposed precoding designs and validate the theoretical analysis carried out.

  3. Self-Tuning Control of Linear Systems Followed by Deadzones

    Directory of Open Access Journals (Sweden)

    K. Kazlauskas

    2014-02-01

    Full Text Available The aim of the present paper is to increase the efficiency of self-tuning generalized minimum variance (GMV control of linear time-invariant (LTI systems followed by deadzone nonlinearities. An approach, based on reordering of observations to be processed for the reconstruction of an unknown internal signal that acts between LTI system and a static nonlinear block of the closed-loop Wiener system, has been developed. The results of GMV self-tuning control of the second order LTI system with an ordinary deadzone are given.

  4. Algorithmic Approach to Abstracting Linear Systems by Timed Automata

    DEFF Research Database (Denmark)

    Sloth, Christoffer; Wisniewski, Rafael

    2011-01-01

    This paper proposes an LMI-based algorithm for abstracting dynamical systems by timed automata, which enables automatic formal verification of linear systems. The proposed abstraction is based on partitioning the state space of the system using positive invariant sets, generated by Lyapunov...... functions. This partitioning ensures that the vector field of the dynamical system is transversal to all facets of the cells, which induces some desirable properties of the abstraction. The algorithm is based on identifying intersections of level sets of quadratic Lyapunov functions, and determining...

  5. H∞ control for uncertain linear system over networks with Bernoulli data dropout and actuator saturation.

    Science.gov (United States)

    Yu, Jimin; Yang, Chenchen; Tang, Xiaoming; Wang, Ping

    2018-03-01

    This paper investigates the H ∞ control problems for uncertain linear system over networks with random communication data dropout and actuator saturation. The random data dropout process is modeled by a Bernoulli distributed white sequence with a known conditional probability distribution and the actuator saturation is confined in a convex hull by introducing a group of auxiliary matrices. By constructing a quadratic Lyapunov function, effective conditions for the state feedback-based H ∞ controller and the observer-based H ∞ controller are proposed in the form of non-convex matrix inequalities to take the random data dropout and actuator saturation into consideration simultaneously, and the problem of non-convex feasibility is solved by applying cone complementarity linearization (CCL) procedure. Finally, two simulation examples are given to demonstrate the effectiveness of the proposed new design techniques. Copyright © 2018 ISA. Published by Elsevier Ltd. All rights reserved.

  6. Focal points and principal solutions of linear Hamiltonian systems revisited

    Science.gov (United States)

    Šepitka, Peter; Šimon Hilscher, Roman

    2018-05-01

    In this paper we present a novel view on the principal (and antiprincipal) solutions of linear Hamiltonian systems, as well as on the focal points of their conjoined bases. We present a new and unified theory of principal (and antiprincipal) solutions at a finite point and at infinity, and apply it to obtain new representation of the multiplicities of right and left proper focal points of conjoined bases. We show that these multiplicities can be characterized by the abnormality of the system in a neighborhood of the given point and by the rank of the associated T-matrix from the theory of principal (and antiprincipal) solutions. We also derive some additional important results concerning the representation of T-matrices and associated normalized conjoined bases. The results in this paper are new even for completely controllable linear Hamiltonian systems. We also discuss other potential applications of our main results, in particular in the singular Sturmian theory.

  7. Fundamentals of linear systems for physical scientists and engineers

    CERN Document Server

    Puri, N N

    2009-01-01

    Thanks to the advent of inexpensive computing, it is possible to analyze, compute, and develop results that were unthinkable in the '60s. Control systems, telecommunications, robotics, speech, vision, and digital signal processing are but a few examples of computing applications. While there are many excellent resources available that focus on one or two topics, few books cover most of the mathematical techniques required for a broader range of applications. Fundamentals of Linear Systems for Physical Scientists and Engineers is such a resource. The book draws from diverse areas of engineering and the physical sciences to cover the fundamentals of linear systems. Assuming no prior knowledge of complex mathematics on the part of the reader, the author uses his nearly 50 years of teaching experience to address all of the necessary mathematical techniques. Original proofs, hundreds of examples, and proven theorems illustrate and clarify the material. An extensive table provides Lyapunov functions for differentia...

  8. Computer Based Dose Control System on Linear Accelerator

    International Nuclear Information System (INIS)

    Taxwim; Djoko-SP; Widi-Setiawan; Agus-Budi Wiyatna

    2000-01-01

    The accelerator technology has been used for radio therapy. DokterKaryadi Hospital in Semarang use electron or X-ray linear accelerator (Linac)for cancer therapy. One of the control parameter of linear accelerator isdose rate. It is particle current or amount of photon rate to the target. Thecontrol of dose rate in linac have been done by adjusting repetition rate ofanode pulse train of electron source. Presently the control is stillproportional control. To enhance the quality of the control result (minimalstationer error, velocity and stability), the dose control system has beendesigned by using the PID (Proportional Integral Differential) controlalgorithm and the derivation of transfer function of control object.Implementation of PID algorithm control system is done by giving an input ofdose error (the different between output dose and dose rate set point). Theoutput of control system is used for correction of repetition rate set pointfrom pulse train of electron source anode. (author)

  9. TENSOLVE: A software package for solving systems of nonlinear equations and nonlinear least squares problems using tensor methods

    Energy Technology Data Exchange (ETDEWEB)

    Bouaricha, A. [Argonne National Lab., IL (United States). Mathematics and Computer Science Div.; Schnabel, R.B. [Colorado Univ., Boulder, CO (United States). Dept. of Computer Science

    1996-12-31

    This paper describes a modular software package for solving systems of nonlinear equations and nonlinear least squares problems, using a new class of methods called tensor methods. It is intended for small to medium-sized problems, say with up to 100 equations and unknowns, in cases where it is reasonable to calculate the Jacobian matrix or approximate it by finite differences at each iteration. The software allows the user to select between a tensor method and a standard method based upon a linear model. The tensor method models F({ital x}) by a quadratic model, where the second-order term is chosen so that the model is hardly more expensive to form, store, or solve than the standard linear model. Moreover, the software provides two different global strategies, a line search and a two- dimensional trust region approach. Test results indicate that, in general, tensor methods are significantly more efficient and robust than standard methods on small and medium-sized problems in iterations and function evaluations.

  10. Photolithography diagnostic expert systems: a systematic approach to problem solving in a wafer fabrication facility

    Science.gov (United States)

    Weatherwax Scott, Caroline; Tsareff, Christopher R.

    1990-06-01

    One of the main goals of process engineering in the semiconductor industry is to improve wafer fabrication productivity and throughput. Engineers must work continuously toward this goal in addition to performing sustaining and development tasks. To accomplish these objectives, managers must make efficient use of engineering resources. One of the tools being used to improve efficiency is the diagnostic expert system. Expert systems are knowledge based computer programs designed to lead the user through the analysis and solution of a problem. Several photolithography diagnostic expert systems have been implemented at the Hughes Technology Center to provide a systematic approach to process problem solving. This systematic approach was achieved by documenting cause and effect analyses for a wide variety of processing problems. This knowledge was organized in the form of IF-THEN rules, a common structure for knowledge representation in expert system technology. These rules form the knowledge base of the expert system which is stored in the computer. The systems also include the problem solving methodology used by the expert when addressing a problem in his area of expertise. Operators now use the expert systems to solve many process problems without engineering assistance. The systems also facilitate the collection of appropriate data to assist engineering in solving unanticipated problems. Currently, several expert systems have been implemented to cover all aspects of the photolithography process. The systems, which have been in use for over a year, include wafer surface preparation (HMDS), photoresist coat and softbake, align and expose on a wafer stepper, and develop inspection. These systems are part of a plan to implement an expert system diagnostic environment throughout the wafer fabrication facility. In this paper, the systems' construction is described, including knowledge acquisition, rule construction, knowledge refinement, testing, and evaluation. The roles

  11. Linear and nonlinear dynamic systems in financial time series prediction

    Directory of Open Access Journals (Sweden)

    Salim Lahmiri

    2012-10-01

    Full Text Available Autoregressive moving average (ARMA process and dynamic neural networks namely the nonlinear autoregressive moving average with exogenous inputs (NARX are compared by evaluating their ability to predict financial time series; for instance the S&P500 returns. Two classes of ARMA are considered. The first one is the standard ARMA model which is a linear static system. The second one uses Kalman filter (KF to estimate and predict ARMA coefficients. This model is a linear dynamic system. The forecasting ability of each system is evaluated by means of mean absolute error (MAE and mean absolute deviation (MAD statistics. Simulation results indicate that the ARMA-KF system performs better than the standard ARMA alone. Thus, introducing dynamics into the ARMA process improves the forecasting accuracy. In addition, the ARMA-KF outperformed the NARX. This result may suggest that the linear component found in the S&P500 return series is more dominant than the nonlinear part. In sum, we conclude that introducing dynamics into the ARMA process provides an effective system for S&P500 time series prediction.

  12. Algebraic coarsening methods for linear and nonlinear PDE and systems

    International Nuclear Information System (INIS)

    McWilliams, J C

    2000-01-01

    -grid variables. Once a coarse grid is chosen for which compatible relaxation converges fast, it follows that the dependence of the coarse-grid variables on each other decays exponentially or faster with the distance between them, measured in mesh-sizes. This implies that highly accurate coarse-grid equations can be constructed locally. A method for doing this by solving local constrained minimization problems is described in [1]. It is also shown how this approach can be applied to devise prolongation operators, which can be used for Galerkin coarsening in the usual way. In the present research we studied and developed methods based, in part, on these ideas. We developed and implemented an AMG approach which employs compatible relaxation to define the prolongation operator (hut is otherwise similar in its structure to classical AMG); we introduced a novel method for direct (i.e., non-Galerkin) algebraic coarsening, which is in the spirit of the approach originally proposed by Brandt in [1], hut is more efficient and well-defined; we investigated an approach for treating systems of equations and other problems where there is no unambiguous correspondence between equations and unknowns

  13. Positive solution of non-square fully Fuzzy linear system of equation in general form using least square method

    Directory of Open Access Journals (Sweden)

    Reza Ezzati

    2014-08-01

    Full Text Available In this paper, we propose the least square method for computing the positive solution of a non-square fully fuzzy linear system. To this end, we use Kaffman' arithmetic operations on fuzzy numbers \\cite{17}. Here, considered existence of exact solution using pseudoinverse, if they are not satisfy in positive solution condition, we will compute fuzzy vector core and then we will obtain right and left spreads of positive fuzzy vector by introducing constrained least squares problem. Using our proposed method, non-square fully fuzzy linear system of equations always has a solution. Finally, we illustrate the efficiency of proposed method by solving some numerical examples.

  14. Solving differential–algebraic equation systems by means of index reduction methodology

    DEFF Research Database (Denmark)

    Sørensen, Kim; Houbak, Niels; Condra, Thomas

    2006-01-01

    of a number of differential equations and algebraic equations — a so called DAE system. Two of the DAE systems are of index 1 and they can be solved by means of standard DAE-solvers. For the actual application, the equation systems are integrated by means of MATLAB’s solver: ode23t, that solves moderately...... stiff ODEs and index 1 DAEs by means of the trapezoidal rule. The last sub-model that models the boilers steam drum consist of two differential and three algebraic equations. The index of this model is greater than 1, which means that ode23t cannot integrate this equation system. In this paper......, it is shown how the equation system, by means of an index reduction methodology, can be reduced to a system of ordinary differential equations — ODEs....

  15. Solving differential-algebraic equation systems by means of index reduction methodology

    DEFF Research Database (Denmark)

    Sørensen, Kim; Houbak, Niels; Condra, Thomas Joseph

    2006-01-01

    of a number of differential equations and algebraic equations - a so called DAE system. Two of the DAE systems are of index 1 and they can be solved by means of standard DAE-solvers. For the actual application, the equation systems are integrated by means of MATLAB’s solver: ode23t, that solves moderately...... stiff ODE’s and index 1 DAE’s by means of the trapezoidal rule. The last sub-model that models the boilers steam drum consist of two differential and three algebraic equations. The index of this model is greater than 1, which means that ode23t cannot integrate this equation system. In this paper......, it is shown how the equation system, by means of an index reduction methodology, can be reduced to a system of Ordinary- Differential-Equations - ODE’s....

  16. Essential uncontrollability of discrete linear, time-invariant, dynamical systems

    Science.gov (United States)

    Cliff, E. M.

    1975-01-01

    The concept of a 'best approximating m-dimensional subspace' for a given set of vectors in n-dimensional whole space is introduced. Such a subspace is easily described in terms of the eigenvectors of an associated Gram matrix. This technique is used to approximate an achievable set for a discrete linear time-invariant dynamical system. This approximation characterizes the part of the state space that may be reached using modest levels of control. If the achievable set can be closely approximated by a proper subspace of the whole space then the system is 'essentially uncontrollable'. The notion finds application in studies of failure-tolerant systems, and in decoupling.

  17. The new control system of the Saclay linear accelerator

    International Nuclear Information System (INIS)

    Gournay, J.F.; Gourcy, G.; Garreau, F.; Giraud, A.; Rouault, J.

    1985-05-01

    A new control system for the Safety Linear Accelerator is now being designed. The computer control architecture is based on 3 dedicated VME crates with MC68000 micro-processors: one crate with a disk-based operating system will run the high level application programs and the data base management facilities, another one will manage the man-machine communications and the third one will interface the system to the linac equipments. Communications between the VME microcomputers will be done through 16 bit parallel links. The software is modular and organized in specific layers, the data base is fully distributed. About 90% of the code is written in Fortran

  18. Fundamental Matrix for a Class of Point Delay Linear Systems

    International Nuclear Information System (INIS)

    Sen, M. de la; Alastruey, C. F.

    1998-01-01

    It is difficult to establish explicit analytic forms for fundamental matrices of delayed linear systems. In this paper, an explicit form of exponential type is given for such a matrix in the case of punctual delays. The existence of real and complex fundamental matrices, for the case of real parameterizations of the differential system, is studied and discussed. Some additional commutativity properties involving the matrices parameters and the fundamental matrices as well as explicit expressions for the solution of the delayed differential system are also given. (Author)

  19. Control of Non-linear Marine Cooling System

    DEFF Research Database (Denmark)

    Hansen, Michael; Stoustrup, Jakob; Bendtsen, Jan Dimon

    2011-01-01

    We consider the problem of designing control laws for a marine cooling system used for cooling the main engine and auxiliary components aboard several classes of container vessels. We focus on achieving simple set point control for the system and do not consider compensation of the non-linearitie......-linearities, closed circuit flow dynamics or transport delays that are present in the system. Control laws are therefore designed using classical control theory and the performance of the design is illustrated through two simulation examples....

  20. Coherent versus Measurement Feedback: Linear Systems Theory for Quantum Information

    Directory of Open Access Journals (Sweden)

    Naoki Yamamoto

    2014-11-01

    Full Text Available To control a quantum system via feedback, we generally have two options in choosing a control scheme. One is the coherent feedback, which feeds the output field of the system, through a fully quantum device, back to manipulate the system without involving any measurement process. The other one is measurement-based feedback, which measures the output field and performs a real-time manipulation on the system based on the measurement results. Both schemes have advantages and disadvantages, depending on the system and the control goal; hence, their comparison in several situations is important. This paper considers a general open linear quantum system with the following specific control goals: backaction evasion, generation of a quantum nondemolished variable, and generation of a decoherence-free subsystem, all of which have important roles in quantum information science. Some no-go theorems are proven, clarifying that those goals cannot be achieved by any measurement-based feedback control. On the other hand, it is shown that, for each control goal there exists a coherent feedback controller accomplishing the task. The key idea to obtain all the results is system theoretic characterizations of the above three notions in terms of controllability and observability properties or transfer functions of linear systems, which are consistent with their standard definitions.

  1. Nonautonomous linear Hamiltonian systems oscillation, spectral theory and control

    CERN Document Server

    Johnson, Russell; Novo, Sylvia; Núñez, Carmen; Fabbri, Roberta

    2016-01-01

    This monograph contains an in-depth analysis of the dynamics given by a linear Hamiltonian system of general dimension with nonautonomous bounded and uniformly continuous coefficients, without other initial assumptions on time-recurrence. Particular attention is given to the oscillation properties of the solutions as well as to a spectral theory appropriate for such systems. The book contains extensions of results which are well known when the coefficients are autonomous or periodic, as well as in the nonautonomous two-dimensional case. However, a substantial part of the theory presented here is new even in those much simpler situations. The authors make systematic use of basic facts concerning Lagrange planes and symplectic matrices, and apply some fundamental methods of topological dynamics and ergodic theory. Among the tools used in the analysis, which include Lyapunov exponents, Weyl matrices, exponential dichotomy, and weak disconjugacy, a fundamental role is played by the rotation number for linear Hami...

  2. Optimal approximation of linear systems by artificial immune response

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    This paper puts forward a novel artificial immune response algorithm for optimal approximation of linear systems. A quaternion model of artificial immune response is proposed for engineering computing. The model abstracts four elements, namely, antigen, antibody, reaction rules among antibodies, and driving algorithm describing how the rules are applied to antibodies, to simulate the process of immune response. Some reaction rules including clonal selection rules, immunological memory rules and immune regulation rules are introduced. Using the theorem of Markov chain, it is proofed that the new model is convergent. The experimental study on the optimal approximation of a stable linear system and an unstable one show that the approximate models searched by the new model have better performance indices than those obtained by some existing algorithms including the differential evolution algorithm and the multi-agent genetic algorithm.

  3. Large linear magnetoresistivity in strongly inhomogeneous planar and layered systems

    International Nuclear Information System (INIS)

    Bulgadaev, S.A.; Kusmartsev, F.V.

    2005-01-01

    Explicit expressions for magnetoresistance R of planar and layered strongly inhomogeneous two-phase systems are obtained, using exact dual transformation, connecting effective conductivities of in-plane isotropic two-phase systems with and without magnetic field. These expressions allow to describe the magnetoresistance of various inhomogeneous media at arbitrary concentrations x and magnetic fields H. All expressions show large linear magnetoresistance effect with different dependencies on the phase concentrations. The corresponding plots of the x- and H-dependencies of R(x,H) are represented for various values, respectively, of magnetic field and concentrations at some values of inhomogeneity parameter. The obtained results show a remarkable similarity with the existing experimental data on linear magnetoresistance in silver chalcogenides Ag 2+δ Se. A possible physical explanation of this similarity is proposed. It is shown that the random, stripe type, structures of inhomogeneities are the most suitable for a fabrication of magnetic sensors and a storage of information at room temperatures

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

  5. Maximization of energy in the output of a linear system

    International Nuclear Information System (INIS)

    Dudley, D.G.

    1976-01-01

    A time-limited signal which, when passed through a linear system, maximizes the total output energy is considered. Previous work has shown that the solution is given by the eigenfunction associated with the maximum eigenvalue in a Hilbert-Schmidt integral equation. Analytical results are available for the case where the transfer function is a low-pass filter. This work is extended by obtaining a numerical solution to the integral equation which allows results for reasonably general transfer functions

  6. Linear Quantum Systems: Non-Classical States and Robust Stability

    Science.gov (United States)

    2016-06-29

    modulation and entanglement in a compound gradient echo memory, Physical Review A 93(2) 023809 2016. We present a theoretical model for a Kerr...Carvalho, M. Hedges and M R James, Analysis of the operation of gradient echo memories using a quantum input-output model, New Journal of Physics , 15...new structured uncertainty methods that ensure robust stability of quantum systems based on nominal linear models, and (v) physical realizability

  7. Dynamic logic architecture based on piecewise-linear systems

    International Nuclear Information System (INIS)

    Peng Haipeng; Liu Fei; Li Lixiang; Yang Yixian; Wang Xue

    2010-01-01

    This Letter explores piecewise-linear systems to construct dynamic logic architecture. The proposed schemes can discriminate the two input signals and obtain 16 kinds of logic operations by different combinations of parameters and conditions for determining the output. Each logic cell performs more flexibly, that makes it possible to achieve complex logic operations more simply and construct computing architecture with less logic cells. We also analyze the various performances of our schemes under different conditions and the characteristics of these schemes.

  8. Efficient Preconditioning of Sequences of Nonsymmetric Linear Systems

    Czech Academy of Sciences Publication Activity Database

    Duintjer Tebbens, Jurjen; Tůma, Miroslav

    2007-01-01

    Roč. 29, č. 5 (2007), s. 1918-1941 ISSN 1064-8275 R&D Projects: GA AV ČR 1ET400300415; GA AV ČR KJB100300703 Institutional research plan: CEZ:AV0Z10300504 Keywords : preconditioned iterative methods * sparse matrices * sequences of linear algebraic systems * incomplete factorizations * factorization updates * Gauss–Jordan transformations * minimum spanning tree Subject RIV: BA - General Mathematics Impact factor: 1.784, year: 2007

  9. Feedback Linearization Controller for a Wind Energy Power System

    Directory of Open Access Journals (Sweden)

    Muthana Alrifai

    2016-09-01

    Full Text Available This paper deals with the control of a doubly-fed induction generator (DFIG-based variable speed wind turbine power system. A system of eight ordinary differential equations is used to model the wind energy conversion system. The generator has a wound rotor type with back-to-back three-phase power converter bridges between its rotor and the grid; it is modeled using the direct-quadrature rotating reference frame with aligned stator flux. An input-state feedback linearization controller is proposed for the wind energy power system. The controller guarantees that the states of the system track the desired states. Simulation results are presented to validate the proposed control scheme. Moreover, further simulation results are shown to investigate the robustness of the proposed control scheme to changes in some of the parameters of the system.

  10. ENVIRONMENTAL PROBLEM SOLVING WITH GEOGRAPHIC INFORMATION SYSTEMS: 1994 AND 1999 CONFERENCE PROCEEDINGS

    Science.gov (United States)

    These two national conferences, held in Cincinnati, Ohio in 1994 and 1999, addressed the area of environmental problem solving with Geographic Information Systems. This CD-ROM is a compilation of the proceedings in PDF format. The emphasis of the conference presentations were on ...

  11. The Interactions between Problem Solving and Conceptual Change: System Dynamic Modelling as a Platform for Learning

    Science.gov (United States)

    Lee, Chwee Beng

    2010-01-01

    This study examines the interactions between problem solving and conceptual change in an elementary science class where students build system dynamic models as a form of problem representations. Through mostly qualitative findings, we illustrate the interplay of three emerging intervening conditions (epistemological belief, structural knowledge…

  12. Optimal Homotopy Asymptotic Method for Solving System of Fredholm Integral Equations

    Directory of Open Access Journals (Sweden)

    Bahman Ghazanfari

    2013-08-01

    Full Text Available In this paper, optimal homotopy asymptotic method (OHAM is applied to solve system of Fredholm integral equations. The effectiveness of optimal homotopy asymptotic method is presented. This method provides easy tools to control the convergence region of approximating solution series wherever necessary. The results of OHAM are compared with homotopy perturbation method (HPM and Taylor series expansion method (TSEM.

  13. Asymptotic behavior of a diffusive scheme solving the inviscid one-dimensional pressureless gases system

    OpenAIRE

    Boudin , Laurent; Mathiaud , Julien

    2012-01-01

    In this work, we discuss some numerical properties of the viscous numerical scheme introduced in [Boudin, Mathiaud, NMPDE 2012] to solve the one-dimensional pressureless gases system, and study in particular, from a computational viewpoint, its asymptotic behavior when the viscosity parameter used in the scheme becomes smaller.

  14. The Prehistory of Discovery: Precursors of Representational Change in Solving Gear System Problems.

    Science.gov (United States)

    Dixon, James A.; Bangert, Ashley S.

    2002-01-01

    This study investigated whether the process of representational change undergoes developmental change or different processes occupy different niches in the course of knowledge acquisition. Subjects--college, third-, and sixth-grade students--solved gear system problems over two sessions. Findings indicated that for all grades, discovery of the…

  15. Linear circuits, systems and signal processing: theory and application

    International Nuclear Information System (INIS)

    Byrnes, C.I.; Saeks, R.E.; Martin, C.F.

    1988-01-01

    In part because of its universal role as a first approximation of more complicated behaviour and in part because of the depth and breadth of its principle paradigms, the study of linear systems continues to play a central role in control theory and its applications. Enhancing more traditional applications to aerospace and electronics, application areas such as econometrics, finance, and speech and signal processing have contributed to a renaissance in areas such as realization theory and classical automatic feedback control. Thus, the last few years have witnessed a remarkable research effort expended in understanding both new algorithms and new paradigms for modeling and realization of linear processes and in the analysis and design of robust control strategies. The papers in this volume reflect these trends in both the theory and applications of linear systems and were selected from the invited and contributed papers presented at the 8th International Symposium on the Mathematical Theory of Networks and Systems held in Phoenix on June 15-19, 1987

  16. hi_class: Horndeski in the cosmic linear anisotropy solving system

    Czech Academy of Sciences Publication Activity Database

    Zumalacarregui, M.; Bellini, E.; Sawicki, Ignacy; Lesgourgues, J.; Ferreira, P.G.

    2017-01-01

    Roč. 2017, č. 8 (2017), s. 1-29, č. článku 019. ISSN 1475-7516 R&D Projects: GA MŠk EF15_003/0000437 Grant - others:OP VVV - CoGraDS(XE) CZ.02.1.01/0.0/0.0/15_003/0000437 Institutional support: RVO:68378271 Keywords : modified gravity * gravitational waves * cosmology * large scale structure Subject RIV: BN - Astronomy, Celestial Mechanics, Astrophysics OBOR OECD: Astronomy (including astrophysics,space science) Impact factor: 4.734, year: 2016

  17. On the Numerical Behavior of Matrix Splitting Iteration Methods for Solving Linear Systems

    Czech Academy of Sciences Publication Activity Database

    Bai, Z.-Z.; Rozložník, Miroslav

    2015-01-01

    Roč. 53, č. 4 (2015), s. 1716-1737 ISSN 0036-1429 R&D Projects: GA ČR GA13-06684S Institutional support: RVO:67985807 Keywords : matrix splitting * stationary iteration method * backward error * rounding error analysis Subject RIV: BA - General Mathematics Impact factor: 1.899, year: 2015

  18. Preconditioner Updates for Solving Sequences of Linear Systems in Matrix-Free Environment

    Czech Academy of Sciences Publication Activity Database

    Duintjer Tebbens, Jurjen; Tůma, Miroslav

    2010-01-01

    Roč. 17, č. 6 (2010), s. 997-1019 ISSN 1070-5325 R&D Projects: GA AV ČR IAA100300802; GA AV ČR KJB100300703 Grant - others:GA AV ČR(CZ) M100300902 Institutional research plan: CEZ:AV0Z10300504 Source of funding: I - inštitucionálna podpora na rozvoj VO Keywords : preconditioned iterative methods * matrix-free environment * factorization updates * inexact Newton-Krylov methods * incomplete factorizations Subject RIV: BA - General Mathematics Impact factor: 1.163, year: 2010

  19. On the economical solution method for a system of linear algebraic equations

    Directory of Open Access Journals (Sweden)

    Jan Awrejcewicz

    2004-01-01

    Full Text Available The present work proposes a novel optimal and exact method of solving large systems of linear algebraic equations. In the approach under consideration, the solution of a system of algebraic linear equations is found as a point of intersection of hyperplanes, which needs a minimal amount of computer operating storage. Two examples are given. In the first example, the boundary value problem for a three-dimensional stationary heat transfer equation in a parallelepiped in ℝ3 is considered, where boundary value problems of first, second, or third order, or their combinations, are taken into account. The governing differential equations are reduced to algebraic ones with the help of the finite element and boundary element methods for different meshes applied. The obtained results are compared with known analytical solutions. The second example concerns computation of a nonhomogeneous shallow physically and geometrically nonlinear shell subject to transversal uniformly distributed load. The partial differential equations are reduced to a system of nonlinear algebraic equations with the error of O(hx12+hx22. The linearization process is realized through either Newton method or differentiation with respect to a parameter. In consequence, the relations of the boundary condition variations along the shell side and the conditions for the solution matching are reported.

  20. Linear filtering of systems with memory and application to finance

    Directory of Open Access Journals (Sweden)

    2006-01-01

    Full Text Available We study the linear filtering problem for systems driven by continuous Gaussian processes V ( 1 and V ( 2 with memory described by two parameters. The processes V ( j have the virtue that they possess stationary increments and simple semimartingale representations simultaneously. They allow for straightforward parameter estimations. After giving the semimartingale representations of V ( j by innovation theory, we derive Kalman-Bucy-type filtering equations for the systems. We apply the result to the optimal portfolio problem for an investor with partial observations. We illustrate the tractability of the filtering algorithm by numerical implementations.