Search NASA⌕ Search

SEARCH · Search NASA

Results for “Linear Equation 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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS2013

Towards a Comprehensive Model of Jet Noise Using an Acoustic Analogy and Steady RANS Solutions

An acoustic analogy is developed to predict the noise from jet flows. It contains two source models that independently predict the noise from turbulence and shock wave shear layer interactions. The acoustic analogy is based on the Euler equations and separates the sources from propagation. Propagation effects are taken into account by calculating the vector Green's function of the linearized Euler equations. The sources are modeled following the work of Tam and Auriault, Morris and Boluriaan, and Morris and Miller. A statistical model of the two-point cross-correlation of the velocity fluctuations is used to describe the turbulence. The acoustic analogy attempts to take into account the correct scaling of the sources for a wide range of nozzle pressure and temperature ratios. It does not make assumptions regarding fine- or large-scale turbulent noise sources, self- or shear-noise, or convective amplification. The acoustic analogy is partially informed by three-dimensional steady Reynolds-Averaged Navier-Stokes solutions that include the nozzle geometry. The predictions are compared with experiments of jets operating subsonically through supersonically and at unheated and heated temperatures. Predictions generally capture the scaling of both mixing noise and BBSAN for the conditions examined, but some discrepancies remain that are due to the accuracy of the steady RANS turbulence model closure, the equivalent sources, and the use of a simplified vector Green's function solver of the linearized Euler equations.

Miller, Steven A. E.↗
DOE OSTI2022

Composing preconditioners for multiphysics PDE systems with applications to Generalized MHD

New patch smoothers or relaxation techniques are developed for solving linear matrix equations coming from systems of discretized partial differential equations (PDEs). One key linear solver challenge for many PDE systems arises when the resulting discretization matrix has a near null space that has a large dimension, which can occur in generalized magnetohydrodynamic (GMHD) systems. Patch-based relaxation is highly effective for problems when the null space can be spanned by a basis of locally supported vectors. The patch-based relaxation methods that we develop can be used either within an algebraic multigrid (AMG) hierarchy or as stand-alone preconditioners. These patch-based relaxation techniques are a form of well-known overlapping Schwarz methods where the computational domain is covered with a series of overlapping sub-domains (or patches). Patch relaxation then corresponds to solving a set of independent linear systems associated with each patch. In the context of GMHD, we also reformulate the underlying discrete representation used to generate a suitable set of matrix equations. In general, deriving a discretization that accurately approximates the curl operator and the Hall term while also producing linear systems with physically meaningful near null space properties can be challenging. Unfortunately, many natural discretization choices lead to a near null space that includes non-physical oscillatory modes and where it is not possible to span the near null space with a minimal set of locally supported basis vectors. Further discretization research is needed to understand the resulting trade-offs between accuracy, stability, and ease in solving the associated linear systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

SU-F-T-431: Dosimetric Validation of Acuros XB Algorithm for Photon Dose Calculation in Water

Purpose: To validate the Acuros XB algorithm implemented in Eclipse Treatment planning system version 11 (Varian Medical System, Inc., Palo Alto, CA, USA) for photon dose calculation. Methods: Acuros XB is a Linear Boltzmann transport equation (LBTE) solver that solves LBTE equation explicitly and gives result equivalent to Monte Carlo. 6MV photon beam from Varian Clinac-iX (2300CD) was used for dosimetric validation of Acuros XB. Percentage depth dose (PDD) and profiles (at dmax, 5, 10, 20 and 30 cm) measurements were performed in water for field size ranging from 2×2,4×4, 6×6, 10×10, 20×20, 30×30 and 40×40 cm{sup 2}. Acuros XB results were compared against measurements and anisotropic analytical algorithm (AAA) algorithm. Results: Acuros XB result shows good agreement with measurements, and were comparable to AAA algorithm. Result for PDD and profiles shows less than one percent difference from measurements, and from calculated PDD and profiles by AAA algorithm for all field size. TPS calculated Gamma error histogram values, average gamma errors in PDD curves before dmax and after dmax were 0.28, 0.15 for Acuros XB and 0.24, 0.17 for AAA respectively, average gamma error in profile curves in central region, penumbra region and outside field region were 0.17, 0.21, 0.42 for Acuros XB and 0.10, 0.22, 0.35 for AAA respectively. Conclusion: The dosimetric validation of Acuros XB algorithms in water medium was satisfactory. Acuros XB algorithm has potential to perform photon dose calculation with high accuracy, which is more desirable for modern radiotherapy environment.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2014

