• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 118
  • 16
  • Tagged with
  • 134
  • 115
  • 86
  • 83
  • 25
  • 18
  • 16
  • 16
  • 14
  • 14
  • 12
  • 11
  • 11
  • 11
  • 10
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
41

Algorithms for a Partially Regularized Least Squares Problem

Skoglund, Ingegerd January 2007 (has links)
Vid analys av vattenprover tagna från t.ex. ett vattendrag betäms halten av olika ämnen. Dessa halter är ofta beroende av vattenföringen. Det är av intresse att ta reda på om observerade förändringar i halterna beror på naturliga variationer eller är orsakade av andra faktorer. För att undersöka detta har föreslagits en statistisk tidsseriemodell som innehåller okända parametrar. Modellen anpassas till uppmätta data vilket leder till ett underbestämt ekvationssystem. I avhandlingen studeras bl.a. olika sätt att säkerställa en unik och rimlig lösning. Grundidén är att införa vissa tilläggsvillkor på de sökta parametrarna. I den studerade modellen kan man t.ex. kräva att vissa parametrar inte varierar kraftigt med tiden men tillåter årstidsvariationer. Det görs genom att dessa parametrar i modellen regulariseras. Detta ger upphov till ett minsta kvadratproblem med en eller två regulariseringsparametrar. I och med att inte alla ingående parametrar regulariseras får vi dessutom ett partiellt regulariserat minsta kvadratproblem. I allmänhet känner man inte värden på regulariseringsparametrarna utan problemet kan behöva lösas med flera olika värden på dessa för att få en rimlig lösning. I avhandlingen studeras hur detta problem kan lösas numeriskt med i huvudsak två olika metoder, en iterativ och en direkt metod. Dessutom studeras några sätt att bestämma lämpliga värden på regulariseringsparametrarna. I en iterativ lösningsmetod förbättras stegvis en given begynnelseapproximation tills ett lämpligt valt stoppkriterium blir uppfyllt. Vi använder här konjugerade gradientmetoden med speciellt konstruerade prekonditionerare. Antalet iterationer som krävs för att lösa problemet utan prekonditionering och med prekonditionering jämförs både teoretiskt och praktiskt. Metoden undersöks här endast med samma värde på de två regulariseringsparametrarna. I den direkta metoden används QR-faktorisering för att lösa minsta kvadratproblemet. Idén är att först utföra de beräkningar som kan göras oberoende av regulariseringsparametrarna samtidigt som hänsyn tas till problemets speciella struktur. För att bestämma värden på regulariseringsparametrarna generaliseras Reinsch’s etod till fallet med två parametrar. Även generaliserad korsvalidering och en mindre beräkningstung Monte Carlo-metod undersöks. / Statistical analysis of data from rivers deals with time series which are dependent, e.g., on climatic and seasonal factors. For example, it is a well-known fact that the load of substances in rivers can be strongly dependent on the runoff. It is of interest to find out whether observed changes in riverine loads are due only to natural variation or caused by other factors. Semi-parametric models have been proposed for estimation of time-varying linear relationships between runoff and riverine loads of substances. The aim of this work is to study some numerical methods for solving the linear least squares problem which arises. The model gives a linear system of the form A1x1 + A2x2 + n = b1. The vector n consists of identically distributed random variables all with mean zero. The unknowns, x, are split into two groups, x1 and x2. In this model, usually there are more unknowns than observations and the resulting linear system is most often consistent having an infinite number of solutions. Hence some constraint on the parameter vector x is needed. One possibility is to avoid rapid variation in, e.g., the parameters x2. This can be accomplished by regularizing using a matrix A3, which is a discretization of some norm. The problem is formulated as a partially regularized least squares problem with one or two regularization parameters. The parameter x2 has here a two-dimensional structure. By using two different regularization parameters it is possible to regularize separately in each dimension. We first study (for the case of one parameter only) the conjugate gradient method for solution of the problem. To improve rate of convergence blockpreconditioners of Schur complement type are suggested, analyzed and tested. Also a direct solution method based on QR decomposition is studied. The idea is to first perform operations independent of the values of the regularization parameters. Here we utilize the special block-structure of the problem. We further discuss the choice of regularization parameters and generalize in particular Reinsch’s method to the case with two parameters. Finally the cross-validation technique is treated. Here also a Monte Carlo method is used by which an approximation to the generalized cross-validation function can be computed efficiently.
42

The Use of Landweber Algorithm in Image Reconstruction

