Search NASA⌕ Search

SEARCH · Search NASA

Results for “methods - statistical”

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 847 records · Page 47

Nanodevice, method of making the same, and method of using the same

A nanodevice provides for electric-field control of magnon-QSD interactions. The nanodevice includes a ferroelectric substrate, a ferromagnetic material disposed over the ferroelectric substrate, and a nanodiamond including an ensemble of nitrogen-vacancy (NV) spins, each NV magnetically interfacing with the ferromagnetic material. An electric field is measured by applying a voltage across the ferroelectric substrate and the ferromagnetic material, changing a magnon excitation spectrum of the ferromagnetic material with respect to an electron spin resonance frequency of the ensemble of NV spins, and measuring a relaxation rate of the ensemble of NV spins.

Shalaev, Vladimir M.↗

Evaluation of image guided motion management methods in lung cancer radiotherapy

Purpose: To evaluate the accuracy and reliability of three target localization methods for image guided motion management in lung cancer radiotherapy. Methods: Three online image localization methods, including (1) 2D method based on 2D cone beam (CB) projection images, (2) 3D method using 3D cone beam CT (CBCT) imaging, and (3) 4D method using 4D CBCT imaging, have been evaluated using a moving phantom controlled by (a) 1D theoretical breathing motion curves and (b) 3D target motion patterns obtained from daily treatment of 3 lung cancer patients. While all methods are able to provide target mean position (MP), the 2D and 4D methods can also provide target motion standard deviation (SD) and excursion (EX). For each method, the detected MP/SD/EX values are compared to the analytically calculated actual values to calculate the errors. The MP errors are compared among three methods and the SD/EX errors are compared between the 2D and 4D methods. In the theoretical motion study (a), the dependency of MP/SD/EX error on EX is investigated with EX varying from 2.0 cm to 3.0 cm with an increment step of 0.2 cm. In the patient motion study (b), the dependency of MP error on target sizes (2.0 cm and 3.0 cm), motion patterns (four motions per patient) and EX variations is investigated using multivariant linear regression analysis. Results: In the theoretical motion study (a), the MP detection errors are −0.2 ± 0.2, −1.5 ± 1.1, and −0.2 ± 0.2 mm for 2D, 3D, and 4D methods, respectively. Both the 2D and 4D methods could accurately detect motion pattern EX (error < 1.2 mm) and SD (error < 1.0 mm). In the patient motion study (b), MP detection error vector (mm) with the 2D method (0.7 ± 0.4) is found to be significantly less than with the 3D method (1.7 ± 0.8,p < 0.001) and the 4D method (1.4 ± 1.0, p < 0.001) using paired t-test. However, no significant difference is found between the 4D method and the 3D method. Based on multivariant linear regression analysis, the variances of MP error in SI direction explained by target sizes, motion patterns, and EX variations are 9% with the 2D method, 74.4% with the 3D method, and 27% with the 4D method. The EX/SD detection errors are both < 1.0 mm for the 2D method and < 2.0 mm for the 4D method. Conclusions: The 2D method provides the most accurate MP detection regardless of the motion pattern variations, while its performance is limited by the accuracy of target identification in the projection images. The 3D method causes the largest error in MP determination, and its accuracy significantly depends on target sizes, motion patterns, and EX variations. The 4D method provides moderate MP detection results, while its accuracy relies on a regular motion pattern. In addition, the 2D and 4D methods both provide accurate measurement of the motion SD/EX, providing extra information for motion management.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Evaluation of intrinsic respiratory signal determination methods for 4D CBCT adapted for mice

