Sökning: "stopping rules"

Hittade 5 avhandlingar innehållade orden stopping rules.

  1. 1. The Use of Landweber Algorithm in Image Reconstruction

    Författare :Touraj Nikazad; Tommy Elfving; George Baravdish; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; convex feasibility; projection methods; simultaneous algorithms; iterative methods; stopping rules; semi-convergence; Numerical analysis; Numerisk analys;

    Sammanfattning : 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. LÄS MER

  3. 2. Algebraic Reconstruction Methods

    Författare :Touraj Nikazad; Tommy Elfving; Constantin Popa; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; iterative methods; image reconstruction; ART; Cimmino; Kaczmarz; Landweber; sequential iteration; simultaneous iteration; block iteration; semi-convergence; relaxation parameters; stopping rules; discrepancy principle; Numerical analysis; Numerisk analys;

    Sammanfattning : 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 modeled using the Radon transform. After expanding the solution into a finite series of basis functions a large, sparse and ill-conditioned linear system occurs. LÄS MER

  4. 3. Reconstruction of flow and temperature from boundary data

    Författare :Tomas Johansson; Vladimir Kozlov; George Bastay (Baravdish); Jürgen Rossmann; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Partiella differentialekvationer; Operatorteori;

    Sammanfattning : In this thesis, we study Cauchy problems for elliptic and parabolic equations. These include the stationary Stokes system and the heat equation. Data are given on a part of the boundary of a bounded domain. The aim is to reconstruct the solution from these data. LÄS MER

  5. 4. Bidragsbedrägeri

    Författare :Helén Örnemark Hansen; Juridiska institutionen; []
    Nyckelord :SAMHÄLLSVETENSKAP; SOCIAL SCIENCES; criminal law; fraud; allowance fraud; Swedish penal code 9:1; social welfare; straffrätt; criminal policy; criminal proceedings; socialrätt;

    Sammanfattning : This thesis treats allowance fraud. Very probably, allowance fraud is frequent and the authorities have difficulty in stopping it. For that reason, it is important to study the area of allowance fraud. LÄS MER

  7. 5. Subspace Computations via Matrix Decompositions and Geometric Optimization

    Författare :Lennart Simonsson; Axel Ruhe; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Mathematics; Numerical Analysis; Rank-revealing UTV; Jacobi-Davidson algorithm; Decomposition; Grassmann type algorithms; Numerical analysis; Numerisk analys;

    Sammanfattning : This thesis is concerned with the computation of certain subspaces connected to a given matrix, where the closely related problem of approximating the matrix with one of lower rank is given special attention. To determine the rank and obtain bases for fundamental subspaces such as the range and null space of a matrix, computing the singular value decomposition (SVD) is the standard method. LÄS MER