Nikazad, Touraj January 2007 (has links)
Ill-posed sets of linear equations typically arise when discretizing certain types of integral transforms. A well known example is image reconstruction, which can be modelled using the Radon transform. After expanding the solution into a finite series of basis functions a large, sparse and ill-conditioned linear system arises. We consider the solution of such systems. In particular we study a new class of iteration methods named DROP (for Diagonal Relaxed Orthogonal Projections) constructed for solving both linear equations and linear inequalities. This class can also be viewed, when applied to linear equations, as a generalized Landweber iteration. The method is compared with other iteration methods using test data from a medical application and from electron microscopy. Our theoretical analysis include convergence proofs of the fully-simultaneous DROP algorithm for linear equations without consistency assumptions, and of block-iterative algorithms both for linear equations and linear inequalities, for the consistent case. When applying an iterative solver to an ill-posed set of linear equations the error typically initially decreases but after some iterations (depending on the amount of noise in the data, and the degree of ill-posedness) it starts to increase. This phenomena is called semi-convergence. It is therefore vital to find good stopping rules for the iteration. We describe a class of stopping rules for Landweber type iterations for solving linear inverse problems. The class includes, e.g., the well known discrepancy principle, and also the monotone error rule. We also unify the error analysis of these two methods. The stopping rules depend critically on a certain parameter whose value needs to be specified. A training procedure is therefore introduced for securing robustness. The advantages of using trained rules are demonstrated on examples taken from image reconstruction from projections. / Vi betraktar lösning av sådana linjära ekvationssystem som uppkommer vid diskretisering av inversa problem. Dessa problem karakteriseras av att den sökta informationen inte direkt kan mätas. Ett välkänt exempel utgör datortomografi. Där mäts hur mycket strålning som passerar genom ett föremål som belyses av en strålningskälla vilken intar olika vinklar i förhållande till objektet. Syftet är förstås att generera bilder av föremålets inre (i medicinska tillämpngar av det inre av kroppen). Vi studerar en klass av iterativa lösningsmetoder för lösning av ekvationssystemen. Metoderna tillämpas på testdata från bildrekonstruktion och jämförs med andra föreslagna iterationsmetoder. Vi gör även en konvergensanalys för olika val av metod-parametrar. När man använder en iterativ metod startar man med en begynnelse approximation som sedan gradvis förbättras. Emellertid är inversa problem känsliga även för relativt små fel i uppmätta data. Detta visar sig i att iterationerna först förbättras för att senare försämras. Detta fenomen, s.k. ’semi-convergence’ är väl känt och förklarat. Emellertid innebär detta att det är viktigt att konstruera goda stoppregler. Om man avbryter iterationen för tidigt fås dålig upplösning och om den avbryts för sent fås en oskarp och brusig bild. I avhandligen studeras en klass av stoppregler. Dessa analyseras teoretiskt och testas på mätdata. Speciellt föreslås en inlärningsförfarande där stoppregeln presenteras med data där det korrekra värdet på stopp-indexet är känt. Dessa data används för att bestämma en viktig parameter i regeln. Sedan används regeln för nya okända data. En sådan tränad stoppregel visar sig fungera väl på testdata från bildrekonstruktionsområdet.
43

Approximations of Integral Equations for WaveScattering

Atle, Andreas January 2006 (has links)
Wave scattering is the phenomenon in which a wave field interacts with physical objects. An incoming wave is scattered at the surface of the object and a scattered wave is produced. Common practical cases are acoustic, electromagnetic and elastic wave scattering. The numerical simulation of the scattering process is important, for example, in noise control, antenna design, prediction of radar cross sections and nondestructive testing. Important classes of numerical methods for accurate simulation of scattering are based on integral representations of the wave fields and theses representations require the knowledge of potentials on the surfaces of the scattering objects. The potential is typically computed by a numerical approximation of an integral equation that is defined on the surface. We first develop such numerical methods in time domain for the scalar wave equation. The efficiency of the techniques are improved by analytic quadrature and in some cases by local approximation of the potential. Most scattering simulations are done for harmonic or single frequency waves. In the electromagnetic case the corresponding integral equation method is called the method of moments. This numerical approximation is computationally very costly for high frequency waves. A simplification is suggested by physical optics, which directly gives an approximation of the potential without the solution of an integral equation. Physical optics is however only accurate for very high frequencies. In this thesis we improve the accuracy in the physical optics approximation of scalar waves by basing the computation of the potential on the theory of radiation boundary conditions. This theory describes the local coupling of derivatives in the wave field and if it is applied at the surface of the scattering object it generates an expression for the unknown potential. The full wave field is then computed as for other integral equation methods. The new numerical techniques are analyzed mathematically and their efficiency is established in a sequence of numerical experiments. The new on surface radiation conditions give, for example, substantial improvement in the estimation of the scattered waves in the acoustic case. This numerical experiment corresponds to radar cross-section estimation in the electromagnetic case.
44

