Search NASA⌕ Search

SEARCH · Search NASA

Results for “linear solver”

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 757 records · Page 42

Solving the Unit Commitment Problem: Polyhedral Theory, Symmetry, and Power Flow

In this talk, I will give an overview of mixed integer linear programming (MILP) formulations and extensions thereof which enable the effective solution of the unit commitment problem (UC) when paired with a commercial MILP solver. First, we will place UC in context, stressing the importance of achieving a (near) optimal solution. Then we will discuss the importance of perfect and "good-enough" formulations for individual generators / market participants. Some of these formulations enable symmetry-aware reformulations for identical market participants, which can be critical when symmetry is present. Finally, we will discuss approximations of AC power flow currently used in practice, and the challenges with including these approximations within the UC formulation.

MATHEMATICS AND COMPUTING↗

Adaptive AMG with Coarsening Based on Compatible Weighted Matching

We introduce a new composite adaptive Algebraic Multigrid (composite αAMG) method to solve systems of linear equations without a-priori knowledge or assumption on characteristics of near-null components of the AMG preconditioned problem referred to as algebraic smoothness. Our version of αAMG is a composite solver built through a bootstrap strategy aimed to obtain a desired convergence rate. The coarsening process employed to build each new solver component relies on a pairwise aggregation scheme based on maximum weighted matching in a graph and on principles of compatible relaxation. The latter replaces the commonly used characterization of strength of connection in both the coarse space selection and in the interpolation scheme. The goal is to design a method leading to scalable AMG for a wide class of problems that go beyond the standard elliptic Partial Differential Equations (PDEs). In the present work, we introduce the method and demonstrate its potential when applied to symmetric positive definite linear systems arising from finite element discretization of highly anisotropic elliptic PDEs on structured and unstructured meshes.

97 MATHEMATICS AND COMPUTING↗

Inverse transport problem solvers based on regularized and compressive sensing techniques

According to the direct exposure measurements from flash radiographic image, regularized-based method and compressive sensing (CS)-based method for inverse transport equation are presented. The linear absorption coefficients and interface locations of objects are reconstructed directly at the same time. With a large number of measurements, least-square method is utilized to complete the reconstruction. Owing to the ill-posedness of the inverse problems, regularized algorithm is employed. Tikhonov method is applied with an appropriate posterior regularization parameter to get a meaningful solution. However, it's always very costly to obtain enough measurements. With limited measurements, CS sparse reconstruction technique Orthogonal Matching Pursuit (OMP) is applied to obtain the sparse coefficients by solving an optimization problem. This paper constructs and takes the forward projection matrix rather than Gauss matrix as measurement matrix. In the CS-based algorithm, Fourier expansion and wavelet expansion are adopted to convert an underdetermined system to a well-posed system. Simulations and numerical results of regularized method with appropriate regularization parameter and that of CS-based agree well with the reference value, furthermore, both methods avoid amplifying the noise. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A Fokker-Planck-Landau collision equation solver on two-dimensional velocity grid and its application to particle-in-cell simulation

An approximate two-dimensional solver of the nonlinear Fokker-Planck-Landau collision operator has been developed using the assumption that the particle probability distribution function is independent of gyroangle in the limit of strong magnetic field. The isotropic one-dimensional scheme developed for nonlinear Fokker-Planck-Landau equation by Buet and Cordier [J. Comput. Phys. 179, 43 (2002)] and for linear Fokker-Planck-Landau equation by Chang and Cooper [J. Comput. Phys. 6, 1 (1970)] have been modified and extended to two-dimensional nonlinear equation. In addition, a method is suggested to apply the new velocity-grid based collision solver to Lagrangian particle-in-cell simulation by adjusting the weights of marker particles and is applied to a five dimensional particle-in-cell code to calculate the neoclassical ion thermal conductivity in a tokamak plasma. Error verifications show practical aspects of the present scheme for both grid-based and particle-based kinetic codes.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Adaptive Algebraic Smoothers

