Search NASA⌕ Search

SEARCH · Search NASA

Results for “iterative 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 343 records · Page 19

A Method for Correcting IMRT Optimizer Heterogeneity Dose Calculations

Radiation therapy treatment planning for volumes close to the patient's surface, in lung tissue and in the head and neck region, can be challenging for the planning system optimizer because of the complexity of the treatment and protected volumes, as well as striking heterogeneity corrections. Because it is often the goal of the planner to produce an isodose plan with uniform dose throughout the planning target volume (PTV), there is a need for improved planning optimization procedures for PTVs located in these anatomical regions. To illustrate such an improved procedure, we present a treatment planning case of a patient with a lung lesion located in the posterior right lung. The intensity-modulated radiation therapy (IMRT) plan generated using standard optimization procedures produced substantial dose nonuniformity across the tumor caused by the effect of lung tissue surrounding the tumor. We demonstrate a novel iterative method of dose correction performed on the initial IMRT plan to produce a more uniform dose distribution within the PTV. This optimization method corrected for the dose missing on the periphery of the PTV and reduced the maximum dose on the PTV to 106% from 120% on the representative IMRT plan.

61 RADIATION PROTECTION AND DOSIMETRY↗

LINE-INTERLOCKING EFFECTS ON POLARIZATION IN SPECTRAL LINES BY RAYLEIGH AND RAMAN SCATTERING

The polarized spectrum of the Sun and stars is formed from the scattering of anisotropic radiation on atoms. Interpretation of this spectrum requires the solution of polarized line transfer in multilevel atomic systems. While sophisticated quantum theories of polarized line formation in multilevel atomic systems exist, they are limited by the approximation of complete frequency redistribution in scattering. The partial frequency redistribution (PRD) in line scattering is a necessary component in modeling the polarized spectra of strong lines. The polarized PRD line scattering theories developed so far confine themselves to a two-level or a two-term atom model. In this paper, we present a heuristic approach to the problem of polarized line formation in multilevel atoms taking into account the effects of PRD and a weak magnetic field. Starting from the unpolarized PRD multilevel atom approach of Hubeny et al., we incorporate the polarization state of the radiation field. However, the lower level polarization is neglected. Two iterative methods of solving the polarized PRD line transfer in multilevel atoms are also presented. Taking the example of a five-level Ca II atom model, we present illustrative results for an isothermal one-dimensional model atmosphere.

79 ASTRONOMY AND ASTROPHYSICS↗

WE-G-207-04: Non-Local Total-Variation (NLTV) Combined with Reweighted L1-Norm for Compressed Sensing Based CT Reconstruction

Purpose: Compressed sensing (CS) has been used for CT (4DCT/CBCT) reconstruction with few projections to reduce dose of radiation. Total-variation (TV) in L1-minimization (min.) with local information is the prevalent technique in CS, while it can be prone to noise. To address the problem, this work proposes to apply a new image processing technique, called non-local TV (NLTV), to CS based CT reconstruction, and incorporate reweighted L1-norm into it for more precise reconstruction. Methods: TV minimizes intensity variations by considering two local neighboring voxels, which can be prone to noise, possibly damaging the reconstructed CT image. NLTV, contrarily, utilizes more global information by computing a weight function of current voxel relative to surrounding search area. In fact, it might be challenging to obtain an optimal solution due to difficulty in defining the weight function with appropriate parameters. Introducing reweighted L1-min., designed for approximation to ideal L0-min., can reduce the dependence on defining the weight function, therefore improving accuracy of the solution. This work implemented the NLTV combined with reweighted L1-min. by Split Bregman Iterative method. For evaluation, a noisy digital phantom and a pelvic CT images are employed to compare the quality of images reconstructed by TV, NLTV and reweighted NLTV. Results: In both cases, conventional and reweighted NLTV outperform TV min. in signal-to-noise ratio (SNR) and root-mean squared errors of the reconstructed images. Relative to conventional NLTV, NLTV with reweighted L1-norm was able to slightly improve SNR, while greatly increasing the contrast between tissues due to additional iterative reweighting process. Conclusion: NLTV min. can provide more precise compressed sensing based CT image reconstruction by incorporating the reweighted L1-norm, while maintaining greater robustness to the noise effect than TV min.

60 APPLIED LIFE SCIENCES↗

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↗

