Search NASA⌕ Search

SEARCH · Search NASA

Results for “Randomized methods”

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,063 records · Page 59

Comparing Individualized Survival Predictions From Random Survival Forests and Multistate Models in the Presence of Missing Data: A Case Study of Patients With Oropharyngeal Cancer

Background: In recent years, interest in prognostic calculators for predicting patient health outcomes has grown with the popularity of personalized medicine. These calculators, which can inform treatment decisions, employ many different methods, each of which has advantages and disadvantages. Methods: We present a comparison of a multistate model (MSM) and a random survival forest (RSF) through a case study of prognostic predictions for patients with oropharyngeal squamous cell carcinoma. The MSM is highly structured and takes into account some aspects of the clinical context and knowledge about oropharyngeal cancer, while the RSF can be thought of as a black-box non-parametric approach. Key in this comparison are the high rate of missing values within these data and the different approaches used by the MSM and RSF to handle missingness. Results: We compare the accuracy (discrimination and calibration) of survival probabilities predicted by both approaches and use simulation studies to better understand how predictive accuracy is influenced by the approach to (1) handling missing data and (2) modeling structural/disease progression information present in the data. We conclude that both approaches have similar predictive accuracy, with a slight advantage going to the MSM. Conclusions: Although the MSM shows slightly better predictive ability than the RSF, consideration of other differences are key when selecting the best approach for addressing a specific research question. These key differences include the methods’ ability to incorporate domain knowledge, and their ability to handle missing data as well as their interpretability, and ease of implementation. Ultimately, selecting the statistical method that has the most potential to aid in clinical decisions requires thoughtful consideration of the specific goals.

60 APPLIED LIFE SCIENCES↗

A multilevel stochastic collocation method for SPDEs

We present a multilevel stochastic collocation method that, as do multilevel Monte Carlo methods, uses a hierarchy of spatial approximations to reduce the overall computational complexity when solving partial differential equations with random inputs. For approximation in parameter space, a hierarchy of multi-dimensional interpolants of increasing fidelity are used. Rigorous convergence and computational cost estimates for the new multilevel stochastic collocation method are derived and used to demonstrate its advantages compared to standard single-level stochastic collocation approximations as well as multilevel Monte Carlo methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Latest developments in seismic texture analysis for subsurface structure, facies, and reservoir characterization: A review

In exploration geology and geophysics, seismic texture is still a developing concept that has not been sufficiently known, although quite a number of different algorithms have been published in the literature. This paper provides a review of the seismic texture concepts and methodologies, focusing on latest developments in seismic amplitude texture analysis, with particular reference to the gray level co-occurrence matrix (GLCM) and the texture model regression (TMR) methods. The GLCM method evaluates spatial arrangements of amplitude samples within an analysis window using a matrix (a two-dimensional histogram) of amplitude co-occurrence. The matrix is then transformed into a suite of texture attributes, such as homogeneity, contrast, and randomness, which provide the basis for seismic facies classification. The TMR method uses a texture model as reference to discriminate among seismic features based on a linear, least-squares regression analysis between the model and the data within an analysis window. By implementing customized texture model schemes, the TMR algorithm has the flexibility to characterize subsurface geology for different purposes. A texture model with a constant phase is effective at enhancing the visibility of seismic structural fabrics, a texture model with a variable phase is helpful for visualizing seismic facies, and a texture model with variable amplitude, frequency, and size is instrumental in calibrating seismic to reservoir properties. Preliminary test case studies in the very recent past have indicated that the latest developments in seismic texture analysis have added to the existing amplitude interpretation theories and methodologies. These and future developments in seismic texture theory and methodologies will hopefully lead to a better understanding of the geologic implications of the seismic texture concept and to an improved geologic interpretation of reflection seismic amplitude

58 GEOSCIENCES↗

Probabilistic models for stochastic elliptic partial differential equations