methods based on Local Sensitivity Analysis (LSA). The method can be used in the context of geometric and algebraic multigrid methods for constructing smoothers, and in the context of Krylov methods for constructing block preconditioners. It is suitable for both constant and variable coecient problems. Furthermore, the method can be applied to systems arising from both scalar and coupled system partial differential equations (PDEs), as well as linear systems that do not arise from PDEs. The simplicity of the method will allow it to be easily incorporated into existing multigrid and Krylov solvers while providing a powerful tool for adaptively constructing methods tuned to a problem.

99 GENERAL AND MISCELLANEOUS↗

Modal response of 4-rod type radio frequency quadrupole linac

This paper deals with the analysis and experimental study of natural frequencies of vibration of a 4-rod type radio frequency quadrupole (RFQ) linear accelerator. The eigenvalue analysis of the structure has been done both analytically (multispan beam concept) as well as using blocked Lanczos eigenvalue finite element solver with an ability to extract the rigid body modes. This has been done in the mechanical design phase to find the level of agreement between the output of simplified analytical analysis results and the output of a commercial finite element method (FEM) solver, since a full scale RFQ structure is too complex to handle analytically. Experimental validation of the analysis results has been done on the physical 1.7 m RFQ at the installation site. The experimental data obtained were later analyzed and found to be in close agreement with the predicted frequencies in the lower frequency ranges. It gets more and more deviated in the higher frequency ranges. Also some frequencies were observed during experimentation, which were not found in the finite element analysis results. The source of those frequencies are to be further investigated as it may play a predominant role in the design high quality factor beam line cavities for higher operational efficiency.

43 PARTICLE ACCELERATORS↗

Computation of pseudospectral abscissa for large-scale nonlinear eigenvalue problems

We present an algorithm to compute the pseudospectral abscissa for a nonlinear eigenvalue problem. The algorithm relies on global under-estimator and over-estimator functions for the eigenvalue and singular value functions involved. These global models follow from eigenvalue perturbation theory. The algorithm has three particular features. First, it converges to the globally rightmost point of the pseudospectrum, and it is immune to nonsmoothness. The global convergence assertion is under the assumption that a global lower bound is available for the second derivative of a singular value function depending on one parameter. It may not be easy to deduce such a lower bound analytically, but assigning large negative values works robustly in practice. Second, it is applicable to large-scale problems since the dominant cost per iteration stems from computing the smallest singular value and associated singular vectors, for which efficient iterative solvers can be used. Furthermore, a significant increase in computational efficiency can be obtained by subspace acceleration, that is, by restricting the domains of the linear maps associated with the matrices involved to small but suitable subspaces, and solving the resulting reduced problems. Occasional restarts of these subspaces further enhance the efficiency for large-scale problems. Finally, in contrast to existing iterative approaches based on constructing low-rank perturbations and rightmost eigenvalue computations, the algorithm relies on computing only singular values of complex matrices. Hence, the algorithm does not require solutions of nonlinear eigenvalue problems, thereby further increasing efficiency and reliability. This work is accompanied by a robust implementation of the algorithm that is publicly available.

97 MATHEMATICS AND COMPUTING↗

Quantum algorithm for the linear Vlasov equation with collisions

The Vlasov equation is a nonlinear partial differential equation that provides a first-principles description of the dynamics of plasmas. Its linear limit is routinely used in plasma physics to investigate plasma oscillations and stability. In this paper, we present a quantum algorithm that simulates the linearized Vlasov equation with and without collisions, in the one-dimensional electrostatic limit. Rather than solving this equation in its native spatial and velocity phase space, we adopt an efficient representation in the dual space yielded by a Fourier-Hermite expansion. For a given simulation time, the Fourier-Hermite representation is exponentially more compact, thus yielding a classical algorithm that can match the performance of a previously proposed quantum algorithm for this problem. Further, this representation results in a system of linear ordinary differential equations (ODEs) which can be solved with well-developed quantum algorithms: a Hamiltonian simulation in the collisionless case, and quantum ODE solvers in the collisional case. In particular, we demonstrate that a quadratic speedup in system size is attainable.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Signal-Preserving Erratic Noise Attenuation via Iterative Robust Sparsity-Promoting Filter

