Essays about: "numerical linear algebra"
Showing result 1 - 5 of 13 essays containing the words numerical linear algebra.
-
1. Randomized Diagonal Estimation
University essay from KTH/Matematik (Avd.)Abstract : Implicit diagonal estimation is a long-standing problem that is concerned with approximating the diagonal of a matrix that can only be accessed through matrix-vector products. It is of interest in various fields of application, such as network science, material science and machine learning. READ MORE
-
2. A review of the Kaczmarz method
University essay from Lunds universitet/Matematikcentrum; Lunds universitet/Matematik (naturvetenskapliga fakulteten)Abstract : The Kaczmarz method is an iterative method for solving linear systems of equations. The Kaczmarz method has been around since it was developed by Kaczmarz 1937. The main idea behind the original Kaczmarz method is to orthogonally project the previous x_k onto the solution space given by a row of the system. READ MORE
-
3. Zero Spectrum Subalgebras of K[x] Described by Higher Derivatives
University essay from Lunds universitet/Matematik LTHAbstract : Unital subalgebras of finite codimension in the polynomial ring $\mathbb{K}[x]$ are described by a finite number of so called subalgebra conditions over a finite set in $\mathbb{K}$ named the subalgebra spectrum. Restricting attention to subalgebras whose spectrum is the singleton $\{0\}$ reveals a rather well behaved class of subalgebras, called almost monomial from the fact that these contain an ideal consisting of all monomials above a certain degree. READ MORE
-
4. A Relation Between Anderson Acceleration and GMRES
University essay from Lunds universitet/MatematikcentrumAbstract : A very common type of problem within mathematics and numerical analysis are fixed-point problems, which can arise as sub-problems of optimization methods, differential equations solvers and much more. The most basic iterative approach for fixed-point problems is fixed-point iteration, special cases of which actually date back as far as the Babylonians, where it was used to to find the square roots of positive numbers. READ MORE
-
5. Convergence Rate of the Dirichlet-Neumann Algorithm for Coupled Poisson Equations
University essay from Lunds universitet/Matematik LTHAbstract : This thesis presents and tests the convergence rate of the Dirichlet-Neumann algorithm for two Poisson equations coupled by transmission boundary conditions. Three second order discretisation methods are used when analyzing the convergence: standard equidistant finite difference, standard adaptive linear finite element, and standard adaptive finite volume discretisation of Poisson's equation. READ MORE
