SEARCH · Engineering Papers

Results for “iterative linear solution”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 163 records · Page 9

All sources NASA NTRS DOE OSTI

DOE OSTI2014

Enabling Predictive Simulation and UQ of Complex Multiphysics PDE Systems by the Development of Goal-Oriented Variational Sensitivity Analysis and A Posteriori Error Estimation Methods

It was demonstrated that a posteriori analyses in general and in particular one that uses adjoint methods can accurately and efficiently compute numerical error estimates and sensitivity for critical Quantities of Interest (QoIs) that depend on a large number of parameters. Activities include: analysis and implementation of several time integration techniques for solving system of ODEs as typically obtained from spatial discretization of PDE systems; multirate integration methods for ordinary differential equations; formulation and analysis of an iterative multi-discretization Galerkin finite element method for multi-scale reaction-diffusion equations; investigation of an inexpensive postprocessing technique to estimate the error of finite element solution of the second-order quasi-linear elliptic problems measured in some global metrics; investigation of an application of the residual-based a posteriori error estimates to symmetric interior penalty discontinuous Galerkin method for solving a class of second order quasi-linear elliptic problems; a posteriori analysis of explicit time integrations for system of linear ordinary differential equations; derivation of accurate a posteriori goal oriented error estimates for a user-defined quantity of interest for two classes of first and second order IMEX schemes for advection-diffusion-reaction problems; Postprocessing finite element solution; and A Bayesian Framework for Uncertain Quantification of Porous Media Flows.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2013

A new least-squares transport equation compatible with voids

We define a new least-squares transport equation that is applicable in voids, can be solved using source iteration with diffusion-synthetic acceleration, and requires only the solution of an independent set of second-order self-adjoint equations for each direction during each source iteration. We derive the equation, discretize it using the S{sub n} method in conjunction with a linear-continuous finite-element method in space, and computationally demonstrate various of its properties. (authors)

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2014

A Least-Squares Transport Equation Compatible with Voids

Standard second-order self-adjoint forms of the transport equation, such as the even-parity, odd-parity, and self-adjoint angular flux equation, cannot be used in voids. Perhaps more important, they experience numerical convergence difficulties in near-voids. Here we present a new form of a second-order self-adjoint transport equation that has an advantage relative to standard forms in that it can be used in voids or near-voids. Our equation is closely related to the standard least-squares form of the transport equation with both equations being applicable in a void and having a nonconservative analytic form. However, unlike the standard least-squares form of the transport equation, our least-squares equation is compatible with source iteration. It has been found that the standard least-squares form of the transport equation with a linear-continuous finite-element spatial discretization has difficulty in the thick diffusion limit. Here we extensively test the 1D slab-geometry version of our scheme with respect to void solutions, spatial convergence rate, and the intermediate and thick diffusion limits. We also define an effective diffusion synthetic acceleration scheme for our discretization. Our conclusion is that our least-squares S n formulation represents an excellent alternative to existing second-order S n transport formulations

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

Computing material volume fractions on a superimposed mesh as applied to Monte Carlo particle transport simulations

Here, we present a newly implemented ray tracing algorithm in OpenMC for efficiently computing material volume fractions on superimposed meshes in complex geometries. By firing rays along each coordinate direction through the geometry, the approach accumulates track-length data in each mesh element, thereby determining the fractional composition of each material. Scaling studies on three different models—a random tetrahedra configuration, the Frascati Neutron Generator ITER dose rate benchmark, and a stellarator design—show excellent parallel performance, with nearly linear speedup on modern multi-threaded and distributed-memory systems. An analysis of the residual error relative to high-resolution reference solutions demonstrated that under optimal conditions it decreases as 1/R, where R is the number of rays fired, making it straightforward to achieve user-prescribed accuracy. This new functionality enables practical, mesh-based approaches for detailed nuclear analyses in production Monte Carlo workflows without resorting to expensive, fully conformal or unstructured meshing.

