Sökning: "numerical analysis"
Visar resultat 26 - 30 av 1416 avhandlingar innehållade orden numerical analysis.
26. Algebraic Dynamical Systems, Analytical Results and Numerical Simulations
Sammanfattning : In this thesis we study discrete dynamical system, given by a polynomial, over both finite extension of the fields of p-adic numbers and over finite fields. Especially in the p-adic case, we study fixed points of dynamical systems, and which elements that are attracted to them. We show with different examples how complex these dynamics are. LÄS MER
27. Development of a Methodology for Dynamic Testing of Rock Support : Field Tests and Numerical Analysis
Sammanfattning : The increasing mining depth in the Luossavaara-Kiirunavaara Aktiebolag (LKAB) mine located in the northern part of Sweden leads to higher stress magnitudes, resulting in increased seismic activity and more seismically-induced damage. The effectiveness of various ground support systems under dynamic loading conditions has therefore become of prime interest to LKAB for successful and safe mining at deep levels. LÄS MER
28. Excavation in moraine and dense non-cohesive soil : Numerical analysis of soil behavior
Sammanfattning : Excavation and moving of soil are common civil work tasks connected to the construction of buildings, roads and railways. In construction projects large amounts of soil have to be handled with different machines, tools and working methods. Soils are more or less difficult to excavate depending on their properties. LÄS MER
29. Object-Oriented Declarative Program Analysis
Sammanfattning : This thesis deals with techniques for raising the programming level for a particular kind of computations, namely those on abstract syntax trees. Such computations are central in many program analysis tools, such as compilers, smart language-sensitive editors, and static analysis tools. LÄS MER
30. Numerical Computations with Fundamental Solutions
Sammanfattning : Two solution strategies for large, sparse, and structured algebraic systems of equations are considered. The first strategy is to construct efficient preconditioners for iterative solvers. The second is to reduce the sparse algebraic system to a smaller, dense system of equations, which are called the boundary summation equations. LÄS MER