Non-Galerkin Coarse Grids for Algebraic Multigrid

Algebraic multigrid (AMG) is a popular and effective solver for systems of linear equations that arise from discretized partial differential equations. And while AMG has been effectively implemented on large scale parallel machines, challenges remain, especially when moving to exascale. Particularly, stencil sizes (the number of nonzeros in a row) tend to increase further down in the coarse grid hierarchy, and this growth leads to more communication. Therefore, as problem size increases and the number of levels in the hierarchy grows, the overall efficiency of the parallel AMG method decreases, sometimes dramatically. This growth in stencil size is due to the standard Galerkin coarse grid operator, $P^T A P$, where $P$ is the prolongation (i.e., interpolation) operator. For example, the coarse grid stencil size for a simple three-dimensional (3D) seven-point finite differencing approximation to diffusion can increase into the thousands on present day machines, causing an associated increase in communication costs. We therefore consider algebraically truncating coarse grid stencils to obtain a non-Galerkin coarse grid. First, the sparsity pattern of the non-Galerkin coarse grid is determined by employing a heuristic minimal “safe” pattern together with strength-of-connection ideas. Second, the nonzero entries are determined by collapsing the stencils in the Galerkin operator using traditional AMG techniques. The result is a reduction in coarse grid stencil size, overall operator complexity, and parallel AMG solve phase times.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2013

GridPACK Toolkit for Developing Power Grid Simulations on High Performance Computing Platforms

This paper describes the GridPACK™ framework, which is designed to help power grid engineers develop modeling software capable of running on todays high performance computers. The framework contains modules for setting up distributed power grid networks, assigning buses and branches with arbitrary behaviors to the network, creating distributed matrices and vectors, using parallel linear and non-linear solvers to solve algebraic equations, and mapping functionality to create matrices and vectors based on properties of the network. In addition, the framework contains additional functionality to support IO and to manage errors.

Palmer, Bruce J.↗
DOE OSTI2016

GridPACK™ : A Framework for Developing Power Grid Simulations on High-Performance Computing Platforms

This paper describes the GridPACK™ framework, which is designed to help power grid engineers develop modeling software capable of running on high performance computers. The framework makes extensive use of software templates to provide high level functionality while at the same time allowing developers the freedom to express whatever models and algorithms they are using. GridPACK™ contains modules for setting up distributed power grid networks, assigning buses and branches with arbitrary behaviors to the network, creating distributed matrices and vectors and using parallel linear and non-linear solvers to solve algebraic equations. It also provides mappers to create matrices and vectors based on properties of the network and functionality to support IO and to mana

Palmer, Bruce J.↗
DOE OSTI2011

A Block-Asynchronous Relaxation Method for Graphics Processing Units