Exponential Fitting, Finite Volume and Box Methods in Option Pricing.

Shcherbakov, Dmitry, Szwaczkiewicz, Sylwia January 2010 (has links)
In this thesis we focus mainly on special finite differences and finite volume methods and apply them to the pricing of barrier options.The structure of this work is the following: in Chapter 1 we introduce the definitions of options and illustrate some properties of vanilla European options and exotic options.Chapter 2 describes a classical model used in the financial world, the  Black-Scholes model. We derive theBlack-Scholes formula and show how stochastic differential equations model financial instruments prices.The aim of this chapter is also to present the initial boundary value problem and the maximum principle.We discuss boundary conditions such as: the first boundary value problem, also called  Dirichlet problem that occur in pricing ofbarrier options and European options. Some kinds of put options lead to the study of a second boundary value problem (Neumann, Robin problem),while the Cauchy problem is associated with one-factor European and American options.Chapter 3 is about finite differences methods such as theta, explicit, implicit and Crank-Nicolson method, which are used forsolving partial differential equations.The exponentially fitted scheme is presented in Chapter 4. It is one of the new classesof a robust difference scheme that is stable, has good convergence and does not produce spurious oscillations.The stability is also advantage of the box method that is presented in Chapter 5.In the beginning of the Chapter 6 we illustrate barrier options and then we consider a novel finite volume discretization for apricing the above options.Chapter 7 describes discretization of the Black-Scholes equation by the fitted finite volume scheme. In  Chapter 8 we present and describe numerical results obtained by using  the finite difference methods illustrated in the previous chapters.
45

Operator Splitting Methods and Artificial Boundary Conditions for a nonlinear       Black-Scholes equation

Uhliarik, Marek January 2010 (has links)
There are some nonlinear models for pricing financial derivatives which can improve the linear Black-Scholes model introduced by Black, Scholes and Merton. In these models volatility is not constant anymore, but depends on some extra variables. It can be, for example, transaction costs, a risk from a portfolio, preferences of a large trader, etc. In this thesis we focus on these models. In the first chapter we introduce some important theory of financial derivatives. The second chapter is devoted to the volatility models. We derive three models concerning transaction costs (RAPM, Leland's  and Barles-Soner's model) and Frey's model which assumes a large (dominant) trader on the market. In the third and in the forth chapter we derive portfolio and make numerical experiments with a free boundary. We use the first order additive and the second order Strang splitting methods. We also use approximations of Barles-Soner's model using the identity function and introduce an approximation with the logarithm function of Barles-Soner's model. These models we finally compare with models where the volatility includes constant transaction costs.
46

Numerical Methods for Pricing Swing Options in the Electricity Market

Guo, Matilda, Lapenkova, Maria January 2010 (has links)
Since the liberalisation of the energy market in Europe in the early 1990s, much opportunity to trade electricity as a commodity has arisen. One significant consequence of this movement is that market prices have become more volatile instead of its tradition constant rate of supply. Spot price markets have also been introduced, affecting the demand of electricity as companies now have the option to not only produce their own supply but also purchase this commodity from the market. Following the liberalisation of the energy market, hence creating a greater demand for trading of electricity and other types of energy, various types of options related to the sales, storage and transmission of electricity have consequently been introduced. Particularly, swing options are popular in the electricity market. As we know, swing-type derivatives are given in various forms and are mainly traded as over-the-counter (OTC) contracts at energy exchanges. These options offer flexibility with respect to timing and quantity. Traditionally, the Geometric Brownian Motion (GBM) model is a very popular and standard approach for modelling the risk neutral price dynamics of underlyings. However, a limitation of this model is that it has very few degrees of freedom, as it does not capture the complex behaviour of electricity prices. In short the GBM model is inefficient in the pricing of options involving electricity. Other models have subsequently been used to bridge this inadequacy, e.g. spot price models, futures price models, etc. To model risk-neutral commodity prices, there are basically two different methodologies, namely spot and futures or so-called term structure models. As swing options are usually written on spot prices, by which we mean the current price at which a particular commodity can be bought or sold at a specified time and place, it is important for us to examine these models in order to more accurately inculcate their effect on the pricing of swing options. Monte Carlo simulation is also a widely used approach for the pricing of swing options in the electricity market. Theoretically, Monte Carlo valuation relies on risk neutral valuation and the technique used is to simulate as many (random) price paths of the underlying(s) as possible, and then to average the calculated payoff for each path, discounted to today's prices, giving the value of the desired derivative. Monte Carlo methods are particularly useful in the valuation of derivatives with multiple sources of uncertainty or complicated features, like our electricity swing options in question. However, they are generally too slow to be considered a competitive form of valuation, if any analytical techniques of valuation exist. In other words, the Monte Carlo approach is, in a sense, a method of last resort. In this thesis, we aim to examine a numerical method involved in the pricing of swing options in the electricity market. We will consider an existing and widely accepted electricity price process model, use the finite volume method to formulate a numerical scheme in order to calibrate the prices of swing options and make a comparison with numerical solutions obtained using the theta-scheme. Further contributions of this thesis include a comparison of results and also a brief discussion of other possible methods.
47