Purpose: 4D CT imaging in mice is important in a variety of areas including studies of lung function and tumor motion. A necessary step in 4D imaging is obtaining a respiratory signal, which can be done through an external system or intrinsically through the projection images. A number of methods have been developed that can successfully determine the respiratory signal from cone-beam projection images of humans, however only a few have been utilized in a preclinical setting and most of these rely on step-and-shoot style imaging. The purpose of this work is to assess and make adaptions of several successful methods developed for humans for an image-guided preclinical radiation therapy system. Methods: Respiratory signals were determined from the projection images of free-breathing mice scanned on the X-RAD system using four methods: the so-called Amsterdam shroud method, a method based on the phase of the Fourier transform, a pixel intensity method, and a center of mass method. The Amsterdam shroud method was modified so the sharp inspiration peaks associated with anesthetized mouse breathing could be detected. Respiratory signals were used to sort projections into phase bins and 4D images were reconstructed. Error and standard deviation in the assignment of phase bins for the four methods compared to a manual method considered to be ground truth were calculated for a range of region of interest (ROI) sizes. Qualitative comparisons were additionally made between the 4D images obtained using each of the methods and the manual method. Results: 4D images were successfully created for all mice with each of the respiratory signal extraction methods. Only minimal qualitative differences were noted between each of the methods and the manual method. The average error (and standard deviation) in phase bin assignment was 0.24 ± 0.08 (0.49 ± 0.11) phase bins for the Fourier transform method, 0.09 ± 0.03 (0.31 ± 0.08) phase bins for the modified Amsterdam shroud method, 0.09 ± 0.02 (0.33 ± 0.07) phase bins for the intensity method, and 0.37 ± 0.10 (0.57 ± 0.08) phase bins for the center of mass method. Little dependence on ROI size was noted for the modified Amsterdam shroud and intensity methods while the Fourier transform and center of mass methods showed a noticeable dependence on the ROI size. Conclusions: The modified Amsterdam shroud, Fourier transform, and intensity respiratory signal methods are sufficiently accurate to be used for 4D imaging on the X-RAD system and show improvement over the existing center of mass method. The intensity and modified Amsterdam shroud methods are recommended due to their high accuracy and low dependence on ROI size.

60 APPLIED LIFE SCIENCES↗

Multi-scale calculation based on dual domain material point method combined with molecular dynamics

This dissertation combines the dual domain material point method (DDMP) with molecular dynamics (MD) in an attempt to create a multi-scale numerical method to simulate materials undergoing large deformations with high strain rates. In these types of problems, the material is often in a thermodynamically non-equilibrium state, and conventional constitutive relations are often not available. In this method, the closure quantities, such as stress, at each material point are calculated from a MD simulation of a group of atoms surrounding the material point. Rather than restricting the multi-scale simulation in a small spatial region, such as phase interfaces, or crack tips, this multi-scale method can be used to consider non-equilibrium thermodynamic e ects in a macroscopic domain. This method takes advantage that the material points only communicate with mesh nodes, not among themselves; therefore MD simulations for material points can be performed independently in parallel. First, using a one-dimensional shock problem as an example, the numerical properties of the original material point method (MPM), the generalized interpolation material point (GIMP) method, the convected particle domain interpolation (CPDI) method, and the DDMP method are investigated. Among these methods, only the DDMP method converges as the number of particles increases, but the large number of particles needed for convergence makes the method very expensive especially in our multi-scale method where we calculate stress in each material point using MD simulation. To improve DDMP, the sub-point method is introduced in this dissertation, which provides high quality numerical solutions with a very small number of particles. The multi-scale method based on DDMP with sub-points is successfully implemented for a one dimensional problem of shock wave propagation in a cerium crystal. The MD simulation to calculate stress in each material point is performed in GPU using CUDA to accelerate the computation. The numerical properties of the multiscale method are investigated as well as the results from this multi-scale calculation are compared of particles needed for convergence makes the method very expensive especially in our multi-scale method where we calculate stress in each material point using MD simulation. To improve DDMP, the sub-point method is introduced in this dissertation, which provides high quality numerical solutions with a very small number of particles. The multi-scale method based on DDMP with sub-points is successfully implemented for a one dimensional problem of shock wave propagation in a cerium crystal. The MD simulation to calculate stress in each material point is performed in GPU using CUDA to accelerate the computation. The numerical properties of the multiscale method are investigated as well as the results from this multi-scale calculation are compared with direct MD simulation results to demonstrate the feasibility of the method. Also, the multi-scale method is applied for a two dimensional problem of jet formation around copper notch under a strong impact.

74 ATOMIC AND MOLECULAR PHYSICS↗

Automated bone removal in CT angiography: Comparison of methods based on single energy and dual energy scans

