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 289 records · Page 16

Conservative tightly-coupled simulations of stochastic multiscale systems

Multiphysics problems often involve components whose macroscopic dynamics is driven by microscopic random fluctuations. The fidelity of simulations of such systems depends on their ability to propagate these random fluctuations throughout a computational domain, including subdomains represented by deterministic solvers. When the constituent processes take place in nonoverlapping subdomains, system behavior can be modeled via a domain-decomposition approach that couples separate components at the interfaces between these subdomains. Its coupling algorithm has to maintain a stable and efficient numerical time integration even at high noise strength. We propose a conservative domain-decomposition algorithm in which tight coupling is achieved by employing either Picard's or Newton's iterative method. Coupled diffusion equations, one of which has a Gaussian white-noise source term, provide a computational testbed for analysis of these two coupling strategies. Fully-converged (“implicit”) coupling with Newton's method typically outperforms its Picard counterpart, especially at high noise levels. This is because the number of Newton iterations scales linearly with the amplitude of the Gaussian noise, while the number of Picard iterations can scale superlinearly. At large time intervals between two subsequent inter-solver communications, the solution error for single-iteration (“explicit”) Picard's coupling can be several orders of magnitude higher than that for implicit coupling. Increasing the explicit coupling's communication frequency reduces this difference, but the resulting increase in computational cost can make it less efficient than implicit coupling at similar levels of solution error, depending on the communication frequency of the latter and the noise strength. This trend carries over into higher dimensions, although at high noise strength explicit coupling may be the only computationally viable option.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A generalized Poisson solver for first-principles device simulations

Electronic structure calculations of atomistic systems based on density functional theory involve solving the Poisson equation. In this paper, we present a plane-wave based algorithm for solving the generalized Poisson equation subject to periodic or homogeneous Neumann conditions on the boundaries of the simulation cell and Dirichlet type conditions imposed at arbitrary subdomains. In this way, source, drain, and gate voltages can be imposed across atomistic models of electronic devices. Dirichlet conditions are enforced as constraints in a variational framework giving rise to a saddle point problem. The resulting system of equations is then solved using a stationary iterative method in which the generalized Poisson operator is preconditioned with the standard Laplace operator. The solver can make use of any sufficiently smooth function modelling the dielectric constant, including density dependent dielectric continuum models. For all the boundary conditions, consistent derivatives are available and molecular dynamics simulations can be performed. The convergence behaviour of the scheme is investigated and its capabilities are demonstrated.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Noncommutative quantum mechanics of a harmonic oscillator under linearized gravitational waves

We consider the quantum dynamics of a harmonic oscillator in noncommutative space under the influence of linearized gravitational waves (GWs) in the long-wavelength and low-velocity limit. Following the prescription in Saha and Gangopadhyay [Phys. Lett. B 681, 96 (2009)] we quantize the system. The Hamiltonian of the system is solved by using standard algebraic iterative methods. The solution shows signatures of the coordinate noncommutativity via alterations in the oscillation frequency of the harmonic oscillator system from its commutative counterpart. Moreover, it is found that the response of the harmonic oscillator to periodic GWs, when their frequencies match, will oscillate with a time scale imposed by the noncommutative parameter. We expect this noncommutative signature to show up as some noise source in the GW detection experiments since the recent phenomenological upper bounds set on the spatial noncommutative parameter imply a length scale comparable to the length variations due to the passage of gravitational waves, detectable in the present-day GW detectors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Some recent developments in spectral methods

This paper is solely devoted to spectral iterative methods including spectral multigrid methods. These techniques are explained with reference to simple model problems. Some Navier-Stokes algorithms based on these techniques are mentioned. Results on transition simulation using these algorithms are presented.

Hussaini, M. Y.↗

Relaxation method of compensation in an optical correlator

An iterative method is proposed for the sharpening of programmable filters in a 4-f optical correlator. Continuously variable spatial light modulators (SLMs) permit the fine adjustment of optical processing filters so as to compensate for the departures from ideal behavior of a real optical system. Although motivated by the development of continuously variable phase-only SLMs, the proposed sharpening method is also applicable to amplitude modulators and, with appropriate adjustments, to binary modulators as well. A computer simulation is presented that illustrates the potential effectiveness of the method: an image is placed on the input to the correlator, and its corresponding phase-only filter is adjusted (allowed to relax) so as to produce a progressively brighter and more centralized peak in the correlation plane. The technique is highly robust against the form of the system's departure from ideal behavior.

Juday, Richard D.↗

ULTRADEEP K{sub S} IMAGING IN THE GOODS-N

