Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 55 records · Page 3

New-Sum: A Novel Online ABFT Scheme For General Iterative Methods

Emerging high-performance computing platforms, with large component counts and lower power margins, are anticipated to be more susceptible to soft errors in both logic circuits and memory subsystems. We present an online algorithm-based fault tolerance (ABFT) approach to efficiently detect and recover soft errors for general iterative methods. We design a novel checksum-based encoding scheme for matrix-vector multiplication that is resilient to both arithmetic and memory errors. Our design decouples the checksum updating process from the actual computation, and allows adaptive checksum overhead control. Building on this new encoding mechanism, we propose two online ABFT designs that can effectively recover from errors when combined with a checkpoint/rollback scheme.

Instantaneous Footprint↗

Optimal Iterative Method for Network Utility Maximization with Intertemporal Constraints

Network utility maximization (NUM) has been widely used to solve the optimal resource allocation problem in wireless network and power systems. The network planner aims to allocate generation and demand over producers and consumers such that social welfare is maximized while supply and demand are balanced, and network constraints such as branch capacity constraints are satisfied. However, when taking into account dynamics of agents, such as ramp rate constraints on power output for suppliers and impact of cumulative prior consumption on current demand for consumers, a single-period formulation is not sufficient. We propose an iterative method for the multi-period NUM with intertemporal constraints based on dual decomposition. It features a price iteration scheme that achieves optimal social welfare, and the algorithm is guaranteed to converge if proper concavity condition holds. We illustrate the iterative algorithm by power system examples. It is shown that similar to locational marginal price (LMP) in power systems, time-varying congestion prices arise when there exists binding branch constraints. Simulation results also demonstrate that there is increase in social welfare compared to a single-period formulation.

Ma, Ke↗

Iterative methods in GPU-resident linear solvers for nonlinear constrained optimization

Linear solvers are major computational bottlenecks in a wide range of decision support and optimization computations. The challenges become even more pronounced on heterogeneous hardware, where traditional sparse numerical linear algebra methods are often inefficient. For example, methods for solving ill-conditioned linear systems have relied on conditional branching, which degrades performance on hardware accelerators such as graphical processing units (GPUs). To improve the efficiency of solving ill-conditioned systems, our computational strategy separates computations that are efficient on GPUs from those that need to run on traditional central processing units (CPUs). Our strategy maximizes the reuse of expensive CPU computations. Iterative methods, which thus far have not been broadly used for ill-conditioned linear systems, play an important role in our approach. In particular, we extend ideas from Arioli et al., (2007) to implement iterative refinement using inexact LU factors and flexible generalized minimal residual (FGMRES), with the aim of efficient performance on GPUs. In conclusion, we focus on solutions that are effective within broader application contexts, and discuss how early performance tests could be improved to be more predictive of the performance in a realistic environment.

97 MATHEMATICS AND COMPUTING↗

An iterative method for tomographic x-ray perfusion estimation in a decomposition model-based approach

Purpose: X-ray based tomographic blood perfusion imaging requires recovery of contrast time-attenuation-curves from dynamic projection data. When using slowly rotating imaging systems, this task is challenging due to nonsimultaneous projection acquisition. A dynamic reconstruction method is proposed that aims at compensating the lack of simultaneously acquired information by incorporating prior knowledge about the expected temporal contrast dynamics. Methods: A decomposition model using temporal basis functions to approximate time-attenuation-curves is integrated into an iterative tomographic reconstruction method. The computationally efficient implementation of the proposed approach makes use of standard forward-projections and backprojections, as well as scalar products in image space. The critical issue of projection noise propagation is tackled by the application of regularization which is realized by the early stopping of iteration cycles and by the proper selection of smooth temporal basis functions. The performance of the proposed dynamic reconstruction approach is evaluated in a simulation study concerning various aspects: Noise propagation and regularization, specification of the temporal model, and type of acquisition mode. Results: The evaluation based on dynamic phantom data indicates that tomographic recovery of contrast time-attenuation-curves in tissue can be achieved with an average range of accuracy of {approx}2% (with respect to dynamic peak attenuation) under ideal noise-free conditions. The relative estimation error for arterial time-attenuation-curves is in the range of 8%, which is due to faster contrast dynamics in the artery. In general, performance depends on the level of acquired information contained in the projection data, which is mainly influenced by the type of rotational acquisition mode; restrictions in angular range and speed can lead to limited accuracy. The analysis of propagated projection noise in a statistical bias-variance framework reveals relative noise levels in estimated time-attenuation-curves of 3%-4% in tissue regions and below 1% in vessels when using optimized settings for regularization. Here, the effect of noise suppression depends on the interrelation between the number of iteration cycles and the constraints imposed by the temporal decomposition model. Conclusions: For usage with slowly rotating imaging systems, the presented model-based iterative dynamic reconstruction method is capable of recovering contrast time-attenuation-curves related to tissue perfusion. The proposed regularization framework is an effective means to limit the impact of projection noise, which is a factor dominating estimation accuracy in tissue regions.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

