Search NASA⌕ Search

SEARCH · Search NASA

Results for “Parallel 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,711 records · Page 95

ATDM LANL FleCSI: Topology and Execution Framework

FleCSI is a compile-time configurable C++ framework designed to support multi-physics application development. As such, FleCSI attempts to provide a very general set of infrastructure design patterns that can be specialized and extended to suit the needs of a broad variety of solver and data requirements. This means that FleCSI is potentially useful to many different ECP projects. Current support includes multidimensional mesh topology, mesh geometry, and mesh adjacency information, n-dimensional hashed-tree data structures, graph partitioning interfaces, and dependency closures (to identify data dependencies between distributed-memory address spaces). FleCSI introduces a functional programming model with control, execution, and data abstractions that are consistent with state-of-the-art task-based runtimes such as Legion and Charm++. The model also provides support for fine-grained, data-parallel execution with backend support for runtimes such as OpenMP and C++17. The FleCSI abstraction layer provides the developer with insulation from the underlying runtimes, while allowing support for multiple runtime systems, including conventional models like asynchronous MPI. The intent is to give developers a concrete set of user-friendly programming tools that can be used now, while allowing flexibility in choosing runtime implementations and optimizations that can be applied to architectures and runtimes that arise in the future. This project is essential to the ECP Ristra Next-Generation Code project, part of ASC ATDM, because it provides a hierarchically parallel programming model that is consistent with the design of modern system architectures, but which allows for the straightforward expression of algorithmic parallelism in a portably performant manner.

97 MATHEMATICS AND COMPUTING↗

AC Resistance Reduction Using Orthogonal Air Gaps in High-Frequency Inductors: Preprint

This paper presents a relatively simple technique to reduce winding losses due to fringing fields in high-frequency inductors. In high-frequency power electronics, ac inductor winding losses are affected by skin and proximity effects, including uneven current distribution due to fringing magnetic fields around airgaps. It is well known how fringing effects can be mitigated using distributed airgaps, at the expense of non-standard core or winding geometry. In planar magnetics, the orthogonal-airgap approach proposed in this paper combines airgaps in core segments parallel with the windings with conventionally placed airgaps in segments perpendicular to the windings. The approach is developed using a 1D analytical framework and validated by 2D finite-element simulations. Analytical guidelines are presented to optimize the airgaps to achieve minimum ac resistance. As a case study, a planar inductor is designed for an 8~kW SiC-based buck converter operating at 250~kHz. It is shown how the orthogonal airgaps result in more than 45\% reduction in ac resistance and substantially reduced inductor losses compared to the design using standard airgaps. The results are verified by loss measurements on an experimental converter prototype.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Tail queues: A multi-threaded matching architecture

As we approach exascale, computational parallelism will have to drastically increase in order to meet throughput targets. Many–core architectures have exacerbated this problem by trading reduced clock speeds, core complexity, and computation throughput for increasing parallelism. This presents two major challenges for communication libraries such as MPI: the library must leverage the performance advantages of thread level parallelism and avoid the scalability problems associated with increasing the number of processes to that scale. Hybrid programming models, such as MPI+X, have been proposed to address these challenges. MPI THREAD MULTIPLE is MPI's thread safe mode. While there has been work to optimize it, it largely remains non–performant in most implementations. While current applications avoid MPI multithreading due to performance concerns, it is expected to be utilized in future applications. One of the major synchronous data structures required by MPI is the matching engine. In this paper, we present a parallel matching algorithm that can improve MPI matching for multithreaded applications. We then perform a feasibility study to demonstrate the performance benefit of the technique.

97 MATHEMATICS AND COMPUTING↗

COMPOFF: A Compiler Cost model using Machine Learning to predict the Cost of OpenMP Offloading

