Radial basis function (RBF) methods for partial differential equations (PDEs), either in bulk domains, on surfaces, or in a combination of the formers, arise in a wide range of practical applications. This thesis proposes numerical approaches of RBF-based meshless techniques to solve these three kinds of PDEs on stationary and nonstationary surfaces and domains. In Chapter 1, we introduce the background of RBF methods, some basic concepts, and error estimates for RBF interpolation. We then provide some preliminaries for manifolds, restricted RBFs on manifolds, and some convergence properties of RBF interpolation. Finally, implicit-explicit time stepping schemes are briefly presented. In Chapter 2, we propose methods to implement meshless collocation approaches intrinsically to solve elliptic PDEs on smooth, closed, connected, and complete Riemannian manifolds with arbitrary codimensions. Our methods are based on strong-form collocations with oversampling and least-squares minimizations, which can be implemented either analytically or approximately. By restricting global kernels to the manifold, our methods resemble their easy-to-implement domain-type analogies, that is, Kansa methods. Our main theoretical contribution is a robust convergence analysis under some standard smoothness assumptions for high-order convergence. We simulate reaction-diffusion equations to generate Turing patterns and solve shallow water problems on manifolds. In Chapter 3, we consider convective-diffusion problems that model surfactants or heat transport along moving surfaces. We propose two time-space algorithms by combining the methods of lines and kernel-based meshless collocation techniques intrinsic to surfaces. We use a low-order time discretization for fair comparison, and higher-order schemes in time are possible. The proposed methods can achieve second-order convergence. They use either analytic or approximated spatial discretization of the surface operators, which do not require regeneration of point clouds at each temporal iteration. Thus, they are alternatively applied to handle models on two types of evolving surfaces, which are defined as prescribed motions and governed by geometric evolution laws, respectively. We present numerical examples on various evolving surfaces for the performance of our algorithms and apply the approximated one to merging surfaces. In Chapter 4, a kernel-based meshless method is developed to solve coupled second-order elliptic PDEs in bulk domains and on surfaces, subject to Robin boundary conditions. It combines a least-squares kernel-based collocation method with a surface-type intrinsic approach. We can thus use each pair for discrete point sets, RBF kernels (globally and restrictedly), trial spaces, and some essential assumptions, to search for least-squares solutions in bulks and on surfaces, respectively. We first analyze error estimates for a domain-type Robin-boundary problem. Based on this analysis and the existing results for surface PDEs, we discuss the theoretical requirements for the Sobolev kernels used. We then select the orders of smoothness for the kernels in bulks and on surfaces. Finally, several numerical experiments are demonstrated to test the robustness of the coupled method in terms of accuracy and convergence rates under different settings.

Includes bibliographical references / In this thesis, the development of a strongly coupled, partitioned fluid-structure interactions (FSI) solver is outlined. Well established methods are analysed and new methods are proposed to provide robust, accurate and efficient FSI solutions. All the methods introduced and analysed are primarily geared towards the solution of incompressible, transient FSI problems, which facilitate the use of black-box sub-domain field solvers. In the first part of the thesis, radial basis function (RBF) interpolation is introduced for interface information transfer. RBF interpolation requires no grid connectivity information, and therefore presents an elegant means by which to transfer information across a non-matching and non-conforming interface to couple finite element to finite volume based discretisation schemes. The transfer scheme is analysed, with particular emphasis on a comparison between consistent and conservative formulations. The primary aim is to demonstrate that the widely used conservative formulation is a zero order method. Furthermore, while the consistent formulation is not provably conservative, it yields errors well within acceptable levels and converges within the limit of mesh refinement. A newly developed multi-vector update quasi-Newton (MVQN) method for implicit coupling of black-box partitioned solvers is proposed. The new coupling scheme, under certain conditions, can be demonstrated to provide near Newton-like convergence behaviour. The superior convergence properties and robust nature of the MVQN method are shown in comparison to other well-known quasi-Newton coupling schemes, including the least squares reduced order modelling (IBQN-LS) scheme, the classical rank-1 update Broyden's method, and fixed point iterations with dynamic relaxation. Partitioned, incompressible FSI, based on Dirichlet-Neumann domain decomposition solution schemes, cannot be applied to problems where the fluid domain is fully enclosed. A simple example often provided in the literature is that of balloon inflation with a prescribed inflow velocity. In this context, artificial compressibility (AC) will be shown to be a useful method to relax the incompressibility constraint, by including a source term within the fluid continuity equation. The attractiveness of AC stems from the fact that this source term can readily be added to almost any fluid field solver, including most commercial solvers. AC/FSI is however limited in the range of problems it can effectively be applied to. To this end, the combination of the newly developed MVQN method with AC/FSI is proposed. In so doing, the AC modified fluid field solver can continue to be treated as a black-box solver, while the overall robustness and performance are significantly improved. The study concludes with a demonstration of the modularity offered by partitioned FSI solvers. The analysis of the coupled environment is extended to include steady state FSI, FSI with free surfaces and an FSI problem with solid-body contact.

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

