Sökning: "Computational geometry"
Visar resultat 36 - 40 av 283 avhandlingar innehållade orden Computational geometry.
36. High Order Local Radial Basis Function Methods for Atmospheric Flow Simulations
Sammanfattning : Since the introduction of modern computers, numerical methods for atmospheric simulations have routinely been applied for weather prediction, and in the last fifty years, there has been a steady improvement in the accuracy of forecasts. Accurate numerical models of the atmosphere are also becoming more important as researchers rely on global climate simulations to assess and understand the impact of global warming. LÄS MER
37. Detached Eddy Simulation for Aerospace Applications
Sammanfattning : With the continuous growth in air traffic that we see nowadays, comes an increase in the requirements needed to be satisfied in order to certify an aircraft for operation. These stricter regulations affect aspects such as CO2 emissions, sound pollution and so on, pushing manufacturers to aim for lighter, more efficient, more robust designs. LÄS MER
38. Domain Decomposition and Preconditioned Iterative Methods for the Helmholtz Equation
Sammanfattning : New preconditioned iterative solution methods for the Helmholtz equation are constructed. To evaluate the performance of the methods, two-dimensional problems with a waveguide geometry are used as model problems. Second- and fourth-order accurate finite difference discretizations are used. LÄS MER
39. Design and Detailed Analysis of Turbomachinery Blades using Truncated Domains
Sammanfattning : With the continuous growth in air traffic that we are seeing nowadays comes an increase in the requirements needed to be satisfied by an aircraft for it to be certified to fly. These stricter regulations affect aspects such as CO2 emissions, sound pollution and so on, pushing manufacturers to aim for lighter, more efficient, more robust designs. LÄS MER
40. 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