The HPC industry is inexorably moving towards an era of extremely heterogeneous architectures, with more devices configured on any given HPC platform and potentially more kinds of devices, some of them highly specialized. Writing a separate code suitable for each target system for a given HPC application is not practical. The better solution is to use directive-based parallel programming models such as OpenMP. OpenMP provides a number of options for offloading a piece of code to devices like GPUs. To select the best option from such options during compilation, most modern compilers use analytical models to estimate the cost of executing the original code and the different offloading code variants. Building such an analytical model for compilers is a difficult task that necessitates a lot of effort on the part of a compiler engineer. Recently, machine learning techniques have been successfully applied to build cost models for a variety of compiler optimization problems. In this paper, we present COMPOFF, a cost model which uses the multi-layer perceptrons to statically estimates the Cost of OpenMP OFFloading. We used six different transformations on a parallel code of Wilson Dslash Operator to support GPU offloading, and we predicted their cost of execution on different GPUs using COMPOFF during compile time. Our results show that this model can predict offloading costs with a root mean squared error in prediction of less than 0.5 seconds. Our preliminary findings indicate that this work will make it much easier and faster for scientists and compiler developers to port legacy HPC applications that use OpenMP to new heterogeneous computing environment.

97 MATHEMATICS AND COMPUTING↗

Design consideration in constructing high performance embedded Knowledge-Based Systems (KBS)

As the hardware trends for artificial intelligence (AI) involve more and more complexity, the process of optimizing the computer system design for a particular problem will also increase in complexity. Space applications of knowledge based systems (KBS) will often require an ability to perform both numerically intensive vector computations and real time symbolic computations. Although parallel machines can theoretically achieve the speeds necessary for most of these problems, if the application itself is not highly parallel, the machine's power cannot be utilized. A scheme is presented which will provide the computer systems engineer with a tool for analyzing machines with various configurations of array, symbolic, scaler, and multiprocessors. High speed networks and interconnections make customized, distributed, intelligent systems feasible for the application of AI in space. The method presented can be used to optimize such AI system configurations and to make comparisons between existing computer systems. It is an open question whether or not, for a given mission requirement, a suitable computer system design can be constructed for any amount of money.

Dalton, Shelly D.↗

On the inference of viscoelastic constants from stress relaxation experiments

Several constitutive theories have been proposed in the literature to model the viscoelastic response of materials, including widely used rheological constitutive models. These models are characterized by certain parameters ("time constants") that define the time scales over which the material relaxes. These parameters are primarily obtained from stress relaxation experiments using curve-fitting techniques. However, the question of how best to estimate these time constants remains open. As a step towards answering this question, we propose an optimal experimental design approach based on ideas from information geometry, namely Fisher information and Kullback-Leibler divergence. The material is modeled as a spring element in parallel with multiple Maxwell elements and described using a one- or two-term Prony series. Treating the time constants as unknowns, we develop expressions for the Fisher information and Kullback-Leibler divergence that allow us to maximize information gain from experimental data. Based on the results of this study, we propose that the largest time constant estimated from a stress relaxation experiment for a linear viscoelastic material should be at most one-fifth of the total time of the experiment in order to maximize information gain. Our results also provide confirmation that the equilibrium modulus of the material cannot be reliably determined from curve-fitting to data from a stress relaxation experiment.

Fisher information↗

VLSI neuroprocessors

Electronic and optoelectronic hardware implementations of highly parallel computing architectures address several ill-defined and/or computation-intensive problems not easily solved by conventional computing techniques. The concurrent processing architectures developed are derived from a variety of advanced computing paradigms including neural network models, fuzzy logic, and cellular automata. Hardware implementation technologies range from state-of-the-art digital/analog custom-VLSI to advanced optoelectronic devices such as computer-generated holograms and e-beam fabricated Dammann gratings. JPL's concurrent processing devices group has developed a broad technology base in hardware implementable parallel algorithms, low-power and high-speed VLSI designs and building block VLSI chips, leading to application-specific high-performance embeddable processors. Application areas include high throughput map-data classification using feedforward neural networks, terrain based tactical movement planner using cellular automata, resource optimization (weapon-target assignment) using a multidimensional feedback network with lateral inhibition, and classification of rocks using an inner-product scheme on thematic mapper data. In addition to addressing specific functional needs of DOD and NASA, the JPL-developed concurrent processing device technology is also being customized for a variety of commercial applications (in collaboration with industrial partners), and is being transferred to U.S. industries. This viewgraph p resentation focuses on two application-specific processors which solve the computation intensive tasks of resource allocation (weapon-target assignment) and terrain based tactical movement planning using two extremely different topologies. Resource allocation is implemented as an asynchronous analog competitive assignment architecture inspired by the Hopfield network. Hardware realization leads to a two to four order of magnitude speed-up over conventional techniques and enables multiple assignments, (many to many), not achievable with standard statistical approaches. Tactical movement planning (finding the best path from A to B) is accomplished with a digital two-dimensional concurrent processor array. By exploiting the natural parallel decomposition of the problem in silicon, a four order of magnitude speed-up over optimized software approaches has been demonstrated.

