In this work the problem of calibrating Flush Air Data Sensing (FADS) has been addressed. The inverse problem of extracting freestream wind speed and angle of attack from pressure measurements has been solved. The aim of this work was to develop machine learning and statistical tools to optimize design and calibration of FADS systems. Experimental and Computational Fluid Dynamics (EFD and CFD) solve the forward problem of determining the pressure distribution given the wind velocity profile and bluff body geometry. In this work three ways are presented in which machine learning techniques can improve calibration of FADS systems. First, a scattered data approximation scheme, called Sequential Function Approximation (SFA) that successfully solved the current inverse problem was developed. The proposed scheme is a greedy and self-adaptive technique that constructs reliable and robust estimates without any user-interaction. Wind speed and direction prediction algorithms were developed for two FADS problems. One where pressure sensors are installed on a surface vessel and the other where sensors are installed on the Runway Assisted Landing Site (RALS) control tower. Second, a Tikhonov regularization based data-model fusion technique with SFA was developed to fuse low fidelity CFD solutions with noisy and sparse wind tunnel data. The purpose of this data model fusion approach was to obtain high fidelity, smooth and noiseless flow field solutions by using only a few discrete experimental measurements and a low fidelity numerical solution. This physics based regularization technique gave better flow field solutions compared to smoothness based solutions when wind tunnel data is sparse and incomplete. Third, a sequential design strategy was developed with SFA using Active Learning techniques from the machine learning theory and Optimal Design of Experiments from statistics for regression and classification problems. Uncertainty Sampling was used with SFA to demonstrate the effectiveness of active learning versus passive learning on a cavity flow classification problem. A sequential G-optimal design procedure was also developed with SFA for regression problems. The effectiveness of this approach was demonstrated on a simulated problem and the above mentioned FADS problem.

Surface reconstruction of anatomical structures is an integral part of medical modeling. Contour information is extracted from serial cross-sections of tissue data and is stored as "slice" files. Although there are several reasonably efficient triangulation algorithms that reconstruct surfaces from slice data, the models generated from them have a jagged or faceted appearance due to the large inter-slice distance created by the sectioning process. Moreover, inconsistencies in user input aggravate the problem. So, we created a method that reduces inter-slice distance, as well as ignores the inconsistencies in the user input. Our method called the piecewise weighted implicit functions, is based on the approach of weighting smaller implicit functions. It takes only a few slices at a time to construct the implicit function. This method is based on a technique called variational interpolation. <p> Other approaches based on variational interpolation have the disadvantage of becoming unstable when the model is quite large with more than a few thousand constraint points. Furthermore, tracing the intermediate contours becomes expensive for large models. Even though some fast fitting methods handle such instability problems, there is no apparent improvement in contour tracing time, because, the value of each data point on the contour boundary is evaluated using a single large implicit function that essentially uses all constraint points. Our method handles both these problems using a sliding window approach. As our method uses only a local domain to construct each implicit function, it achieves a considerable run-time saving over the other methods. The resulting software produces interpolated models from large data sets in a few minutes on an ordinary desktop computer.