Sparse domain thresholding filters operating in a sparse domain are highly effective in removing Gaussian random noise under Gaussian distribution assumption. Erratic noise, which designates non-Gaussian noise that consists of large isolated events with known or unknown distribution, also needs to be explicitly taken into account. However, conventional sparse domain thresholding filters based on the least-squares (LS) criterion are severely sensitive to data with high-amplitude and non-Gaussian noise, i.e., the erratic noise, which makes the suppression of this type of noise extremely challenging. Here, in this paper, we present a robust sparsity-promoting denoising model, in which the LS criterion is replaced by the Huber criterion to weaken the effects of erratic noise. The random and erratic noise is distinguished by using a data-adaptive parameter in the presented method, where random noise is described by mean square, while the erratic noise is downweighted through a damped weight. Different from conventional sparse domain thresholding filters, definition of the misfit between noisy data and recovered signal via the Huber criterion results in a nonlinear optimization problem. With the help of theoretical pseudoseismic data, an iterative robust sparsity-promoting filter is proposed to transform the nonlinear optimization problem into a linear LS problem through an iterative procedure. The main advantage of this transformation is that the nonlinear denoising filter can be solved by conventional LS solvers. Lastly, tests with several data sets demonstrate that the proposed denoising filter can successfully attenuate the erratic noise without damaging useful signal when compared with conventional denoising approaches based on the LS criterion.

97 MATHEMATICS AND COMPUTING↗

Baryon fraction from the BAO amplitude: a consistent approach to parameterizing perturbation growth

Galaxy clustering constrains the baryon fraction Omega_b/Omega_m through the amplitude of baryon acoustic oscillations and the suppression of perturbations entering the horizon before recombination. This produces a different pre-recombination distribution of baryons and dark matter. After recombination, the gravitational potential responds to both components in proportion to their mass, allowing robust measurement of the baryon fraction. This is independent of new-physics scenarios altering the recombination background (e.g. Early Dark Energy). The accuracy of such measurements does, however, depend on how baryons and CDM are modeled in the power spectrum. Previous template-based splitting relied on approximate transfer functions that neglected part of information. We present a new method that embeds an extra parameter controlling the balance between baryons and dark matter in the growth terms of the perturbation equations in the CAMB Boltzmann solver. This approach captures the baryonic suppression of CDM prior to recombination, avoids inconsistencies, and yields a clean parametrization of the baryon fraction in the linear power spectrum, separating out the simple physics of growth due to the combined matter potential. We implement this framework in an analysis pipeline using Effective Field Theory of Large-Scale Structure with HOD-informed priors and validate it against noiseless LCDM and EDE cosmologies with DESI-like errors. The new scheme achieves comparable precision to previous splitting while reducing systematic biases, providing a more robust way to baryon-fraction measurements. In combination with BBN constraints on the baryon density and Alcock-Paczynski estimates of the matter density, these results strengthen the use of baryon fraction measurements to derive a Hubble constant from energy densities, with future DESI and Euclid data expected to deliver competitive constraints.

