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 343 records · Page 19

All sources NASA NTRS DOE OSTI

DOE OSTI2023

Constraint energy minimizing generalized multiscale finite element method for multi-continuum Richards equations

In fluid flow simulation, the multi-continuum model is a useful strategy. When the heterogeneity and contrast of coefficients are high, the system becomes multiscale, and some kinds of reduced order methods are demanded. Combining these techniques with nonlinearity, we will consider in this paper a dual-continuum model which is generalized as a multi-continuum model for a coupled system of nonlinear Richards equations as unsaturated flows, in complex heterogeneous fractured porous media; and we will solve it by a novel multiscale approach utilizing the constraint energy minimizing generalized multiscale finite element method (CEM-GMsFEM). In particular, such a nonlinear system will be discretized in time and then linearized by Picard iteration (whose global convergence is proved theoretically). Subsequently, we tackle the resulting linearized equations by the CEM-GMsFEM and obtain proper offline multiscale basis functions to span the multiscale space (which contains the pressure solution). More specifically, we first introduce two new sources of samples, and the GMsFEM is used over each coarse block to build local auxiliary multiscale basis functions via solving local spectral problems, that are crucial for detecting high-contrast channels. Second, per oversampled coarse region, local multiscale basis functions are created through the CEM as constrainedly minimizing an energy functional. Various numerical tests for our approach reveal that the error converges with the coarse-grid size and that only few oversampling layers as well as basis functions are needed.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1988

On conjugate gradient type methods and polynomial preconditioners for a class of complex non-Hermitian matrices

Conjugate gradient type methods are considered for the solution of large linear systems Ax = b with complex coefficient matrices of the type A = T + i(sigma)I where T is Hermitian and sigma, a real scalar. Three different conjugate gradient type approaches with iterates defined by a minimal residual property, a Galerkin type condition, and an Euclidian error minimization, respectively, are investigated. In particular, numerically stable implementations based on the ideas behind Paige and Saunder's SYMMLQ and MINRES for real symmetric matrices are proposed. Error bounds for all three methods are derived. It is shown how the special shift structure of A can be preserved by using polynomial preconditioning. Results on the optimal choice of the polynomial preconditioner are given. Also, some numerical experiments for matrices arising from finite difference approximations to the complex Helmholtz equation are reported.

Freund, Roland↗

NASA NTRS1991

Efficient use of direct solvers for the calculation of compressible flows

While the direct solution of systems of linear equations resulting from fluid dynamic problems has generally not been practical in the past, it is presently demonstrated that the direct method is often more efficient than the most popular iterative schemes when constructed in such a way as to take advantage of presently available vector processing capabilities and large memory. The vertical line Gauss-Seidel algorithm was chosen as the iterative method to be compared with the direct method. It is fond that the direct method becomes efficient only when large residual reductions are desired.

Riggins, David W.↗

NASA NTRS2011

Enhanced Fuel-Optimal Trajectory-Generation Algorithm for Planetary Pinpoint Landing

An enhanced algorithm is developed that builds on a previous innovation of fuel-optimal powered-descent guidance (PDG) for planetary pinpoint landing. The PDG problem is to compute constrained, fuel-optimal trajectories to land a craft at a prescribed target on a planetary surface, starting from a parachute cut-off point and using a throttleable descent engine. The previous innovation showed the minimal-fuel PDG problem can be posed as a convex optimization problem, in particular, as a Second-Order Cone Program, which can be solved to global optimality with deterministic convergence properties, and hence is a candidate for onboard implementation. To increase the speed and robustness of this convex PDG algorithm for possible onboard implementation, the following enhancements are incorporated: 1) Fast detection of infeasibility (i.e., control authority is not sufficient for soft-landing) for subsequent fault response. 2) The use of a piecewise-linear control parameterization, providing smooth solution trajectories and increasing computational efficiency. 3) An enhanced line-search algorithm for optimal time-of-flight, providing quicker convergence and bounding the number of path-planning iterations needed. 4) An additional constraint that analytically guarantees inter-sample satisfaction of glide-slope and non-sub-surface flight constraints, allowing larger discretizations and, hence, faster optimization. 5) Explicit incorporation of Mars rotation rate into the trajectory computation for improved targeting accuracy. These enhancements allow faster convergence to the fuel-optimal solution and, more importantly, remove the need for a "human-in-the-loop," as constraints will be satisfied over the entire path-planning interval independent of step-size (as opposed to just at the discrete time points) and infeasible initial conditions are immediately detected. Finally, while the PDG stage is typically only a few minutes, ignoring the rotation rate of Mars can introduce 10s of meters of error. By incorporating it, the enhanced PDG algorithm becomes capable of pinpoint targeting.

