No description available.

In this thesis, we analyze theoretical properties of the discontinuous Galerkin method (DGM) and propose novel approaches to implementation with the aim to increase its efficiency. First, we derive explicit expressions for the eigenvalues (spectrum) of the discontinuous Galerkin spatial discretization applied to the linear advection equation. We show that the eigenvalues are related to the subdiagonal [p/p+1] Pade approximation of exp(-z) when the p-th degree basis functions are used. Then, we extend the analysis to nonuniform meshes where both the size of elements and the composition of the mesh influence the spectrum. We show that the spectrum depends on the ratio of the size of the largest to the smallest cell as well as the number of cells of different types. We find that the spectrum grows linearly as a function of the proportion of small cells present in the mesh when the size of small cells is greater than some critical value. When the smallest cells are smaller than this critical value, the corresponding eigenvalues lie outside of the main spectral curve. Numerical examples on nonuniform meshes are presented to show the improvement on the time step restriction. In particular, this result can be used to improve the time step restriction on Cartesian grids. Finally, we present a discontinuous Galerkin method for solutions of the Euler equations on Cartesian grids with embedded geometries. Cutting an embedded geometry out of the Cartesian grid creates cut cells, which are difficult to deal with for two reasons. One is the restrictive CFL number and the other is the integration on irregularly shaped cells. We use explicit time integration employing cell merging to avoid restrictively small time steps. We provide an algorithm for splitting complex cells into triangles and use standard quadrature rules on these for numerical integration. To avoid the loss of accuracy due to straight sided grids, we employ the curvature boundary conditions. We show that the proposed method is robust and high-order accurate.

This thesis deals with Martin Heideggers critique of the Cartesian problem of scepticism in Being and Time. In addition to the critique itself, Heideggers position with regards to the sense and task of phenomenological research, as well as fundamental ontology, is discussed as a necessary underpinning of his critique. Finally, the objection to Heideggers critique that is raised by Charles Guignon in his book, Heidegger and the Problem of Knowledge, (namely, that it suffers from the problem of reflexivity) is evaluated.

No description available.

vii, 99 p. A print copy of this thesis is available through the UO Libraries. Search the library catalog for the location and call number. / We investigate Cesàro summability of the Fourier orthogonal expansion of functions on B d × I m , where B d is the closed unit ball in [Special characters omitted] and I m is the m -fold Cartesian product of the interval [-1, 1], in terms of orthogonal polynomials with respect to the weight functions (1 - z ) α (1 + z ) β (1 - |x| 2 ) λ-1/2 , with z ∈ I m and x ∈ B d . In addition, we study a discretized Fourier orthogonal expansion on the cylinder B 2 × [-1, 1], which uses a finite number of Radon projections. The Lebesgue constant of this operator is obtained, and the proof utilizes generating functions for associated orthogonal series. / Committee in charge: Yuan Xu, Chairperson, Mathematics; Huaxin Lin, Member, Mathematics Jonathan Brundan, Member, Mathematics; Marcin Bownik, Member, Mathematics; Jun Li, Outside Member, Computer & Information Science

