Results for “Mg(CoN)2” | Engineering Papers

DOE OSTI2020

Materials Data on Mg(CoN)2 by Materials Project

Mg(CoN)2 crystallizes in the tetragonal P-4m2 space group. The structure is two-dimensional and consists of one Mg(CoN)2 sheet oriented in the (0, 0, 1) direction. Mg2+ is bonded to four equivalent N3- atoms to form corner-sharing MgN4 tetrahedra. All Mg–N bond lengths are 2.18 Å. Co2+ is bonded in a linear geometry to two equivalent N3- atoms. Both Co–N bond lengths are 1.73 Å. N3- is bonded in a see-saw-like geometry to two equivalent Mg2+ and two equivalent Co2+ atoms.

36 MATERIALS SCIENCE↗

DOE OSTI2021

Effect of biochanin A on the rumen microbial community of Holstein steers consuming a high fiber diet and subjected to a subacute acidosis challenge

Subacute rumen acidosis (SARA) occurs when highly fermentable carbohydrates are introduced into the diet, decreasing pH and disturbing the microbial ecology of the rumen. Rumen amylolytic bacteria rapidly catabolize starch, fermentation acids accumulate in the rumen and reduce environmental pH. Historically, antibiotics ( e . g ., monensin, MON) have been used in the prevention and treatment of SARA. Biochanin A (BCA), an isoflavone produced by red clover ( Trifolium pratense ), mitigates changes associated with starch fermentation ex vivo . The objective of the study was to determine the effect of BCA on amylolytic bacteria and rumen pH during a SARA challenge. Twelve rumen fistulated steers were assigned to 1 of 4 treatments: HF CON (high fiber control), SARA CON, MON (200 mg d -1 ), or BCA (6 g d -1 ). The basal diet consisted of corn silage and dried distiller’s grains ad libitum . The study consisted of a 2-wk adaptation, a 1-wk HF period, and an 8-d SARA challenge (d 1–4: 40% corn; d 5–8: 70% cracked corn). Samples for pH and enumeration were taken on the last day of each period (4 h). Amylolytic, cellulolytic, and amino acid/peptide-fermenting bacteria (APB) were enumerated. Enumeration data were normalized by log transformation and data were analyzed by repeated measures ANOVA using the MIXED procedure of SAS. The SARA challenge increased total amylolytics and APB, but decreased pH, cellulolytics, and in situ DMD of hay (P < 0.05). BCA treatment counteracted the pH, microbiological, and fermentative changes associated with SARA challenge (P < 0.05). Similar results were also observed with MON (P < 0.05). These results indicate that BCA may be an effective alternative to antibiotics for mitigating SARA in cattle production systems.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2024

Physical origins of the varying performance and unusual transport behaviors among thermoelectric A Mg 2 Sb 2 materials ( A = Ca, Sr, Sm, Yb, and Mg)

Contrary to the similar thermoelectric performance among both AZn 2 Sb 2 and AMg 2 Bi 2 compounds, their isostructural counterparts, AMg 2 Sb 2 , can exhibit thermoelectric figure of merit values that vary by orders of magnitude with different A elements. Here, we reveal physical origins accounting for the significantly differing performance among AMg 2 Sb 2 -based compounds (A = Ca, Sr, Sm, Yb, and Mg) through comprehensive analyses, where it is shown that the dispar- ities in performance at the macroscale essentially originate from the widely varying activation energies that equal amounts of dopant can induce. Meanwhile, a few unusual transport behaviors regarding electrical conductivity, carrier concentration, or lattice thermal con- ductivity among these compounds have been identified, and we also present their rationales in depth. Furthermore, this mechanism-focused study can not only promote further understanding of the complex transport behaviors in condensed matter but be instrumental in rationally tun- ing the physical properties of materials as well.

36 MATERIALS SCIENCE↗

DOE OSTI2020

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