Metalearning aims to obtain knowledge of the relationship between the mechanism of learning and the concrete contexts in which that mechanisms is applicable. As new mechanisms of learning are continually added to the pool of learning algorithms, the chances of encountering behavior similarity among algorithms are increased. Understanding the relationships among algorithms and the interactions between algorithms and tasks help to narrow down the space of algorithms to search for a given learning task. In addition, this process helps to disclose factors contributing to the similar behavior of different algorithms. We first study general characteristics of learning tasks and their correlation with the performance of algorithms, isolating two metafeatures whose values are fairly distinguishable between easy and hard tasks. We then devise a new metafeature that measures the difficulty of a learning task that is independent of the performance of learning algorithms on it. Building on these preliminary results, we then investigate more formally how we might measure the behavior of algorithms at a ner grained level than a simple dichotomy between easy and hard tasks. We prove that, among all many possible candidates, the Classifi er Output Difference (COD) measure is the only one possessing the properties of a metric necessary for further use in our proposed behavior-based clustering of learning algorithms. Finally, we cluster 21 algorithms based on COD and show the value of the clustering in 1) highlighting interesting behavior similarity among algorithms, which leads us to a thorough comparison of Naive Bayes and Radial Basis Function Network learning, and 2) designing more accurate algorithm selection models, by predicting clusters rather than individual algorithms.

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.

Compact and lightweight optical designs achieving acceptable image quality, field of view, eye clearance, eyebox size, operating across the visible spectrum, are the key to the success of next generation head-worn displays. The first part of this thesis reports on the design, fabrication, and analysis of off-axis magnifier designs. The first design is catadioptric and consists of two elements. The lens utilizes a diffractive optical element and the mirror has a free-form surface described with an x-y polynomial. A comparison of color correction between doublets and single layer diffractive optical elements in an eyepiece as a function of eye clearance is provided to justify the use of a diffractive optical element. The dual-element design has an 8 mm diameter eyebox, 15 mm eye clearance, 20 degree diagonal full field, and is designed to operate across the visible spectrum between 450-650 nm. 20% MTF at the Nyquist frequency with less than 3% distortion has been achieved in the dual-element head-worn display. An ideal solution for a head-worn display would be a single free-form surface mirror design. A single surface mirror does not have dispersion; therefore, color correction is not required. A single surface mirror can be made see-through by machining the appropriate surface shape on the opposite side to form a zero power shell. The second design consists of a single off-axis free-form mirror described with an x-y polynomial, which achieves a 3 mm diameter exit pupil, 15 mm eye relief, and a 24 degree diagonal full field of view. The second design achieves 10% MTF at the Nyquist frequency set by the pixel spacing of the VGA microdisplay with less than 3% distortion. Both designs have been fabricated using diamond turning techniques. Finally, this thesis addresses the question of what is the optimal surface shape for a single mirror constrained in an off-axis magnifier configuration with multiple fields? Typical optical surfaces implemented in raytrace codes today are functions mapping two dimensional vectors to real numbers. The majority of optical designs to-date have relied on conic sections and polynomials as the functions of choice. The choice of conic sections is justified since conic sections are stigmatic surfaces under certain imaging geometries. The choice of polynomials from the point of view of surface description can be challenged. A polynomial surface description may link a designer s understanding of the wavefront aberrations and the surface description. The limitations of using multivariate polynomials are described by a theorem due to Mairhuber and Curtis from approximation theory. This thesis proposes and applies radial basis functions to represent free-form optical surfaces as an alternative to multivariate polynomials. We compare the polynomial descriptions to radial basis functions using the MTF criteria. The benefits of using radial basis functions for surface description are summarized in the context of specific head-worn displays. The benefits include, for example, the performance increase measured by the MTF, or the ability to increase the field of view or pupil size. Even though Zernike polynomials are a complete and orthogonal set of basis over the unit circle and they can be orthogonalized for rectangular or hexagonal pupils using Gram-Schmidt, taking practical considerations into account, such as optimization time and the maximum number of variables available in current raytrace codes, for the specific case of the single off-axis magnifier with a 3 mm pupil, 15 mm eye relief, 24 degree diagonal full field of view, we found the Gaussian radial basis functions to yield a 20% gain in the average MTF at 17 field points compared to a Zernike (using 66 terms) and an x-y polynomial up to and including 10th order. The linear combination of radial basis function representation is not limited to circular apertures. Visualization tools such as field map plots provided by nodal aberration theory have been applied during the analysis of the off-axis systems discussed in this thesis. Full-field displays are used to establish node locations within the field of view for the dual-element head-worn display. The judicious separation of the nodes along the x-direction in the field of view results in well-behaved MTF plots. This is in contrast to an expectation of achieving better performance through restoring symmetry via collapsing the nodes to yield field-quadratic astigmatism.