[ES] La interacción de contacto entre sólidos deformables es uno de los fenómenos más complejos en el ámbito de la mecánica computacional. La resolución de este problema requiere de algoritmos robustos para el tratamiento de no linealidades geométricas. El Método de Elementos Finitos (MEF) es uno de los más utilizados para el diseño de componentes mecánicos, incluyendo la solución de problemas de contacto. En este método el coste asociado al proceso de discretización (generación de malla) está directamente vinculado a la definición del contorno a modelar, lo cual dificulta la introducción en la simulación de superficies complejas, como las superficies NURBS, cada vez más utilizadas en el diseño de componentes. Esta tesis está basada en el "Cartesian grid Finite Element Method" (cgFEM). En esta metodología, encuadrada en la categoría de métodos "Immersed Boundary", se extiende el problema a un dominio de aproximación (cuyo mallado es sencillo de generar) que contiene al dominio de análisis completamente en su interior. Al desvincular la discretización de la definición del contorno del problema se reduce drásticamente el coste de generación de malla. Es por ello que el método cgFEM es una herramienta adecuada para la resolución de problemas en los que es necesario modificar la geometría múltiples veces, como el problema de optimización de forma o la simulación de desgaste. El método cgFEM permite también crear de manera automática y eficiente modelos de Elementos Finitos a partir de imágenes médicas. La introducción de restricciones de contacto habilitaría la posibilidad de considerar los diferentes estados de integración implante-tejido en procesos de optimización personalizada de implantes. Así, en esta tesis se desarrolla una formulación para resolver problemas de contacto 3D con el método cgFEM, considerando tanto modelos de contacto sin fricción como problemas con rozamiento de Coulomb. La ausencia de nodos en el contorno en cgFEM impide la aplicación de métodos tradicionales para imponer las restricciones de contacto, por lo que se ha desarrollado una formulación estabilizada que hace uso de un campo de tensiones recuperado para asegurar la estabilidad del método. Para una mayor precisión de la solución, se ha introducido la definición analítica de las superficies en contacto en la formulación propuesta. Además, se propone la mejora de la robustez de la metodología cgFEM en dos aspectos: el control del mal condicionamiento del problema numérico mediante un método estabilizado, y la mejora del campo de tensiones recuperado, utilizado en el proceso de estimación de error. La metodología propuesta se ha validado a través de diversos ejemplos numéricos presentados en la tesis, mostrando el gran potencial de cgFEM en este tipo de problemas. / [CAT] La interacció de contacte entre sòlids deformables és un dels fenòmens més complexos en l'àmbit de la mecànica computacional. La resolució d'este problema requerix d'algoritmes robustos per al tractament de no linealitats geomètriques. El Mètode dels Elements Finits (MEF) és un dels més utilitzats per al disseny de components mecànics, incloent la solució de problemes de contacte. En este mètode el cost associat al procés de discretització (generació de malla) està directament vinculat a la definició del contorn a modelar, la qual cosa dificulta la introducció en la simulació de superfícies complexes, com les superfícies NURBS, cada vegada més utilitzades en el disseny de components. Esta tesi està basada en el "Cartesian grid Finite Element Method" (cgFEM). En esta metodologia, enquadrada en la categoria de mètodes "Immersed Boundary", s'estén el problema a un domini d'aproximació (el mallat del qual és senzill de generar) que conté al domini d'anàlisi completament en el seu interior. Al desvincular la discretització de la definició del contorn del problema es reduïx dràsticament el cost de generació de malla. És per això que el mètode cgFEM és una ferramenta adequada per a la resolució de problemes en què és necessari modificar la geometria múltiples vegades, com el problema d'optimització de forma o la simulació de desgast. El mètode cgFEM permet també crear de manera automàtica i eficient models d'Elements Finits a partir d'imatges mèdiques. La introducció de restriccions de contacte habilitaria la possibilitat de considerar els diferents estats d'integració implant-teixit en processos d'optimització personalitzada d'implants. Així, en esta tesi es desenvolupa una formulació per a resoldre problemes de contacte 3D amb el mètode cgFEM, considerant tant models de contacte sense fricció com a problemes amb fregament de Coulomb. L'absència de nodes en el contorn en cgFEM impedix l'aplicació de mètodes tradicionals per a imposar les restriccions de contacte, per la qual cosa s'ha desenvolupat una formulació estabilitzada que fa ús d'un camp de tensions recuperat per a assegurar l'estabilitat del mètode. Per a una millor precisió de la solució, s'ha introduït la definició analítica de les superfícies en contacte en la formulació proposada. A més, es proposa la millora de la robustesa de la metodologia cgFEM en dos aspectes: el control del mal condicionament del problema numèric per mitjà d'un mètode estabilitzat, i la millora del camp de tensions recuperat, utilitzat en el procés d'estimació d'error. La metodologia proposada s'ha validat a través de diversos exemples numèrics presentats en la tesi, mostrant el gran potencial de cgFEM en este tipus de problemes. / [EN] The contact interaction between elastic solids is one of the most complex phenomena in the computational mechanics research field. The solution of such problem requires robust algorithms to treat the geometrical non-linearities characteristic of the contact constrains. The Finite Element Method (FE) has become one of the most popular options for the mechanical components design, including the solution of contact problems. In this method the computational cost of the generation of the discretization (mesh generation) is directly related to the complexity of the analysis domain, namely its boundary. This complicates the introduction in the numerical simulations of complex surfaces (for example NURBS), which are being increasingly used in the CAD industry. This thesis is grounded on the Cartesian grid Finite Element Method (cgFEM). In this methodology, which belongs to the family of Immersed Boundary methods, the problem at hand is extended to an approximation domain which completely embeds the analysis domain, and its meshing is straightforward. The decoupling of the boundary definition and the discretization mesh results in a great reduction of the mesh generation's computational cost. Is for this reason that the cgFEM is a suitable tool for the solution of problems that require multiple geometry modifications, such as shape optimization problems or wear simulations. The cgFEM is also capable of automatically generating FE models from medical images without the intermediate step of generating CAD entities. The introduction of the contact interaction would open the possibility to consider different states of the union between implant and living tissue for the design of optimized implants, even in a patient-specific process. Hence, in this thesis a formulation for solving 3D contact problems with the cgFEM is presented, considering both frictionless and Coulomb's friction problems. The absence of nodes along the boundary in cgFEM prevents the enforcement of the contact constrains using the standard procedures. Thus, we develop a stabilized formulation that makes use of a recovered stress field, which ensures the stability of the method. The analytical definition of the contact surfaces (by means of NURBS) has been included in the proposed formulation in order to increase the accuracy of the solution. In addition, the robustness of the cgFEM methodology is increased in this thesis in two different aspects: the control of the numerical problem's ill-conditioning by means of a stabilized method, and the enhancement of the stress recovered field, which is used in the error estimation procedure. The proposed methodology has been validated through several numerical examples, showing the great potential of the cgFEM in these type of problems. / Navarro Jiménez, JM. (2019). Contact problem modelling using the Cartesian grid Finite Element Method [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/124348 / TESIS

