The Gleason problem has been proven to be a complicated issue to tackle. In this thesiswe will conclude that a domain, Ω ⊂ R𝑛, has Gleason 𝑅-property at any point 𝑝 ∈ Ω, where 𝑅(Ω) ⊂ 𝐶∞(Ω) is the ring of functions that are real analytic in 𝑝. First, we investigate function spaces and give them fitting norms. Afterwards, we build a bump function that is then used to construct a smooth partition of unity on R𝑛. Finally, we show that some of the functionspaces, introduced earlier, have the Gleason property. Ultimately, we use our smooth partition of unity in order to prove that the statement above holds for domains in R2. Subsequently, with the same reasoning one can prove that the statement also holds for domains Ω ⊂ R𝑛.

No description available.

The scope of this research concerns the passive damping of structural vibrations by the use of viscoelastic layers. It is motivated by the need for efficient numerical tools to deal with the medium frequency behaviour of industrial viscoelastic sandwich products. The sandwich modelling technique is based on the use of an interface element: the two deformable plates are modelled by special plate elements while the intermediate dissipative layer is modelled with interface elements. This interface element is based on the first-order shear deformation theory and assume constant peel and shear stresses in the polymer thickness. This element couples the lower and upper layers without additional degrees of freedom. The partition of unity finite element method (PUFEM) is applied to the development of enriched Mindlin plate elements. The element shape functions are obtained as the product of partition of unity functions with arbitrary chosen enrichment functions. Polynomial enrichment leads to the generation of high-order polynomial shape functions and is therefore similar to a p-FEM technique. Numerical examples illustrate the use of both PUFEM Mindlin plate elements and interface elements for the simulation of viscoelastic sandwich structures.

Este trabalho consiste em introduzir uma nova abordagem de representação de superfície no ambiente de simulação Freeflow2D. Consiste em usar Partição da Unidade Implícita para estimar da superfície a geometria, normais e curvatura. Procurando se valer das vantagens de métodos do tipo meshless (sem malha) conservando no entanto a malha Lagrangiana, no interesse de manter o fácil acesso de vizinhança, inserção e eliminação de pontos / The objective of this work is to introduce a new approache of surface representation within the Freeflow system. It consists of using implicit functions by means of Partition of Unit Implicit to estimate surface geometry, normals and curvature. Aiming at the advantages of meshless methods of surface representation whilst keeping the Lagrangian mesh in order to preserve ease of access of geometric vicinity, particle insertion and removal

First of all, the PDE form of the classical level set function phi is parameterized with an analytical form of Radial Basis Function (RBF), which is real-valued and continuously differentiable. Such that the upwind scheme, extension velocity and reinitialization algorithms in solving the discrete Hamilton-Jacobi equation can be waived in the numerical process, the whole framework is transformed into a standard mathematical programming problem in which the linear objective function can be directly optimized by a gradient algorithm - shape sensitivity. The minimization of the mean compliance is studied and presented to demonstrate the advantages of the parametrical method. / Parametrization substantially reduces the complexity of the original discrete PDE level set method. However, the result shows that the high number of RBF knots leads to dense coefficient matrices. Thus, it induces numerical instabilities, slow convergence and less accuracy in the process. Consequently, we then study the distribution of knots density for faster computation. By updating the movement of the knot, the knot moves towards the position where the change is directly determined by the shape sensitivity. In such case, we may use lesser number of knots to describe the properties of the system while the smoothness of the implicit function is satisfied. The sensitivity study is evaluated carefully and discussed in detail. Results show a significant improvement in the computational speed and stability. / The study found significant improvement obtained in the structural optimization with the parametric level set method, both the stability and efficiency were given as the benefits of using the method of the parametrization. / Traditional structural optimization approaches can be referred to as sizing optimization, since their design variables are the proportions of the structure or material. A major restriction in the sizing problem is that the shape and the topology of the structure are fixed a priori. Undoubtedly, changes in shape (e.g., curved boundary) and topology (e.g., holes in a member) could produce more significant improvement in dynamic performance than modifications in size alone. A recent development of shape and topology optimization based on the implicit moving boundaries with the use of the renowned level set method is regarded as one of the most sophisticated methods in handling the change of the structural topology. In this thesis, we study the parametrization of the classical level set method for the structural optimization and the associated computational methodology. / Usually, a large-scale model will lead to bulk coefficient matrices in the RBF optimization and the linear function normally require O (N3) flops and O (N2) memory while processing. It is becoming impractical to solve as N goes over 10,000. In fact, the dense system equation matrix frequently leads to the numerical instabilities and the failure of the optimization. Finally, we introduce the method of Partition of Unity (POU) to deal with this problem. POU is often used in 3D reconstruction of implicit surfaces from scattered point sets. It breaks the global domain into smaller overlapping subdomains such that the implicit functions can be more efficiently interpolated. Meanwhile, the global solution is obtained by blending all the local solutions with a set of weighting functions. The algorithm of POU is presented here, and we analyze and discuss the numerical results accordingly. / Ho, Hon Shan. / Adviser: Michael Y. Wang. / Source: Dissertation Abstracts International, Volume: 73-03, Section: B, page: . / Thesis (Ph.D.)--Chinese University of Hong Kong, 2010. / Includes bibliographical references (leaves 106-119). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [201-] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstract also in Chinese.