In this paper, we analyze the potential of asynchronous relaxation methods on Graphics Processing Units (GPUs). For this purpose, we developed a set of asynchronous iteration algorithms in CUDA and compared them with a parallel implementation of synchronous relaxation methods on CPU-based systems. For a set of test matrices taken from the University of Florida Matrix Collection we monitor the convergence behavior, the average iteration time and the total time-to-solution time. Analyzing the results, we observe that even for our most basic asynchronous relaxation scheme, despite its lower convergence rate compared to the Gauss-Seidel relaxation (that we expected), the asynchronous iteration running on GPUs is still able to provide solution approximations of certain accuracy in considerably shorter time then Gauss- Seidel running on CPUs. Hence, it overcompensates for the slower convergence by exploiting the scalability and the good fit of the asynchronous schemes for the highly parallel GPU architectures. Further, enhancing the most basic asynchronous approach with hybrid schemes – using multiple iterations within the ”subdomain” handled by a GPU thread block and Jacobi-like asynchronous updates across the ”boundaries”, subject to tuning various parameters – we manage to not only recover the loss of global convergence but often accelerate convergence of up to two times (compared to the effective but difficult to parallelize Gauss-Seidel type of schemes), while keeping the execution time of a global iteration practically the same. This shows the high potential of the asynchronous methods not only as a stand alone numerical solver for linear systems of equations fulfilling certain convergence conditions but more importantly as a smoother in multigrid methods. Due to the explosion of parallelism in todays architecture designs, the significance and the need for asynchronous methods, as the ones described in this work, is expected to grow.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2013

The Scaling of Broadband Shock-Associated Noise with Increasing Temperature

A physical explanation for the saturation of broadband shock-associated noise (BBSAN) intensity with increasing jet stagnation temperature has eluded investigators. An explanation is proposed for this phenomenon with the use of an acoustic analogy. To isolate the relevant physics, the scaling of BBSAN peak intensity level at the sideline observer location is examined. The equivalent source within the framework of an acoustic analogy for BBSAN is based on local field quantities at shock wave shear layer interactions. The equivalent source combined with accurate calculations of the propagation of sound through the jet shear layer, using an adjoint vector Green's function solver of the linearized Euler equations, allows for predictions that retain the scaling with respect to stagnation pressure and allows for saturation of BBSAN with increasing stagnation temperature. The sources and vector Green's function have arguments involving the steady Reynolds- Averaged Navier-Stokes solution of the jet. It is proposed that saturation of BBSAN with increasing jet temperature occurs due to a balance between the amplication of the sound propagation through the shear layer and the source term scaling.

Miller, Steven A. E.↗
NASA NTRS2021

Pretest Computational Assessment of Boundary Layer Transition in the NASA Juncture Flow Model with an NACA 0015-Based Wing

The first two phases of the NASA Juncture Flow experiment were carried out on a DLR-F6 swept-wing model and were designed to provide “CFD validation-quality” data toward the assessment and improvement of existing CFD turbulence models in predicting onset and extent of three-dimensional separated flow near the wing-juncture trailing-edge region. The next phase of experiments will involve an NACA 0015-based swept wing, as prior risk reduction experiments had indicated that this wing shape resulted in reduced separation near the juncture region than the DLR-F6 wing, thus providing a better option to evaluate the ability of CFD models to predict incipient turbulent separation. The NACA 0015 measurements will also include IR thermography to infer the variation of transition front with respect to an increasing angle of attack. The primary objective of this work is to computationally make a preliminary assessment of the transition front on both surfaces of the NACA 0015 wing at a crank-chord-based Reynolds number of 2.4 x 106 for four different angles of attack, (0°, 2.5°, 5°, and 7.5°) and to determine the dominant mechanisms responsible for transition. This assessment includes both RANS-based transition models from NASA’s OVERFLOW 2.3b flow solver and linear parabolized stability equations (PSE) stability analysis based on the Langley Stability and Transition Analysis code, LASTRAC. Linear PSE results indicate that the upper surface of the wing is dominated by Tollmien- Schlichting (TS) instabilities, and that the laminar flow region shrinks from about 50% chord to a very small region just downstream of the attachment line as the angle of attack is increased from 0° to 7.5°. Consequently, the transition fronts predicted by the Spalart- Allmaras-based amplification factor transport (AFT-2017b) equation model (which accounts for the TS instabilities alone) and the Menter’s shear-stress transport equation (SST2003)- based Langtry-Menter transition model with ability to account for both TS and crossflow effects (LM2015) compare well with those predicted using linear PSE. On the lower surface of the wing, stationary crossflow (CF) instabilities begin to appear on the inboard portion of the wing in addition to the TS-instabilities for the larger angles of attack (5° and 7.5°), further reducing the laminar flow extent within the inboard region. The LM2015 model that accounts for CF effects is able to replicate this trend but appears to predict a slightly earlier transition. The outcome of this effort will inform the experiment and, when the actual experimental data become available, provide further opportunity to assess and improve the various transition models.