Kemeny, Sabrina E.↗

A Parallel Cut-Cell Algorithm for the Free-Boundary Grad--Shafranov Problem

A parallel cut-cell algorithm is described to solve the free-boundary problem of the Grad--Shafranov equation. The algorithm reformulates the free-boundary problem in an irregular bounded domain and its important aspects include a searching algorithm for the magnetic axis and separatrix, a surface integral along the irregular boundary to determine the boundary values, an approach to optimize the coil current based on a targeting plasma shape, Picard iterations with Aitken's acceleration for the resulting nonlinear problem, and a Cartesian grid embedded boundary method to handle the complex geometry. Here the algorithm is implemented in parallel using a standard domain-decomposition approach and a good parallel scaling is observed. Numerical results verify the accuracy and efficiency of the free-boundary Grad--Shafranov solver.

97 MATHEMATICS AND COMPUTING↗

Applying Machine Learning to Understand Write Performance of Large-scale Parallel Filesystems

In high-performance computing (HPC), I/O performance prediction offers the potential to improve the efficiency of scientific computing. In particular, accurate prediction can make runtime estimates more precise, guide users toward optimal checkpoint strategies, and better inform facility provisioning and scheduling policies. HPC I/O performance is notoriously difficult to predict and model, however, in large part because of inherent variability and a lack of transparency in the behaviors of constituent storage system components. In this work we seek to advance the state of the art in HPC I/O performance prediction by (1) modeling the mean performance to address high variability, (2) deriving model features from write patterns, system architecture and system configurations, and (3) employing Lasso regression model to improve model accuracy. We demonstrate the efficacy of our approach by applying it to a crucial subset of common HPC I/O motifs, namely, file-per-process checkpoint write workloads. We conduct experiments on two distinct production HPC platforms—Titan at the Oak Ridge Leadership Computing Facility and Cetus at the Argonne Leadership Computing Facility—to train and evaluate our models. We find that we can attain ≤ 30% relative error for 92.79% and 99.64% of the samples in our test set on these platforms, respectively.

Xie, Bing↗

Benchmark Comparison of Cloud Analytics Methods Applied to Earth Observations

Earth Observation data are a vital resource for studying long term changes, but the large data volumes can be challenging to analyze. Time series analysis in particular is hampered by the typical thin-time-slice file organization. We examine several potential solutions inspired in large part by the data-parallel methods that have arisen with cloud computing. These solutions include various combinations of data re-organization, spatial indexing, distributed storage and pre-computation that we term "Analytics Optimized Data Stores" (AODS). We find that even simple solutions (such as a data cube) produce more than an order of magnitude improvement; the best provide two to three orders of magnitude improvement. The most performant solutions have tradeoffs in terms of generality or storage footprint, but may nonetheless be useful components in data analytics frameworks where performance is critical.

parallel processing (computers)↗

Effect of cell compression on the performance and the structure of proton exchange membrane water electrolyzer (PEMWE) assembly

Here, in the field of water electrolysis, the proton exchange membrane water electrolyzer (PEMWE) is currently the most advanced technology for producing hydrogen without emitting CO 2 . Although PEMWE plants are already in operation, further research is needed to improve cell efficiency and reduce the use of rare materials, such as iridium oxide catalysts for the oxygen evolution reaction (OER). One of the main causes of performance loss in PEMWE is the relatively low electric conductivity of the porous transport layer (PTL) and of the anode catalyst layer, which results in ohmic losses and low catalyst utilization during high current density operation. The objective of this study is to investigate how optimization of the PTL and electrode interface can increase the cell performance. To this end, we tested different cell assemblies using fibrous and sintered PTLs, decreasing membrane thickness, reducing iridium loading, and inserting a microporous layer to increase contact surface area. Electrochemical characterization of each cell configuration was systematically performed at various compression levels as the pressure is a crucial parameter influencing the electrode/PTL contact area. In parallel, X-ray microcomputed tomography (micro-CT) was employed to investigate the effects of cell hydration and compression on the structure of PEMWE components. This study combining electrochemistry and micro-CT imaging presents how optimizing the electrode/PTL contact surface area, minimizes ohmic losses, and enables PEMWE operation with low iridium loading at high current densities.