Purpose: To evaluate dual energy based methods for bone removal in computed tomography angiography (CTA) images and compare these with single energy based methods that use an additional, nonenhanced, CT scan. Methods: Four different bone removal methods were applied to CT scans of an anthropomorphic thorax phantom, acquired with a second generation dual source CT scanner. The methods differed by the way information on the presence of bone was obtained (either by using an additional, nonenhanced scan or by scanning with two tube voltages at the same time) and by the way the bone was removed from the CTA images (either by masking or subtracting the bone). The phantom contained parts which mimic vessels of various diameters in direct contact with bone. Both a quantitative and qualitative analysis of image quality after bone removal was performed. Image quality was quantified by the contrast-to-noise ratio (CNR) normalized to the square root of the dose (CNRD). At locations where vessels touch bone, the quality of the bone removal and the vessel preservation were visually assessed. The dual energy based methods were assessed with and without the addition of a 0.4 mm tin filter to the high voltage x-ray tube filtration. For each bone removal method, the dose required to obtain a certain CNR after bone removal was compared with the dose of a reference scan with the same CNR but without automated bone removal. The CNRD value of the reference scan was maximized by choosing the lowest tube voltage available. Results: All methods removed the bone completely. CNRD values were higher for the masking based methods than for the subtraction based methods. Single energy based methods had a higher CNRD value than the corresponding dual energy based methods. For the subtraction based dual energy method, tin filtration improved the CNRD value with approximately 50%. For the masking based dual energy method, it was easier to differentiate between iodine and bone when tin filtration was applied. The CNRD value decreased only with 4% in that case. Compared to the dual scan based methods, the dual energy based methods had the advantage that only a single scan was made without the need of image registration. This might be easier to implement in clinical practice. Vessel preservation was better with bone subtraction than with bone masking. Smaller vessels were completely occluded by the bone mask. None of the bone removal methods was dose neutral. Conclusions: In general, dual scan based methods that use the lowest tube voltage available, have a higher CNR than the dual energy based approaches at the same dose level. Tin filtration improves the ability to differentiate between iodine and bone for the dual energy based masking method. In clinical practice, the advantages of the dual energy masking method might outweigh its disadvantage of a slightly higher dose penalty compared to the conventional dual scan masking method.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Practical dose point-based methods to characterize dose distribution in a stationary elliptical body phantom for a cone-beam C-arm CT system

Purpose: To propose new dose point measurement-based metrics to characterize the dose distributions and the mean dose from a single partial rotation of an automatic exposure control-enabled, C-arm-based, wide cone angle computed tomography system over a stationary, large, body-shaped phantom. Methods: A small 0.6 cm{sup 3} ion chamber (IC) was used to measure the radiation dose in an elliptical body-shaped phantom made of tissue-equivalent material. The IC was placed at 23 well-distributed holes in the central and peripheral regions of the phantom and dose was recorded for six acquisition protocols with different combinations of minimum kVp (109 and 125 kVp) and z-collimator aperture (full: 22.2 cm; medium: 14.0 cm; small: 8.4 cm). Monte Carlo (MC) simulations were carried out to generate complete 2D dose distributions in the central plane (z = 0). The MC model was validated at the 23 dose points against IC experimental data. The planar dose distributions were then estimated using subsets of the point dose measurements using two proposed methods: (1) the proximity-based weighting method (method 1) and (2) the dose point surface fitting method (method 2). Twenty-eight different dose point distributions with six different point number cases (4, 5, 6, 7, 14, and 23 dose points) were evaluated to determine the optimal number of dose points and their placement in the phantom. The performances of the methods were determined by comparing their results with those of the validated MC simulations. The performances of the methods in the presence of measurement uncertainties were evaluated. Results: The 5-, 6-, and 7-point cases had differences below 2%, ranging from 1.0% to 1.7% for both methods, which is a performance comparable to that of the methods with a relatively large number of points, i.e., the 14- and 23-point cases. However, with the 4-point case, the performances of the two methods decreased sharply. Among the 4-, 5-, 6-, and 7-point cases, the 7-point case (1.0% [±0.6%] difference) and the 6-point case (0.7% [±0.6%] difference) performed best for method 1 and method 2, respectively. Moreover, method 2 demonstrated high-fidelity surface reconstruction with as few as 5 points, showing pixelwise absolute differences of 3.80 mGy (±0.32 mGy). Although the performance was shown to be sensitive to the phantom displacement from the isocenter, the performance changed by less than 2% for shifts up to 2 cm in the x- and y-axes in the central phantom plane. Conclusions: With as few as five points, method 1 and method 2 were able to compute the mean dose with reasonable accuracy, demonstrating differences of 1.7% (±1.2%) and 1.3% (±1.0%), respectively. A larger number of points do not necessarily guarantee better performance of the methods; optimal choice of point placement is necessary. The performance of the methods is sensitive to the alignment of the center of the body phantom relative to the isocenter. In body applications where dose distributions are important, method 2 is a better choice than method 1, as it reconstructs the dose surface with high fidelity, using as few as five points.