An iterative method to deblend AGN-Host contributions for Integral Field spectroscopic observations

ABSTRACT We present a new iterative deblending method to separate the host galaxy (HG) and their Active Galactic Nuclei (AGNs) emission with the use of Integral Field spectroscopic (IFS) data. The method decomposes the resolved HG emission from the unresolved AGN emission by modelling the two-dimensional surface brightness (SB) profile of the point-spread function (PSF) and the two-dimensional SB HG continuum simultaneously per each monochromatic slide. Our method does not require any prior information about the observed SB profile or a detailed fitting of the PSF, making it ideal for the automatic analysis of large galaxy samples. In this work, we test the quality of our method, its advantages, and its disadvantages. We test our method by using a set of IFS mock data cubes to quantify the reliability of our deblending process and further compare our method with the qdblend3d analysis tool. Furthermore, we applied our method to three data cubes selected from the MaNGA survey according to the dominance of either its HG or its AGN. We show that our deblending method is capable of disengaging the bright, non-resolved AGN emission from the HG continuum and its narrow emission lines. However, the decoupling depends on how well the IFS spatially resolves the PSF, and on the relative flux intensity of the HG-AGN. Therefore, the method is ideal for disentangling the bright-flux contribution from AGN-dominated spectra.

Ibarra-Medel, H. (ORCID:0000000297906313)↗

Nash equilibrium in differential games and the construction of the programmed iteration method

This work is devoted to the study of nonzero-sum differential games. The set of payoffs in a situation of Nash equilibrium is examined. It is shown that the set of payoffs in a situation of Nash equilibrium coincides with the set of values of consistent functions which are fixed points of the program absorption operator. A condition for functions to be consistent is given in terms of the weak invariance of the graph of the functions under a certain differential inclusion. Bibliography: 18 titles.

97 MATHEMATICS AND COMPUTING↗

A relaxed two-step splitting iteration method for computing PageRank

In this paper, we extend the two-step matrix splitting iteration approach by introducing a new relaxation parameter. The main idea is based on the inner–outer iteration for solving the PageRank problems proposed by Gleich et al. (J Sci Comput 32(1): 349–371, 2010) and Bai (Numer Algebra Cont Optim 2(4): 855–862, 2012) and the two-step splitting iteration presented by Gu et al. (Appl Math Comput 271: 337–343, 2015). The theoretical analysis results show that the proposed method is efficient. Numerical experiments demonstrate that the convergence performances of the method are better than the existing methods.

97 MATHEMATICS AND COMPUTING↗

Implementation of a cell-wise Block-Gauss-Seidel iterative method for SN transport on a hybrid parallel computer architecture

We have implemented a cell-wise, block-Gauss-Seidel (bGS) iterative algorithm, for the solution of the S{sub n} transport equations on the Roadrunner hybrid, parallel computer architecture. A compute node of this massively parallel machine comprises AMD Opteron cores that are linked to a Cell Broadband Engine{trademark} (Cell/B.E.). LAPACK routines have been ported to the Cell/B.E. in order to make use of its parallel Synergistic Processing Elements (SPEs). The bGS algorithm is based on the LU factorization and solution of a linear system that couples the fluxes for all S{sub n} angles and energy groups on a mesh cell. For every cell of a mesh that has been parallel decomposed on the higher-level Opteron processors, a linear system is transferred to the Cell/B.E. and the parallel LAPACK routines are used to compute a solution, which is then transferred back to the Opteron, where the rest of the computations for the S{sub n} transport problem take place. Compared to standard parallel machines, a hundred-fold speedup of the bGS was observed on the hybrid Roadrunner architecture. Numerical experiments with strong and weak parallel scaling demonstrate the bGS method is viable and compares favorably to full parallel sweeps (FPS) on two-dimensional, unstructured meshes when it is applied to optically thick, multi-material problems. As expected, however, it is not as efficient as FPS in optically thin problems.

97 MATHEMATICS AND COMPUTING↗

Extending the density functional embedding theory to finite temperature and an efficient iterative method for solving for embedding potentials