We present an ultradeep K{sub S} -band image that covers 0.5 x 0.5 deg{sup 2} centered on the Great Observatories Origins Deep Survey-North (GOODS-N). The image reaches a 5{sigma} depth of K{sub S,AB}=24.45 in the GOODS-N region, which is as deep as the GOODS-N Spitzer Infrared Array Camera (IRAC) 3.6 {mu}m image. We present a new method of constructing IRAC catalogs that uses the higher spatial resolution K{sub S} image and catalog as priors and iteratively subtracts fluxes from the IRAC images to estimate the IRAC fluxes. Our iterative method is different from the {chi}{sup 2} approach adopted by other groups. We verified our results using data taken in two different epochs of observations, as well as by comparing our colors with the colors of stars and with the colors derived from model spectral energy distributions of galaxies at various redshifts. We make available to the community our WIRCam K{sub S} -band image and catalog (94,951 objects in 0.25 deg{sup 2}), the Interactive Data Language pipeline used for reducing the WIRCam images, and our IRAC 3.6-8.0 {mu}m catalog (16,950 objects in 0.06 deg{sup 2} at 3.6 {mu}m). With this improved K{sub S} and IRAC catalog and a large spectroscopic sample from our previous work, we study the color-magnitude and color-color diagrams of galaxies. We compare the effectiveness of using K{sub S} and IRAC colors to select active galactic nuclei and galaxies at various redshifts. We also study a color selection of z = 0.65-1.2 galaxies using the K{sub S} , 3.6 {mu}m, and 4.5 {mu}m bands.

79 ASTRONOMY AND ASTROPHYSICS↗

The Iterated Fission Matrix Method

The fission matrix (FM) method has been successfully demonstrated for different applications. One of the interesting features of this method, which is not possible via standard criticality source Monte Carlo calculations, is the capability to calculate higher forward and adjoint Eigenmodes; however, the accuracy of the estimates for higher eigenvalues strongly depends on the spatial discretization adopted for the fission matrix. A fine mesh ensures accurate results but requires matrices of large size. This is considered a limitation to the applicability of the FM method due to the memory requirements for storage of large full matrices. The adoption of sparse matrix storage (e.g., in MCNP) partially overcomes this problem; nonetheless, the sparse matrix indexing increases the complexity of the implementation of the FM algorithm and introduces the additional task of sparsifying the fission matrix. This summary presents a new method, named the iterated fission matrix (IFM), that allows to estimate higher eigenvalues of multiplying systems on much smaller meshes, but with the same level of accuracy in terms of spatial discretization errors, as compared to the FM method. The following Sections describe this new approach and provide a demonstration using two case studies: a PWR fuel assembly, and a 2D PWR core. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

A fast directional algorithm for high-frequency electromagnetic scattering

This paper is concerned with the fast solution of high-frequency electromagnetic scattering problems using the boundary integral formulation. We extend the O(N log N) directional multilevel algorithm previously proposed for the acoustic scattering case to the vector electromagnetic case. We also detail how to incorporate the curl operator of the magnetic field integral equation into the algorithm. When combined with a standard iterative method, this results in an almost linear complexity solver for the combined field integral equations. In addition, the butterfly algorithm is utilized to compute the far field pattern and radar cross section with O(N log N) complexity.

97 MATHEMATICS AND COMPUTING↗

An iterative decoupling solution method for large scale Lyapunov equations

A great deal of attention has been given to the numerical solution of the Lyapunov equation. A useful classification of the variety of solution techniques are the groupings of direct, transformation, and iterative methods. The paper summarizes those methods that are at least partly favorable numerically, giving special attention to two criteria: exploitation of a general sparse system matrix structure and efficiency in resolving the governing linear matrix equation for different matrices. An iterative decoupling solution method is proposed as a promising approach for solving large-scale Lyapunov equation when the system matrix exhibits a general sparse structure. A Fortran computer program that realizes the iterative decoupling algorithm is also discussed.

Athay, T. M.↗

On the use of flux limiters in the discrete ordinates method for 3D radiation calculations in absorbing and scattering media

The application of flux limiters to the discrete ordinates method (DOM), S{sub N}, for radiative transfer calculations is discussed and analyzed for 3D enclosures for cases in which the intensities are strongly coupled to each other such as: radiative equilibrium and scattering media. A Newton-Krylov iterative method (GMRES) solves the final systems of linear equations along with a domain decomposition strategy for parallel computation using message passing libraries in a distributed memory system. Ray effects due to angular discretization and errors due to domain decomposition are minimized until small variations are introduced by these effects in order to focus on the influence of flux limiters on errors due to spatial discretization, known as numerical diffusion, smearing or false scattering. Results are presented for the DOM-integrated quantities such as heat flux, irradiation and emission. A variety of flux limiters are compared to 'exact' solutions available in the literature, such as the integral solution of the RTE for pure absorbing-emitting media and isotropic scattering cases and a Monte Carlo solution for a forward scattering case. Additionally, a non-homogeneous 3D enclosure is included to extend the use of flux limiters to more practical cases. The overall balance of convergence, accuracy, speed and stability using flux limiters is shown to be superior compared to step schemes for any test case.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Iterative algorithms for processing experimental data

The need to solve linear and nonlinear integral equations arise, e.g., in recovering plasma parameters from the data of multichannel diagnostics. The paper presents an iterative method for solving integral equations with a singularity at the upper limit of integration. The method consists in constructing successive approximations and calculating the integral by quadrature formulas in each integration interval. An example of application of the iterative algorithm to numerically solve an integral equation similar to those arising in recovering the plasma density profile from reflectometry data is presented.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Considering nonlocality in the optical potentials within eikonal models

