National Repository of Grey Literature 18 records found  1 - 10next  jump to record: Search took 0.00 seconds. 
Preconditioning and regularity of symmetric interval matrices
Vigilev, Pavel ; Hladík, Milan (advisor) ; Horáček, Jaroslav (referee)
In this thesis we observed different approaches to construct a preconditioner for sy- mmetric interval matrices. Using these preconditioners we described and implemented methods for testing regularity of these matrices and compared efficiency of described algorithms. After that we observed different methods for estimating eigenvalues of this class of matrices. Also we constructed such method that uses any testing regularity me- thod for filtering an input interval. After that we compared efficency of these methods on different classes of matrices. All algorithms we implemented using MATLAB with the IntLab library. Comparing numerical results we concluded that the way to test regula- rity of symmetric interval matrix based on the sufficient condition for regularity with standard preconditioner is the most efficient one among the algorithms we implemented. The constructed method for estimating eigenvalues based on testing regularity gives very accurate result because of its iterativity, but it seems to be very slow comparing to other methods which give similar accuracy. 1
Overdetermined systems of interval linear equations
Horáček, Jaroslav ; Hladík, Milan (advisor)
This work is focused on overdetermined systems of interval linear equati- ons. First part consists of introduction to interval arithmetics and interval linear algebra and basic theory of interval linear systems. In the second part various methods for solving overdetermined interval linear systems are de- scribed. By solution of overdetermined interval system we mean union of all solutions of all subsystems. Known and our variants of algorithms are discussed. We introduce our subsquare method. All mentioned methods are implemented in one toolbox for Matlab. Methods are tested on solvable and unsolvable overdetermined systems. For solvable systems we test solution enclosure, time and special features of methods. For unsolvable systems we test detection of unsolvability. At the end of this work we provide basic in- troduction to Intlab. 1
Interval linear and nonlinear systems
Horáček, Jaroslav ; Hladík, Milan (advisor) ; Garloff, Jürgen (referee) ; Ratschan, Stefan (referee)
First, basic aspects of interval analysis, roles of intervals and their applications are addressed. Then, various classes of interval matrices are described and their relations are depicted. This material forms a prelude to the unifying theme of the rest of the work - solving interval linear systems. Several methods for enclosing the solution set of square and overdetermined interval linear systems are covered and compared. For square systems the new shaving method is introduced, for overdetermined systems the new subsquares approach is introduced. Detecting unsolvability and solvability of such systems is discussed and several polynomial conditions are compared. Two strongest condi- tions are proved to be equivalent under certain assumption. Solving of interval linear systems is used to approach other problems in the rest of the work. Computing enclosures of determinants of interval matrices is addressed. NP- hardness of both relative and absolute approximation is proved. New method based on solving square interval linear systems and Cramer's rule is designed. Various classes of matrices with polynomially computable bounds on determinant are characterized. Solving of interval linear systems is also used to compute the least squares linear and nonlinear interval regression. It is then applied to real...
Game theory as a confict and cooperation theory
Horáček, Jaroslav ; Černý, Karel (advisor) ; Šubrt, Jiří (referee)
The main focus of this work is the relation between sociology and mathematics, especially the relation between sociological theories of conflict and cooperation and the game theory. In the work four general theories of conflict (and coopera- tion) are introduced - theory by John Rex, Kenneth Boulding, Louis Kriesberg and František Znebejánek. Each is accompanied by a critical review. Next, the formal game theory is introduced. The main effort is to shed new light on game theoretic concepts known in sociology and introduce some of the less known ones. The text is focused on the main ideas and explanation without mathematical for- malism. Historical relation between sociology and game theory is discussed. Also some topics that are not well handled in game theory from sociological point of view are further elaborated - assumption of rationality, definition of utility and preference, assumption of general knowledge etc. There are also topics from mathematics and informatics slowly penetrating sociology - computer simulation, prediction, that we also discuss. The possible modifications and merit of game theory for sociology is also included. Inspired by the previous theories, at the end of this work a new theoretic model of conflict and cooperation is introduced, which tries to overcome some imperfections of the...
Application of Branch and Bound Approach to Parametric Interval Linear Systems
Szabó, Adam ; Horáček, Jaroslav (advisor) ; Rada, Miroslav (referee)
This work is focused on parametric interval linear systems. By using branch and bound method and various pruning conditions, we first obtained their solution and then described it more precisely with n-dimensional boxes. We were acquainted with the basic concepts of intervals and linear systems. Subsequently, we processed the boxes obtained by multiple methods to opti- mize their number. Part of the work is also a comparison of various pruning conditions on parametric systems with the different number of parameters. Finally, our algorithms were implemented into the Lime interval package with the possibility of simple visualization of the obtained solutions. 1
Overdetermined systems of interval linear equations
Horáček, Jaroslav ; Hladík, Milan (advisor)
This work is focused on overdetermined systems of interval linear equati- ons. First part consists of introduction to interval arithmetics and interval linear algebra and basic theory of interval linear systems. In the second part various methods for solving overdetermined interval linear systems are de- scribed. By solution of overdetermined interval system we mean union of all solutions of all subsystems. Known and our variants of algorithms are discussed. We introduce our subsquare method. All mentioned methods are implemented in one toolbox for Matlab. Methods are tested on solvable and unsolvable overdetermined systems. For solvable systems we test solution enclosure, time and special features of methods. For unsolvable systems we test detection of unsolvability. At the end of this work we provide basic in- troduction to Intlab. 1
Determinants of Interval Matrices
Matějka, Josef ; Horáček, Jaroslav (advisor) ; Hladík, Milan (referee)
This work focuses on the determinants of interval matrices. After a short introduction into interval arithmetics, the works focus on time complexity of computation tight enclosures of interval determinants, we show what complexity class this problem belongs to and how hard is approximation with relative and absolute error. Next chapter works with various preconditions of a matrix, which could lead to better results. After we analyse preconditioning of matrices we show several methods for computing determinants, starting with Gauss elimination, en- ding method using Cramer's rule. We also ponder about special cases of matrices like symmetric, tridiagonal and Toeplitz. At the end we test shown methods. 1
Estimating data with use of interval analysis
Pelikánová, Petra ; Horáček, Jaroslav (advisor) ; Černý, Michael (referee)
This work is focused on estimating interval data by real functions and interval functions. It presents possibilistic and necessity models of interval regression and compares its strong and week formulations. Further we describe algorithms of linear and nonlinear estimation. The application part is based on demonstration of tolerance method and subtracting tolerance method analysing real cases. 1
Psychologically-plausible and connectionism-friendly implementation of long-term memory
Milota, Martin ; Horáček, Jaroslav (advisor) ; Bálek, Martin (referee)
In recent decades, the influence and sophistication of connectionist systems has soared. The fields of their applications are countless - image re- cognition, data mining, robotics, and many more. A part of the thesis focuses on commonly adopted distributed data representations suitable for connectionist systems, devising an extension and testing its usefulness. The goal of the thesis is to use these extensions to design and implement a model of the long-term memory based on a prevalent psychological theory.
Visualisation of interval data
Mečiar, Martin ; Horáček, Jaroslav (advisor) ; Rada, Miroslav (referee)
The thesis is focused on visualisation, comparison and modification of outputs of interval solvers for solving a continuous constraint satisfaction problem. The author's designed solution for the approximation of outputs of solvers is presented in the thesis. The approximation of outputs of solvers is transformed into the problem of visual reallocation of the sets of outputs of solvers on a finer level than interval box level. Main part of the thesis is the program on added CD that allows visualisation, comparison and modification of outputs of interval solvers. The program is written in C++, but can be compiled as a MEX file for MATLAB. A user documentation and a technical documentation for the program are included in the thesis. The thesis shows several examples of program output in the devoted chapter. Powered by TCPDF (www.tcpdf.org)

National Repository of Grey Literature : 18 records found   1 - 10next  jump to record:
See also: similar author names
6 HORÁČEK, Jakub
1 Horáček, J.
6 Horáček, Jakub
14 Horáček, Jan
67 Horáček, Jaromír
23 Horáček, Jiří
Interested in being notified about new results for this query?
Subscribe to the RSS feed.