Engineering aircraft systems is a complex task. Therefore models and computer simulations are needed to test functions and behaviors of non existing systems, reduce testing time and cost, reduce the risk involved and to detect problems early which reduce the amount of implementation errors. At the section Vehicle Simulation and Thermal Analysis at Saab Aeronautics in Linköping every basic aircraft system is designed and simulated, for example the fuel system. Currently 2-dimensional rectangular blocks are used in the simulation model to represent the fuel tanks. However, this is too simplistic to allow a more detailed analysis. The model needs to be extended with a more complex description of the tank geometry in order to get a more accurate model. This report explains the different steps in the developed methodology for combining 3-dimensional geometry models of any fuel tank created in CATIA with dynamic simulation of the fuel system in Dymola. The new 3-dimensional representation of the tank in Dymola should be able to calculate fuel surface location during simulation of a maneuvering aircraft.  The first step of the methodology is to create a solid model of the fuel contents in the tank. Then the area of validity for the model has to be specified, in this step all possible orientations of the fuel acceleration vector within the area of validity is generated. All these orientations are used in the automated volume analysis in CATIA. For each orientation CATIA splits the fuel body in a specified number of volumes and records the volume, the location of the fuel surface and the location of the center of gravity. This recorded data is then approximated with the use of radial basis functions implemented in MATLAB. In MATLAB a surrogate model is created which are then implemented in Dymola. In this way any fuel surface location and center of gravity can be calculated in an efficient way based on the orientation of the fuel acceleration vector and the amount of fuel. The new 3-dimensional tank model is simulated in Dymola and the results are compared with measures from the model in CATIA and with the results from the simulation of the old 2-dimensional tank model. The results shows that the 3-dimensional tank gives a better approximation of reality and that there is a big improvement compared with the 2-dimensional tank model. The downside is that it takes approximately 24 hours to develop this model. / Att utveckla ett nytt flygplanssystem är en väldigt komplicerad arbetsuppgift. Därför används modeller och simuleringar för att testa icke befintliga system, minska utvecklingstiden och kostnaderna, begränsa riskerna samt upptäcka problem tidigt och på så sätt minska andelen implementerade fel. Vid sektionen Vehicle Simulation and Thermal Analysis på Saab Aeronautics i Linköping designas och simuleras varje grundflygplanssystem, ett av dessa system är bränslesystemet. För närvarande används 2-dimensionella rätblock i simuleringsmodellen för att representera bränsletankarna, vilket är en väldigt grov approximation. För att kunna utföra mer detaljerade analyser behöver modellerna utökas med en bättre geometrisk beskrivning av bränsletankarna. Denna rapport går igenom de olika stegen i den framtagna metodiken för att kombinera 3- dimensionella tankmodeller skapade i CATIA med dynamisk simulering av bränslesystemet i Dymola. Den nya 3-dimensionella representationen av en tank i Dymola bör kunna beräkna bränsleytans läge under en simulering av ett manövrerande flygplan. Första steget i metodiken är att skapa en solid modell av bränslet som finns i tanken. Därefter specificeras modellens giltighetsområde och alla tänkbara riktningar hos accelerationsvektorn som påverkar bränslet genereras, dessa används sedan i den automatiserade volymanalysen i CATIA.  För varje riktning delar CATIA upp bränslemodellen i ett bestämt antal delar och registrerar volymen, bränsleytans läge samt tyngdpunktens position för varje del. Med hjälp av radiala basfunktioner som har implementerats i MATLAB approximeras dessa data och en surrogatmodell tas fram, denna implementeras sedan i Dymola. På så sätt kan bränsleytans och tyngdpunktens läge beräknas på ett effektivt sätt, baserat på riktningen hos bränslets accelerationsvektor samt mängden bränsle i tanken. Den nya 3-dimensionella tankmodellen simuleras i Dymola och resultaten jämförs med mätningar utförda i CATIA samt med resultaten från den gamla simuleringsmodellen. Resultaten visar att den 3-dimensionella tankmodellen ger en mycket bättre representation av verkligheten och att det är en stor förbättring jämfört med den 2-dimensionella representationen. Nackdelen är att det tar ungefär 24 timmar att få fram denna 3-dimensionella representation.

Surface reconstruction of anatomical structures is an integral part of medical modeling. Contour information is extracted from serial cross-sections of tissue data and is stored as "slice" files. Although there are several reasonably efficient triangulation algorithms that reconstruct surfaces from slice data, the models generated from them have a jagged or faceted appearance due to the large inter-slice distance created by the sectioning process. Moreover, inconsistencies in user input aggravate the problem. So, we created a method that reduces inter-slice distance, as well as ignores the inconsistencies in the user input. Our method called the piecewise weighted implicit functions, is based on the approach of weighting smaller implicit functions. It takes only a few slices at a time to construct the implicit function. This method is based on a technique called variational interpolation. <p> Other approaches based on variational interpolation have the disadvantage of becoming unstable when the model is quite large with more than a few thousand constraint points. Furthermore, tracing the intermediate contours becomes expensive for large models. Even though some fast fitting methods handle such instability problems, there is no apparent improvement in contour tracing time, because, the value of each data point on the contour boundary is evaluated using a single large implicit function that essentially uses all constraint points. Our method handles both these problems using a sliding window approach. As our method uses only a local domain to construct each implicit function, it achieves a considerable run-time saving over the other methods. The resulting software produces interpolated models from large data sets in a few minutes on an ordinary desktop computer.

Approximation and interpolation employing radial basis functions has found important applications since the early 1980's in areas such as signal processing, medical imaging, as well as neural networks. Several applications demand that certain physical properties be fulfilled, such as a function being divergence free. No such class of radial basis functions that reflects these physical properties was known until 1994, when Narcowich and Ward introduced a family of matrix-valued radial basis functions that are divergence free. They also obtained error bounds and stability estimates for interpolation by means of these functions. These divergence-free functions are very smooth, and have unbounded support. In this thesis we introduce a new class of matrix-valued radial basis functions that are divergence free as well as compactly supported. This leads to the possibility of applying fast solvers for inverting interpolation matrices, as these matrices are not only symmetric and positive definite, but also sparse because of this compact support. We develop error bounds and stability estimates which hold for a broad class of functions. We conclude with applications to the numerical solution of the Navier-Stokes equation for certain incompressible fluid flows.