Background: For its simplicity, the eikonal method is the tool of choice to analyze nuclear reactions at high energies (E > 100 MeV/nucleon), including knockout reactions. However, so far, the effective interactions used in this method are assumed to be fully local. Purpose: Given the recent studies on nonlocal optical potentials, in this work we assess whether nonlocality in the optical potentials is expected to impact reactions at high energies and then explore different avenues for extending the eikonal method to include nonlocal interactions. Method: We compare angular distributions obtained for nonlocal interactions (using the exact R-matrix approach for elastic scattering and the adiabatic distorted wave approximation for transfer) with those obtained using their local-equivalent interactions. Results: Our results show that transfer observables are significantly impacted by nonlocality in the high-energy regime. Because knockout reactions are dominated by stripping (transfer to inelastic channels), nonlocality is expected to have a large effect on knockout observables too. Three approaches are explored for extending the eikonal method to nonlocal interactions, including an iterative method and a perturbation theory. Conclusions: None of the derived extensions of the eikonal model provide a good description of elastic scattering. Here, this paper suggests that nonlocality removes the formal simplicity associated with the eikonal model.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Shear viscosity in the postquasistatic approximation

We apply the postquasistatic approximation, an iterative method for the evolution of self-gravitating spheres of matter, to study the evolution of anisotropic nonadiabatic radiating and dissipative distributions in general relativity. Dissipation is described by viscosity and free-streaming radiation, assuming an equation of state to model anisotropy induced by the shear viscosity. We match the interior solution, in noncomoving coordinates, with the Vaidya exterior solution. Two simple models are presented, based on the Schwarzschild and Tolman VI solutions, in the nonadiabatic and adiabatic limit. In both cases, the eventual collapse or expansion of the distribution is mainly controlled by the anisotropy induced by the viscosity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

AMPS: An Augmented Matrix Formulation for Principal Submatrix Updates with Application to Power Grids

We present an augmented matrix approach to update the solution to a linear system of equations when the coefficient matrix is modified by a few elements within a principal submatrix. This problem arises in the dynamic security analysis of a power grid, where operators need to perform $N-x$ contingency analysis, i.e., determine the state of the system when up to $x$ links from $N$ fail. Our algorithms augment the coefficient matrix to account for the changes in it, and then compute the solution to the augmented system without refactoring the modified matrix. We provide two algorithms, a direct method, and a hybrid direct-iterative method for solving the augmented system. We also exploit the sparsity of the matrices and vectors to accelerate the overall computation. Our algorithms are compared on three power grids with PARDISO, a parallel direct solver, and CHOLMOD, a direct solver with the ability to modify the Cholesky factors of the coefficient matrix. We show that our augmented algorithms outperform PARDISO (by two orders of magnitude), and CHOLMOD (by a factor of up to 5). Further, our algorithms scale better than CHOLMOD as the number of elements updated increases. The solutions are computed with high accuracy. Our algorithms are capable of computing $N-x$ contingency analysis on a $778K$ bus grid, updating a solution with $x=20$ elements in $1.6 \times 10^{-2}$ seconds on an Intel Xeon processor.

Yeung, Yu-Hong↗

COYOTE

COYOTE is designed for the analysis of steady and transient, multi-dimensional, nonlinear heat conduction problems. The spatial discretization technique is based on the Galerkin finite element method. The code contains a library of linear and quadratic elements and incudes bars and shells. COYOTE Implicit and explicit time integration methods, with adaptive time step control, are available for transient problems and fixed-point methods are used for Conjugate gradient iterative methods are used for the matrix solution. Coupled enclosure radiation with efficient view factor computation is included. Simulation capabilities include material motion, dynamic radiation enclosures, contact boundary conditions, multipoint constraints, material (element) addition, and deletion, bulk nodes, chemically reactive materials, and coupling with other mechanics codes. The code is designed for single or multi-processor computing

Gartling, DavidK.↗

Numerical simulation of two-dimensional heat transfer in composite bodies with application to de-icing of aircraft components

Transient, numerical simulations of the de-icing of composite aircraft components by electrothermal heating were performed for a two dimensional rectangular geometry. The implicit Crank-Nicolson formulation was used to insure stability of the finite-difference heat conduction equations and the phase change in the ice layer was simulated using the Enthalpy method. The Gauss-Seidel point iterative method was used to solve the system of difference equations. Numerical solutions illustrating de-icer performance for various composite aircraft structures and environmental conditions are presented. Comparisons are made with previous studies. The simulation can also be used to solve a variety of other heat conduction problems involving composite bodies.

Chao, D. F. K.↗

Inverse problems in diffraction

A two-dimensional problem of diffraction of a plane electromagnetic wave on a smooth 2 pi-periodic surface is considered. A numerical algorithm solving this problem is developed. An inverse problem of determination of the shape of 2 pi-periodic surface using the performance data of reverse scattering is considered. The inverse problem was solved by means of minimization of the residual functional with the help of the gradient descent method. The initial data were calculated with the help of the numerical method. On each step of the iterative method of minimization, the residual functional was calculated approximately with the help of the small slope method. The examples of the shape determination are considered.

Mikheev, Andrew G.↗