Catalyst - PTL interface↗

Deep Gaussian process-based cost-aware batch Bayesian optimization for complex materials design campaigns

The accelerating pace and expanding scope of materials discovery demand optimization frameworks that efficiently navigate vast design spaces with complex response surfaces while judiciously allocating limited evaluation resources. We present a cost-aware, batch Bayesian optimization scheme powered by deep Gaussian process (DGP) surrogates and a heterotopic querying strategy. Our DGP surrogate, formed by stacking GP layers, models complex hierarchical relationships among high-dimensional compositional features and captures correlations across multiple target properties, propagating uncertainty through successive layers. We integrate evaluation cost into an upper-confidence-bound acquisition extension, which, together with heterotopic querying, proposes small batches of candidates in parallel, balancing exploration of under-characterized regions with exploitation of high-mean, low-variance predictions across correlated properties. Applied to refractory high-entropy alloys for high-temperature applications, our framework converges to optimal formulations in fewer iterations with cost-aware queries than conventional GP-based BO, highlighting the value of deep, uncertainty-aware, cost-sensitive strategies in materials campaigns.

36 MATERIALS SCIENCE↗

Synthesis, structural and electrical properties of a new cobalt arsenate NaCo{sub 2}As{sub 3}O{sub 10}

The title compound sodium dicobalt triarsenate NaCo{sub 2}As{sub 3}O{sub 10} has been synthesized by solid state reaction. Crystal structure and electrical properties were studied by X-ray diffraction and complex impedance spectroscopy, respectively. The obtained structural model is supported by charge-distribution (CHARDI) analysis and bond-valence-sum (BVS) validations tools. The structure (triclinic, P−1, a=6.800 (8) Å, b=7.816 (9) Å, c=8.718 (3) Å, α=108.03 (2)°, β=108.48 (3)°, γ=100.11 (2)°) can be described as a three-dimensional framework resulted from corner-connection between cobalt metallic chains running along [−110] and As{sub 3}O{sub 10} groups; the negative charge is balanced by Na{sup +} ions which house the two tunnels parallel to a and b axes. Ball milling was used as mechanical means to reduce the particles sizes of the synthesized powder. At the optimal sintering temperature of 650 °C, 85% of the relative density was obtained. The conductivity measurements show that NaCo{sub 2}As{sub 3}O{sub 10} is a cationic conductor with an activation energy of 0.48 eV and a conductivity of σ=1.2×10{sup −5} S cm{sup −1} at 310 °C. The BVS model is extended to simulate the ionic migration pathways of alkali cations in the anionic framework. - Graphical abstract: 1D pathways link Na atoms along the a-axis with bond valence mismatch |ΔV(Na)|=0.64 v.u. - Highlights: • A new single crystal NaCo{sub 2}As{sub 3}O{sub 10} was grown by solid state reaction and its structure determined by single-crystal X-ray diffraction. • The purity of the powder sample was verified by Rietveld refinement. • The CIS measurements were optimized and the obtained spectra were fitted by electrical equivalent circuits. • The conduction pathways for Na{sup +} cations are simulated by means of the bond valence sum model.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Digital Time-Resolved Spot Diagnostic

The digital time-resolved spot diagnostic (D-TRSD) is intended to be a fast-response, time-dependent beam diagnostic for measuring the spot size emitted from radiographic x-ray sources. It will measure spot sizes from submillimeters up to several millimeters for photon energies in the range of 150 keV to 20 MeV with doses as low as 0.03 rad up to 500 rad. The D-TRSD performs fast data acquisition as radiographic x-ray sources typically produce pulses in the tens of nanosecond ranges. The system will be optimized to capture multiple individual pulses in time within the same data record. The data collected will be used to support beam tuning and source optimization with on-the-fly evaluation of radiographic source performance. The diagnostic is based on penumbral imaging techniques. A scintillating fiber array of parallel aligned fibers is positioned in the beam path with a high-Z rolled edge inserted between the source and the array, thereby creating the penumbral x-ray signal that is captured by the D-TRSD system. The light from the scintillation conversion is recorded by individual avalanche photodiode detectors integrated into custom digitizer electronics. The penumbra is used to calculate the spot of the beam on the axis orthogonal to the fiber array based on the magnification from the rolled edge, the resolution of the spaced fibers, and the rotation of the array normal to the beam path. Many arrays can be used to capture additional spot widths about different rotations. The D-TRSD system is modular, software-driven, and easier to use than legacy TRSD systems.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Xavier: High-Performance X-Drop Adaptive Banded Pairwise Alignment (Xavier) v1.0