A key element in the density functional embedding theory (DFET) is the embedding potential. We discuss two major issues related to the embedding potential: (1) its non-uniqueness and (2) the numerical difficulty for solving for it, especially for the spin-polarized systems. To resolve the first issue, we extend DFET to finite temperature: all quantities, such as the subsystem densities and the total system’s density, are calculated at a finite temperature. This is a physical extension since materials work at finite temperatures. We show that the embedding potential is strictly unique at T > 0. To resolve the second issue, we introduce an efficient iterative embedding potential solver. We discuss how to relax the magnetic moments in subsystems and how to equilibrate the chemical potentials across subsystems. The solver is robust and efficient for several non-trivial examples, in all of which good quality spin-polarized embedding potentials were obtained. We also demonstrate the solver on an extended periodic system: iron body-centered cubic (110) surface, which is related to the modeling of the heterogeneous catalysis involving iron, such as the Fischer-Tropsch and the Haber processes. This work would make it efficient and accurate to perform embedding simulations of some challenging material problems, such as the heterogeneous catalysis and the defects of complicated spin configurations in electronic materials.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Robust Iterative Method for Symmetric Quantum Signal Processing in All Parameter Regimes

Here, this paper addresses the problem of solving nonlinear systems in the context of symmetric quantum signal processing (QSP), a powerful technique for implementing matrix functions on quantum computers. Symmetric QSP focuses on representing target polynomials as products of matrices in SU(2) that possess symmetry properties. We present a novel Newton’s method tailored for efficiently solving the nonlinear system involved in determining the phase factors within the symmetric QSP framework. Our method demonstrates rapid and robust convergence in all parameter regimes, including the challenging scenario with ill-conditioned Jacobian matrices, using standard double precision arithmetic operations. For instance, solving symmetric QSP for a highly oscillatory target function α cos(1000x) (polynomial degree ≈ 1433) takes 6 iterations to converge to machine precision when α = 0.9, and the number of iterations only increases to 18 iterations when α = 1 – 10 -9 with a highly ill-conditioned Jacobian matrix. Leveraging the matrix product state structure of symmetric QSP, the computation of the Jacobian matrix incurs a computational cost comparable to a single function evaluation. Moreover, we introduce a reformulation of symmetric QSP using real-number arithmetics, further enhancing the method’s efficiency. Extensive numerical tests validate the effectiveness and robustness of our approach, which has been implemented in the QSPPACK software package.

97 MATHEMATICS AND COMPUTING↗

Iterative methods for dose reduction and image enhancement in tomography

A system and method for creating a three dimensional cross sectional image of an object by the reconstruction of its projections that have been iteratively refined through modification in object space and Fourier space is disclosed. The invention provides systems and methods for use with any tomographic imaging system that reconstructs an object from its projections. In one embodiment, the invention presents a method to eliminate interpolations present in conventional tomography. The method has been experimentally shown to provide higher resolution and improved image quality parameters over existing approaches. A primary benefit of the method is radiation dose reduction since the invention can produce an image of a desired quality with a fewer number projections than seen with conventional methods.

47 OTHER INSTRUMENTATION↗

An efficient iterative method for dynamical Ginzburg-Landau equations

Here we propose a new finite element approach to solving the time-dependent Ginzburg-Landau equations for superconductivity under the temporal gauge and design an efficient preconditioner for the Newton iteration of the resulting discrete system. It solves the vector magnetic potential in $H$(curl) space by the lowest order of the second kind N´ed´elec element. This approach offers a simple way to deal with the boundary conditions, leading to a stable and reliable performance for superconductor geomtry with reentrant corners. The bench-marking in numerical simulations verifies the efficiency of the proposed preconditioner, which can be employed to significantly speed up in large-scale computations.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

HyKKT: a hybrid direct-iterative method for solving KKT linear systems

Here, we propose a solution strategy for the large indefinite linear systems arising in interior methods for nonlinear optimization. The method is suitable for implementation on hardware accelerators such as graphical processing units (GPUs). The current gold standard for sparse indefinite systems is the LBLT factorization where L is a lower triangular matrix and B is 1×1 or 2×2 block diagonal. However, this requires pivoting, which substantially increases communication cost and degrades performance on GPUs. Our approach solves a large indefinite system by solving multiple smaller positive definite systems, using an iterative solver on the Schur complement and an inner direct solve (via Cholesky factorization) within each iteration. Cholesky is stable without pivoting, thereby reducing communication and allowing reuse of the symbolic factorization. We demonstrate the practicality of our approach on large optimal power flow problems and show that it can efficiently utilize GPUs and outperform LBL T factorization of the full system.

97 MATHEMATICS AND COMPUTING↗