Mathematical requirements that the random coefficients of stochastic elliptical partial differential equations must satisfy such that they have unique solutions have been studied extensively. Yet, additional constraints that these coefficients must satisfy to provide realistic representations for physical quantities, referred to as physical requirements, have not been examined systematically. It is shown that current models for random coefficients constructed solely by mathematical considerations can violate physical constraints and, consequently, be of limited practical use. We develop alternative models for the random coefficients of stochastic differential equations that satisfy both mathematical and physical constraints. Theoretical arguments are presented to show potential limitations of current models and establish properties of the models developed in this study. Numerical examples are used to illustrate the construction of the proposed models, assess the performance of these models, and demonstrate the sensitivity of the solutions of stochastic differential equations to probabilistic characteristics of their random coefficients.

97 MATHEMATICS AND COMPUTING↗

Estimating epistemic uncertainty in soil parameters for nonlinear site response analyses: Introducing the Latin Hypercube Sampling technique

This study quantifies the effects of epistemic uncertainty in soil parameters on nonlinear (NL) site response analysis (SRA) results, validated against the data recorded at a well-instrumented geotechnical downhole array located in Japan. To this end, a one-dimensional soil column model of the Service Hall Array (SHA) near the Kashiwazaki-Kariwa Nuclear Power Plant (KKNPP) is developed using the finite element (FE) program LS-DYNA. The dynamic stress–strain relationship is characterized by a modified two-stage hyperbolic (MTH) NL backbone curve formulation capable of capturing soil behavior at both small- and large-shear strains. The model is then validated against the ground motion recordings to capture the model bias. The uncertainties associated with the shear-wave velocity profile (a small-strain soil property) and soil shear strength (a large-strain soil property) are incorporated in NL SRA to quantify their separate and joint randomization effects on the results. This study proposes using the Latin Hypercube Sampling (LHS) method as an efficient alternative to commonly used methods, such as Standard Monte Carlo (SMC), to account for uncertainty propagation in such reliability analysis. Both low-intensity and design-level records from the recordings at the SHA are applied to study the contribution of the small- and large-strain NL dynamic soil properties. Results from 46,200 NL FE analyses (23,100 per input motion) are presented. Measured and predicted site response, using recorded ground motions at this downhole array, is compared to assess the significance of soil parameter uncertainty on the observed ground motion dispersions. It is demonstrated that increasing the number of soft realizations and implementing higher level earthquake intensity lead to higher ground motion dispersion. Unlike past studies in randomization of Vs profiles with the SMC method, the LHS method is shown to have no significant effect on the predicted median surface response spectra and amplification factors (AFs) for this case study.

Engineering↗

Multi-field inflation with random potentials: field dimension, feature scale and non-Gaussianity

We explore the super-horizon evolution of the two-point and three-point correlation functions of the primordial density perturbation in randomly-generated multi-field potentials. We use the Transport method to evolve perturbations and give full evolutionary histories for observables. Identifying the separate universe assumption as being analogous to a geometrical description of light rays, we give an expression for the width of the bundle, thereby allowing us to monitor evolution towards the adiabatic limit, as well as providing a useful means of understanding the behaviour in f{sub NL}. Finally, viewing our random potential as a toy model of inflation in the string landscape, we build distributions for observables by evolving trajectories for a large number of realisations of the potential and comment on the prospects for testing such models. We find the distributions for observables to be insensitive to the number of fields over the range 2 to 6, but that these distributions are highly sensitive to the scale of features in the potential. Most sensitive to the scale of features is the spectral index, with more than an order of magnitude increase in the dispersion of predictions over the range of feature scales investigated. Least sensitive was the non-Gaussianity parameter f{sub NL}, which was consistently small; we found no examples of realisations whose non-Gaussianity is capable of being observed by any planned experiment.

79 ASTRONOMY AND ASTROPHYSICS↗

Attainability analysis in stochastic controlled systems

A control problem for stochastically forced nonlinear continuous-time systems is considered. We propose a method for construction of the regulator that provides a preassigned probabilistic distribution of random states in stochastic equilibrium. Geometric criteria of the controllability are obtained. Constructive technique for the specification of attainability sets is suggested.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Artificial intelligence based analysis of nanoindentation load–displacement data using a genetic algorithm