Thesis (M. Eng.(Mechanical Engineering))--University of Pretoria, 2004. / Includes bibliographical references.

abstract: Divergence-free vector field interpolants properties are explored on uniform and scattered nodes, and also their application to fluid flow problems. These interpolants may be applied to physical problems that require the approximant to have zero divergence, such as the velocity field in the incompressible Navier-Stokes equations and the magnetic and electric fields in the Maxwell's equations. In addition, the methods studied here are meshfree, and are suitable for problems defined on complex domains, where mesh generation is computationally expensive or inaccurate, or for problems where the data is only available at scattered locations. The contributions of this work include a detailed comparison between standard and divergence-free radial basis approximations, a study of the Lebesgue constants for divergence-free approximations and their dependence on node placement, and an investigation of the flat limit of divergence-free interpolants. Finally, numerical solvers for the incompressible Navier-Stokes equations in primitive variables are implemented using discretizations based on traditional and divergence-free kernels. The numerical results are compared to reference solutions obtained with a spectral method. / Dissertation/Thesis / Doctoral Dissertation Applied Mathematics 2016

In this paper the obstacle description with Radial Basis Functions for contact problems in three dimensional elasticity will be done. A short Introduction of the idea of Radial Basis Functions will be followed by the usage of Radial Basis Functions for approximation of isosurfaces. Then these isosurfaces are used for the obstacle-description in three dimensional elasticity contact problems. In the last part some computational examples will be shown.

Distributed modal filters based on piezoelectric polymer have especially become popular in the field of active vibration control to reduce the problem of spillover. While distributed modal filters for one-dimensional structures can be found analytically based on the orthogonality between the mode shapes, the design for two-dimensional structures is not straightforward. It requires a continuous gain variation in two dimensions, which is not realizable from the current manufacturing point of view. In this thesis, a structural optimization problem is considered to approximate distributed modal sensors for two-dimensional plate structures, where the thickness is constant but the polarization can switch between positive and negative. The problem is solved through an explicit parametric level set method. In this framework, the boundary of a domain is represented implicitly by the zero isoline of a level set function. This allows simultaneous shape and topology changes. The level set function is approximated by a linear combination of Gaussian radial basis functions. As a result, the structural optimization problem can be directly posed in terms of the parameters of the approximation. This allows to apply standard optimization methods and bypasses the numerical drawbacks, such as reinitialization, velocity extension and regularization, which are associated with the numerical solution of the Hamilton-Jacobi equation in conventional methods.Since the level set method based on the shape derivative formally only allows shape but not topology transformation, the optimization problem is firstly tackled with a derivative-free optimization algorithm. It is shown that the approach is able to find approximate modal sensor designs with only few design variables. However, this approach becomes unsuitable as soon as the number of optimization variables is growing. Therefore, a sensitivity-based optimization approach is being applied, based on the parametric shape derivative which is with respect to the parameters of the radial basis functions. Although the shape derivatives does not exist at points where the topology changes, it is demonstrated that an optimization routine based on a SQP solver is able to perform topological changes during the optimization and finds optimal designs even from poor initial designs. In order to include the sensors' distribution as design variable, the parametric level set approach is extended to multiple level sets. It turns out that, despite the increased design space, optimal solutions always converge to full-material polarization designs. Numerical examples are provided for a simply supported as well as a cantilever square plate. / Doctorat en Sciences de l'ingénieur et technologie / info:eu-repo/semantics/nonPublished

Meshless methods have recently received much attention but are yet to reach their full potential as the required problem setup (i.e. collocation point distribution) is still significant and far from automated. The distribution of points still closely resembles the nodes of finite volume-type meshes and the free parameter, c, of the radial-basis expansion functions (RBF) still must be tailored specifically to a problem. The localized meshless collocation method investigated requires a local influence region, or topology, used as the expansion medium to produce the required field derivatives. Tests have shown a regular cartesian point distribution produces optimal results, however, in order to maintain a locally cartesian point distribution a recursive quadtree scheme is herein proposed. The quadtree method allows modeling of irregular geometries and refinement of regions of interest and it lends itself for full automation, thus, reducing problem setup efforts. Furthermore, the construction of the localized expansion regions is closely tied up to the point distribution process and, hence, incorporated into the automated sequence. This also allows for the optimization of the RBF free parameter on a local basis to achieve a desired level of accuracy in the expansion. In addition, an optimized auto-segmentation process is adopted to distribute and balance the problem loads throughout a parallel computational environment while minimizing communication requirements.