Este trabalho consiste em introduzir uma nova abordagem de representação de superfície no ambiente de simulação Freeflow2D. Consiste em usar Partição da Unidade Implícita para estimar da superfície a geometria, normais e curvatura. Procurando se valer das vantagens de métodos do tipo meshless (sem malha) conservando no entanto a malha Lagrangiana, no interesse de manter o fácil acesso de vizinhança, inserção e eliminação de pontos / The objective of this work is to introduce a new approache of surface representation within the Freeflow system. It consists of using implicit functions by means of Partition of Unit Implicit to estimate surface geometry, normals and curvature. Aiming at the advantages of meshless methods of surface representation whilst keeping the Lagrangian mesh in order to preserve ease of access of geometric vicinity, particle insertion and removal

Atualmente, no que concerne as problemáticas pertinentes à engenharia estrutural, o Método dos Elementos Finitos (MEF) é a principal ferramenta utilizada para obter soluções aproximadas de Problemas de Valor de Contorno (PVC). No entanto, tal metodologia exige um elevado custo computacional ao demandar malhas muito refinadas para solucionar problemas que apresentam singularidades, ou seja, que apresentam regiões onde ocorrem gradientes de deformação fortemente localizados. Para superar esse inconveniente, o Método dos Elementos Finitos Generalizados (MEFG) propõe a expansão do espaço de aproximação do MEF mediante a inserção de funções (conhecidas como funções de enriquecimento) que melhor representem localmente o comportamento da solução procurada. Tais funções podem apresentar características específicas ou mesmo serem geradas numericamente. Neste caso, dispensam-se malhas muito refinadas. Entretanto, o aumento do espaço de aproximação de modo irrestrito pode introduzir dependências lineares no sistema de equações do MEFG, tornando a solução obtida imprecisa ou mesmo impedindo a solução do sistema por métodos diretos. A chamada versão estável do MEFG explora uma modificação imposta às funções de enriquecimento a fim de melhorar o condicionamento da matriz de rigidez. Contudo, tal modificação não se configura como condição suficiente para garantir uma redução efetiva do número de condição. Neste trabalho, considera-se uma proposição recente para a modificação do espaço das funções de forma do MEFG associadas ao enriquecimento: trata-se do emprego de funções do tipo flat-top e trigonométricas como Partição da Unidade (PU), as quais são empregadas exclusivamente na construção das funções de forma enriquecidas (essas partições são definidas para elementos finitos quadrilaterais e triangulares). Exemplos numéricos são selecionados para evidenciar as vantagens dessas novas versões do MEFG em relação às anteriores e ao MEF convencional. Demonstra-se que tanto a PU flat-top quanto a PU trigonométrica, preservam as excelentes propriedades de convergência do MEFG. Além disso, mostra-se que o condicionamento da matriz de rigidez associada é próximo ao apresentado pelo MEF (uma vez que o enriquecimento, mesmo polinomial, não gera dependências) e que a formulação apresenta-se robusta na consideração de descontinuidades fortes. / Currently, regarding structural engineering issues, the Finite Element Method (FEM) is the main tool used to obtain approximate solutions of Boundary Value Problems (BVP). However, such methodology requires very refined meshes to solve problems that have singularities, i.e., that have regions where strongly localized deformation gradients occur, which leads to a high computational cost. To overcome this drawback, the Generalized Finite Element Method (GFEM) proposes the expansion of the FEM approach space by inserting functions (known as enrichment functions) that best represent locally the behavior of the searched solution. Such functions may have specific characteristics or even be generated numerically. In this case, very refined meshes are dispensed. However, the increase of the unrestricted approach space can introduce linear dependencies in the system of equations of the GFEM, making the solution imprecise or even preventing the solution of the system by direct methods. The so-called stable version of the GFEM exploits a modification imposed on the enrichment functions in order to improve the conditioning of the stiffness matrix. However, such a modification is not a sufficient condition to ensure an effective reduction in the condition number. In this work, it is considered a recent proposition to modify the space of the shape functions of GFEM associated with enrichment: the use of flat-top and trigonometric functions such as Partition of Unity (PU), which are used exclusively in the construction of the enriched shape functions (these partitions are defined for finite elements quadrilateral and triangular). Numerical examples are selected to highlight the advantages of these new versions of the GFEM over the previous ones and the conventional FEM. It is demonstrated that both flat-top PU and trigonometric PU preserve the excellent convergence properties of GFEM. In addition, it is shown that the conditioning of the associated stiffness matrix is close to that presented by FEM (since enrichment, even polynomial, does not generate dependencies) and that the formulation is robust in the consideration of strong discontinuities.

