Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computational optimization”

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.

At least 1,603 records · Page 89

Optimal nodal point distribution for improved accuracy in computational fluid dynamics

In applying finite-difference techniques to flow field problems, the accuracy attained for a fixed number of node points can be improved using unequally-spaced node points. The distribution of these node points is chosen here by minimizing a measure of local truncation error with respect to the parameters which define a transformation between the computational space of equally-spaced node points and the physical space of unequally-spaced node points. The problem then becomes a nonlinear programming problem. Numerical results are presented for two one-dimensional test problems: the Blasius boundary layer problem and the inviscid Burgers' equation.

Pierson, B. L.↗

Evolutionary computing for spacecraft power subsystem design search and optimization

Multi-objective optimization involves finding one or more optimal solutions when there is more than one conflicting objective. This means that a solution that is better in one objective compromises or trades-off, other objectives. Trade Studies are conducted by flight projects to create mission concepts with different trade-off solutions for mass, cost, performance and risk.

Hua, Hook↗

Runtime optimization of an application executing on a parallel computer

Identifying a collective operation within an application executing on a parallel computer; identifying a call site of the collective operation; determining whether the collective operation is root-based; if the collective operation is not root-based: establishing a tuning session and executing the collective operation in the tuning session; if the collective operation is root-based, determining whether all compute nodes executing the application identified the collective operation at the same call site; if all compute nodes identified the collective operation at the same call site, establishing a tuning session and executing the collective operation in the tuning session; and if all compute nodes executing the application did not identify the collective operation at the same call site, executing the collective operation without establishing a tuning session.

97 MATHEMATICS AND COMPUTING↗

Runtime optimization of an application executing on a parallel computer

Identifying a collective operation within an application executing on a parallel computer; identifying a call site of the collective operation; determining whether the collective operation is root-based; if the collective operation is not root-based: establishing a tuning session and executing the collective operation in the tuning session; if the collective operation is root-based, determining whether all compute nodes executing the application identified the collective operation at the same call site; if all compute nodes identified the collective operation at the same call site, establishing a tuning session and executing the collective operation in the tuning session; and if all compute nodes executing the application did not identify the collective operation at the same call site, executing the collective operation without establishing a tuning session.

97 MATHEMATICS AND COMPUTING↗

Runtime optimization of an application executing on a parallel computer

Identifying a collective operation within an application executing on a parallel computer; identifying a call site of the collective operation; determining whether the collective operation is root-based; if the collective operation is not root-based: establishing a tuning session and executing the collective operation in the tuning session; if the collective operation is root-based, determining whether all compute nodes executing the application identified the collective operation at the same call site; if all compute nodes identified the collective operation at the same call site, establishing a tuning session and executing the collective operation in the tuning session; and if all compute nodes executing the application did not identify the collective operation at the same call site, executing the collective operation without establishing a tuning session.

97 MATHEMATICS AND COMPUTING↗

Möbius domain-wall fermions on gradient-flowed dynamical HISQ ensembles

We report on salient features of a mixed lattice QCD action using valence Möbius domain-wall fermions solved on the dynamical 𝑁 𝑓 = 2 + 1 + 1 highly improved staggered quark sea-quark ensembles generated by the MILC Collaboration. The approximate chiral symmetry properties of the valence fermions are shown to be significantly improved by utilizing the gradient-flow scheme to first smear the highly improved staggered quark configurations. The greater numerical cost of the Möbius domain-wall inversions is mitigated by the highly efficient QUDA library optimized for NVIDIA GPU accelerated compute nodes. We have created an interface to this optimized QUDA solver in Chroma. We provide tuned parameters of the action and performance of QUDA using ensembles with the lattice spacings 𝑎 ≃ {0.15,0.12,0.09} fm and pion masses 𝑚 𝜋 ≃ {310,220,130} MeV. We have additionally generated two new ensembles with 𝑎 ∼ 0.12 fm and 𝑚 𝜋 ∼ {400,350} MeV. Furthermore, with a fixed flow time of 𝑡 𝑔⁡𝑓 =1 in lattice units, the residual chiral symmetry breaking of the valence fermions is kept below 10% of the light quark mass on all ensembles, 𝑚 res ≲ 0.1 × 𝑚 𝑙 , with moderate values of the fifth dimension 𝐿 5 and a domain-wall height 𝑀 5 ≤ 1.3. As a benchmark calculation, we perform a continuum, infinite volume, physical pion and kaon mass extrapolation of 𝐹 𝐾 ±⁡ /𝐹 𝜋 ± and demonstrate our results are independent of flow time and consistent with the FLAG determination of this quantity at the level of less than one standard deviation.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Lewis Structures Technology, 1988. Volume 2: Structural Mechanics

Lewis Structures Div. performs and disseminates results of research conducted in support of aerospace engine structures. These results have a wide range of applicability to practitioners of structural engineering mechanics beyond the aerospace arena. The engineering community was familiarized with the depth and range of research performed by the division and its academic and industrial partners. Sessions covered vibration control, fracture mechanics, ceramic component reliability, parallel computing, nondestructive evaluation, constitutive models and experimental capabilities, dynamic systems, fatigue and damage, wind turbines, hot section technology (HOST), aeroelasticity, structural mechanics codes, computational methods for dynamics, structural optimization, and applications of structural dynamics, and structural mechanics computer codes.

Source record↗

Lewis Structures Technology, 1988. Volume 3: Structural Integrity Fatigue and Fracture Wind Turbines HOST

The charter of the Structures Division is to perform and disseminate results of research conducted in support of aerospace engine structures. These results have a wide range of applicability to practioners of structural engineering mechanics beyond the aerospace arena. The specific purpose of the symposium was to familiarize the engineering structures community with the depth and range of research performed by the division and its academic and industrial partners. Sessions covered vibration control, fracture mechanics, ceramic component reliability, parallel computing, nondestructive evaluation, constitutive models and experimental capabilities, dynamic systems, fatigue and damage, wind turbines, hot section technology (HOST), aeroelasticity, structural mechanics codes, computational methods for dynamics, structural optimization, and applications of structural dynamics, and structural mechanics computer codes.

Source record↗