MMI bakalaureusetööd – Bachelor's theses. Kuni 2015

Selle kollektsiooni püsiv URIhttps://hdl.handle.net/10062/30415

Sirvi

Nüüd näidatakse 1 - 20 56

Применение принципа равномерной органиченности к теории суммируемости
(Tartu Ülikool, 1999) Удальцова, Елена; Soomer, Virge, juhendaja; Tartu Ülikool. Matemaatika-informaatikateaduskond; Tartu Ülikool. Matemaatika instituut
Optimaalsete veomarsruutide leidmine kahe lao korral
(Tartu Ülikool, 2002) Kuresson, Aire; Kangro, Raul, juhendaja; Tartu Ülikool. Matemaatika-informaatikateaduskond; Tartu Ülikool. Matemaatika instituut
Autonoomsete diferentsiaalvõrrandite süsteemide perioodilised lahendid
(Tartu Ülikool, 2002) Korobova, Evelin; Miidla, Peep, juhendaja; Tartu Ülikool. Matemaatika-informaatikateaduskond; Tartu Ülikool. Matemaatika instituut
Hüpoteeside kontrollimine ja võimsuse arvutamine Analyst Application abil
(Tartu Ülikool, 2002) Bileva, Anna; Parring, Anne-Mai, juhendaja; Tartu Ülikool. Matemaatika-informaatikateaduskond; Tartu Ülikool. Matemaatika instituut
Asümmeetria ja järsakuse karakteristikud
(Tartu Ülikool, 2005) Kilgi, Helle; Kollo, Tõnu, juhendaja; Tartu Ülikool. Matemaatika-informaatikateaduskond; Tartu Ülikool. Matemaatika instituut
Hulkade ja funktsioonide r-kumerus
(Tartu Ülikool, 2005) Kivi, Karin; Soomer, Virge, juhendaja; Tartu Ülikool. Matemaatika-informaatikateaduskond; Tartu Ülikool. Matemaatika instituut
Rajaülesande lahendamine ratsionaalsplainidega kollokatsioonimeetodil
(Tartu Ülikool, 2006) Mehide, Inga; Fischer, Malle, juhendaja; Oja, Peeter, juhendaja; Tartu Ülikool. Matemaatika-informaatikateaduskond; Tartu Ülikool. Matemaatika instituut
Riccati diferentsiaalvõrrand finantsmatemaatikas
(Tartu Ülikool, 2007) Kuld, Anu; Miidla, Peep, juhendaja; Tartu Ülikool. Matemaatika-informaatikateaduskond; Tartu Ülikool. Matemaatika instituut
Rajaülesande lahendamine ratsionaalsplainidega kollokatsioonimeetodil
(Tartu Ülikool, 2007) Nurk, Anni; Fischer, Malle, juhendaja; Oja, Peeter, juhendaja; Tartu Ülikool. Matemaatika-informaatikateaduskond; Tartu Ülikool. Matemaatika instituut
B-splainid ja nende rakendused
(Tartu Ülikool, 2007) Kuljus, Elina; Fischer, Malle, juhendaja; Oja, Peeter, juhendaja; Tartu Ülikool. Matemaatika-informaatikateaduskond; Tartu Ülikool. Matemaatika instituut
Ruutsplainidega interpoleerimine ühtlasel võrgul
(Tartu Ülikool, 2008) Frolova, Svetlana; Pedas, Arvet, juhendaja; Tartu Ülikool. Matemaatika-informaatikateaduskond; Tartu Ülikool. Matemaatika instituut
Ajaskaalal määratud funktsioonide diferentseerimine ja integreerimine
(Tartu Ülikool, 2009) Karm, Märten; Leiger, Toivo, juhendaja; Tartu Ülikool. Matemaatika-informaatikateaduskond; Tartu Ülikool. Matemaatika instituut
Otsese ja kaudse meetodi võrdlemine aktsiahinna kasvamise tõenäosuse leidmisel päevasisese kauplemise tingimustes
(Tartu Ülikool, 2009) Olvik, Ander; Kangro, Raul, juhendaja; Tartu Ülikool. Matemaatika-informaatikateaduskond; Tartu Ülikool. Matemaatika instituut
Minkowski aegruumi geomeetriast
(Tartu Ülikool, 2013) Lätt, Priit; Abramov, Viktor, juhendaja; Tartu Ülikool. Matemaatika-informaatikateaduskond; Tartu Ülikool. Matemaatika instituut
We consider a four-dimensional real vector space in which three coordinates describe the space, and the fourth coordinate describes time. Such a vector space, equipped with Minkowski metric, is said to be a Minkowski spacetime, denotedM and sometimes referred just as Minkowski space. In the beginning of 20th century it emerged from the works of Hermann Minkowski and Henry Poincar e that this mathematical tool can be really useful in areas like the theory of special relativity. The rst objective of this thesis is to introduce the classical properties of Minkowski spacetime in a way that doesn't get into the details about the physical meaning of the topic. The main focus is on the elements of the spacetime and the orthogonal maps that describe the transformations of these elements. As this topic, the Minkowski spacetime, has many applications in physics, most of the literature on it originates from physics, rather than mathematics. In the books that are written by physicists, strict proofs are not given properly or they are avoided entirely. Sometimes physical discussion is considered as a proof, but as shown in proposition 3.1 for example, things are not so obvious after all in a mathematical point of view. In contrary, the aim of this thesis is to ll this gap by giving rigorous proof to all the statements that are made. The last part of the thesis takes a new course and tries to introduce tools from branch of mathematics called di erential geometry. Apparatus described there can be useful not just describing the structure of Minkowski spacetime, but also wide areas of theoretical physics. At last, we generalize classical spacetime and present the Minkowski superspace { a space with anticommuting coordinates that has become a useful tool in the eld theory. This is all done in a bit less formal way. This thesis consists of four sections. In the rst section we recall such topics that are not strictly connected to the thesis but have great impact on further understanding of the paper. For example Gram{Schmidt orthogonalization process is reminded and we prove one of the fundamental results related to dot product, the Cauchy{Schwartz{Bunjakowski inequality. We also describe the rules of the multipication of block matrices as 42 well as nding the inverse of block matrix. Map called matrix exponential is introduced as it plays a key role in the nal part of the thesis. Considered the geometrical meaning of the paper we nd ourselves stopping for a bit longer to study the idea of topological manifold. Second section sets an objective to describe the elements or events of the Minkowski spacetime. For that we give a strict de nition of dot product and move on to the concept of pseudoeucleidic space. After that we describe the dot product in Minkowski spacetime, which gives us the metric. It appears that by the metric we can factorize the elements of spacetime into three distinct classes, these are spacelike, timelike and nullvectors. The last subsection is there to describe the orthogonal transformations of Minkowski space, referred as Lorentz transformations. We show how these transformations can be represented in both coordinates and matrix form and what is the connection between the transformations and the metric of M. Finally we prove that the set of all Lorentz transformatioins has a very natural group structure, the Lorentz group. In the third section we continue with the observation of Lorentz transformations. In the rts subsection we take a closer look at the properties of such transformations and concentrate on the most important of them. As a result we nd a rotation subgroup of Lorentz group. We proceed with noting that Lorentz transformations remain the distances invariant. That encourages us to look for other such transformations that share the same property. As it happens translations are of this kind and by observing translations with Lorentz transformations together, we get the symmetry group of Minkowski spacetime, the Poincar e group. The fourth section takes another course. In this section the objective is to introduce, via more popular approach, the connections between Minkowski spacetime and di erential geometry, and to uncover the term superspace with the surrounding mathematics. In the part of di erential geometry we de ne Lie algebra with its representation and give examples to clear the topic. As expected we then nd ourselves de ning Lie group which we later connect with Lie algebra by giving an informal description. The section, as well as the paper is then nished with the introduction of Minkowski superspace. For that we de ne terms such as superalgebra and give a well known example, the Grassmann algebra. By avoiding strict mathematical formalism, we show what are functions on superspace and how to nd integral or derivative of such functions.
Matemaatika võimalikest rakendustest muusikas
(Tartu Ülikool, 2013) Simson, Mai; Abel, Mati, juhendaja; Tartu Ülikool. Matemaatika-informaatikateaduskond; Tartu Ülikool. Matemaatika instituut
The aim of this bachelor’s thesis is to give an overview of some mathematical applications which can be used in music. The thesis is mainly based on three books: “Simple Gamma” by Georgi Evgenevitš Šilov, “Occidents’ History of Music” by Igor Garšnek and “Music: A Mathematical Offering” by Dave Benson. The thesis consists of four chapters. In the first chapter we give definitions to different terms that are used in the thesis. The second chapter briefly describes the common history in music and mathematics. The aim of the third chapter is to explain the construction of the musical scale using logarithms and chain fractures. The final chapter focuses on different mathematical applications used in music. We will discuss Iannis Xenakis’s theory about the algebraic qualities of the intervals, the theory that Pierre Boulez used to compose his “Structures I”, Urmas Sisask using mathematics and astronomy to compose his choir piece “Gloria Patri” and also some mathematical methods that could be used to describe music.
M(a,B,c)-ideaalid Banachi ruumides
(Tartu Ülikool, 2013) Rozhinskaya, Ksenia; Zolk, Indrek, juhendaja; Tartu Ülikool. Matemaatika-informaatikateaduskond; Tartu Ülikool. Matemaatika instituut
In their 1973 paper “Structure in real Banach spaces” [AE], E. Alfsen and E. Effros introduced the notion of an M-ideal. It turned out that a closed subspace of a Banach space that is an M-ideal enjoys some properties (e.g. uniqueness of a norm-preserving extension) which do not necessarily occur in arbitrary subspaces. In [GKS], G. Godefroy, N. Kalton and P. Saphar introduced the notion of an ideal. It allowed them to make a connection between M-ideals and u-ideals, which were first introduced in [CK]. They also presented a natural strengthening of the definition of a u-ideal, an h-ideal. Another important step towards the generalization of previously studied ideals was made by J. Cabello and E. Nieto in [CN], where they defined an M(r; s)-ideal. The idea of studying M(a;B; c)-ideals dates back to a paper [O1] by E. Oja from 2000. In [OZ], one finds the following definition. Let a, c > 0 and let B K be a compact set of scalars. We shall say that a Banach space X satisfies the M(a;B; c)-inequality if kax + b Xx k + ck Xx k 6 kx k 8b 2 B; 8x 2 X ; where X : X ! X is the canonical projection. Based on this definition, we define an M(a;B; c)-ideal for an arbitrary closed subspace and aim to study some properties of M(a;B; c)-ideals. The pursuit to studyM(a;B; c)-ideals is motivated by the fact that the definition of anM(a;B; c)- ideal encompasses all previously studied special cases of ideals and makes it possible to handle them with a more unified approach. This bachelor thesis consists of four chapters. In the first chapter, we give a brief overview of some basic definitions and results required for further work. In the second chapter, we introduce the notion of an M(a;B; c)-ideal and study some basic properties of M(a;B; c)-ideals. We also take a closer look at M-, u- and h-ideals. The aim of the third chapter is to study M(a;B; c)-ideals in particular Banach spaces. First we give necessary and sufficient conditions for a one-dimensional subspace of a Banach space `2 1 to be an M(a;B; c)-ideal in `2 1. We also provide a theoretical result which can be used to derive examples of M(a;B; c)-ideals in L(X). In the fourth chapter, we study the transitivity of M(a;B; c)-inequality. First we show that ideal projections are closely connected to Hahn-Banach extension operators. Using this knowledge, we show as a first main result of this bachelor thesis that if X is an M(a;B; c)-ideal in Y and Y is an M(d;E; f)-ideal in Z, then X is an ideal satisfying a certain type of inequality in Z. Relying on this result, we show as a second main result of this thesis that if X is an M(a;B; c)-ideal in its second bidual X , then X is an ideal satisfying a certain type of inequality in X(2n) for every n 2 N.
Elastsete plaatide painde ülesanded
(Tartu Ülikool, 2013) Kasepuu, Kaile; Lellep, Jaan, juhendaja; Tartu Ülikool. Matemaatika-informaatikateaduskond; Tartu Ülikool. Matemaatika instituut
The aim of this work is to introduce the Basic equations of the Kirchhoff’s bending theory. The current study consists on two parts. In the first part we derive the governing differential equation for the deflection for thin plate bending. In the second part we study the bending of thin rectangular plates subjected to the transverse pressure. We find the middle surface of the plate in the case of cylindrical bending. It appears that in this case the differential equation of equilibrium can be solved by direct integration. Also we present Navier’s method for rectangular plates with simply supported boundary conditions on all four edges. We look for the solution of the equilibrium equation in the form of double seires. Each term of this series is a product of trigonometrical functions which meet the boundary conditions spontaneously.
Absoluutselt summeerivad operaatorid ruumil B (F)
(Tartu Ülikool, 2013) Izotova, Jekaterina; Põldvere, Märt,juhendaja; Tamme, Tõnu, juhendaja; Tartu Ülikool.Matemaatika-informaatikateaduskond; Tartu Ülikool.Matemaatika instituut
Aasia optsioonide hindamine
(Tartu Ülikool, 2013) Kask, Rain; Raus, Toomas, juhendaja; Tartu Ülikool. Matemaatika-informaatikateaduskond; Tartu Ülikool. Matemaatika instituut
Determining the correct value of an option is the main problem in option theory. There are several factors which determine the price of an option. In addition to these factors, Asian options also depend on the history of the underlying asset which complicates the correct pricing of an Asian option. Although the structure of an Asian option is more complex than for example European option's, many of the typical numerical methods can still be used to nd the price of an Asian option when modi ed correctly. In the rst part of this thesis some of these typical numerical methods are introduced. The basic idea of lattice method, di erential method and Monte-Carlo method are described by showing how to nd a value of a usual European option step by step. The last and main part of this thesis is dedicated to Asian options and lattice method. It is shown how to modify the lattice method so that it could be used for pricing an Asian option. The modi ed lattice method for pricing an Asian option is called forward shooting grid method (FSG) and was rst used in 1993 by Hull and White for nding the value of Asian and lookback options. The method is described thoroughly and 2 di erent approaches (Barraquand-Pudet method and modi ed Hull-White method) for choosing the average price of an underlying asset are introduced. To ensure that the FSG method can truly be used for pricing an Asian option, some results obtained by using the FSG method with di erent parameters N, and are brought out in the last section of the thesis. The prices found by Barraquand and Pudet method and modi ed Hull and White method are compared with a price of an unrealistic Asian option, which analytical value can be found. For one more realistical case of an Asian option the prices found by FSG method are compared with a price found by Monte-Carlo method. Source codes (written in Python) for FSG method and Monte-Carlo method are brought out in Appendixes (Lisad).
Otsesuunatud tehisnärvivõrgud paketis R
(Tartu Ülikool, 2013) Liivoja, Merili; Miidla, Peep, juhendaja; Tartu Ülikool. Matemaatika-informaatikateaduskond; Tartu Ülikool. Matemaatika instituut
Human brain is a complex and powerful system that is able to solve a wide variety of tasks. The aim of many scientists is to develop a computer simulation that mimics the brain functions and solves problems the way our brains do. Very simplified models of biological neural networks are artificial neural networks. There are two different types of artificial neural networks – feed forward neural networks and recurrent neural networks. This thesis gives an overview of feed-forward neural networks and their working principles. The thesis is divided into two main parts. The first part is the theory of feed-forward neural networks and the second part is a practical example of neural network with software R. The first part gives an overview of the artificial neuron and its history. Also different types of artificial neurons are introduced. The first part includes instructions of how feed-forward neural networks are composed and explains how they calculate the results. Separate chapter is devoted to training artificial neural networks. The chapter gives an overview of two main training algorithms – perceptron training algorithm and back-propagation algorithm. The first is designed to train perceptrons and the second is often used in training multi-layer feed-forward neural networks. The last topic explains how to construct feed-forward neural networks with software R. It includes a tutorial of how to build a neural network that calculates the square root. The tutorial will produce a neural network which takes a single input and produces a single output. Input is the number that we want square rooting and the output is the square root of the input.

Sirvi

Sirvi MMI bakalaureusetööd – Bachelor's theses. Kuni 2015 Kuupäev järgi