60 APPLIED LIFE SCIENCES↗

Strong Stability Preserving Integrating Factor Two-Step Runge-Kutta Methods

In this report, problems with components that feature significantly different time scales, where the stiff time-step restriction comes from a linear component, implicit-explicit (IMEX) methods alleviate this restriction if the concern is linear stability. However, when nonlinear non-inner-product stability properties are of interest, such as in the evolution of hyperbolic partial differential equations with shocks or sharp gradients, linear inner-product stability is no longer sufficient for convergence, and so strong stability preserving (SSP) methods are often needed. Where the SSP property is needed, IMEX SSP Runge-Kutta (SSP-IMEX) methods have very restrictive time-steps. An alternative to SSP-IMEX schemes is to adopt an integrating factor approach to handle the linear component exactly and step the transformed problem forward using some time-evolution method. The strong stability properties of integrating factor Runge-Kutta methods were established in Isherwood et al. (SIAM J Numer Anal 56(6):3276–3307, 2018), where it was shown that it is possible to define explicit integrating factor Runge-Kutta methods that preserve strong stability properties satisfied by each of the two components when coupled with forward Euler time-stepping. It was proved that the solution will be SSP if the transformed problem is stepped forward with an explicit SSP Runge-Kutta method that has non-decreasing abscissas. However, explicit SSP Runge-Kutta methods have an order barrier of p=4, and sometimes higher order is desired. In this work we consider explicit SSP two-step Runge-Kutta integrating factor methods to raise the order. We show that strong stability is ensured if the two-step Runge-Kutta method used to evolve the transformed problem is SSP and has non-decreasing abscissas. We find such methods up to eighth order and present their SSP coefficients. Adding a step allows us to break the fourth order barrier on explicit SSP Runge-Kutta methods; furthermore, our explicit SSP two-step Runge-Kutta methods with non-decreasing abscissas typically have larger SSP coefficients than the corresponding one-step methods. A selection of our methods are tested for convergence and demonstrate the design order. We also show, for selected methods, that the SSP time-step predicted by the theory is a lower bound of the allowable time-step for linear and nonlinear problems that satisfy the total variation diminishing (TVD) condition. We compare some of the non-decreasing abscissa SSP two-step Runge-Kutta methods to previously found methods that do not satisfy this criterion on linear and nonlinear TVD test cases to show that this non-decreasing abscissa condition is indeed necessary in practice as well as theory. We also compare these results to our SSP integrating factor Runge-Kutta methods designed in Isherwood et al. (2018).

97 MATHEMATICS AND COMPUTING↗

Robustness of phase retrieval methods in x-ray phase contrast imaging: A comparison

Purpose: The robustness of the phase retrieval methods is of critical importance for limiting and reducing radiation doses involved in x-ray phase contrast imaging. This work is to compare the robustness of two phase retrieval methods by analyzing the phase maps retrieved from the experimental images of a phantom. Methods: Two phase retrieval methods were compared. One method is based on the transport of intensity equation (TIE) for phase contrast projections, and the TIE-based method is the most commonly used method for phase retrieval in the literature. The other is the recently developed attenuation-partition based (AP-based) phase retrieval method. The authors applied these two methods to experimental projection images of an air-bubble wrap phantom for retrieving the phase map of the bubble wrap. The retrieved phase maps obtained by using the two methods are compared. Results: In the wrap's phase map retrieved by using the TIE-based method, no bubble is recognizable, hence, this method failed completely for phase retrieval from these bubble wrap images. Even with the help of the Tikhonov regularization, the bubbles are still hardly visible and buried in the cluttered background in the retrieved phase map. The retrieved phase values with this method are grossly erroneous. In contrast, in the wrap's phase map retrieved by using the AP-based method, the bubbles are clearly recovered. The retrieved phase values with the AP-based method are reasonably close to the estimate based on the thickness-based measurement. The authors traced these stark performance differences of the two methods to their different techniques employed to deal with the singularity problem involved in the phase retrievals. Conclusions: This comparison shows that the conventional TIE-based phase retrieval method, regardless if Tikhonov regularization is used or not, is unstable against the noise in the wrap's projection images, while the AP-based phase retrieval method is shown in these experiments to be superior to the TIE-based method for the robustness in performing the phase retrieval.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