Finite Element Analysis of a Washing Machine Cylinder

Gundeboina, Saidulu January 2010 (has links)
In this thesis a finite element model of a household washing machine cylinder is built and analysed in ABAQUS 6.9-2. The aim is to help Asko appliances in conducting similar analysis for future manufacturing of high capacity cylinders by reducing experimentation. The analysis is mainly concerned with an evenly distributed load at a constant angular velocity. The load is applied with the help of lead plates instead of clothes. The cylinder is loaded with three thin (2 mm) lead plates weighing 2 kg each. The plates with dimensional 370x240x2 mm are mounted with one strip of double sided foam tape inside the cylinder. To estimate the behavior of the cylinder the strains are measured when the cylinder is rotating at 1620 and 2200 revolution per minute (rpm). To validate the model the numerical analyses are compared with experimental results. The results clearly show that the numerical strain values fit with experimental strain values.
48

Operator Splitting Techniques for American Type of Floating Strike Asian Option

Takac, Michal January 2011 (has links)
In this thesis we investigate Asian oating strike options. We particu-larly focus on options with early exercise - American options. This typeof options are very lucrative to the end-users of commodities or ener-gies who are tend to be exposed to the average prices over time. Asianoptions are also very popular with corporations, who have ongoing cur-rency exposures. The main idea of the pricing is to examine the freeboundary position on which the value of the option is depending. Wefocus on developing a ecient numerical algorithm for this boundary.In the rst Chapter we give an informative description of the nancialderivatives including Asian options. The second Chapter is devoted tothe analytical derivation of the corresponding partial dierential equa-tion coming from the original Black - Scholes equation. The problemis simplied using transformation methods and dimension reduction. Inthe third and fourth Chapter we describe important numerical methodsand discretize the problem. We use the rst order Lie splitting and thesecond order Strang splitting. Finally, in the fth Chapter we makenumerical experiments with the free boundary and compare the resultwith other known methods.
49

Stable Numerical Methods for PDE Models of Asian Options

Rehurek, Adam January 2011 (has links)
Asian options are exotic financial derivative products which price must be calculated by numerical evaluation. In this thesis, we study certain ways of solving partial differential equations, which are associated with these derivatives. Since standard numerical techniques for Asian options are often incorrect and impractical, we discuss their variations, which are efficiently applicable for handling frequent numerical instabilities reflected in form of oscillatory solutions. We will show that this crucial problem can be treated and eliminated by adopting flux limiting techniques, which are total variation dimishing.
50

Meshfree methods in option pricing

Belova, Anna, Shmidt, Tamara January 2011 (has links)
A meshfree approximation scheme based on the radial basis function methods is presented for the numerical solution of the options pricing model. This thesis deals with the valuation of the European, Barrier, Asian, American options of a single asset and American options of multi assets. The option prices are modeled by the Black-Scholes equation. The θ-method is used to discretize the equation with respect to time. By the next step, the option price is approximated in space with radial basis functions (RBF) with unknown parameters, in particular, we con- sider multiquadric radial basis functions (MQ-RBF). In case of Ameri- can options a penalty method is used, i.e. removing the free boundary is achieved by adding a small and continuous penalty term to the Black- Scholes equation. Finally, a comparison of analytical and finite difference solutions and numerical results from the literature is included.

Page generated in 0.0333 seconds