High-order unstructured curved mesh generation using the Winslow equations
Not Available
SEARCH · Search NASA
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Not Available
Not Available
Here, we present a geometric multigrid solver for the Compact Discontinuous Galerkin method through building a hierarchy of coarser meshes using a simple agglomeration method which handles arbitrary element shapes and dimensions. The method is easily extendable to other discontinuous Galerkin discretizations, including the Local DG method and the Interior Penalty method. We demonstrate excellent solver performance for Poisson's equation, provided a flux formulation is used for the operator coarsening and a suitable switch function chosen for the numerical fluxes.
Amelogenin proteins are critical to the formation of enamel in teeth and may have roles in promoting nucleation, controlling growth, and regulating microstructures of the intricately woven hydroxyapatite (HAP). Leucine-rich amelogenin protein (LRAP) is a 59-residue splice variant of amelogenin and contains the N- and C-terminal charged regions of the full-length protein thought to control crystal growth. Although the quaternary structure of full-length amelogenin in solution has been well studied and can consist of self-assemblies of monomers called nanospheres, the quaternary structure of LRAP is not as well studied. Here, analytical ultracentrifugation sedimentation velocity (SV) and small angle neutron scattering (SANS) were used to study the tertiary and quaternary structure of LRAP over a range of pH values, ionic strengths, and concentrations. SV has advantages over other techniques in accurately quantifying protein speciation in polydisperse solutions. We found that the monomer was the dominant species of phosphorylated LRAP (LRAP(+P)) over a range of solution conditions (pH 2.7 to 4.1, pH 4.5 to 8, 50 mmol/L( mM) to 200 mM NaCl, 0.065 to 2 mg/mL). The monomer was also the dominant species for unphosphorylated LRAP (LRAP(-P)) at pH 7.4 and LRAP(+P) in the presence of 2.5 mM calcium at pH 7.4. LRAP aggregated in a narrow pH range near the isoelectric point (pH 4.1). We conclude that LRAP does not form nanospheres under physiological solution conditions. Both SV and SANS showed that the LRAP monomer has a radius of ~2.0 nm and adopts an extended structure which solution NMR studies show is intrinsically disordered. This work provides new insights into the tertiary and quaternary structure of LRAP and further evidence that the monomeric species is an important functional form of amelogenins
Not Available
Abstract not provided.
Not Available
Abstract not provided
Abstract not provided.
Abstract not provided
Understanding the flow of fluid, either liquid or gas, through and around solid bodies has challenged man since the dawn of scientific inquiry. Many of the great minds of science and mathematics have progressively built up a hierarchy of fluid models since fluid flow impacts our lives in so many fundamental ways - from the early days of flow of water in viaducts to cities, to today's flight of planes. This chapter is concerned with the computational modeling of turbulent flow around aerodynamic bodies such as planes and wind turbines. In this case, viscous effects near the solid bodies create very thin boundary layers that yield highly anisotropic (gradients normal to the surface may be 10 6 larger than gradients along the surface) solutions to the governing non-linear partial differential equations (PDE); the Navier-Stokes equations. Furthermore, turbulent flows develop extremely broad ranges of length and time scales motivating the use of discretization methods capable of employing adaptivity and implicit time integration. The combination of these features - non-linear, anisotropy, adaptivity, and implicit - dramatically raise the complexity of the discretization, posing large challenges to efficient scalable parallel implementation. However, through careful design, the more complex algorithms can provide great reductions in computational cost relative to simpler methods (e.g., Cartesian grids with explicit time integration) that are easier to mate efficiently to hardware. In this chapter, we not only describe our approach but we also address the fact that while complex algorithms may never be as efficient flop-for-flop as simple methods, in the important measure of science-per-core-hour, they can still win big by making complex features like adaptivity and implicit methods as efficient and scalable as possible.