Acikmese, Behcet↗

NASA NTRS2019

Real-time Exponential Curve Fits Using Discrete Calculus

This paper presents an improved solution for curve fitting data to an exponential equation (Y = AeBt + C). This improvement is in four areas ? speed, stability, determinant processing time, and the removal of limits. The solution presented in this paper avoids iterative techniques and their stability errors by using three mathematical ideas ? discrete calculus, a special relationship (between exponential curves and the Mean Value Theorem for Derivatives), and a simple linear curve fit algorithm. This method can also be applied to fitting data to the general power law equation Y = AxB + C and the general geometric growth equation Y = AkBt + C.

Rowe, Geoffrey K.↗

NASA NTRSDate not supplied

Generalized Linear Targeting For Cislunar Flight

An important element of Artemis and NASA’s campaign to explore the Moon is the autonomous onboard two-level targeter (TLT) used during all cislunar flight phases. The function of the TLT is to autonomously recompute the burn targets for the upcoming burn (or multiple burns) in response to navigation and vehicle dispersion providing a solution that meets all of the trajectory constraints. Although the TLT has been utilized previously as a ground-based planning tool, and flown onboard during the Artemis I mission, it’s complexity and iterative nature make is difficult to incorporate into and support rapid analyses such as robust optimal trajectory design applications where speed is essential. In this paper, a set of generalized linear targeting algorithms that mimics many of the properties of the TLT is derived. The generalized algorithms can handle single or multiple impulsive maneuvers, with multiple constraints at multiple fixed or variable times. A linear targeting algorithm for finite burn maneuvers is also derived. The generalized linear targeting algorithms are exceptionally fast and easy to implement in Monte Carlo analysis, linear covariance (LinCov) analysis, and robust optimal trajectory design. Several cislunar flight examples are provided.

Linear Covariance Analysis↗

NASA NTRS1985

Some iterative schemes for transonic potential flows

The minimal residual (MR) method for the numerical solution of transonic potential flows is closely related to the conjugate gradient method, which has found widespread use in the solution of large sparse, symmetric, and positive-definite linear equations. The primary advantage of the MR method is its applicability to both symmetric and nonsymmetric matrices.

Wong, Y. S.↗

NASA NTRS1979

A time dependent difference theory for sound propagation in ducts with flow

A time dependent numerical solution of the linearized continuity and momentum equation was developed for sound propagation in a two dimensional straight hard or soft wall duct with a sheared mean flow. The time dependent governing acoustic difference equations and boundary conditions were developed along with a numerical determination of the maximum stable time increments. A harmonic noise source radiating into a quiescent duct was analyzed. This explicit iteration method then calculated stepwise in real time to obtain the transient as well as the steady state solution of the acoustic field. Example calculations were presented for sound propagation in hard and soft wall ducts, with no flow and plug flow. Although the problem with sheared flow was formulated and programmed, sample calculations were not examined. The time dependent finite difference analysis was found to be superior to the steady state finite difference and finite element techniques because of shorter solution times and the elimination of large matrix storage requirements.

Baumeister, K. J.↗

NASA NTRS1972

Calculation of free fall trajectories based on numerical optimization techniques

The development of a means of computing free-fall (nonthrusting) trajectories from one specified point in the solar system to another specified point in the solar system in a given amount of time was studied. The problem is that of solving a two-point boundary value problem for which the initial slope is unknown. Two standard methods of attack exist for solving two-point boundary value problems. The first method is known as the initial value or shooting method. The second method of attack for two-point boundary value problems is to approximate the nonlinear differential equations by an appropriate linearized set. Parts of both boundary value problem solution techniques described above are used. A complete velocity history is guessed such that the corresponding position history satisfies the given boundary conditions at the appropriate times. An iterative procedure is then followed until the last guessed velocity history and the velocity history obtained from integrating the acceleration history agree to some specified tolerance everywhere along the trajectory.

Source record↗

NASA NTRS1975

Bidirectional plant canopy reflection models derived from the radiation transfer equation