To accurately model or predict future operating conditions of a system in engineering or applied mechanics, it is necessary to understand its fundamental principles. These may be the material parameters, defining dimensional characteristics, or the boundary conditions. However, there are instances when there is little to no prior knowledge of the system properties or conditions, and consequently, the problem cannot be modeled accurately. It is therefore critical to define a method that can identify the desired characteristics of the current system without accumulating extensive computation time. This thesis formulates an inverse approach using proper orthogonal decomposition (POD) with an accompanying radial basis function (RBF) interpolation network. This method is capable of predicting the desired characteristics of a specimen even with little prior knowledge of the system. This thesis first develops a conductive heat transfer problem, and by using the truncated POD – RBF interpolation network, temperature values are predicted given a varying Biot number. Then, a simple bifurcation problem is modeled and solved for velocity profiles while changing the mass flow rate. This bifurcation problem provides the data and foundation for future research into the left ventricular assist device (LVAD) and implementation of POD – RBF. The trained POD – RBF inverse approach defined in this thesis can be implemented in several applications of engineering and mechanics. It provides model reduction, error filtration, regularization and an improvement over previous analysis utilizing computational fluid dynamics (CFD).

No description available.

Despite the advancements in the development of autonomous vehicles (AVs), there are still numerous complex situations in which AVs may encounter challenges. In recent years, the concept of teleoperation, which entails establishing a connection between a remote operator and the AV, has garnered substantial attention from both AV companies and governmental bodies as a viable safety backup method. However, a research gap is apparent when it comes to the remote manipulation of AVs positioned at a considerable distance. This gap involves a) AV with a temporal delay through real-time direct control within the constraints of current wireless communication technology in an unpredictable road environment, and b) enhancing the AV's inherent detection capabilities to augment its autonomous control abilities, thereby reducing the operator's workload. To address this research gap, this dissertation introduces an innovative teleoperation system. Initially, we devise a control system utilizing the wave variable approach as a communication method to alleviate the impact of signal latency. And Radial Basis Function Networks (RBFN) are employed to effectively manage the uncertain nonlinear dynamics of the vehicle. Subsequently, a saliency-based object detection (OD) algorithm, named SalienDet, is proposed to identify objects not present in the training sample set. SalienDet incorporates saliency maps generated without prior information into the neural network, enhancing image features for unfamiliar objects. This augmentation significantly aids the OD algorithm in detecting previously unknown objects, thereby empowering the AV to possess an improved perception ability. This advancement is particularly valuable when the operator imparts driving advice to the AV instead of exercising direct control. In conclusion, this dissertation makes a noteworthy contribution to AV teleoperation by furnishing a comprehensive solution that spans various aspects of AV teleoperation. / Doctor of Philosophy / This dissertation revolves around the teleoperation of autonomous vehicles (AVs), with the objective of formulating a comprehensive teleoperation system that encompasses two critical aspects: direct control and indirect control. In the initial segment of the dissertation, we introduce a real-time teleoperation direct control system based on neural networks. This framework plays a pivotal role in assisting operators in navigating AVs efficiently, especially in the face of challenges such as communication delays and complex external environments. Following this, we present a novel saliency-based object detection (OD) algorithm. This algorithm empowers the AV to recognize potential objects beyond its prior knowledge, thereby enhancing its level of autonomous control, particularly when operators opt not to exercise direct control over the remote AV. Our research findings delve into the essential facets of AV teleoperation. The developed teleoperation system serves as a valuable reference for future researchers and engineers dedicated to advancing autonomous vehicle technology.

Yes / Metamodelling or surrogate modelling techniques are frequently used across the engineering disciplines in conjunction with expensive simulation models or physical experiments. With the proliferation of metamodeling techniques developed to provide enhanced performance for specific problems, and the wide availability of a diverse choice of tools in engineering software packages, the engineering task of selecting a robust metamodeling technique for practical problems is still a challenge. This research introduces a framework for describing the typology of engineering problems, in terms of dimensionality and complexity, and the modelling conditions, reflecting the noisiness of the signals and the affordability of sample sizes, and on this basis presents a systematic evaluation of the performance of frequently used metamodeling techniques. A set of metamodeling techniques, selected based on their reported use for engineering problems (i.e. Polynomial, Radial Basis Function, and Kriging), were systematically evaluated in terms of accuracy and robustness against a carefully assembled set of 18 test functions covering different types of problems, sampling conditions and noise conditions. A set of four real-world engineering case studies covering both computer simulation and physical experiments were also analysed as validation tests for the proposed guidelines. The main conclusions drawn from the study are that Kriging model with Matérn 5/2 correlation function performs consistently well across different problem types with smooth (i.e. not noisy) data, while Kriging model with Matérn 3/2 correlation function provides robust performance under noisy conditions, except for the very high noise conditions, where the Kriging model with nugget appears to provide better models. These results provide engineering practitioners with a guide for the choice of a metamodeling technique for problem types and modelling conditions represented in the study, whereas the evaluation framework and benchmarking problems set will be useful for researchers conducting similar studies.