Monte Carlo↗

DOE OSTI2026

Precise Modeling of a Complex Solenoidal Magnetic Field Using a Combination of Analytic Functions and a PINN

We demonstrate an iterative approach to modeling a sparsely measured magnetic field in a large-bore solenoid. This approach uses a hybrid of traditional and machine learning techniques. The traditional technique is a linear least-squares fit using a series solution to Laplace's equation, while the machine learning technique involves the training of a physics-informed neural network (PINN) on the least-squares fit residuals. We use a newly defined activation function "DELTAsnake," a modification to the snake activation function proposed by Ziyin et al. that allows for stronger curvature and non-monotonicity. The combined model approximately obeys Maxwell's equations to a level sufficient for producing high quality physics simulations and analysis. Our approach is applied to a highly realistic calculation of the expected magnetic field in the Mu2e experiment's Detector Solenoid which includes a simple model for the expected statistical measurement uncertainties. Using ten toy measurement simulations, we demonstrate the capabilities of our model in comparison to the least-squares method alone; the least-squares method alone results in a reduced chi-squared statistic of ${2.15 \pm 0.01}$, while our approach improves the reduced chi-square to ${1.034 \pm 0.005}$. Furthermore, for an average toy simulation, we show that the range of the RMS of the three field component residuals reduces from ${0.07-0.37}$ Gauss to ${0.05-0.07}$ Gauss. We find that this novel method is robust against a realistic systematic uncertainty deriving from Hall probe calibration bias and can be used to significantly reduce the number of measurements required to achieve an accurate model.

Kampa, Cole [Caltech] (ORCID:0000000192972920)↗

DOE OSTI2011

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↗

DOE OSTI2015

A time-parallel method for the solution of PDE-constrained optimization problems

We study a time-parallel approach to solving quadratic optimization problems with linear time-dependent partial differential equation (PDE) constraints. These problems arise in formulations of optimal control, optimal design and inverse problems that are governed by parabolic PDE models. They may also arise as subproblems in algorithms for the solution of optimization problems with nonlinear time-dependent PDE constraints, e.g., in sequential quadratic programming methods. We apply a piecewise linear finite element discretization in space to the PDE constraint, followed by the Crank-Nicolson discretization in time. The objective function is discretized using finite elements in space and the trapezoidal rule in time. At this point in the discretization, auxiliary state variables are introduced at each discrete time interval, with the goal to enable: (i) a decoupling in time; and (ii) a fixed-point iteration to recover the solution of the discrete optimality system. The fixed-point iterative schemes can be used either as preconditioners for Krylov subspace methods or as smoothers for multigrid (in time) schemes. We present promising numerical results for both use cases.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Parallel Algebraic Multigrid for Fusion and Higher-Order PDEs

Multigrid methods play a key role in large-scale scientific simulation because they are among the fastest and most scalable approaches for solving the underlying sparse linear systems of equations that arise from a wide array of Partial Differential Equation (PDE) discretizations. Algebraic multigrid (AMG) is a special type of multigrid method that depends only on the description of the linear system, giving it better portability and broader applicability than geometric multigrid, as it requires no explicit knowledge of the problem geometry. Even though these methods are widely used today, there are still applications where further development is needed. In this report, we focus on PDEs with higher-order terms (e.g., fourth order), concentrating on a PDE that arises in tokamak edge plasma simulations (a tokamak is a machine that confines a plasma using magnetic fields and is believed to be the leading plasma confinement concept for future fusion power plants). General multigrid relaxes a linear system on coarser grids and reverses this process with interpolation, but standard AMG methods struggle with the aforementioned higher-order PDEs. We investigate cyclic coarsening and interpolation heuristics, as well as new iterative approximation methods of refining the solution at each grid to improve the existing multigrid approach. To this end, we ensure that these techniques are transferable to a parallelized setting with LLNL’s supercomputers.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