A Novel Coarsening Method for Scalable and Efficient Mesh Generation

In this paper, we propose a novel mesh coarsening method called brick coarsening method. The proposed method can be used in conjunction with any graph partitioners and scales to very large meshes. This method reduces problem space by decomposing the original mesh into fixed-size blocks of nodes called bricks, layered in a similar way to conventional brick laying, and then assigning each node of the original mesh to appropriate brick. Our experiments indicate that the proposed method scales to very large meshes while allowing simple RCB partitioner to produce higher-quality partitions with significantly less edge cuts. Our results further indicate that the proposed brick-coarsening method allows more complicated partitioners like PT-Scotch to scale to very large problem size while still maintaining good partitioning performance with relatively good edge-cut metric. Graph partitioning is an important problem that has many scientific and engineering applications in such areas as VLSI design, scientific computing, and resource management. Given a graph G = (V,E), where V is the set of vertices and E is the set of edges, (k-way) graph partitioning problem is to partition the vertices of the graph (V) into k disjoint groups such that each group contains roughly equal number of vertices and the number of edges connecting vertices in different groups is minimized. Graph partitioning plays a key role in large scientific computing, especially in mesh-based computations, as it is used as a tool to minimize the volume of communication and to ensure well-balanced load across computing nodes. The impact of graph partitioning on the reduction of communication can be easily seen, for example, in different iterative methods to solve a sparse system of linear equation. Here, a graph partitioning technique is applied to the matrix, which is basically a graph in which each edge is a non-zero entry in the matrix, to allocate groups of vertices to processors in such a way that many of matrix-vector multiplication can be performed locally on each processor and hence to minimize communication. Furthermore, a good graph partitioning scheme ensures the equal amount of computation performed on each processor. Graph partitioning is a well known NP-complete problem, and thus the most commonly used graph partitioning algorithms employ some forms of heuristics. These algorithms vary in terms of their complexity, partition generation time, and the quality of partitions, and they tend to trade off these factors. A significant challenge we are currently facing at the Lawrence Livermore National Laboratory is how to partition very large meshes on massive-size distributed memory machines like IBM BlueGene/P, where scalability becomes a big issue. For example, we have found that the ParMetis, a very popular graph partitioning tool, can only scale to 16K processors. An ideal graph partitioning method on such an environment should be fast and scale to very large meshes, while producing high quality partitions. This is an extremely challenging task, as to scale to that level, the partitioning algorithm should be simple and be able to produce partitions that minimize inter-processor communications and balance the load imposed on the processors. Our goals in this work are two-fold: (1) To develop a new scalable graph partitioning method with good load balancing and communication reduction capability. (2) To study the performance of the proposed partitioning method on very large parallel machines using actual data sets and compare the performance to that of existing methods. The proposed method achieves the desired scalability by reducing the mesh size. For this, it coarsens an input mesh into a smaller size mesh by coalescing the vertices and edges of the original mesh into a set of mega-vertices and mega-edges. A new coarsening method called brick algorithm is developed in this research. In the brick algorithm, the zones in a given mesh are first grouped into fixed size blocks called bricks. These brick are then laid in a way similar to conventional brick laying technique, which reduces the number of neighboring blocks each block needs to communicate. Contributions of this research are as follows: (1) We have developed a novel method that scales to a really large problem size while producing high quality mesh partitions; (2) We measured the performance and scalability of the proposed method on a machine of massive size using a set of actual large complex data sets, where we have scaled to a mesh with 110 million zones using our method. To the best of our knowledge, this is the largest complex mesh that a partitioning method is successfully applied to; and (3) We have shown that proposed method can reduce the number of edge cuts by as much as 65%.