A special generalized HSS method for discrete ill-posed problems

In this paper, we use a new special generalized Hermitian and skew-Hermitian splitting (SGHSS) method for solving ill-posed inverse problems. Based on an augmented system formulation, we apply a new splitting for the Hermitian part of the coefficient matrix and discuss on the convergence of this iterative method. Moreover, the optimal parameter minimizing the spectral radius of iteration matrix is derived. Finally, we present some numerical examples to demonstrate the performance of the presented method.

97 MATHEMATICS AND COMPUTING↗

Seven open problems in applied combinatorics

We present and discuss seven different open problems in applied combinatorics. Additionally, the application areas relevant to this compilation include quantum computing, algorithmic differentiation, topological data analysis, iterative methods, hypergraph cut algorithms, and power systems.

97 MATHEMATICS AND COMPUTING↗

Self-consistent calculation of nuclear photoabsorption cross sections: Finite amplitude method with Skyrme functionals in the three-dimensional real space

The finite amplitude method (FAM), which we have recently proposed [T. Nakatsukasa, T. Inakura, and K. Yabana, Phys. Rev. C 76, 024318 (2007)], significantly simplifies the fully self-consistent calculation of the random-phase approximation (RPA). This article presents a computational scheme of FAM suitable for systematic investigation and shows its performance for realistic Skyrme energy functionals. We adopt the mixed representation in which the forward and backward RPA amplitudes are represented by index of hole orbitals and of the spatial grid points for the three-dimensional real space. We solve a linear algebraic problem with a sparse non-Hermitian matrix, using an iterative method. We show results of the dipole response for selected spherical and deformed nuclei. The calculated peak energies of the giant dipole resonance well agree with experiments for heavy nuclei. However, they are systematically underestimated for light nuclei. We also discuss the width of the giant dipole resonance in the fully self-consistent RPA calculation.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Performance evaluation of OpenFOAM on many-core architectures

In this article application of Open Source Field Operation and Manipulation (OpenFOAM) C++ libraries for solving engineering problems on many-core architectures is presented. Objective of this article is to present scalability of OpenFOAM on parallel platforms solving real engineering problems of fluid dynamics. Scalability test of OpenFOAM is performed using various hardware and different implementation of standard PCG and PBiCG Krylov iterative methods. Speed up of various implementations of linear solvers using GPU and MIC accelerators are presented in this paper. Numerical experiments of 3D lid-driven cavity flow for several cases with various number of cells are presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A nearly-linear computational-cost scheme for the forward dynamics of an N-body pendulum

