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 217 records · Page 12

Speeding up N -body simulations of modified gravity: chameleon screening models

We describe and demonstrate the potential of a new and very efficient method for simulating certain classes of modified gravity theories, such as the widely studied f ( R ) gravity models. High resolution simulations for such models are currently very slow due to the highly nonlinear partial differential equation that needs to be solved exactly to predict the modified gravitational force. This nonlinearity is partly inherent, but is also exacerbated by the specific numerical algorithm used, which employs a variable redefinition to prevent numerical instabilities. The standard Newton-Gauss-Seidel iterative method used to tackle this problem has a poor convergence rate. Our new method not only avoids this, but also allows the discretised equation to be written in a form that is analytically solvable. We show that this new method greatly improves the performance and efficiency of f ( R ) simulations. For example, a test simulation with 512{sup 3} particles in a box of size 512 Mpc/ h is now 5 times faster than before, while a Millennium-resolution simulation for f ( R ) gravity is estimated to be more than 20 times faster than with the old method. Our new implementation will be particularly useful for running very high resolution, large-sized simulations which, to date, are only possible for the standard model, and also makes it feasible to run large numbers of lower resolution simulations for covariance analyses. We hope that the method will bring us to a new era for precision cosmological tests of gravity.

79 ASTRONOMY AND ASTROPHYSICS↗

Influence of refraction index strength on the light propagation in dielectrics material with periodic refraction index

This study investigated the influence of refraction index strength on the light propagation in refraction index-varied dielectric material. This dielectric material served as photonic lattice. The behavior of light propagation influenced by variation of refraction index in photonic lattice was investigated. Modes of the guiding light were determined numerically using squared-operator iteration method. It was found that the greater the strength of refraction index, the smaller the guiding modes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Iterative solution of Hermite boundary integral equations

An efficient iterative method for the solution of the linear equations arising from a Hermite boundary integral approximation has been developed. Along with equations for the boundary unknowns, the Hermite system incorporates equations for the first-order surface derivatives (gradient) of the potential, and is therefore substantially larger than the matrix for a corresponding linear approximation. However, by exploiting the structure of the Hermite matrix, a two-level iterative algorithm has been shown to provide a very efficient solution algorithm. In this approach, the boundary function unknowns are treated separately from the gradient, taking advantage of the sparsity and near-positive definiteness of the gradient equations. In test problems, the new algorithm significantly reduced computation time compared to iterative solution applied to the full matrix. This approach should prove to be even more effective for the larger systems encountered in three-dimensional analysis, and increased efficiency should come from pre-conditioning of the non-sparse matrix component.

97 MATHEMATICS AND COMPUTING↗

Langmuir probe analysis in electronegative plasmas

This paper compares two methods to analyze Langmuir probe data obtained in electronegative plasmas. The techniques are developed to allow investigations in plasmas, where the electronegativity α{sub 0} = n{sub –}/n{sub e} (the ratio between the negative ion and electron densities) varies strongly. The first technique uses an analytical model to express the Langmuir probe current-voltage (I-V) characteristic and its second derivative as a function of the electron and ion densities (n{sub e}, n{sub +}, n{sub –}), temperatures (T{sub e}, T{sub +}, T{sub –}), and masses (m{sub e}, m{sub +}, m{sub –}). The analytical curves are fitted to the experimental data by adjusting these variables and parameters. To reduce the number of fitted parameters, the ion masses are assumed constant within the source volume, and quasi-neutrality is assumed everywhere. In this theory, Maxwellian distributions are assumed for all charged species. We show that this data analysis can predict the various plasma parameters within 5–10%, including the ion temperatures when α{sub 0} > 100. However, the method is tedious, time consuming, and requires a precise measurement of the energy distribution function. A second technique is therefore developed for easier access to the electron and ion densities, but does not give access to the ion temperatures. Here, only the measured I-V characteristic is needed. The electron density, temperature, and ion saturation current for positive ions are determined by classical probe techniques. The electronegativity α{sub 0} and the ion densities are deduced via an iterative method since these variables are coupled via the modified Bohm velocity. For both techniques, a Child-Law sheath model for cylindrical probes has been developed and is presented to emphasize the importance of this model for small cylindrical Langmuir probes.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Cross sections for electron scattering by carbon disulfide in the low- and intermediate-energy range

In this work, we report a theoretical study on e{sup -}-CS{sub 2} collisions in the low- and intermediate-energy ranges. Elastic differential, integral, and momentum-transfer cross sections, as well as grand total (elastic + inelastic) and absorption cross sections, are reported in the 1-1000 eV range. A recently proposed complex optical potential composed of static, exchange, and correlation-polarization plus absorption contributions is used to describe the electron-molecule interaction. The Schwinger variational iterative method combined with the distorted-wave approximation is applied to calculate the scattering amplitudes. The comparison between our calculated results and the existing experimental and/or theoretical results is encouraging.