DIII-D research to provide solutions for ITER and fusion energy

The DIII-D tokamak has elucidated crucial physics and developed projectable solutions for ITER and fusion power plants in the key areas of core performance, boundary heat and particle transport, and integrated scenario operation, with closing the core-edge integration knowledge gap being the overarching mission. New experimental validation of high-fidelity, multi-channel, non-linear gyrokinetic turbulent transport models for ITER provides strong confidence it will achieve Q ≥ 10 operation. Experiments identify options for easing H-mode access in hydrogen, and give new insight into the isotopic dependence of transport and confinement. Analysis of 2,1 islands in unoptimized low-torque IBS demonstration discharges suggests their onset time occurs randomly in the constant β phase, most often triggered by non-linear 3-wave coupling, thus identifying an NTM seeding mechanism to avoid. Pure deuterium SPI for disruption mitigation is shown to provide favorable slow cooling, but poor core assimilation, suggesting paths for improved SPI on ITER. At the boundary, measured neutral density and ionization source fluxes are strongly poloidally asymmetric, implying a 2D treatment is needed to model pedestal fuelling. Detailed measurements of pedestal and SOL quantities and impurity charge state radiation in detached divertors has validated edge fluid modelling and new self-consistent 'pedestal-to-divertor' integrated modeling that can be used to optimize reactors. New feedback adaptive ELM control minimizes confinement reduction, and RMP ELM suppression with sustained high core performance was obtained for the first time with the outer strike point in a W-coated, compact and unpumped small-angle slot divertor. Advances have been made in integrated operational scenarios for ITER and power plants. Wide pedestal intrinsically ELM-free QH-modes are produced with more reactor-relevant conditions, Low torque IBS with W-equivalent radiators can exhibit predator-prey oscillations in Te and radiation which need control. High-β P scenarios with q min > 2, q 95 –7.9, β N > 4, β T –3.3% and H 98y2 > 1.5 are sustained with high density ($\overline{n}$ = 7E19 m -3 , f G –1) for 6 τ E , improving confidence in steady-state tokamak reactors. Diverted NT plasmas achieve high core performance with a non-ELMing edge, offering a possible highly attractive core-edge integration solution for reactors.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2017

Plasma–wall interaction studies within the EUROfusion consortium: progress on plasma-facing components development and qualification

The provision of a particle and power exhaust solution which is compatible with first-wall components and edge-plasma conditions is a key area of present-day fusion research and mandatory for a successful operation of ITER and DEMO. The work package plasma-facing components (WP PFC) within the European fusion programme complements with laboratory experiments, i.e. in linear plasma devices, electron and ion beam loading facilities, the studies performed in toroidally confined magnetic devices, such as JET, ASDEX Upgrade, WEST etc. The connection of both groups is done via common physics and engineering studies, including the qualification and specification of plasma-facing components, and by modelling codes that simulate edge-plasma conditions and the plasma–material interaction as well as the study of fundamental processes. WP PFC addresses these critical points in order to ensure reliable and efficient use of conventional, solid PFCs in ITER (Be and W) and DEMO (W and steel) with respect to heat-load capabilities (transient and steady-state heat and particle loads), lifetime estimates (erosion, material mixing and surface morphology), and safety aspects (fuel retention, fuel removal, material migration and dust formation) particularly for quasi-steady-state conditions. Alternative scenarios and concepts (liquid Sn or Li as PFCs) for DEMO are developed and tested in the event that the conventional solution turns out to not be functional. Here, we present an overview of the activities with an emphasis on a few key results: (i) the observed synergistic effects in particle and heat loading of ITER-grade W with the available set of exposition devices on material properties such as roughness, ductility and microstructure; (ii) the progress in understanding of fuel retention, diffusion and outgassing in different W-based materials, including the impact of damage and impurities like N; and (iii), the preferential sputtering of Fe in EUROFER steel providing an in situ W surface and a potential first-wall solution for DEMO.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2019