The dynamic equations of motion of an n-body pendulum with spherical joints are derived to be a mixed system of differential and algebraic equations (DAE's). The DAE's are kept in implicit form to save arithmetic and preserve the sparsity of the system and are solved by the robust implicit integration method. At each solution point, the predicted solution is corrected to its exact solution within given tolerance using Newton's iterative method. For each iteration, a linear system of the form J delta X = E has to be solved. The computational cost for solving this linear system directly by LU factorization is O(n exp 3), and it can be reduced significantly by exploring the structure of J. It is shown that by recognizing the recursive patterns and exploiting the sparsity of the system the multiplicative and additive computational costs for solving J delta X = E are O(n) and O(n exp 2), respectively. The formulation and solution method for an n-body pendulum is presented. The computational cost is shown to be nearly linearly proportional to the number of bodies.

Chou, Jack C. K.↗

Final Report, DE-FG01-06ER25718 Domain Decomposition and Parallel Computing

The goal of this project is to develop and improve domain decomposition algorithms for a variety of partial differential equations such as those of linear elasticity and electro-magnetics.These iterative methods are designed for massively parallel computing systems and allow the fast solution of the very large systems of algebraic equations that arise in large scale and complicated simulations. A special emphasis is placed on problems arising from Maxwell's equation. The approximate solvers, the preconditioners, are combined with the conjugate gradient method and must always include a solver of a coarse model in order to have a performance which is independent of the number of processors used in the computer simulation. A recent development allows for an adaptive construction of this coarse component of the preconditioner.

97 MATHEMATICS AND COMPUTING↗

Absorption effects in electron-sulfur-dioxide collisions

A joint experimental-theoretical study on electron-SO{sub 2} collisions in the low and intermediate energy range is reported. More specifically, experimental elastic differential, integral, and momentum transfer cross sections in absolute scale are measured in the 100-1000 eV energy range using the relative-flow technique. Calculated elastic differential, integral, and momentum transfer cross sections as well as grand-total and total absorption cross sections are also presented in the 1-1000 eV energy range. A complex optical potential is used to represent the electron-molecule interaction dynamics, whereas the Schwinger variational iterative method combined with the distorted-wave approximation is used to solve the scattering equations. Comparison of the present results is made with the theoretical and experimental results available in the literature.

74 ATOMIC AND MOLECULAR PHYSICS↗

Thermophysical properties of nitrogen plasmas under thermal equilibrium and non-equilibrium conditions

Calculated thermophysical properties of nitrogen plasmas in and out of thermal equilibrium are presented. The cut-off of the partition functions due to the lowering of the ionization potential has been taken into account, together with the contributions from different core excited electronic states. The species composition and thermodynamic properties are determined numerically using the Newton-Raphson iterative method, taking into account the corrections due to Coulomb interactions. The transport properties including diffusion coefficient, viscosity, thermal conductivity, and electrical conductivity are calculated using the most recent collision interaction potentials by adopting Devoto's electron and heavy particle decoupling approach, expanded to the third-order approximation (second-order for viscosity) in the framework of Chapman-Enskog method. Results are presented in the pressure range of 0.1 atm-10 atm and in electron temperature range from 300 to 40 000 K, with the ratio of electron temperature to heavy-particle temperature varied from 1 to 20. Results are compared with those from previous works, and the influences of different definitions of the Debye length are discussed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

The multigrid preconditioned conjugate gradient method

A multigrid preconditioned conjugate gradient method (MGCG method), which uses the multigrid method as a preconditioner of the PCG method, is proposed. The multigrid method has inherent high parallelism and improves convergence of long wavelength components, which is important in iterative methods. By using this method as a preconditioner of the PCG method, an efficient method with high parallelism and fast convergence is obtained. First, it is considered a necessary condition of the multigrid preconditioner in order to satisfy requirements of a preconditioner of the PCG method. Next numerical experiments show a behavior of the MGCG method and that the MGCG method is superior to both the ICCG method and the multigrid method in point of fast convergence and high parallelism. This fast convergence is understood in terms of the eigenvalue analysis of the preconditioned matrix. From this observation of the multigrid preconditioner, it is realized that the MGCG method converges in very few iterations and the multigrid preconditioner is a desirable preconditioner of the conjugate gradient method.

Tatebe, Osamu↗

Assessment of Preconditioner for a USM3D Hierarchical Adaptive Nonlinear Method (HANIM) (Invited)

Enhancements to the previously reported mixed-element USM3D Hierarchical Adaptive Nonlinear Iteration Method (HANIM) framework have been made to further improve robustness, efficiency, and accuracy of computational fluid dynamic simulations. The key enhancements include a multi-color line-implicit preconditioner, a discretely consistent symmetry boundary condition, and a line-mapping method for the turbulence source term discretization. The USM3D iterative convergence for the turbulent flows is assessed on four configurations. The configurations include a two-dimensional (2D) bump-in-channel, the 2D NACA 0012 airfoil, a three-dimensional (3D) bump-in-channel, and a 3D hemisphere cylinder. The Reynolds Averaged Navier Stokes (RANS) solutions have been obtained using a Spalart-Allmaras turbulence model and families of uniformly refined nested grids. Two types of HANIM solutions using line- and point-implicit preconditioners have been computed. Additional solutions using the point-implicit preconditioner alone (PA) method that broadly represents the baseline solver technology have also been computed. The line-implicit HANIM shows superior iterative convergence in most cases with progressively increasing benefits on finer grids.

Pandya, Mohagna J.↗

Polymer/metal hybrid multilayers modified Schottky devices

Insulating, polymethylmethacrylate (PMMA), and semiconducting, poly(3-hexylthiophene) (P3HT), nanometer thick polymers/Au nanoparticles based hybrid multilayers (HyMLs) were fabricated on p-Si single-crystal substrate. An iterative method, which involves, respectively, spin-coating (PMMA and P3HT deposition) and sputtering (Au nanoparticles deposition) techniques to prepare Au/HyMLs/p-Si Schottky device, was used. The barrier height and the ideality factor of the Au/HyMLs/p-Si Schottky devices were investigated by current-voltage measurements in the thickness range of 1–5 bilayers. It was observed that the barrier height of such hybrid layered systems can be tuned as a function of bilayers number and its evolution was quantified and analyzed.

36 MATERIALS SCIENCE↗

TU-EF-204-04: Feasibility Study of a Novel Stationary Spectral CT Scanner

Purpose: To evaluate a cadmium zinc telluride (CZT) detector module and to develop a proof-of-concept bench-top system to examine the concept and feasibility of a stationary spectral scanner that would consist of a CZT detector ring and a distributed source for rotationless imaging. Methods: The bench-top system employs a double-rotation set-up with two concentric but independent rotating stages, one for turning the object at sparse angles to mimic the imaging from a sequentially activated source distributed on a ring, while the other for translating the detector module to simulate a projection arc along a virtual detector ring. A source of 30-degree fan is used in the set-up, and the ring is designed to be 85cm in diameter in order to provide a 22cm field-of-view that is large enough for an average human head. The CZT detector module has 16×16 0.5mm pixels and eight global energy thresholds, and is attached to an experimental data acquisition board from the same vendor (Nova R&D). Its pixel gain is first calibrated using radioisotope Tc-99m to align the photo-peaks. Count rate performance is assessed using the X-ray source. Air and offset corrections are done prior to each CT scan. A 10cm acrylic phantom with 5 different inserts is imaged at 100kVp, 2mA, with an effective exposure window of 150ms per projection. Reconstruction is done using a total variation-type iterative method. Results: The detector module exhibited large gain variations among pixels. Average count rate was over 1Mcps per pixel. Parallax effect was observed along the arcs but was corrected. Reconstructed images from two energy bins demonstrated good contrast, spatial resolution and image uniformity, with little artifacts. Conclusion: The CZT detector tested is suitable for imaging relatively small objects. A stationary spectral CT appears feasible should we have enough buttable modules and a distributed source. This work was supported by Ministry of Science and Technology of China through grants 11YQ040082 and 2012BAI13B04.

60 APPLIED LIFE SCIENCES↗

The Transfer of Resonance Line Polarization with Partial Frequency Redistribution in the General Hanle–Zeeman Regime

The spectral line polarization encodes a wealth of information about the thermal and magnetic properties of the solar atmosphere. Modeling the Stokes profiles of strong resonance lines is, however, a complex problem both from a theoretical and computational point of view, especially when partial frequency redistribution (PRD) effects need to be taken into account. In this work, we consider a two-level atom in the presence of magnetic fields of arbitrary intensity (Hanle–Zeeman regime) and orientation, both deterministic and micro-structured. Working within the framework of a rigorous PRD theoretical approach, we have developed a numerical code that solves the full non-LTE radiative transfer problem for polarized radiation, in one-dimensional models of the solar atmosphere, accounting for the combined action of the Hanle and Zeeman effects, as well as for PRD phenomena. After briefly discussing the relevant equations, we describe the iterative method of solution of the problem and the numerical tools that we have developed and implemented. We finally present some illustrative applications to two resonance lines that form at different heights in the solar atmosphere, and provide a detailed physical interpretation of the calculated Stokes profiles. We find that magneto-optical effects have a strong impact on the linear polarization signals that PRD effects produce in the wings of strong resonance lines. We also show that the weak-field approximation has to be used with caution when PRD effects are considered.

79 ASTRONOMY AND ASTROPHYSICS↗

Thermoelectric power of supported graphene - An iterative approach

Thermoelectric power, S, of graphene supported on SiO{sub 2} substrate is studied for 10K < T < 400K within the framework of Boltzmann transport formalism by an iterative method. Numerical calculations of diffusion thermopower, S{sub d}, as a function of temperature, are presented assuming the electrons to be scattered by impurities, vacancies, surface roughness, acoustic phonons, inelastic optical phonons and surface polar optical phonons. For the range of temperatures considered, S{sub d} is found to be dominated by impurities for T < 40K and by acoustic phonon and vacancy scatterings for T > 40K. The optical phonons are found to influence S{sub d} for T > 300K. Our calculations, assuming the drag component to be negligible, obtain good agreement with the recent experimental data.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