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 253 records · Page 14

Rapid analysis of scattering from periodic dielectric structures using accelerated Cartesian expansions

Here, the analysis of fields in periodic dielectric structures arise in numerous applications of recent interest, ranging from photonic bandgap structures and plasmonically active nanostructures to metamaterials. To achieve an accurate representation of the fields in these structures using numerical methods, dense spatial discretization is required. This, in turn, affects the cost of analysis, particularly for integral-equation-based methods, for which traditional iterative methods require Ο(Ν 2 ) operations, Ν being the number of spatial degrees of freedom. In this paper, we introduce a method for the rapid solution of volumetric electric field integral equations used in the analysis of doubly periodic dielectric structures. The crux of our method is the accelerated Cartesian expansion algorithm, which is used to evaluate the requisite potentials in Ο(Ν) cost. Results are provided that corroborate our claims of acceleration without compromising accuracy, as well as the application of our method to a number of compelling photonics applications.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Solution of the symmetric eigenproblem AX=lambda BX by delayed division

Delayed division is an iterative method for solving the linear eigenvalue problem AX = lambda BX for a limited number of small eigenvalues and their corresponding eigenvectors. The distinctive feature of the method is the reduction of the problem to an approximate triangular form by systematically dropping quadratic terms in the eigenvalue lambda. The report describes the pivoting strategy in the reduction and the method for preserving symmetry in submatrices at each reduction step. Along with the approximate triangular reduction, the report extends some techniques used in the method of inverse subspace iteration. Examples are included for problems of varying complexity.

Thurston, G. A.↗

Inventing and improving ribozyme function: rational design versus iterative selection methods

Two major strategies for generating novel biological catalysts exist. One relies on our knowledge of biopolymer structure and function to aid in the 'rational design' of new enzymes. The other, often called 'irrational design', aims to generate new catalysts, in the absence of detailed physicochemical knowledge, by using selection methods to search a library of molecules for functional variants. Both strategies have been applied, with considerable success, to the remodeling of existing ribozymes and the development of ribozymes with novel catalytic function. The two strategies are by no means mutually exclusive, and are best applied in a complementary fashion to obtain ribozymes with the desired catalytic properties.

Review, Tutorial↗

Prediction of BVI Noise for an Active Twist Rotor Using a Loosely Coupled CFD/CSD Method and Comparison to Experimental Data

Numerical predictions of the acoustic characteristics of an Active Twist Rotor (ATR), using two methods to compute the rotor blade aerodynamics and elastic blade motion are compared to experimental data from a wind tunnel test in the NASA Langley Transonic Dynamics Tunnel (TDT) in 2000. The first method, a loosely coupled iterative method, utilizes the Computational Fluid Dynamics (CFD) code OVERFLOW 2 and the Computational Structural Dynamics (CSD) code CAMRAD II. The second method utilizes the CAMRAD II free-wake model only. The harmonic active-twist control to the main rotor blade system is identified with three parameters - harmonic actuation frequency, actuation amplitude, and control phase angle. The resulting aerodynamics and blade motion data from the two methods are then used in the acoustics code PSU-WOPWOP to predict acoustic pressure on a spherical array of equally spaced observers surrounding the rotor. This spherical distribution of pressure is used to compute the sound power level representing baseline and actuated conditions. Sound power levels for three categories of noise are defined as - blade-vortex interaction sound power level (BVIPWL), low frequency sound power level (LFPWL), and overall sound power level, OAPWL. Comparisons with measured data indicate the CFD/CSD analysis successfully captures the trends in sound power levels and the effects of active-twist control at advance ratios of 0.14 and 0.17. The free-wake model predictions show inconsistent sound power levels relative to the trends in the experimental and CFD data. This paper presents the first ever comparison between CFD/CSD acoustic predictions for an active-twist rotor and experimental measurements.

Fogarty, David E.↗

ON THE ACCURACY OF WEAK-LENSING CLUSTER MASS RECONSTRUCTIONS