Low-Rank Solution Methods for Stochastic Eigenvalue Problems

In this report, we study efficient solution methods for stochastic eigenvalue problems arising from discretization of self-adjoint partial differential equations with random data, where the underlying operators depend linearly on the random parameters. With the stochastic Galerkin approach, the solutions are represented as generalized polynomial chaos expansions. When these solutions can be approximated well by low-rank objects, we introduce a low-rank variant of the inverse subspace iteration algorithm for computing one or several minimal eigenvalues and corresponding eigenvectors of parameter-dependent matrices. In the algorithm, the iterates are approximated by low-rank matrices, which leads to significant cost savings. Furthermore, the algorithm is tested on two benchmark problems, a stochastic diffusion problem with some poorly separated eigenvalues, and an operator derived from a discrete stochastic Stokes problem whose minimal eigenvalue is related to the inf-sup stability constant. Numerical experiments show that the low-rank algorithm produces accurate solutions compared to the Monte Carlo method, and it uses much less computational time than the original algorithm without low-rank approximation.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2014

Block-Iterative Methods for 3D Constant-Coefficient Stencils on GPUs and Multicore CPUs

Block iterative methods are extremely important as smoothers for multigrid methods, as preconditioners for Krylov methods, and as solvers for diagonally dominant linear systems. Developing robust and efficient smoother algorithms suitable for current and evolving GPU and multicore CPU systems is a significant challenge. We address this issue in the case of constant-coefficient stencils arising in the solution of elliptic partial differential equations on structured 3D uniform and adaptively refined block structured grids. Robust, highly parallel implementations of block Jacobi and chaotic block Gauss-Seidel algorithms with exact inversion of the blocks are developed using different parallelization techniques. Experimental results for NVIDIA Fermi/Kepler GPUs and AMD multicore systems are presented.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2017

Numerical Analysis of 2-D and 3-D MHD Flows Relevant to Fusion Applications

Here, the analysis of many fusion applications such as liquid-metal blankets requires application of computational fluid dynamics (CFD) methods for electrically conductive liquids in geometrically complex regions and in the presence of a strong magnetic field. A current state of the art general purpose CFD code allows modeling of the flow in complex geometric regions, with simultaneous conjugated heat transfer analysis in liquid and surrounding solid parts. Together with a magnetohydrodynamics (MHD) capability, the general purpose CFD code will be a valuable tool for the design and optimization of fusion devices. This paper describes an introduction of MHD capability into the general purpose CFD code CFX, part of the ANSYS Workbench. The code was adapted for MHD problems using a magnetic induction approach. CFX allows introduction of user-defined variables using transport or Poisson equations. For MHD adaptation of the code three additional transport equations were introduced for the components of the magnetic field, in addition to the Poisson equation for electric potential. The Lorentz force is included in the momentum transport equation as a source term. Fusion applications usually involve very strong magnetic fields, with values of the Hartmann number of up to tens of thousands. In this situation a system of MHD equations become very rigid with very large source terms and very strong variable gradients. To increase system robustness, special measures were introduced during the iterative convergence process, such as linearization using source coefficient for momentum equations. The MHD implementation in general purpose CFD code was tested against benchmarks, specifically selected for liquid-metal blanket applications. Results of numerical simulations using present implementation closely match analytical solutions for a Hartmann number of up to 1500 for a 2-D laminar flow in the duct of square cross section, with conducting and nonconducting walls. Results for a 3-D test case are also included.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2017

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↗

DOE OSTI2015

Application of Fireworks Algorithm in Gamma-Ray Spectrum Fitting for Radioisotope Identification