CFD modeling↗
NASA NTRS2021

Pretest Computational Assessment of Boundary Layer Transition in the NASA Juncture Flow Model with an NACA 0015-Based Wing

The first two phases of the NASA Juncture Flow experiment were carried out on a DLR-F6 swept-wing model and were designed to provide “CFD validation-quality” data toward the assessment and improvement of existing CFD turbulence models in predicting onset and extent of three-dimensional separated flow near the wing-juncture trailing-edge region. The next phase of experiments will involve an NACA 0015-based swept wing, as prior risk reduction experiments had indicated that this wing shape resulted in reduced separation near the juncture region than the DLR-F6 wing, thus providing a better option to evaluate the ability of CFD models to predict incipient turbulent separation. The NACA 0015 measurements will also include IR thermography to infer the variation of transition front with respect to an increasing angle of attack. The primary objective of this work is to computationally make a preliminary assessment of the transition front on both surfaces of the NACA 0015 wing at a crank-chord-based Reynolds number of 2.4 x 106 for four different angles of attack, (0°, 2.5°, 5°, and 7.5°) and to determine the dominant mechanisms responsible for transition. This assessment includes both RANS-based transition models from NASA’s OVERFLOW 2.3b flow solver and linear parabolized stability equations (PSE) stability analysis based on the Langley Stability and Transition Analysis code, LASTRAC. Linear PSE results indicate that the upper surface of the wing is dominated by Tollmien- Schlichting (TS) instabilities, and that the laminar flow region shrinks from about 50% chord to a very small region just downstream of the attachment line as the angle of attack is increased from 0° to 7.5°. Consequently, the transition fronts predicted by the Spalart- Allmaras-based amplification factor transport (AFT-2017b) equation model (which accounts for the TS instabilities alone) and the Menter’s shear-stress transport equation (SST2003)- based Langtry-Menter transition model with ability to account for both TS and crossflow effects (LM2015) compare well with those predicted using linear PSE. On the lower surface of the wing, stationary crossflow (CF) instabilities begin to appear on the inboard portion of the wing in addition to the TS-instabilities for the larger angles of attack (5° and 7.5°), further reducing the laminar flow extent within the inboard region. The LM2015 model that accounts for CF effects is able to replicate this trend but appears to predict a slightly earlier transition. The outcome of this effort will inform the experiment and, when the actual experimental data become available, provide further opportunity to assess and improve the various transition models.

CFD modeling↗
NASA NTRS1994

Prediction of Undsteady Flows in Turbomachinery Using the Linearized Euler Equations on Deforming Grids

A linearized Euler solver for calculating unsteady flows in turbomachinery blade rows due to both incident gusts and blade motion is presented. The model accounts for blade loading, blade geometry, shock motion, and wake motion. Assuming that the unsteadiness in the flow is small relative to the nonlinear mean solution, the unsteady Euler equations can be linearized about the mean flow. This yields a set of linear variable coefficient equations that describe the small amplitude harmonic motion of the fluid. These linear equations are then discretized on a computational grid and solved using standard numerical techniques. For transonic flows, however, one must use a linear discretization which is a conservative linearization of the non-linear discretized Euler equations to ensure that shock impulse loads are accurately captured. Other important features of this analysis include a continuously deforming grid which eliminates extrapolation errors and hence, increases accuracy, and a new numerically exact, nonreflecting far-field boundary condition treatment based on an eigenanalysis of the discretized equations. Computational results are presented which demonstrate the computational accuracy and efficiency of the method and demonstrate the effectiveness of the deforming grid, far-field nonreflecting boundary conditions, and shock capturing techniques. A comparison of the present unsteady flow predictions to other numerical, semi-analytical, and experimental methods shows excellent agreement. In addition, the linearized Euler method presented requires one or two orders-of-magnitude less computational time than traditional time marching techniques making the present method a viable design tool for aeroelastic analyses.