A collection of bidirectional canopy reflection models was obtained from the solution of the radiation transfer equation for a horizontally homogeneous canopy. A phase function is derived for a collection of bidirectionally reflecting and transmitting planar elements characterized geometrically by slope and azimuth density functions. Two approaches to solving the radiation transfer equation for the canopy are presented. One approach factors the radiation transfer equation into a solvable set of three first-order linear differential equations by assuming that the radiation field within the canopy can be initially approximated by three components: uniformly diffuse downwelling, uniformly diffuse upwelling, and attenuated specular. The solution to these equations, which can be iterated to any degree of accuracy, was used to obtain overall canopy reflection from the formal solution to the radiation transfer equation. A programable solution to canopy overall bidirectional reflection is given for this approach. The special example of Lambertian leaves with constant leaf bidirectional reflection and scattering functions is considered, and a programmable solution for this example is given. The other approach to solving the radiation transfer equation, a generalized Chandrasekhar technique, is presented in the appendix.

Beeth, D. R.↗

NASA NTRS1991

A second order iteration procedure for correlation of analysis frequencies with test data

A second derivative frequency modification procedure is developed to iteratively change analysis modeling parameters for the more rapid convergence of analytically determined frequencies to those obtained by structural dynamic testing. A nonlinear system of algebraic equations in the modeling parameters is derived and a rapidly converging iterative method for their solution is presented. Numerical results obtained show that the higher order formulation and nonlinear predictor-corrector solution procedure yields results which are more rapidly convergent than those obtained using only the usual linear first-order parameter modification procedure. The proposed higher order theory also connverges in some cases when the ordinary linear theory does not.

Ojalvo, I. U.↗

NASA NTRS2015

Discrete Fourier Transform in a Complex Vector Space

An image-based phase retrieval technique has been developed that can be used on board a space based iterative transformation system. Image-based wavefront sensing is computationally demanding due to the floating-point nature of the process. The discrete Fourier transform (DFT) calculation is presented in "diagonal" form. By diagonal we mean that a transformation of basis is introduced by an application of the similarity transform of linear algebra. The current method exploits the diagonal structure of the DFT in a special way, particularly when parts of the calculation do not have to be repeated at each iteration to converge to an acceptable solution in order to focus an image.

Dean, Bruce H.↗

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↗

NASA NTRS1989

Digital restoration of multichannel images

The Wiener solution of a multichannel restoration scheme is presented. Using matrix diagonalization and block-Toeplitz to block-circulant approximation, the inversion of the multichannel, linear space-invariant imaging system becomes feasible by utilizing a fast iterative matrix inversion procedure. The restoration uses both the within-channel (spatial) and between-channel (spectral) correlation; hence, the restored result is a better estimate than that produced by independent channel restoration. Simulations are also presented.

Galatsanos, Nikolas P.↗

NASA NTRS1990

Optimal trajectories based on linear equations

The Principal results of a recent theory of fuel optimal space trajectories for linear differential equations are presented. Both impulsive and bounded-thrust problems are treated. A new form of the Lawden Primer vector is found that is identical for both problems. For this reason, starting iteratives from the solution of the impulsive problem are highly effective in the solution of the two-point boundary-value problem associated with bounded thrust. These results were applied to the problem of fuel optimal maneuvers of a spacecraft near a satellite in circular orbit using the Clohessy-Wiltshire equations. For this case two-point boundary-value problems were solved using a microcomputer, and optimal trajectory shapes displayed. The results of this theory can also be applied if the satellite is in an arbitrary Keplerian orbit through the use of the Tschauner-Hempel equations. A new form of the solution of these equations has been found that is identical for elliptical, parabolic, and hyperbolic orbits except in the way that a certain integral is evaluated. For elliptical orbits this integral is evaluated through the use of the eccentric anomaly. An analogous evaluation is performed for hyperbolic orbits.

Carter, Thomas E.↗

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↗

NASA NTRS1979

A time dependent difference theory for sound propagation in ducts with flow

A time dependent numerical solution of the linearized continuity and momentum equation is developed for sound propagation in a two-dimensional straight hard or soft wall duct with a sheared mean flow. The time dependent governing acoustic-difference equations and boundary conditions are developed along with a numerical determination of the maximum stable time increments. The analysis begins with a harmonic noise source radiating into a quiescent duct. This explicit iteration method then calculates stepwise in real time to obtain the transient as well as the 'steady' state solution of the acoustic field. Example calculations are presented for sound propagation in hard and soft wall ducts, with no flow and with plug flow. Although the problem with sheared flow has been formulated and programmed, sample calculations have not yet been examined. So far, the time dependent finite difference analysis has been found to be superior to the steady state finite difference and finite element techniques because of shorter solution times and the elimination of large matrix storage requirements.

Baumeister, K. J.↗

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↗