Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 35 for “"polynomial degree"”.
-
Computational fluid dynamics on wildly heterogeneous systems
… scale with O(p · N), where N is the number of degrees of freedom and p the polynomial degree, the runtime of the best available multigrid algorithms scales with O(p · N) as well. This super-linear scaling limits the applicability of high-order methods to mid-range polynomial orders and …
-
Discontinuous Galerkin finite element approximation of Hamilton-Jacobi-Bellman equations with Cordes coefficients
… convergent under suitable choices of meshes and polynomial degrees. The method allows for a broad range of <em>hp</em>-refinement strategies on unstructured meshes with varying element sizes and orders of approximation, thus permitting up to exponential convergence rates, even for nonsmooth …
-
Optimal-complexity and robust multigrid methods for high-order FEM
… very rapid convergence properties. As the polynomial degree is increased, the efficient solution of such PDEs becomes difficult.</p> <p>This thesis develops preconditioners for high-order discretizations. We build upon the pioneering work of Pavarino, who proved in 1993 that the additive …
-
From efficient high-order methods to scientific machine learning.
… tensor-product elements with many fewer degrees of freedom (DoFs). Adapting arguments from Pavarino for the tensor-product case, we prove that patch smoothers give conditioning estimates independent of the polynomial degree for a model problem. We combine this with a low-order global …
-
Investigations of model validity using residuals
… caused by the choice of an inappropriate degree in polynomial regression has been investigated, and a new procedure, based upon the Durbin-Watson d-statistic, has been proposed for determining the appropriate polynomial degree. It was shown that the d-statistic can be transformed to …
-
Three-dimensional mortar finite element method for convection-diffusion equation with nonconforming meshes
… elements, where both mesh refinement and degree enhancement are combined to increase accuracy. The mortar finite element method has proven to be a good candidate for implementation in two dimensions. In this work, for the first time, we present computational results for the convergence of …
-
Quadratic Forms over Global Fields
… explores certain binary quadratic forms over the polynomial ring $\mathbb{F}_q[T]$. We derive explicit formulas for the number of representations of a polynomial and estimate their moments in two asymptotic scenarios: the large finite field limit, where the field size $q$ grows with fixed …
-
U-Splines: Splines Over Unstructured Meshes
… can accommodate local variation in cell size, polynomial degree, and smoothness simultaneously over more varied mesh configurations. Mixed cell types (e.g., triangle and tetrahedron and quadrilateral and hexahedral cells in the same mesh) and T-junctions are also supported. The U-spline …
-
Structures on a K3 surface
… of the Lattice to make accurate predictions of polynomial degree growth under the automorphisms. We describe these automorphisms in terms of operations on elliptic curves. In the second part of this paper, we look at curves whose shape is sketched by the orbit of a point under the composed …
-
Low-order finite element preconditioner for spectral element pressure solver in Navier-Stokes equations
… is attained regardless of mesh geometry or polynomial degree used. This novel meshing strategy achieves a reduction up to 30% in the number of iterations compared to the best current schemes without increasing the computational cost of the preconditioners, and it also overcomes the …
-
Convergence analysis for finite element discretizations of highly indefinite problems
… solution without any condition for piecewise polynomials and plane waves and under a mild condition for a very general class of the approximation spaces. We develop a theory for general abstract non-conforming Galerkin discretization. As an application we present the error analysis for the …
-
Unfitted Finite Element Methods for Shape Optimization and Liquid Crystals
… Fréchet differentiability results hold for any polynomial degree used for the discrete level set representation of the domain. We illustrate our results with some numerical accuracy tests, a simple model (ge- ometric) problem with known exact solution, as well as shape optimization of structural …
-
Knotted fields and real algebraic links
… finds a function $f:mathbb{C}^2tomathbb{C}$, a polynomial in complex variables $u$, $v$ and the conjugate $overline{v}$, whose vanishing set $f^{-1}(0)$ intersects the unit three-sphere $S^3$ in $L$. These functions can often be manipulated to satisfy the physical constraints of the system in …
-
Feature-Based Polynomial Adaptation for High-Order Methods Applied to Martian Aerodynamics
… a comparative study of different feature-based polynomial adaptation strategies for high-order unstructured methods applied to unsteady turbulent flows. Recently, the Flux Reconstruction (FR) approach has been introduced as a unifying framework for high-order unstructured spatial …
-
Gröbner basis techniques for certain problems in coding and systems theory
… development. By generalizing the concept of polynomial degree, term orders are provided for multivariable polynomial rings and free modules over polynomial rings. The orders are not, in general, unique and this adds, in no small way, to the power and flexibility of the technique. As well as …
-
Enabling higher order isogeometric analysis for applications in structural mechanics
… system limits isogeometric analysis to low polynomial orders, typically degree two or three. The same may be said for classical finite element analysis. Classical formation and assembly routines scale as O(p⁹) per degree of freedom, while the optimal scaling with polynomial degree is O(p³). …
-
Numerical Methods for Two-phase Flow in Rigid and Deformable Porous Media
… to its local mesh adaptivity and local choice of polynomial degree. Finite volume methods are only first-order accurate but computationally efficient and robust for general geometries with structured mesh. We develop adaptive indicators to dynamically identify the regions of each method. By using …
-
Spectral hulls: a degree of freedom reducing hp-strategy in space/time
Reducing the degrees of freedom (DOF) of modern finite element methods is investigated using a systematic hp-process. The elements are first agglomerated (h-coarsening) to form convex/concave hulls and then the polynomial degree of the hull basis, is increased (p-refinement). Compared to the …
-
Impact of Nested Preconditioning in hp-Adaptive Continuous Galerkin Solutions of the Poisson Problem
… remain nearly independent of system size and polynomial degree. However, its runtime efficiency only becomes evident at large matrix sizes, due to the overhead of inter-level transfers at smaller scales. The adaptive refinement studies reveal distinct behaviors: 𝑝-adaptivity consistently …
-
Multi-Port Receivers System Analysis and Modeling
… the first derivative of the I-V curve that fits polynomial obtained in Matlab and assures that the optimizer will not be trapped into local minima. To verify the results of this research we used a Simulink model that emulates the radio frequency (RF) and digital base band parts of a Six-Port …
Page 1 of 2