In this work, we developed an automated tool, Nanoindentation Neo package for the analysis of nanoindentation load–displacement curves using a Genetic Algorithm (GA) applied to the Oliver-Pharr method (Oliver et al.,1992). For some materials, such as polycrystalline isotropic graphites, Least Squares Fitting (LSF) of the unload curve can produce unrealistic fit parameters. These graphites exhibit sharply peaked unloading curves not easily fit using the LSF, which tends to overestimate the indenter tip geometry parameter. To tackle this problem, we extended our general materials characterization tool Neo for EXAFS analysis (Terry et al., 2021) to fit nanoindentation data. Nanoindentation Neo automatically processes and analyzes nanoindentation data with minimal user input while producing meaningful fit parameters. GA, a robust metaheuristic method, begins with a population of temporary solutions using model parameters called chromosomes; from these we evaluate a fitness value for each solution, and select the best solutions to mix with random solutions producing the next generation. A mutation operator then modifies existing solutions by random perturbations, and the optimal solution is selected. We tested the GA method using Silica and Al reference standards. We fit samples of graphite and a high entropy alloy (HEA) consisting of BCC and FCC phases.

42 ENGINEERING↗

Statistical CT noise reduction with multiscale decomposition and penalized weighted least squares in the projection domain

Purposes: The suppression of noise in x-ray computed tomography (CT) imaging is of clinical relevance for diagnostic image quality and the potential for radiation dose saving. Toward this purpose, statistical noise reduction methods in either the image or projection domain have been proposed, which employ a multiscale decomposition to enhance the performance of noise suppression while maintaining image sharpness. Recognizing the advantages of noise suppression in the projection domain, the authors propose a projection domain multiscale penalized weighted least squares (PWLS) method, in which the angular sampling rate is explicitly taken into consideration to account for the possible variation of interview sampling rate in advanced clinical or preclinical applications. Methods: The projection domain multiscale PWLS method is derived by converting an isotropic diffusion partial differential equation in the image domain into the projection domain, wherein a multiscale decomposition is carried out. With adoption of the Markov random field or soft thresholding objective function, the projection domain multiscale PWLS method deals with noise at each scale. To compensate for the degradation in image sharpness caused by the projection domain multiscale PWLS method, an edge enhancement is carried out following the noise reduction. The performance of the proposed method is experimentally evaluated and verified using the projection data simulated by computer and acquired by a CT scanner. Results: The preliminary results show that the proposed projection domain multiscale PWLS method outperforms the projection domain single-scale PWLS method and the image domain multiscale anisotropic diffusion method in noise reduction. In addition, the proposed method can preserve image sharpness very well while the occurrence of 'salt-and-pepper' noise and mosaic artifacts can be avoided. Conclusions: Since the interview sampling rate is taken into account in the projection domain multiscale decomposition, the proposed method is anticipated to be useful in advanced clinical and preclinical applications where the interview sampling rate varies.

60 APPLIED LIFE SCIENCES↗

Root identification in minirhizotron imagery with multiple instance learning

In this study, multiple instance learning (MIL) algorithms to automatically perform root detection and segmentation in minirhizotron imagery using only image-level labels are proposed. Root and soil characteristics vary from location to location, and thus, supervised machine learning approaches that are trained with local data provide the best ability to identify and segment roots in minirhizotron imagery. However, labeling roots for training data (or otherwise) is an extremely tedious and time-consuming task. This paper aims to address this problem by labeling data at the image level (rather than the individual root or root pixel level) and train algorithms to perform individual root pixel level segmentation using MIL strategies. Three MIL methods (multiple instance adaptive cosine coherence estimator, multiple instance support vector machine, multiple instance learning with randomized trees) were applied to root detection and compared to non-MIL approaches. The results show that MIL methods improve root segmentation in challenging minirhizotron imagery and reduce the labeling burden. In our results, multiple instance support vector machine outperformed other methods. The multiple instance adaptive cosine coherence estimator algorithm was a close second with an added advantage that it learned an interpretable root signature which identified the traits used to distinguish roots from soil and did not require parameter selection.

59 BASIC BIOLOGICAL SCIENCES↗

PlasmidHostFinder: Prediction of Plasmid Hosts Using Random Forest

