|
| |
|
| |
|
| |
|
| |
|
|
A quadrature formula of Clenshaw-Curtis type for the Gegenbauer weight-function
Labant, Ján ; Kofroň, Josef (advisor) ; Janovský, Vladimír (referee)
In this thesis we study especially quadrature formulae based on the Cheby- shev expansion, known as the Clenshaw-Curtis quadrature. The first part is focused on the Chebyshev polynomials, their definitions and properties. This knowledge will be used to derivate the Clenshaw-Curtis quadrature. Consider- able part of this work is dedicated to comparison of this and the well-known Gauss quadrature both theoretically and practicaly. In the further work we will extend the Clenshaw-Curtis quadrature by the Gegenbauer weight function which gives us new methods for numerical integration. These methods allow us to find a solution of some known problems what will be pointed out also on some nu- merical experimets. 1
|
|
|
Mathematical models of ecosystems
Scholle, David ; Janovský, Vladimír (advisor) ; Kofroň, Josef (referee)
This work is about models of population growth in different situations. At first, we will examine amount of spiders and their prey in the region of Langa Astigiana, based on models of dynamical systems. We will also consider the usage of spraying of near vineyards and effect of this on the ecosystem. The aim of this work is also to check the possibility of periodical cycles, and thus also of the Hopf Bifurcation, appearing. Next part talks about the model of a beehive and examines the influence of insecticides on the population of bee drones and worker bees. The aim of the last chapter is to examine the effectivity and possible impact of human intervention in the region of Šumava forest. The model will check the necessity of such action against parasites. The software used for these tasks will be mainly the continuation toolbox MatCont, which is a part of the program MatLab.
|
|
| |
|
|
Solving bordered linear systems
Štrausová, Jitka ; Janovský, Vladimír (advisor) ; Zítko, Jan (referee)
The comparison of two algorithms for solving bordered linear systems is considered. The matrix of this system consists of four blocks (matrices A,B,C,D), the upper left one is a sparse matrix A, which is ill-conditioned and structured. The other blocks (B,C,D) are dense. We say that the matrix A is bordered with the matrices B,C,D. It is desirable to preserve the block structure of the matrix and take advantage of sparsity and structure of the matrix A. The literature suggests to use two different algorithms: The first one is the method BEM for matrices with the borders of width equal to one. The recursive alternative for matrices with wider borders is called BEMW. The second algorithm is an iterative method. Both techniques are based on different variants of the block LU-decomposition.
|
|
|
Lineární algebraické modelování úloh s nepřesnými daty
Vasilík, Kamil ; Hnětynková, Iveta (advisor) ; Janovský, Vladimír (referee)
In this thesis we consider problems Ax b arising from the discretization of ill-posed problems, where the right-hand side b is polluted by (unknown) noise. It was shown in [29] that under some natural assumptions, using the Golub-Kahan iterative bidiagonalization the noise level in the data can be estimated at a negligible cost. Such information can be further used in solving ill-posed problems. Here we suggest criteria for detecting the noise revealing iteration in the Golub-Kahan iterative bidiagonalization. We discuss the presence of noise of different colors. We study how the loss of orthogonality affects the noise revealing property of the bidiagonalization.
|
|
| |
guest ::
RSS feed.