We study the bias and scatter in mass measurements of galaxy clusters resulting from fitting a spherically symmetric Navarro, Frenk, and White model to the reduced tangential shear profile measured in weak-lensing (WL) observations. The reduced shear profiles are generated for {approx}10{sup 4} cluster-sized halos formed in a {Lambda}CDM cosmological N-body simulation of a 1 h{sup -1} Gpc box. In agreement with previous studies, we find that the scatter in the WL masses derived using this fitting method has irreducible contributions from the triaxial shapes of cluster-sized halos and uncorrelated large-scale matter projections along the line of sight. Additionally, we find that correlated large-scale structure within several virial radii of clusters contributes a smaller, but nevertheless significant, amount to the scatter. The intrinsic scatter due to these physical sources is {approx}20% for massive clusters and can be as high as {approx}30% for group-sized systems. For current, ground-based observations, however, the total scatter should be dominated by shape noise from the background galaxies used to measure the shear. Importantly, we find that WL mass measurements can have a small, {approx}5%-10%, but non-negligible amount of bias. Given that WL measurements of cluster masses are a powerful way to calibrate cluster mass-observable relations for precision cosmological constraints, we strongly emphasize that a robust calibration of the bias requires detailed simulations that include more observational effects than we consider here. Such a calibration exercise needs to be carried out for each specific WL mass estimation method, as the details of the method determine in part the expected scatter and bias. We present an iterative method for estimating mass M{sub 500c} that can eliminate the bias for analyses of ground-based data.

79 ASTRONOMY AND ASTROPHYSICS↗

An Efficient High-Order Solver for Diffusion Equations with Strong Anisotropy on Non-Anisotropy-Aligned Meshes

This paper concerns numerical solution of the diffusion equation with strong anisotropy on meshes not aligned with the anisotropic vector field. In order to resolve the numerical pollution for simulations on a non-anisotropy-aligned mesh and reduce the associated high computational cost we propose an effective preconditioner, extending our previous work. Similar to the anisotropy-aligned mesh case, we apply the auxiliary space preconditioning framework to design a preconditioner where a continuous finite element space is used as the auxiliary space for the discontinuous finite element space. The key component is an effective line smoother that can mitigate the high-frequency errors perpendicular to the magnetic field. We design a graph-based approach to find such a line smoother that is approximately perpendicular to the vector fields when the mesh does not align with the anisotropy. Finally, numerical experiments for several benchmark problems are presented, demonstrating the effectiveness and robustness of the proposed preconditioner when applied to Krylov iterative methods.

97 MATHEMATICS AND COMPUTING↗

TH-E-17A-02: High-Pitch and Sparse-View Helical 4D CT Via Iterative Image Reconstruction Method Based On Tensor Framelet

Purpose: 4D CT is routinely performed during radiation therapy treatment planning of thoracic and abdominal cancers. Compared with the cine mode, the helical mode is advantageous in temporal resolution. However, a low pitch (∼0.1) for 4D CT imaging is often required instead of the standard pitch (∼1) for static imaging, since standard image reconstruction based on analytic method requires the low-pitch scanning in order to satisfy the data sufficient condition when reconstructing each temporal frame individually. In comparison, the flexible iterative method enables the reconstruction of all temporal frames simultaneously, so that the image similarity among frames can be utilized to possibly perform high-pitch and sparse-view helical 4D CT imaging. The purpose of this work is to investigate such an exciting possibility for faster imaging with lower dose. Methods: A key for highpitch and sparse-view helical 4D CT imaging is the simultaneous reconstruction of all temporal frames using the prior that temporal frames are continuous along the temporal direction. In this work, such a prior is regularized through the sparsity transform based on spatiotemporal tensor framelet (TF) as a multilevel and high-order extension of total variation transform. Moreover, GPU-based fast parallel computing of X-ray transform and its adjoint together with split Bregman method is utilized for solving the 4D image reconstruction problem efficiently and accurately. Results: The simulation studies based on 4D NCAT phantoms were performed with various pitches (i.e., 0.1, 0.2, 0.5, and 1) and sparse views (i.e., 400 views per rotation instead of standard >2000 views per rotation), using 3D iterative individual reconstruction method based on 3D TF and 4D iterative simultaneous reconstruction method based on 4D TF respectively. Conclusion: The proposed TF-based simultaneous 4D image reconstruction method enables high-pitch and sparse-view helical 4D CT with lower dose and faster speed.

