Sökning: "sparse matrices"
Visar resultat 16 - 20 av 30 avhandlingar innehållade orden sparse matrices.
16. Efficient and Reliable Simulation of Quantum Molecular Dynamics
Sammanfattning : The time-dependent Schrödinger equation (TDSE) models the quantum nature of molecular processes. Numerical simulations based on the TDSE help in understanding and predicting the outcome of chemical reactions. LÄS MER
17. Efficient Density Matrix Methods for Large Scale Electronic Structure Calculations
Sammanfattning : Efficient and accurate methods for computing the density matrix are necessary to be able to perform large scale electronic structure calculations. For sufficiently sparse matrices, the computational cost of recursive polynomial expansions to construct the density matrix scales linearly with increasing system size. LÄS MER
18. Matrix Algebra for Quantum Chemistry
Sammanfattning : This thesis concerns methods of reduced complexity for electronic structure calculations. When quantum chemistry methods are applied to large systems, it is important to optimally use computer resources and only store data and perform operations that contribute to the overall accuracy. LÄS MER
19. Global radial basis function collocation methods for PDEs
Sammanfattning : Radial basis function (RBF) methods are meshfree, i.e., they can operate on unstructured node sets. Because the only geometric information required is the pairwise distance between the node points, these methods are highly flexible with respect to the geometry of the computational domain. LÄS MER
20. Network models with applications to genomic data: generalization, validation and uncertainty assessment
Sammanfattning : The aim of this thesis is to provide a framework for the estimation and analysis of transcription networks in human cancer. The methods we develop are applied to data collected by The Cancer Genome Atlas (TCGA) and supporting simulations are based on derived models in order to reflect real data structure. LÄS MER