• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • 1
  • Tagged with
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Efficient Algorithms for Future Aircraft Design: Contributions to Aerodynamic Shape Optimization

Hicken, Jason 24 September 2009 (has links)
Advances in numerical optimization have raised the possibility that efficient and novel aircraft configurations may be ``discovered'' by an algorithm. To begin exploring this possibility, a fast and robust set of tools for aerodynamic shape optimization is developed. Parameterization and mesh-movement are integrated to accommodate large changes in the geometry. This integrated approach uses a coarse B-spline control grid to represent the geometry and move the computational mesh; consequently, the mesh-movement algorithm is two to three orders faster than a node-based linear elasticity approach, without compromising mesh quality. Aerodynamic analysis is performed using a flow solver for the Euler equations. The governing equations are discretized using summation-by-parts finite-difference operators and simultaneous approximation terms, which permit nonsmooth mesh continuity at block interfaces. The discretization results in a set of nonlinear algebraic equations, which are solved using an efficient parallel Newton-Krylov-Schur strategy. A gradient-based optimization algorithm is adopted. The gradient is evaluated using adjoint variables for the flow and mesh equations in a sequential approach. The flow adjoint equations are solved using a novel variant of the Krylov solver GCROT. This variant of GCROT is flexible to take advantage of non-stationary preconditioners and is shown to outperform restarted flexible GMRES. The aerodynamic optimizer is applied to several studies of induced-drag minimization. An elliptical lift distribution is recovered by varying spanwise twist, thereby validating the algorithm. Planform optimization based on the Euler equations produces a nonelliptical lift distribution, in contrast with the predictions of lifting-line theory. A study of spanwise vertical shape optimization confirms that a winglet-up configuration is more efficient than a winglet-down configuration. A split-tip geometry is used to explore nonlinear wake-wing interactions: the optimized split-tip demonstrates a significant reduction in induced drag relative to a single-tip wing. Finally, the optimal spanwise loading for a box-wing configuration is investigated.
2

Efficient Algorithms for Future Aircraft Design: Contributions to Aerodynamic Shape Optimization

Hicken, Jason 24 September 2009 (has links)
Advances in numerical optimization have raised the possibility that efficient and novel aircraft configurations may be ``discovered'' by an algorithm. To begin exploring this possibility, a fast and robust set of tools for aerodynamic shape optimization is developed. Parameterization and mesh-movement are integrated to accommodate large changes in the geometry. This integrated approach uses a coarse B-spline control grid to represent the geometry and move the computational mesh; consequently, the mesh-movement algorithm is two to three orders faster than a node-based linear elasticity approach, without compromising mesh quality. Aerodynamic analysis is performed using a flow solver for the Euler equations. The governing equations are discretized using summation-by-parts finite-difference operators and simultaneous approximation terms, which permit nonsmooth mesh continuity at block interfaces. The discretization results in a set of nonlinear algebraic equations, which are solved using an efficient parallel Newton-Krylov-Schur strategy. A gradient-based optimization algorithm is adopted. The gradient is evaluated using adjoint variables for the flow and mesh equations in a sequential approach. The flow adjoint equations are solved using a novel variant of the Krylov solver GCROT. This variant of GCROT is flexible to take advantage of non-stationary preconditioners and is shown to outperform restarted flexible GMRES. The aerodynamic optimizer is applied to several studies of induced-drag minimization. An elliptical lift distribution is recovered by varying spanwise twist, thereby validating the algorithm. Planform optimization based on the Euler equations produces a nonelliptical lift distribution, in contrast with the predictions of lifting-line theory. A study of spanwise vertical shape optimization confirms that a winglet-up configuration is more efficient than a winglet-down configuration. A split-tip geometry is used to explore nonlinear wake-wing interactions: the optimized split-tip demonstrates a significant reduction in induced drag relative to a single-tip wing. Finally, the optimal spanwise loading for a box-wing configuration is investigated.
3

Summation By Parts Finite Difference Methods with Simultaneous Approximation Terms for the Heat Equation with Discontinuous Coefficients

Kåhlman, Niklas January 2019 (has links)
In this thesis we will investigate how the SBP-SAT finite difference method behave with and without an interface. As model problem, we consider the heat equation with piecewise constant coefficients. The thesis is split in two main parts. In the first part we look at the heat equation in one-dimension, and in the second part we expand the problem to a two-dimensional domain. We show how the SAT-parameters are chosen such that the scheme is dual consistent and stable. Then, we perform numerical experiments, now looking at the static case. In the one-dimensional case we see that the second order SBP-SAT method with an interface converge with an order of two, while the second order SBP-SAT method without an interface converge with an order of one.

Page generated in 0.1659 seconds