Pairwise sequence alignment is one of the most compute-intense challenges for the analysis of genomics data and it can account for more than 90% of the runtime depending on the application. Despite the effort to reduce the computational cost introducing heuristics such as banded and x-drop alignment, the performance of state-of-the-art software is often unsatisfactory for long sequences. Recent advances in single-molecule sequencing technologies keep increasing the length of the sequences to align at the cost of higher error rates b ranging from 5% to 15% b, emphasizing the need for fast and accurate software. Our long-read alignment software, named Xavier, computes high-performance x-drop adaptive banded pairwise alignment exploiting instruction-level parallelism via Single-Instruction-Multiple-Data (SIMD) operations. Xavier uses a narrow bandwidth that appreciably improves performance reducing the search space for the optimal alignment. In our experiment, the adaptive mechanism enables Xavier to find the optimal alignment between related sequences even when the error rate is as high as 50%. Xavier achieves speed-up up to 5X over competitor software when enabling the x-drop termination and up to 415X when disabling it, with negligible accuracy loss.

Guidi, Giulia↗

HydraGNN_Predictive_GFM_2024 - Ensemble of predictive graph foundation models for ground state atomistic materials modeling

We provide the ensemble of fifteen pre-trained graph foundation models (GFMs) for atomistic materials modeling applications. Each one of the fifteen GFMs has been trained on five open-source datasets that (once aggregated) amount to over 154 million atomistic structures, which cover over two-thirds of the natural elements of the periodic table and that comprises a broad set of organic and inorganic compounds. This vast set of atomistic structures comprises ground state configurations that are dynamically stable (i.e., equilibrated structures with atomic forces approximately close to zero values) as well as dynamically unstable structures (i.e., non-equilibrium structures with non-negligible non-zero values of atomic forces). The ensemble of datasets aggregated does NOT include excited states. The datasets have been curated to remove atomistic structures with spectral norm of the force tensor above 100 eV/angstrom. Moreover, a linear term of the energy was computed for each dataset using a linear regression model that uses the chemical concentration of each natural element as regressor. The linear term predicted by the linear regression model has been subtracted from each original energy value to perform a re-alignment of the energy values across different electronic structures approximation theories performed to generate the diverse multi-source, multi-fidelity datasets. The folder "ADIOS_files" contains the set of pre-processed datasets in Adaptable I/O System (ADIOS) format (https://www.exascaleproject.org/research-project/adios/) that have been used for the development and training of GFMs in this work. The "ADIOS_files" directory contains 6 sub-directories named as follows: - ANI1x-v3.bp - MPTrj-v3.bp - OC2020-20M-v3.bp - OC2020-v3.bp - OC2022-v3.bp - qm7x-v3.bp Each sub-directory contains the pre-processed datasets converted in Adaptable I/O System (ADIOS) format (https://www.exascaleproject.org/research-project/adios/) that have been used to the development, training, and performance testing of the ensemble go predictive graph foundation models. Each GFM was developed using HydraGNN (https://github.com/ORNL/HydraGNN) as underlying graph neural network (GNN) architecture. The multi-task learning (MTL) capability of HydraGNN was used to simultaneously train the GFMs on labeled values for direct predictions of energy (a total system property of an atomistic structure that measures the chemical stability) and atomic forces (an atomic level property of an atomistic structure that measures the dynamical stability). The hyper parameters of the GFM have been tuned using scalable hyperparameter optimization (HPO) algorithms implemented in the software DeepHyper (https://github.com/deephyper/deephyper). The pre-training of each HPO trial was performed using distributed data parallelism (DDP) to scale the training across 128 compute nodes of the exascale OLCF supercomputer Frontier. Each HPO trial was trained only for 10 epochs and an early stopping was performed to avoid wasting significant computational resources on GNN architectures that were clearly underperforming. For each HPO trial, the 'omnistat' tool developed by (AMD Research - Advanced Micro Device) was used to measure the total energy consumption in kWh. The ensemble of GFMs was obtained by selecting the fifteen best performing HPO trials. Four models have been selected for their clear advantage in accuracy, and these are the GFMs with IDs 229, 156, 147, 260. Additional eleven models have been selected based on judicious balance between accuracy and energy consumption needed for training, and these are the GFMs with IDs 165, 78, 137, 1, 175, 171, 181, 67, 179, 167, 351. Each selected GFM of the ensemble was continued to cumulate a total of at most 30 epochs. In some cases, the total number of epochs actually performed was les than 30 due to two combined factors: (1) the size of the GFM (i.e., the number of model parameters to train) and (2) the total wall-clock time for which the computational resources could be allocated on OLCF-Frontier. The "Ensemble_of_models" directory contains 15 sub-directories named as follows: - gfm_0.229 - gfm_0.156 - gfm_0.147 - gfm_0.260 - gfm_0.165 - gfm_0.78 - gfm_0.137 - gfm_0.1 - gfm_0.175 - gfm_0.171 - gfm_0.181 - gfm_0.67 - gfm_0.179 - gfm_0.167 - gfm_0.351 Each one of these sub-directories refers to one of the fifteen HPO trials that have been selected to continue the pre-training with at most 30 epochs. With each sub-directory associated with a specific HPO trial, the following files can be found: - config.json: file for argument parsing to develop and train an HydraGNN architecture - gfm_0.ID_epoch_N.pk: file with model parameters for HPO ID trial after N epochs of training The ensemble of fifteen GFM architectures was used for (1) ensemble averaging to stabilize the predictions of energy and atomic forces after pre-training for post-processing analysis and (2) ensemble uncertainty quantification (UQ). The code used to develop, pre-train, and load the pre-trained models for post-processing analysis is available on the ORNL-GitHub at the following link: https://github.com/ORNL/HydraGNN/tree/Predictive_GFM_2024

36 MATERIALS SCIENCE↗

A mechanical reduced order model for elastomeric 3D printed architectures

Direct ink writing of silicone elastomers enables printing with precise control of porosity and mechanical properties of ordered cellular solids, suitable for shock absorption and stress mitigation applications. With the ability to manipulate structure and feedstock stiffness, the design space becomes challenging to parse to obtain a solution producing a desired mechanical response. We derive an analytical design approach for a specific architecture. Results from finite element simulations and quasi-static mechanical tests of two different parallel strand architectures were analyzed to understand the structure-property relationships under uniaxial compression. Combining effective stiffness-density scaling with least squares optimization of the stress responses yielded general response curves parameterized by resin modulus and strand spacing. An analytical expression of these curves serves as a reduced order model, which, when optimized, provides a rapid design capability for filament-based 3D printed structures. Finally, as a demonstration, the optimal design of a face-centered tetragonal architecture is computed that satisfies prescribed minimum and maximum load constraints.

36 MATERIALS SCIENCE↗

Universal Design Curves for Elastomeric Direct Ink-Writing Architectures

Direct ink writing of silicone elastomers enables printing with precise control of porosity and mechan- ical properties of ordered cellular solids, suitable for shock absorption and stress mitigation applications. With the ability to manipulate structure and feedstock stiffness, the design space becomes challenging to parse to obtain a solution producing a desired mechanical response. Here we derive an analytical design approach for a specific architecture. Results from finite element simulations and quasi-static mechanical tests of two different parallel strand architectures were analyzed to understand the structure-property relationships under compressive strain. Combining effective stiffness-density scaling with least squares optimization of the stress responses yielded general response curves parameterized by resin modulus and strand spacing. An analytical expression of these curves serves as a reduced order model, which, when optimized, provides a rapid design capability for filament-based 3D printed structures. As a demonstration, the optimal design of a face-centered tetragonal architecture is computed that satisfies prescribed minimum and maximum load constraints.

36 MATERIALS SCIENCE↗