Essays about: "eigenvalue problem"
Showing result 21 - 25 of 36 essays containing the words eigenvalue problem.
-
21. Implementation of Singly Diagonally Implicit Runge-Kutta Methods with Constant Step Sizes
University essay from Lunds universitet/Matematik LTHAbstract : Runge–Kutta methods can be used for solving ordinary differential equations of the form y0 = f(t, y) with initial condition y(t0) = y0 and where f : R x R^m -> R^m. The idea is to find a method that is efficient to implement. But it is also important for the method to be of high order and be stable. READ MORE
-
22. Supersymmetry in Quantum Mechanics
University essay from Lunds universitet/Teoretisk partikelfysik - Geonomgår omorganisation; Lunds universitet/Institutionen för astronomi och teoretisk fysik - Genomgår omorganisationAbstract : This thesis gives an introduction to the basic formalism of one-dimensional supersymmetric quantum mechanics. The factorization of a Hamiltonian is used to create a supersymmetric partner Hamiltonian. READ MORE
-
23. Analysis of the Many-Body Problem in One Dimension with Repulsive Delta-Function Interaction
University essay from Uppsala universitet/Teoretisk fysikAbstract : The repulsive delta-function interaction model in one dimension is reviewed for spinless particles and for spin-1/2 fermions. The problem of solving the differential equation related to the Schrödinger equation is reduced by the Bethe ansatz to a system of algebraic equations. READ MORE
-
24. Numerical Methods for the PDES on Curves and Surfaces
University essay from Institutionen för datavetenskapAbstract : Curves and surfaces are manifolds that can be represented using implicit and parametric methods. With a representation in hand, one can define a partial differential equation on the manifold using differential tangential calculus. READ MORE
-
25. Parallel Reduction from Block Hessenberg to Hessenberg using MPI
University essay from Institutionen för datavetenskapAbstract : In many scientific applications, eigenvalues of a matrix have to be computed. By first reducing a matrix from fully dense to Hessenberg form, eigenvalue computations with the QR algorithm become more effcient. READ MORE