Sökning: "square matrix"
Visar resultat 1 - 5 av 47 uppsatser innehållade orden square matrix.
1. Grönare gata på 25 kvadrat : en studie av utmaningar och möjligheter med biodiversitetsfrämjande parklets i urban miljö
Master-uppsats, SLU/Dept. of Landscape Architecture, Planning and Management (from 130101)Sammanfattning : Idag lever nästan 90% av Sveriges befolkning sina liv i urbana miljöer. Eftersom expansionen i många städer blivit begränsad riktas i stället blickarna mot den täta staden som lösning på problemet. Men med förtätning följer också många utmaningar. LÄS MER
2. Improved Statistical Methods for Elliptic Stochastic Homogenization Problems : Application of Multi Level- and Multi Index Monte Carlo on Elliptic Stochastic Homogenization Problems
Kandidat-uppsats, Uppsala universitet/Tillämpad beräkningsvetenskapSammanfattning : In numerical multiscale methods, one relies on a coupling between macroscopic model and a microscopic model. The macroscopic model does not include the microscopic properties that the microscopic model offers and that are vital for the desired solution. LÄS MER
3. Acoustic Characterization of Catalyst
Kandidat-uppsats, KTH/Skolan för teknikvetenskap (SCI)Sammanfattning : The WHO has set a sound level threshold of 55 dB, beyond which noise is considered harmful to humans when exposed for an extended period of time. It is, however, estimated by the European Environmental Agency that over 110 million people in the EU are regularly exposed to levels of traffic noise above 55 dB. LÄS MER
4. Perron–Frobenius theorem and Z≥0[S3]-semimodules
Master-uppsats, Uppsala universitet/Algebra, logik och representationsteoriSammanfattning : In this thesis, the Perron–Frobenius theorem which in its most general formstates that the spectral radius of a non-negative real square matrix is an eigenvaluewith a non-negative eigenvector, is proven. Related properties arederived, in particular the Collatz–Wielandt formula and a general form of anon-negative idempotent matrices. LÄS MER
5. Adapting Marching Squares to operate on sparse matrices
Kandidat-uppsats, Umeå universitet/Institutionen för datavetenskapSammanfattning : Marching Squares is an algorithm that iterates over a given matrix filled with data points and outputs lines depending on the values in the grid. The algorithm iterates over the matrix four data points at a time in the shape of a square, hence its name. LÄS MER