60 APPLIED LIFE SCIENCES↗

Generalized Jacobi method for linear bounded operators system

In this paper, we construct a generalization of the Jacobi iterative method adapted to a system of linear bounded operators. This new method is used with product integration method to solve a linear Fredholm integral equation of the second kind with a weakly singular kernel. The convergence analysis is proved. The numerical tests developed show its effectiveness.

97 MATHEMATICS AND COMPUTING↗

Two-Level Transport Methods with Independent Discretization

In this proposal, we introduce two-level nonlinear iteration methods for the transport equation in 1D slab geometry approximated by means of the linear discontinuous finite element method (LDFEM). We develop transport schemes based on the quasidiffusion (QD) method in which the low-order QD (LOQD) equations are discretized by the linear continuous finite element method (LCFEM). This requires a mapping of the LCFEM low-order solution to the LDFEM high-order solution to define the scattering term. Several mappings are proposed and analyzed. Another suggested transport discretization scheme is based on the step characteristics for the transport equation and LCFEM for the LOQD equations. We also develop new nonlinear synthetic acceleration (NSA) methods based on the LCFEM discretization of the QD equation. To gain iterative stability, the NSA algorithms are combined with the nonlinear Krylov acceleration method. We present numerical results that demonstrate performance and basic properties of the proposed discretization schemes and iterative solution methods.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Perfect discretization of reparametrization invariant path integrals

To obtain a well-defined path integral one often employs discretizations. In the case of gravity and reparametrization-invariant systems, the latter of which we consider here as a toy example, discretizations generically break diffeomorphism and reparametrization symmetry, respectively. This has severe implications, as these symmetries determine the dynamics of the corresponding system. Indeed we will show that a discretized path integral with reparametrization-invariance is necessarily also discretization independent and therefore uniquely determined by the corresponding continuum quantum mechanical propagator. We use this insight to develop an iterative method for constructing such a discretized path integral, akin to a Wilsonian RG flow. This allows us to address the problem of discretization ambiguities and of an anomaly-free path integral measure for such systems. The latter is needed to obtain a path integral, that can act as a projector onto the physical states, satisfying the quantum constraints. We will comment on implications for discrete quantum gravity models, such as spin foams.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Preconditioned Mixed Spectral Element Methods for Elasticity and Stokes Problems

Preconditioned iterative methods for the indefinite systems obtained by discretizing the linear elasticity and Stokes problems with mixed spectral elements in three dimensions are introduced and analyzed. The resulting stiffness matrices have the structure of saddle point problems with a penalty term, which is associated with the Poisson ratio for elasticity problems or with stabilization techniques for Stokes problems. The main results of this paper show that the convergence rate of the resulting algorithms is independent of the penalty parameter, the number of spectral elements Nu and mildly dependent on the spectral degree eta via the inf-sup constant. The preconditioners proposed for the whole indefinite system are block-diagonal and block-triangular. Numerical experiments presented in the final section show that these algorithms are a practical and efficient strategy for the iterative solution of the indefinite problems arising from mixed spectral element discretizations of elliptic systems.

Pavarino, Luca F.↗

GLOBAL OPTIMIZATION METHODS FOR GRAVITATIONAL LENS SYSTEMS WITH REGULARIZED SOURCES

Several approaches exist to model gravitational lens systems. In this study, we apply global optimization methods to find the optimal set of lens parameters using a genetic algorithm. We treat the full optimization procedure as a two-step process: an analytical description of the source plane intensity distribution is used to find an initial approximation to the optimal lens parameters; the second stage of the optimization uses a pixelated source plane with the semilinear method to determine an optimal source. Regularization is handled by means of an iterative method and the generalized cross validation (GCV) and unbiased predictive risk estimator (UPRE) functions that are commonly used in standard image deconvolution problems. This approach simultaneously estimates the optimal regularization parameter and the number of degrees of freedom in the source. Using the GCV and UPRE functions, we are able to justify an estimation of the number of source degrees of freedom found in previous work. We test our approach by applying our code to a subset of the lens systems included in the SLACS survey.

79 ASTRONOMY AND ASTROPHYSICS↗