74 ATOMIC AND MOLECULAR PHYSICS↗

Estimating Jupiter’s Gravity Field Using Juno Measurements, Trajectory Estimation Analysis, and a Flow Model Optimization

The upcoming Juno spacecraft measurements have the potential of improving our knowledge of Jupiter’s gravity field. The analysis of the Juno Doppler data will provide a very accurate reconstruction of spatial gravity variations, but these measurements will be very accurate only over a limited latitudinal range. In order to deduce the full gravity field of Jupiter, additional information needs to be incorporated into the analysis, especially regarding the Jovian flow structure and its depth, which can influence the measured gravity field. In this study we propose a new iterative method for the estimation of the Jupiter gravity field, using a simulated Juno trajectory, a trajectory estimation model, and an adjoint-based inverse model for the flow dynamics. We test this method both for zonal harmonics only and with a full gravity field including tesseral harmonics. The results show that this method can fit some of the gravitational harmonics better to the “measured” harmonics, mainly because of the added information from the dynamical model, which includes the flow structure. Thus, it is suggested that the method presented here has the potential of improving the accuracy of the expected gravity harmonics estimated from the Juno and Cassini radio science experiments.

79 ASTRONOMY AND ASTROPHYSICS↗

POLARIZED LINE FORMATION IN MULTI-DIMENSIONAL MEDIA. IV. A FOURIER DECOMPOSITION TECHNIQUE TO FORMULATE THE TRANSFER EQUATION WITH ANGLE-DEPENDENT PARTIAL FREQUENCY REDISTRIBUTION

To explain the linear polarization observed in spatially resolved structures in the solar atmosphere, the solution of polarized radiative transfer (RT) equation in multi-dimensional (multi-D) geometries is essential. For strong resonance lines, partial frequency redistribution (PRD) effects also become important. In a series of papers, we have been investigating the nature of Stokes profiles formed in multi-D media including PRD in line scattering. For numerical simplicity, so far we have restricted our attention to the particular case of PRD functions which are averaged over all the incident and scattered directions. In this paper, we formulate the polarized RT equation in multi-D media that takes into account the Hanle effect with angle-dependent PRD functions. We generalize here to the multi-D case the method for Fourier series expansion of angle-dependent PRD functions originally developed for RT in one-dimensional geometry. We show that the Stokes source vector S = (S{sub I} , S{sub Q} , S{sub U} ){sup T} and the Stokes vector I = (I, Q, U){sup T} can be expanded in terms of infinite sets of components S-tilde{sup (k)}, I-tilde{sup (k)}, respectively, k in [0, +{infinity}). We show that the components S-tilde{sup (k)} become independent of the azimuthal angle ({psi}) of the scattered ray, whereas the components I-tilde{sup (k)} remain dependent on {psi} due to the nature of RT in multi-D geometry. We also establish that S-tilde{sup (k)} and I-tilde{sup (k)} satisfy a simple transfer equation, which can be solved by any iterative method such as an approximate Lambda iteration or a Bi-Conjugate Gradient-type projection method provided we truncate the Fourier series to have a finite number of terms.

79 ASTRONOMY AND ASTROPHYSICS↗

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↗

The Bohr Hamiltonian Solution with the Morse Potential for the {gamma}-unstable and the Rotational Cases

Analytical solutions of the collective Bohr Hamiltonian with the Morse potential have been obtained for the U(5)-O(6) and U(5)-SU(3) transition regions through the Asymptotic Iteration Method (AIM). The obtained energy eigenvalue equations have been used to get the experimental excitation energy spectrum of Xe and Yb isotopes. The results are in good agreement with experimental data.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

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↗

Deflation for inversion with multiple right-hand sides in QCD

Most calculations in lattice Quantum Chromodynamics (QCD) involve the solution of a series of linear systems of equations with exceedingly large matrices and a large number of right hand sides. Iterative methods for these problems can be sped up significantly if we deflate approximations of appropriate invariant spaces from the initial guesses. Recently we have developed eigCG, a modification of the Conjugate Gradient (CG) method, which while solving a linear system can reuse a window of the CG vectors to compute eigenvectors almost as accurately as the Lanczos method. The number of approximate eigenvectors can increase as more systems are solved. In this paper we review some of the characteristics of eigCG and show how it helps remove the critical slowdown in QCD calculations. Moreover, we study scaling with lattice volume and an extension of the technique to nonsymmetric problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