97 MATHEMATICS AND COMPUTING↗

Pn-FEM Method for Solving the First-Order Neutron Transport Equation

A deterministic method was investigated and developed for the photon-neutron transport calculation for fusion reactor blanket. Firstly, considering the fact that the second order transport equation cannot describe void region accurately due to the appearance of zero total cross section in the denominator, the first order equation was selected as the starting point of the solution. The angular discretization uses the spherical harmonics (Pn) method. Although discrete ordinates (Sn) method has been most commonly applied due to its efficiency, it suffers from the ray effect. To describe unstructured geometry, the finite element method was used to discrete spatial variable. It is well known that Bubnov-Galerkin discretization of the first-order equation is inappropriate which will create oscillations. To obtain robust solutions, Petrov- Galerkin methods have been developed such as the Streamline-Upwind Petrov-Galerkin (SUPG) method and the Generalized Least-Squares (GLS) method. These methods require a stabilization term added to its test functions, which will incur additional computational cost. Another finite element formulation that usually used for first order equation is the Discontinuous-Galerkin (DG) method. In this method, each element has a unique and separate set of basis function. Then the adjacent elements can be connected by using the in-coming flux. Its main drawback is the number of unknowns, much larger than Continuous-Galerkin (CG) method. The Sub-Grid Scale (SGS) finite element method combines the advantages of CG and DG methods together. It inserts the DG method in each element to correct the CG solution, and provides numerically stable solution of first-order equation without increasing the number of unknowns. The boundary conditions and interface conditions for Pn method is a hard nut to crack. We use Riemann method to deal with this problem. It decomposes the neutron angular flux into in-coming and out-going information through an interface, and applies boundary condition to the in-coming one. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Self-consistent Kohn-Sham method based on the adiabatic-connection fluctuation-dissipation theorem and the exact-exchange kernel

A self-consistent Kohn-Sham method based on the adiabatic-connection fluctuation-dissipation (ACFD) theorem, employing the frequency-dependent exact exchange kernel f{sub x} is presented. The resulting SC-exact-exchange-only (EXX)-ACFD method leads to even more accurate correlation potentials than those obtained within the direct random phase approximation (dRPA). In contrast to dRPA methods, not only the Coulomb kernel but also the exact exchange kernel f{sub x} is taken into account in the EXX-ACFD correlation which results in a method that, unlike dRPA methods, is free of self-correlations, i.e., a method that treats exactly all one-electron systems, like, e.g., the hydrogen atom. The self-consistent evaluation of EXX-ACFD total energies improves the accuracy compared to EXX-ACFD total energies evaluated non-self-consistently with EXX or dRPA orbitals and eigenvalues. Reaction energies of a set of small molecules, for which highly accurate experimental reference data are available, are calculated and compared to quantum chemistry methods like Møller-Plesset perturbation theory of second order (MP2) or coupled cluster methods [CCSD, coupled cluster singles, doubles, and perturbative triples (CCSD(T))]. Moreover, we compare our methods to other ACFD variants like dRPA combined with perturbative corrections such as the second order screened exchange corrections or a renormalized singles correction. Similarly, the performance of our EXX-ACFD methods is investigated for the non-covalently bonded dimers of the S22 reference set and for potential energy curves of noble gas, water, and benzene dimers. The computational effort of the SC-EXX-ACFD method exhibits the same scaling of N{sup 5} with respect to the system size N as the non-self-consistent evaluation of only the EXX-ACFD correlation energy; however, the prefactor increases significantly. Reaction energies from the SC-EXX-ACFD method deviate quite little from EXX-ACFD energies obtained non-self-consistently with dRPA orbitals and eigenvalues, and the deviation reduces even further if the Coulomb kernel is scaled by a factor of 0.75 in the dRPA to reduce self-correlations in the dRPA correlation potential. For larger systems, such a non-self-consistent EXX-ACFD method is a competitive alternative to high-level wave-function-based methods, yielding higher accuracy than MP2 and CCSD methods while exhibiting a better scaling of the computational effort than CCSD or CCSD(T) methods. Moreover, EXX-ACFD methods were shown to be applicable in situation characterized by static correlation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