Sökning: "tensor product"
Visar resultat 1 - 5 av 15 uppsatser innehållade orden tensor product.
1. On quantum systems and the measurement problem
Master-uppsats, Stockholms universitet/FysikumSammanfattning : We focus on the Tensor Product Structure (TPS) of the Hilbert space and the fact that a choice in the TPS has an impact on the representation of the studied quantum system. We define the measurement problem in quantum mechanics and present some theories about quantum mechanics, each of them highlighting a different approach to quantum measurements. LÄS MER
2. Discussion of Python Implementation Techniques for Discontinuous Galerkin Methods
Kandidat-uppsats, Lunds universitet/Matematik (naturvetenskapliga fakulteten); Lunds universitet/MatematikcentrumSammanfattning : This paper discusses implementation techniques for integration methods within the Discontinuous Galerkin Methods. These methods are used to approximate solutions for differential equations. To do so, one must compute a polynomial, which is an approximation of the used function. LÄS MER
3. A Hierarchical Tucker Solver for the Vlasov-Maxwell System
Master-uppsats, Uppsala universitet/Institutionen för informationsteknologiSammanfattning : The Vlasov-Maxwell equations is a common model to describe the behavior of a plasma, but come at the cost of their dimensionality since both spatial and veloocity data is stored in three dimensions. This causes a significant obstacle to be able solve them numerically since the size of the data is N^6, which yields a data size of 8. LÄS MER
4. Designing Effective Derivative Line Filters: Utilizing convolution to extract extra information
Master-uppsats, KTH/Matematik (Avd.)Sammanfattning : The ability to generate accurate approximations of derivatives holds significant importance in numerous scientific fields, including chemistry, economics and fluid mechanics. This thesis is centred around extracting hidden information in data using Smoothness-Increasing Accuracy-Conserving (SIAC) filters. LÄS MER
5. Tensor rank and support rank in the context of algebraic complexity theory
Master-uppsats, KTH/Matematik (Avd.)Sammanfattning : Starting with the work of Volker Strassen, algorithms for matrix multiplication have been developed which are time complexity-wise more efficient than the standard algorithm from the definition of multiplication. The general method of the developments has been viewing the bilinear mapping that matrix multiplication is as a three-dimensional tensor, where there is an exact correspondence between time complexity of the multiplication algorithm and tensor rank. LÄS MER