This dissertation addresses design and analysis aspects of stochastic dynamical systems using Fokker-Planck equation (FPE). A new numerical methodology based on the partition of unity meshless paradigm is developed to tackle the greatest hurdle in successful numerical solution of FPE, namely the curse of dimensionality. A local variational form of the Fokker-Planck operator is developed with provision for h- and p- refinement. The resulting high dimensional weak form integrals are evaluated using quasi Monte-Carlo techniques. Spectral analysis of the discretized Fokker- Planck operator, followed by spurious mode rejection is employed to construct a new semi-analytical algorithm to obtain near real-time approximations of transient FPE response of high dimensional nonlinear dynamical systems in terms of a reduced subset of admissible modes. Numerical evidence is provided showing that the curse of dimensionality associated with FPE is broken by the proposed technique, while providing problem size reduction of several orders of magnitude. In addition, a simple modification of norm in the variational formulation is shown to improve quality of approximation significantly while keeping the problem size fixed. Norm modification is also employed as part of a recursive methodology for tracking the optimal finite domain to solve FPE numerically. The basic tools developed to solve FPE are applied to solving problems in nonlinear stochastic optimal control and nonlinear filtering. A policy iteration algorithm for stochastic dynamical systems is implemented in which successive approximations of a forced backward Kolmogorov equation (BKE) is shown to converge to the solution of the corresponding Hamilton Jacobi Bellman (HJB) equation. Several examples, including a four-state missile autopilot design for pitch control, are considered. Application of the FPE solver to nonlinear filtering is considered with special emphasis on situations involving long durations of propagation in between measurement updates, which is implemented as a weak form of the Bayes rule. A nonlinear filter is formulated that provides complete probabilistic state information conditioned on measurements. Examples with long propagation times are considered to demonstrate benefits of using the FPE based approach to filtering.

No description available.

Kyoto University (京都大学) / 0048 / 新制・課程博士 / 博士(工学) / 甲第15580号 / 工博第3292号 / 新制||工||1497(附属図書館) / 28101 / 京都大学大学院工学研究科社会基盤工学専攻 / (主査)教授 杉浦 邦征, 教授 田村 武, 准教授 宇都宮 智昭 / 学位規則第4条第1項該当