The aim of this diploma thesis is using cartesian genetic programming on design image filters and creating basic structure for implement diferent type of problems. Genetic programming is rapidly growing method, which often using for solve dificult problems. This thesis analyze basic principle, way of application and implementing this method to design filters. Result of this thesis is program realize design filters define by specific parameters, overview of implementig method and achieve summary from this sphere.

The aim of this dissertation is to provide a critique of the idea that skepticism was the driving force in the development of early modern thought. Historian of philosophy Richard Popkin introduced this thesis in the 1950s and elaborated on it over the next five decades, and recent scholarship shows that it has become an increasingly accepted interpretation. I begin with a study of the relevant historical antecedents—the ancient skeptical traditions of which early modern thinkers were aware—Pyrrhonism and Academicism. Then I discuss the influence of skepticism on three pre-Cartesians: Francisco Sanches, Michel de Montaigne, and Pierre Charron. Basing my arguments on an informed understanding of both ancient Greek skepticism and some of the writings of these philosophers, I contend that it is inaccurate to predominantly characterize Sanches, Montaigne, and Charron as skeptics. To support his thesis about the singular influence of skepticism on early modern thought, Popkin says that René Descartes’ metaphysical philosophy was formed as a response to a skeptical threat and that Descartes ultimately conceded to the force of skepticism. He also argues that David Hume was a Pyrrhonist par excellence. I disagree with Popkin’s claims. I argue that Descartes was not as deeply affected by skepticism as Popkin suggests and that it is inaccurate to characterize Hume as a Pyrrhonist. By offering this critique, I hope to make clear to the readers two things: first, that Popkin’s thesis, though it is both enticing and generally accepted by many scholars, is questionable with regard to its plausibility; second, that the arguments I present in this dissertation reveal that further research into the role of skepticism in early modern philosophy is in order.

The complementary prism of a graph G is the graph formed from a disjoint union of G and its complement ̄G by adding the edges of a perfect matching between the corresponding vertices of G and G. We study independent domination numbers of complementary prisms. Exact values are determined for complementary prisms of paths, complete bipartite graphs, and subdivided stars. A natural lower bound on the independent domination number of a complementary prism is given, and graphs attaining this bound axe characterized. Then we show that the independent domination number behaves somewhat differently in complementary prisms than the domination and total domination numbers. We conclude with a sharp upper bound.

The complementary prism of a graph G is the graph formed from a disjoint union of G and its complement ̄G by adding the edges of a perfect matching between the corresponding vertices of G and G. We study independent domination numbers of complementary prisms. Exact values are determined for complementary prisms of paths, complete bipartite graphs, and subdivided stars. A natural lower bound on the independent domination number of a complementary prism is given, and graphs attaining this bound axe characterized. Then we show that the independent domination number behaves somewhat differently in complementary prisms than the domination and total domination numbers. We conclude with a sharp upper bound.