Crespi, Andrea [U. Waterloo (main); Waterloo U., I↗

Dark Current Simulation for Linear Collider Accelerator Structures

The dynamics of field-emitted electrons in the traveling wave fields of a constant gradient (tapered) disk-loaded waveguide is followed numerically. Previous simulations have been limited to constant impedance (uniform) structures for sake of simplicity since only the fields in a unit cell is needed. Using a finite element field solver on a parallel computer, the fields in the tapered structure can now be readily generated. We will obtain the characteristics of the dark current emitted from both structure types and compare the two results with and without the effect of secondary electrons. The NLC and JLC detuned structures are considered to study if dark current may pose a problem for high gradient acceleration in the next generation of Linear Colliders.

43 PARTICLE ACCELERATORS↗

A fast Fourier transform-based solver for elastic micropolar composites

This work presents a spectral micromechanical formulation for obtaining the full-field and homogenized response of elastic micropolar composites. The algorithm relies on a coupled set of convolution integral equations for the micropolar strains, where periodic Green’s operators associated with a linear homogeneous reference medium are convolved with functions of the Cauchy and couple stress fields that encode the material’s heterogeneity, as well as any potential material nonlinearity. Such convolution integral equations take an algebraic form in the reciprocal Fourier space that can be solved iteratively. In this vein, the fast Fourier transform (FFT) algorithm is leveraged to accelerate the numerical solution, resulting in a mesh-free formulation in which the periodic unit cell representing the heterogeneous material can be discretized by a regular grid of pixels in two dimensions (or voxels in three dimensions). For verification, the numerical solutions obtained with the micropolar FFT solver are compared with analytical solutions for a matrix with a dilute circular inclusion subjected to plane strain loading. The developed computational framework is then used to study length-scale effects and effective (micropolar) moduli of composites with various topological configurations.

97 MATHEMATICS AND COMPUTING↗

Wave modeling in a cylindrical non-uniform helicon discharge

A radio frequency field solver based on Maxwell's equations and a cold plasma dielectric tensor is employed to describe wave phenomena observed in a cylindrical non-uniform helicon discharge. The experiment is carried out on a recently built linear plasma-material interaction machine: The magnetized plasma interaction experiment [Blackwell et al., Plasma Sources Sci. Technol. (submitted)], in which both plasma density and static magnetic field are functions of axial position. The field strength increases by a factor of 15 from source to target plate, and the plasma density and electron temperature are radially non-uniform. With an enhancement factor of 9.5 to the electron-ion Coulomb collision frequency, a 12% reduction in the antenna radius, and the same other conditions as employed in the experiment, the solver produces axial and radial profiles of wave amplitude and phase that are consistent with measurements. A numerical study on the effects of axial gradient in plasma density and static magnetic field on wave propagations is performed, revealing that the helicon wave has weaker attenuation away from the antenna in a focused field compared to a uniform field. This may be consistent with observations of increased ionization efficiency and plasma production in a non-uniform field. We find that the relationship between plasma density, static magnetic field strength, and axial wavelength agrees well with a simple theory developed previously. A numerical scan of the enhancement factor to the electron-ion Coulomb collision frequency from 1 to 15 shows that the wave amplitude is lowered and the power deposited into the core plasma decreases as the enhancement factor increases, possibly due to the stronger edge heating for higher collision frequencies.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Design Considerations for GPU-based Mixed Integer Programming on Parallel Computing Platforms

Mixed Integer Programming (MIP) is a powerful abstraction in combinatorial optimization that finds real-life application across many significant sectors. The recent proliferation of graphical processing unit (GPU)-based accelerated computing architectures in large-scale parallel computing or supercomputing presents new opportunities as well as challenges in the advancement of MIP solver technology to effectively use the new accelerated computing platforms and scale to large parallel systems. Here, we recount the conventional processor-based strategies and focus on configurations where the most promising intersection lies between parallel MIP solver approaches and the specific strengths of accelerated parallel platforms. We note that the best potential lies in solving problems whose individual matrix sizes (of the linear program relaxation) fit entirely within one accelerator's memory and whose branch-and-bound (or branch-and-cut) trees cannot be fully contained within a small number of computational nodes. Additionally, we identify ideal features of computational linear algebra support on GPU accelerators that would help advance this direction of scalable parallel solution of MIP problems on GPU-based accelerated computing architectures.

Perumalla, Kalyan↗

A computational methodology for learning low-complexity surrogate models of process from experiments or simulations. (Paper 679a)

Costly and/or insufficiently robust simulations or experiments can often pose difficulties when their use extends well beyond a single evaluation. This is case with the numerous evaluations of uncertainty quantification, when an algebraic model is needed for optimization, as well as numerous other areas. To overcome these difficulties, we generate an accurate set of algebraic surrogate models of disaggregated process blocks of the experiment or simulation. We developed a method that uses derivative-based and derivative-free optimization alongside machine learning and statistical techniques to generate the set of surrogate models using data sampled from experiments or detailed simulations. Our method begins by building a low-complexity surrogate model for each block from an initial sample set. The model is built using a best subset technique that leverages a mixed-integer linear problem formulation to allow for very large initial basis sets. The models are then tested, exploited, and improved through the use of derivative-free solvers to adaptively sample new simulation or experimental points. The sets of surrogate models from each disaggregated process block are then combined with heat and mass balances around each disaggregated block to generate a full algebraic model of the process. The full model can be used for cheap and accurate evaluations of the original simulation or experiment or combined with design specifications and an objective for nonlinear optimization.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

SIESTA: A scalable iterative equilibrium solver for toroidal applications

A new solver for rapidly obtaining magnetohydrodynamic (MHD) equilibria in toroidal systems in the presence of islands and stochastic regions is described. It is based on the Kulsrud-Kruskal MHD energy minimization principle. To carry out this minimization, small displacements are made around a convenient set of curvilinear coordinates obtained from a nearby three-dimensional equilibrium that assumes nested surfaces. Because the changes of the magnetic fields and pressure are small, corresponding to small changes in the initial magnetic and kinetic energies, solutions for the linearized perturbations can be used to rapidly and iteratively find lower energy states with magnetic islands. A physics-based preconditioner is developed to accelerate the convergence of the iterative procedure to obtain an ideal MHD equilibrium with broken magnetic surfaces (islands).

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Optimal design and dispatch of a system of diesel generators, photovoltaics and batteries for remote locations

Renewable energy technologies, specifically, solar photovoltaic cells, combined with battery storage and diesel generators, form a hybrid system capable of independently powering remote locations, i.e., those isolated from larger grids. If sized correctly, hybrid systems reduce fuel consumption compared to diesel generator-only alternatives. We present an optimization model for establishing a hybrid power design and dispatch strategy for remote locations, such as a military forward operating base, that models the acquisition of different power technologies as integer variables and their operation using nonlinear expressions. Our cost-minimizing, nonconvex, mixed-integer, nonlinear program contains a detailed battery model. Due to its complexities, we present linearizations, which include exact and convex under-estimation techniques, and a heuristic, which determines an initial feasible solution to serve as a “warm start” for the solver. We determine, in a few hours at most, solutions within 5% of optimality for a candidate set of technologies; these solutions closely resemble those from the nonlinear model. Lastly, our instances contain real data spanning a yearly horizon at hour fidelity and demonstrate that a hybrid system could reduce fuel consumption by as much as 50% compared to a generator-only solution.

14 SOLAR ENERGY↗

Scalable parallel methods for monolithic coupling in fluid-structure interaction with application to blood flow modeling

We introduce and study numerically a scalable parallel finite element solver for the simulation of blood flow in compliant arteries. The incompressible Navier-Stokes equations are used to model the fluid and coupled to an incompressible linear elastic model for the blood vessel walls. Our method features an unstructured dynamic mesh capable of modeling complicated geometries, an arbitrary Lagrangian-Eulerian framework that allows for large displacements of the moving fluid domain, monolithic coupling between the fluid and structure equations, and fully implicit time discretization. Simulations based on blood vessel geometries derived from patient-specific clinical data are performed on large supercomputers using scalable Newton-Krylov algorithms preconditioned with an overlapping restricted additive Schwarz method that preconditions the entire fluid-structure system together. The algorithm is shown to be robust and scalable for a variety of physical parameters, scaling to hundreds of processors and millions of unknowns.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