Search for dissertations about: "problem solving methods"
Showing result 1 - 5 of 412 swedish dissertations containing the words problem solving methods.
-
1. Numerical Methods for Wave Propagation : Analysis and Applications in Quantum Dynamics
Abstract : We study numerical methods for time-dependent partial differential equations describing wave propagation, primarily applied to problems in quantum dynamics governed by the time-dependent Schrödinger equation (TDSE). We consider both methods for spatial approximation and for time stepping. READ MORE
-
2. Chemistry: content, context and choices : towards students' higher order problem solving in upper secondary school
Abstract : Chemistry is often claimed to be difficult, irrelevant, and uninteresting to school students. Even students who enjoy doing science often have problems seeing themselves as being scientists. This thesis explores and challenges the negative perception of chemistry by investigating upper secondary students’ views on the subject. READ MORE
-
3. Solving the correspondence problem in analytical chemistry : Automated methods for alignment and quantification of multiple signals
Abstract : When applying statistical data analysis techniques to analytical chemical data, all variables must have correspondence over the samples dimension in order for the analysis to generate meaningful results. Peak shifts in NMR and chromatography destroys that correspondence and creates data matrices that have to be aligned before analysis. READ MORE
-
4. Feasible Direction Methods for Constrained Nonlinear Optimization : Suggestions for Improvements
Abstract : This thesis concerns the development of novel feasible direction type algorithms for constrained nonlinear optimization. The new algorithms are based upon enhancements of the search direction determination and the line search steps. READ MORE
-
5. Constructing Algorithms for Constraint Satisfaction and Related Problems : Methods and Applications
Abstract : In this thesis, we will discuss the construction of algorithms for solving Constraint Satisfaction Problems (CSPs), and describe two new ways of approaching them. Both approaches are based on the idea that it is sometimes faster to solve a large number of restricted problems than a single, large, problem. READ MORE