We present that identification of radioisotopic signature patterns in gamma-ray spectra is of paramount importance in various applications of gamma spectroscopy. Therefore, there are several active research efforts to develop accurate and precise methods to perform automated spectroscopic analysis and subsequently recognize gamma-ray signatures. In this work, the authors present a new method for radioisotope identification in gamma-ray spectra obtained with a low resolution radiation detector. The method fits the obtained spectrum with a linear combina-tion of known template signature patterns. Coefficients of the linear combination are evaluated by computing the solution of a single objective optimization problem, whose objective is the Theil-1 inequality coefficient. Optimization of the problem is performed by the Fireworks Algorithm, which identifies a set of coefficients that minimize the Theil-1 value. The computed coefficients are statistically tested for being significantly different than zero or not, and if at least one is found to be zero then the Fireworks Algorithm is used to reiterate fitting using the non-zero templates. Fitting iterations are continued up to the point that no linear coefficients are found to be zero. The output of the method is a list that contains the radioisotopes that have been identified in the measured spectrum. The method is tested on a set of both simulated and real experimental gamma-ray spectra comprised of a variety of isotopes, and compared to a multiple linear regression fitting, and genetic algorithm Theil-1 based fitting. Finally, results demonstrate the potentiality of the Fireworks Algorithm based method, expressed as higher accuracy and similar precision over the other two tested methodologies for radioisotope signature pattern identification in the framework of gamma-ray spectrum fitting.

Theil Coefficient↗

DOE OSTI2017

Sequential computation of elementary modes and minimal cut sets in genome-scale metabolic networks using alternate integer linear programming

Elementary (flux) modes (EMs) have served as a valuable tool for investigating structural and functional properties of metabolic networks. Identification of the full set of EMs in genome-scale networks remains challenging due to combinatorial explosion of EMs in complex networks. It is often, however, that only a small subset of relevant EMs needs to be known, for which optimization-based sequential computation is a useful alternative. Most of the currently available methods along this line are based on the iterative use of mixed integer linear programming (MILP), the effectiveness of which significantly deteriorates as the number of iterations builds up. To alleviate the computational burden associated with the MILP implementation, we here present a novel optimization algorithm termed alternate integer linear programming (AILP). Results: Our algorithm was designed to iteratively solve a pair of integer programming (IP) and linear programming (LP) to compute EMs in a sequential manner. In each step, the IP identifies a minimal subset of reactions, the deletion of which disables all previously identified EMs. Thus, a subsequent LP solution subject to this reaction deletion constraint becomes a distinct EM. In cases where no feasible LP solution is available, IP-derived reaction deletion sets represent minimal cut sets (MCSs). Despite the additional computation of MCSs, AILP achieved significant time reduction in computing EMs by orders of magnitude. The proposed AILP algorithm not only offers a computational advantage in the EM analysis of genome-scale networks, but also improves the understanding of the linkage between EMs and MCSs.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2012

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.↗

DOE OSTI2026

NCCS High Performance GMRES Mixed Precision

HPG-MxP is a software package that performs a fixed number of multigrid preconditioned (using a Gauss-Seidel smoother) Generalized minimal residual (PGMRES) iterations in order to solve a possibly nonsymmetric large sparse linear system of equations. It is designed to be a benchmark to measure a computer's performance for sparse linear algebra workloads typical in scientific computing while allowing the use of mixed precision methods. The solution is required to have convergence characteristics and accuracy similar to double precision GMRES. It is based on the High Performance Conjugate Gradient Benchmark (HPCG) which restricts all implementations to use only the IEEE double precision format (FP64). The original implementation (https://github.com/hpg-mxp/hpg-mxp) was written by Ichitaro Yamazaki, Jennifer Loe, Christian Glusa, Sivasankaran Rajamanickam, Piotr Luszczek, and Jack Dongarra. Please refer to that repository for documentation on the original implementation. This version is maintained by the National Center for Computational Sciences at Oak Ridge National Laboratory. It is highly scalable and optimized for Oak Ridge Leadership Computing Facility (OLCF) systems, particularly Frontier.

Kashi, Aditya [Oak Ridge National Laboratory (ORNL↗