Plasmids play a major role facilitating the spread of antimicrobial resistance between bacteria. Understanding the host range and dissemination trajectories of plasmids is critical for surveillance and prevention of antimicrobial resistance. Identification of plasmid host ranges could be improved using automated pattern detection methods compared to homology-based methods due to the diversity and genetic plasticity of plasmids. In this study, we developed a method for predicting the host range of plasmids using machine learning—specifically, random forests. We trained the models with 8,519 plasmids from 359 different bacterial species per taxonomic level; the models achieved Matthews correlation coefficients of 0.662 and 0.867 at the species and order levels, respectively. Our results suggest that despite the diverse nature and genetic plasticity of plasmids, our random forest model can accurately distinguish between plasmid hosts. This tool is available online through the Center for Genomic Epidemiology (https://cge.cbs.dtu.dk/services/PlasmidHostFinder/).

59 BASIC BIOLOGICAL SCIENCES↗

SU-C-207B-05: Tissue Segmentation of Computed Tomography Images Using a Random Forest Algorithm: A Feasibility Study

Purpose: Develop an automated Random Forest algorithm for tissue segmentation of CT examinations. Methods: Seven materials were classified for segmentation: background, lung/internal gas, fat, muscle, solid organ parenchyma, blood/contrast, and bone using Matlab and the Trainable Weka Segmentation (TWS) plugin of FIJI. The following classifier feature filters of TWS were investigated: minimum, maximum, mean, and variance each evaluated over a pixel radius of 2n, (n = 0–4). Also noise reduction and edge preserving filters, Gaussian, bilateral, Kuwahara, and anisotropic diffusion, were evaluated. The algorithm used 200 trees with 2 features per node. A training data set was established using an anonymized patient’s (male, 20 yr, 72 kg) chest-abdomen-pelvis CT examination. To establish segmentation ground truth, the training data were manually segmented using Eclipse planning software, and an intra-observer reproducibility test was conducted. Six additional patient data sets were segmented based on classifier data generated from the training data. Accuracy of segmentation was determined by calculating the Dice similarity coefficient (DSC) between manual and auto segmented images. Results: The optimized autosegmentation algorithm resulted in 16 features calculated using maximum, mean, variance, and Gaussian blur filters with kernel radii of 1, 2, and 4 pixels, in addition to the original CT number, and Kuwahara filter (linear kernel of 19 pixels). Ground truth had a DSC of 0.94 (range: 0.90–0.99) for adult and 0.92 (range: 0.85–0.99) for pediatric data sets across all seven segmentation classes. The automated algorithm produced segmentation with an average DSC of 0.85 ± 0.04 (range: 0.81–1.00) for the adult patients, and 0.86 ± 0.03 (range: 0.80–0.99) for the pediatric patients. Conclusion: The TWS Random Forest auto-segmentation algorithm was optimized for CT environment, and able to segment seven material classes over a range of body habitus and CT protocol parameters with an average DSC of 0.86 ± 0.04 (range: 0.80–0.99).

60 APPLIED LIFE SCIENCES↗

Implementation and testing of the on-the-fly thermal scattering Monte Carlo sampling method for graphite and light water in MCNP6

Here, a proper treatment of thermal neutron scattering requires accounting for chemical binding through a scattering law S(α,β,T). Monte Carlo codes sample the secondary neutron energy and angle after a thermal scattering event from probability tables generated from S(α,β,T) tables at discrete temperatures, requiring a large amount of data for multiscale and multiphysics problems with detailed temperature gradients. We have previously developed a method to handle this temperature dependence on-the-fly during the Monte Carlo random walk using polynomial expansions in 1/T to directly sample the secondary energy and angle. In this paper, the on-the-fly method is implemented into MCNP6 and tested in both graphite-moderated and light water-moderated systems. The on-the-fly method is compared with the thermal ACE libraries that come standard with MCNP6, yielding good agreement with integral reactor quantities like k-eigenvalue and differential quantities like single-scatter secondary energy and angle distributions. The simulation runtimes are comparable between the two methods (on the order of 5–15% difference for the problems tested) and the on-the-fly fit coefficients only require 5–15 MB of total data storage.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Risk of Late Toxicity in Men Receiving Dose-Escalated Hypofractionated Intensity Modulated Prostate Radiation Therapy: Results From a Randomized Trial

Objective: To report late toxicity outcomes from a randomized trial comparing conventional and hypofractionated prostate radiation therapy and to identify dosimetric and clinical parameters associated with late toxicity after hypofractionated treatment. Methods and Materials: Men with localized prostate cancer were enrolled in a trial that randomized men to either conventionally fractionated intensity modulated radiation therapy (CIMRT, 75.6 Gy in 1.8-Gy fractions) or to dose-escalated hypofractionated IMRT (HIMRT, 72 Gy in 2.4-Gy fractions). Late (≥90 days after completion of radiation therapy) genitourinary (GU) and gastrointestinal (GI) toxicity were prospectively evaluated and scored according to modified Radiation Therapy Oncology Group criteria. Results: 101 men received CIMRT and 102 men received HIMRT. The median age was 68, and the median follow-up time was 6.0 years. Twenty-eight percent had low-risk, 71% had intermediate-risk, and 1% had high-risk disease. There was no difference in late GU toxicity in men treated with CIMRT and HIMRT. The actuarial 5-year grade ≥2 GU toxicity was 16.5% after CIMRT and 15.8% after HIMRT (P=.97). There was a nonsignificant numeric increase in late GI toxicity in men treated with HIMRT compared with men treated with CIMRT. The actuarial 5-year grade ≥2 GI toxicity was 5.1% after CIMRT and 10.0% after HIMRT (P=.11). In men receiving HIMRT, the proportion of rectum receiving 36.9 Gy, 46.2 Gy, 64.6 Gy, and 73.9 Gy was associated with the development of late GI toxicity (P<.05). The 5-year actuarial grade ≥2 GI toxicity was 27.3% in men with R64.6Gy ≥ 20% but only 6.0% in men with R64.6Gy < 20% (P=.016). Conclusions: Dose-escalated IMRT using a moderate hypofractionation regimen (72 Gy in 2.4-Gy fractions) can be delivered safely with limited grade 2 or 3 late toxicity. Minimizing the proportion of rectum that receives moderate and high dose decreases the risk of late rectal toxicity after this hypofractionation regimen.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Extending Conformal Prediction to Hidden Markov Models with Exact Validity via de Finetti’s Theorem for Markov Chains

Conformal prediction is a widely used method to quantify uncertainty in settings where the data is independent and identically distributed (IID), or more generally, exchangeable. Conformal prediction takes in a pre-trained classifier and a calibration dataset as inputs, and returns a function which maps feature vectors to subsets of classes. The output of the returned function for a new feature vector is guaranteed to contain the true class with a pre-specified confidence. Despite its success and usefulness in IID settings, extending conformal prediction to non-exchangeable (e.g., Markovian) data in a manner that provably preserves all desirable theoretical properties has largely remained an open problem. As a solution, we extend conformal prediction to the setting of a Hidden Markov Model (HMM) with unknown parameters. The key idea behind the proposed method is to partition the non-exchangeable Markovian data from the HMM into exchangeable blocks by exploiting the de Finetti’s Theorem for Markov Chains discovered by Diaconis and Freedman (1980). The permutations of the exchangeable blocks are then viewed as randomizations of the observed Markovian data from the HMM. The proposed method provably retains all desirable theoretical guarantees offered by the classical conformal prediction framework and is general enough to be useful in many sequential prediction problems.

Nettasinghe, Don Buddhika Wijayantha↗

Deformable segmentation of 3D MR prostate images via distributed discriminative dictionary and ensemble learning

Purpose: Automatic prostate segmentation from MR images is an important task in various clinical applications such as prostate cancer staging and MR-guided radiotherapy planning. However, the large appearance and shape variations of the prostate in MR images make the segmentation problem difficult to solve. Traditional Active Shape/Appearance Model (ASM/AAM) has limited accuracy on this problem, since its basic assumption, i.e., both shape and appearance of the targeted organ follow Gaussian distributions, is invalid in prostate MR images. To this end, the authors propose a sparse dictionary learning method to model the image appearance in a nonparametric fashion and further integrate the appearance model into a deformable segmentation framework for prostate MR segmentation. Methods: To drive the deformable model for prostate segmentation, the authors propose nonparametric appearance and shape models. The nonparametric appearance model is based on a novel dictionary learning method, namely distributed discriminative dictionary (DDD) learning, which is able to capture fine distinctions in image appearance. To increase the differential power of traditional dictionary-based classification methods, the authors' DDD learning approach takes three strategies. First, two dictionaries for prostate and nonprostate tissues are built, respectively, using the discriminative features obtained from minimum redundancy maximum relevance feature selection. Second, linear discriminant analysis is employed as a linear classifier to boost the optimal separation between prostate and nonprostate tissues, based on the representation residuals from sparse representation. Third, to enhance the robustness of the authors' classification method, multiple local dictionaries are learned for local regions along the prostate boundary (each with small appearance variations), instead of learning one global classifier for the entire prostate. These discriminative dictionaries are located on different patches of the prostate surface and trained to adaptively capture the appearance in different prostate zones, thus achieving better local tissue differentiation. For each local region, multiple classifiers are trained based on the randomly selected samples and finally assembled by a specific fusion method. In addition to this nonparametric appearance model, a prostate shape model is learned from the shape statistics using a novel approach, sparse shape composition, which can model nonGaussian distributions of shape variation and regularize the 3D mesh deformation by constraining it within the observed shape subspace. Results: The proposed method has been evaluated on two datasets consisting of T2-weighted MR prostate images. For the first (internal) dataset, the classification effectiveness of the authors' improved dictionary learning has been validated by comparing it with three other variants of traditional dictionary learning methods. The experimental results show that the authors' method yields a Dice Ratio of 89.1% compared to the manual segmentation, which is more accurate than the three state-of-the-art MR prostate segmentation methods under comparison. For the second dataset, the MICCAI 2012 challenge dataset, the authors' proposed method yields a Dice Ratio of 87.4%, which also achieves better segmentation accuracy than other methods under comparison. Conclusions: A new magnetic resonance image prostate segmentation method is proposed based on the combination of deformable model and dictionary learning methods, which achieves more accurate segmentation performance on prostate T2 MR images.

60 APPLIED LIFE SCIENCES↗

A stochastic Galerkin method for the Boltzmann equation with uncertainty

We develop a stochastic Galerkin method for the Boltzmann equation with uncertainty. The method is based on the generalized polynomial chaos (gPC) approximation in the stochastic Galerkin framework, and can handle random inputs from collision kernel, initial data or boundary data. We show that a simple singular value decomposition of gPC related coefficients combined with the fast Fourier-spectral method (in velocity space) allows one to compute the high-dimensional collision operator very efficiently. In the spatially homogeneous case, we first prove that the analytical solution preserves the regularity of the initial data in the random space, and then use it to establish the spectral accuracy of the proposed stochastic Galerkin method. Several numerical examples are presented to illustrate the validity of the proposed scheme.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Adaptive surrogate modeling by ANOVA and sparse polynomial dimensional decomposition for global sensitivity analysis in fluid simulation

The Polynomial Dimensional Decomposition (PDD) is employed in this work for the global sensitivity analysis and uncertainty quantification (UQ) of stochastic systems subject to a moderate to large number of input random variables. Due to the intimate connection between the PDD and the Analysis of Variance (ANOVA) approaches, PDD is able to provide a simpler and more direct evaluation of the Sobol' sensitivity indices, when compared to the Polynomial Chaos expansion (PC). Unfortunately, the number of PDD terms grows exponentially with respect to the size of the input random vector, which makes the computational cost of standard methods unaffordable for real engineering applications. In order to address the problem of the curse of dimensionality, this work proposes essentially variance-based adaptive strategies aiming to build a cheap meta-model (i.e. surrogate model) by employing the sparse PDD approach with its coefficients computed by regression. Three levels of adaptivity are carried out in this paper: 1) the truncated dimensionality for ANOVA component functions, 2) the active dimension technique especially for second- and higher-order parameter interactions, and 3) the stepwise regression approach designed to retain only the most influential polynomials in the PDD expansion. During this adaptive procedure featuring stepwise regressions, the surrogate model representation keeps containing few terms, so that the cost to resolve repeatedly the linear systems of the least-squares regression problem is negligible. The size of the finally obtained sparse PDD representation is much smaller than the one of the full expansion, since only significant terms are eventually retained. Consequently, a much smaller number of calls to the deterministic model is required to compute the final PDD coefficients.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