Clark, William S.↗
NASA NTRS1974

Parallel tridiagonal equation solvers

Three parallel algorithms were compared for the direct solution of tridiagonal linear systems of equations. The algorithms are suitable for computers such as ILLIAC 4 and CDC STAR. For array computers similar to ILLIAC 4, cyclic odd-even reduction has the least operation count for highly structured sets of equations, and recursive doubling has the least count for relatively unstructured sets of equations. Since the difference in operation counts for these two algorithms is not substantial, their relative running times may be more related to overhead operations, which are not measured in this paper. The third algorithm, based on Buneman's Poisson solver, has more arithmetic operations than the others, and appears to be the least favorable. For pipeline computers similar to CDC STAR, cyclic odd-even reduction appears to be the most preferable algorithm for all cases.

Stone, H. S.↗
NASA NTRS1996

Numerical Modeling of Spray Combustion with an Unstructured-Grid Method

The present unstructured-grid method follows strictly the basic finite volume forms of the conservation laws of the governing equations for the entire flow domain. High-order spatially accurate formulation has been employed for the numerical solutions of the Navier-Stokes equations. A two-equation k-epsilon turbulence model is also incorporated in the unstructured-grid solver. The convergence of the resulted linear algebraic equation is accelerated with preconditioned Conjugate Gradient method. A statistical spray combustion model has been incorporated into the present unstructured-grid solver. In this model, spray is represented by discrete particles, rather than by continuous distributions. A finite number of computational particles are used to predict a sample of total population of particles. Particle trajectories are integrated using their momentum and motion equations and particles exchange mass, momentum and energy with the gas within the computational cell in which they are located. The interaction calculations are performed simultaneously and eliminate global iteration for the two-phase momentum exchange. A transient spray flame in a high pressure combustion chamber is predicted and then the solution of liquid-fuel combusting flow with a rotating cup atomizer is presented and compared with the experimental data. The major conclusion of this investigation is that the unstructured-grid method can be employed to study very complicated flow fields of turbulent spray combustion. Grid adaptation can be easily achieved in any flow domain such as droplet evaporation and combustion zone. Future applications of the present model can be found in the full three-dimensional study of flow fields of gas turbine and liquid propulsion engine combustion chambers with multi-injectors.

Shang, H. M.↗
NASA NTRS2000

User's Manual for PCSMS (Parallel Complex Sparse Matrix Solver)

PCSMS (Parallel Complex Sparse Matrix Solver) is a computer code written to make use of the existing real sparse direct solvers to solve complex, sparse matrix linear equations. PCSMS converts complex matrices into real matrices and use real, sparse direct matrix solvers to factor and solve the real matrices. The solution vector is reconverted to complex numbers. Though, this utility is written for Silicon Graphics (SGI) real sparse matrix solution routines, it is general in nature and can be easily modified to work with any real sparse matrix solver. The User's Manual is written to make the user acquainted with the installation and operation of the code. Driver routines are given to aid the users to integrate PCSMS routines in their own codes.

Reddy, C. J.↗
NASA NTRS1995

Nonlinear (time domain) and linearized (time and frequency domain) solutions to the compressible Euler equations in conservation law form

Two linearized solvers (time and frequency domain) based on a high resolution numerical scheme are presented. The basic approach is to linearize the flux vector by expressing it as a sum of a mean and a perturbation. This allows the governing equations to be maintained in conservation law form. A key difference between the time and frequency domain computations is that the frequency domain computations require only one grid block irrespective of the interblade phase angle for which the flow is being computed. As a result of this and due to the fact that the governing equations for this case are steady, frequency domain computations are substantially faster than the corresponding time domain computations. The linearized equations are used to compute flows in turbomachinery blade rows (cascades) arising due to blade vibrations. Numerical solutions are compared to linear theory (where available) and to numerical solutions of the nonlinear Euler equations.

Sreenivas, Kidambi↗
NASA NTRS1991

Prediction of unsteady aerodynamic loads in cascades using the linearized Euler equations on deforming grids

A linearized Euler solver for calculating unsteady flows in turbomachinery blade rows due to both incident gusts and blade motion is presented. Using the linearized Euler technique, one decomposes the flow into a mean (or steady) flow plus an unsteady, harmonically varying, small disturbance flow. Linear variable coefficient equations describe the small disturbance behavior of the flow, and are solved using a pseudo-time marching Lax-Wendroff scheme. For the blade motion problem, a harmonically deforming computational rid that conforms to the motion of vibrating blades eliminates large error producing mean flow gradient terms that would otherwise appear in the unsteady flow tangency boundary condition. The paper also presents a new, numerically exact, nonreflecting far-field boundary condition based on an eigenanalysis of the discretized equations. Computed flow solutions demonstrate the computational accuracy and efficiency of the present method. The solution of the linearized Euler equations requires one to two orders of magnitude less computer time than solution of the nonlinear Euler equations using traditional time-accurate time-marching techniques. In addition, the deformable grid significantly improves the accuracy of the solution.

Hall, Kenneth C.↗
NASA NTRS1993

Preconditioned conjugate-gradient methods for low-speed flow calculations

An investigation is conducted into the viability of using a generalized Conjugate Gradient-like method as an iterative solver to obtain steady-state solutions of very low-speed fluid flow problems. Low-speed flow at Mach 0.1 over a backward-facing step is chosen as a representative test problem. The unsteady form of the two dimensional, compressible Navier-Stokes equations is integrated in time using discrete time-steps. The Navier-Stokes equations are cast in an implicit, upwind finite-volume, flux split formulation. The new iterative solver is used to solve a linear system of equations at each step of the time-integration. Preconditioning techniques are used with the new solver to enhance the stability and convergence rate of the solver and are found to be critical to the overall success of the solver. A study of various preconditioners reveals that a preconditioner based on the Lower-Upper Successive Symmetric Over-Relaxation iterative scheme is more efficient than a preconditioner based on Incomplete L-U factorizations of the iteration matrix. The performance of the new preconditioned solver is compared with a conventional Line Gauss-Seidel Relaxation (LGSR) solver. Overall speed-up factors of 28 (in terms of global time-steps required to converge to a steady-state solution) and 20 (in terms of total CPU time on one processor of a CRAY-YMP) are found in favor of the new preconditioned solver, when compared with the LGSR solver.

Ajmani, Kumud↗
NASA NTRS1993

Preconditioned Conjugate Gradient methods for low speed flow calculations

An investigation is conducted into the viability of using a generalized Conjugate Gradient-like method as an iterative solver to obtain steady-state solutions of very low-speed fluid flow problems. Low-speed flow at Mach 0.1 over a backward-facing step is chosen as a representative test problem. The unsteady form of the two dimensional, compressible Navier-Stokes equations are integrated in time using discrete time-steps. The Navier-Stokes equations are cast in an implicit, upwind finite-volume, flux split formulation. The new iterative solver is used to solve a linear system of equations at each step of the time-integration. Preconditioning techniques are used with the new solver to enhance the stability and the convergence rate of the solver and are found to be critical to the overall success of the solver. A study of various preconditioners reveals that a preconditioner based on the lower-upper (L-U)-successive symmetric over-relaxation iterative scheme is more efficient than a preconditioner based on incomplete L-U factorizations of the iteration matrix. The performance of the new preconditioned solver is compared with a conventional line Gauss-Seidel relaxation (LGSR) solver. Overall speed-up factors of 28 (in terms of global time-steps required to converge to a steady-state solution) and 20 (in terms of total CPU time on one processor of a CRAY-YMP) are found in favor of the new preconditioned solver, when compared with the LGSR solver.

Ajmani, Kumud↗