Search NASA⌕ Search

SEARCH · Search NASA

Results for “Matrix differential equation”

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.

286 records · Page 16
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Online randomized interpolative decomposition with a posteriori error estimator for temporal PDE data reduction

Traditional low-rank approximation is a powerful tool for compressing large data matrices that arise in simulations of partial differential equations (PDEs), but suffers from high computational cost and requires several passes over the PDE data. The compressed data may also lack interpretability thus making it difficult to identify feature patterns from the original data. Here, to address these issues, we present an online randomized algorithm to compute the interpolative decomposition (ID) of large-scale data matrices in situ. Compared to previous randomized IDs that used the QR decomposition to determine the column basis, we adopt a streaming ridge leverage score-based column subset selection algorithm that dynamically selects proper basis columns from the data and thus avoids an extra pass over the data to compute the coefficient matrix of the ID. In particular, we adopt a single-pass error estimator based on the non-adaptive Hutch++ algorithm to provide real-time error approximation for determining the best coefficients. As a result, our approach only needs a single pass over the original data and thus is suitable for large and high-dimensional matrices stored outside of core memory or generated in PDE simulations. A strategy to improve the accuracy of the reconstructed data gradient, when desired, within the ID framework is also presented. We provide numerical experiments on turbulent channel flow and ignition simulations, and on the NSTX Gas Puff Image dataset, comparing our algorithm with the offline ID algorithm to demonstrate its utility in real-world applications.

Column subset selection↗
NASA NTRS1986

An efficient method for solving the steady Euler equations

An efficient numerical procedure for solving a set of nonlinear partial differential equations is given, specifically for the steady Euler equations. Solutions of the equations were obtained by Newton's linearization procedure, commonly used to solve the roots of nonlinear algebraic equations. In application of the same procedure for solving a set of differential equations we give a theorem showing that a quadratic convergence rate can be achieved. While the domain of quadratic convergence depends on the problems studied and is unknown a priori, we show that firstand second-order derivatives of flux vectors determine whether the condition for quadratic convergence is satisfied. The first derivatives enter as an implicit operator for yielding new iterates and the second derivatives indicates smoothness of the flows considered. Consequently flows involving shocks are expected to require larger number of iterations. First-order upwind discretization in conjunction with the Steger-Warming flux-vector splitting is employed on the implicit operator and a diagonal dominant matrix results. However the explicit operator is represented by first- and seond-order upwind differencings, using both Steger-Warming's and van Leer's splittings. We discuss treatment of boundary conditions and solution procedures for solving the resulting block matrix system. With a set of test problems for one- and two-dimensional flows, we show detailed study as to the efficiency, accuracy, and convergence of the present method.

Liou, M. S.↗
DOE OSTI2025

PETSc/TAO developments for GPU-based early exascale systems

The Portable Extensible Toolkit for Scientific Computation (PETSc) library provides scalable solvers for nonlinear time-dependent differential and algebraic equations and for numerical optimization via the Toolkit for Advanced Optimization (TAO). PETSc is used in dozens of scientific fields and is an important building block for many simulation codes. During the U.S. Department of Energy’s Exascale Computing Project, the PETSc team has made substantial efforts to enable efficient utilization of the massive fine-grain parallelism present within exascale compute nodes and to enable performance portability across exascale architectures. We recap some of the challenges that designers of numerical libraries face in such an endeavor, and then discuss the many developments we have made, which include the addition of new GPU backends, features supporting efficient on-device matrix assembly, better support for asynchronicity and GPU kernel concurrency, and new communication infrastructure. In conclusion, we evaluate the performance of these developments on some pre-exascale systems as well as the early exascale systems Frontier and Aurora, using compute kernel, communication layer, solver, and mini-application benchmark studies, and then close with a few observations drawn from our experiences on the tension between portable performance and other goals of numerical libraries.

Exascale Computing Project (ECP)↗
NASA NTRS1973

Quasi-static extension of a tensile crack contained in a viscoelastic-plastic solid

Final stretch criterion of failure is applied to the problem of quasi-static extension of a crack embedded in an elastic-plastic or viscoelastic-plastic matrix. The slow growth under subcritical conditions in a rate-sensitive Tresca solid is shown to be a superposition of creep rupture and McClintock's ductile growth. This type of growth occurs at subcritical magnitude of the imposed K-factor and can be accounted for only through a recognition of inelastic properties of solids. In the subcritical range there is no unique value for K sub c independent of geometrical configuration and flaw size. Not only the produced states of stress and strain are dependent on the loading path, but also the material resistance to fracture turns out to be a function of the history of loading that precedes catastrophic failure. A nonlinear integro-differential equation of motion is derived for a crack progressing through a viscoelastic medium with some limited ability to plastic flow. Examples of numerical integration are given incorporating both monotonic and cyclic loading programs.

Wnuk, M. P.↗
NASA NTRS1952

Matrix Method of Determining the Longitudinal-Stability Coefficients and Frequency Response of an Aircraft from Transient Flight Data

A matrix method is presented for determining the longitudinal-stability coefficients and frequency response of an aircraft from arbitrary maneuvers. The method is devised so that it can be applied to time-history measurements of combinations of such simple quantities as angle of attack, pitching velocity, load factor, elevator angle, and hinge moment to obtain the over-all coefficients. Although the method has been devised primarily for the evaluation of stability coefficients which are of primary interest in most aircraft loads and stability studies, it can be used also, with a simple additional computation, to determine the frequency-response characteristics. The entire procedure can be applied or extended to other problems which can be expressed by linear differential equations.

Donegan, James J↗
NASA NTRS2011

Constraint Embedding Technique for Multibody System Dynamics

Multibody dynamics play a critical role in simulation testbeds for space missions. There has been a considerable interest in the development of efficient computational algorithms for solving the dynamics of multibody systems. Mass matrix factorization and inversion techniques and the O(N) class of forward dynamics algorithms developed using a spatial operator algebra stand out as important breakthrough on this front. Techniques such as these provide the efficient algorithms and methods for the application and implementation of such multibody dynamics models. However, these methods are limited only to tree-topology multibody systems. Closed-chain topology systems require different techniques that are not as efficient or as broad as those for tree-topology systems. The closed-chain forward dynamics approach consists of treating the closed-chain topology as a tree-topology system subject to additional closure constraints. The resulting forward dynamics solution consists of: (a) ignoring the closure constraints and using the O(N) algorithm to solve for the free unconstrained accelerations for the system; (b) using the tree-topology solution to compute a correction force to enforce the closure constraints; and (c) correcting the unconstrained accelerations with correction accelerations resulting from the correction forces. This constraint-embedding technique shows how to use direct embedding to eliminate local closure-loops in the system and effectively convert the system back to a tree-topology system. At this point, standard tree-topology techniques can be brought to bear on the problem. The approach uses a spatial operator algebra approach to formulating the equations of motion. The operators are block-partitioned around the local body subgroups to convert them into aggregate bodies. Mass matrix operator factorization and inversion techniques are applied to the reformulated tree-topology system. Thus in essence, the new technique allows conversion of a system with closure-constraints into an equivalent tree-topology system, and thus allows one to take advantage of the host of techniques available to the latter class of systems. This technology is highly suitable for the class of multibody systems where the closure-constraints are local, i.e., where they are confined to small groupings of bodies within the system. Important examples of such local closure-constraints are constraints associated with four-bar linkages, geared motors, differential suspensions, etc. One can eliminate these closure-constraints and convert the system into a tree-topology system by embedding the constraints directly into the system dynamics and effectively replacing the body groupings with virtual aggregate bodies. Once eliminated, one can apply the well-known results and algorithms for tree-topology systems to solve the dynamics of such closed-chain system.

Woo, Simon S.↗
NASA NTRS2005

Energy Finite Element Analysis for Computing the High Frequency Vibration of the Aluminum Testbed Cylinder and Correlating the Results to Test Data

The Energy Finite Element Analysis (EFEA) is a finite element based computational method for high frequency vibration and acoustic analysis. The EFEA solves with finite elements governing differential equations for energy variables. These equations are developed from wave equations. Recently, an EFEA method for computing high frequency vibration of structures either in vacuum or in contact with a dense fluid has been presented. The presence of fluid loading has been considered through added mass and radiation damping. The EFEA developments were validated by comparing EFEA results to solutions obtained by very dense conventional finite element models and solutions from classical techniques such as statistical energy analysis (SEA) and the modal decomposition method for bodies of revolution. EFEA results have also been compared favorably with test data for the vibration and the radiated noise generated by a large scale submersible vehicle. The primary variable in EFEA is defined as the time averaged over a period and space averaged over a wavelength energy density. A joint matrix computed from the power transmission coefficients is utilized for coupling the energy density variables across any discontinuities, such as change of plate thickness, plate/stiffener junctions etc. When considering the high frequency vibration of a periodically stiffened plate or cylinder, the flexural wavelength is smaller than the interval length between two periodic stiffeners, therefore the stiffener stiffness can not be smeared by computing an equivalent rigidity for the plate or cylinder. The periodic stiffeners must be regarded as coupling components between periodic units. In this paper, Periodic Structure (PS) theory is utilized for computing the coupling joint matrix and for accounting for the periodicity characteristics.

Vlahopoulos, Nickolas↗
NASA NTRS1993

Near-Threshold Rovibrational Excitation of HF by Electron Impact

The pronounced threshold peaks found in cross sections for electron-impact excitation of the vibrational levels of HF have been studied using an R-matrix method, in which electron exchange, correlation effects and polarization are included. Vibration is modelled inside the R-matrix sphere using the energy-modified adiabatic phase matrix method (EMAP). Rotation of the target molecule is treated outside the R-matrix sphere, using the frame transformation method. The external rovibronic close-coupling equations are solved by analytic methods. Analysis of the multichannel threshold structures indicates that the peaks found for rovibrational excitation of nu = 1 can be interpreted as virtual states while those for nu = 2 correspond to nuclear-excited Feshbach resonances. These two different results correspond simply to a change of sign of a small parameter that is determined by the threshold analysis. Whereas the overall shapes of the excitation peaks agree with earlier theoretical results, we have found detailed rotational fine structures for scattering energies on the order of the rotational constant above and below the opening of the vibrational channels. The partial and total cross sections for rovibrational state-to-state transitions in the energy region of the peaks are analysed. Characteristic cusp structures and excitation peaks are found at the rovibrational thresholds for transitions with small angular momentum transfer (Delta)j =0, 1 and 2. Differential cross sections are similar to recent measurements. These experimental data do not show the relatively sharp rise at the vibrational thresholds indicated by theory. Theory and experiment are in good agreement for the shape and magnitude of the angular dependence of cross sections for rovibrational state-to-state transitions, especially at larger energies.

Thummel, Helmar T.↗
NASA NTRS1990

Constraint treatment techniques and parallel algorithms for multibody dynamic analysis

Computational procedures for kinematic and dynamic analysis of three-dimensional multibody dynamic (MBD) systems are developed from the differential-algebraic equations (DAE's) viewpoint. Constraint violations during the time integration process are minimized and penalty constraint stabilization techniques and partitioning schemes are developed. The governing equations of motion, a two-stage staggered explicit-implicit numerical algorithm, are treated which takes advantage of a partitioned solution procedure. A robust and parallelizable integration algorithm is developed. This algorithm uses a two-stage staggered central difference algorithm to integrate the translational coordinates and the angular velocities. The angular orientations of bodies in MBD systems are then obtained by using an implicit algorithm via the kinematic relationship between Euler parameters and angular velocities. It is shown that the combination of the present solution procedures yields a computationally more accurate solution. To speed up the computational procedures, parallel implementation of the present constraint treatment techniques, the two-stage staggered explicit-implicit numerical algorithm was efficiently carried out. The DAE's and the constraint treatment techniques were transformed into arrowhead matrices to which Schur complement form was derived. By fully exploiting the sparse matrix structural analysis techniques, a parallel preconditioned conjugate gradient numerical algorithm is used to solve the systems equations written in Schur complement form. A software testbed was designed and implemented in both sequential and parallel computers. This testbed was used to demonstrate the robustness and efficiency of the constraint treatment techniques, the accuracy of the two-stage staggered explicit-implicit numerical algorithm, and the speed up of the Schur-complement-based parallel preconditioned conjugate gradient algorithm on a parallel computer.

Chiou, Jin-Chern↗
NASA NTRS2004

Discontinuous Spectral Difference Method for Conservation Laws on Unstructured Grids

A new, high-order, conservative, and efficient discontinuous spectral finite difference (SD) method for conservation laws on unstructured grids is developed. The concept of discontinuous and high-order local representations to achieve conservation and high accuracy is utilized in a manner similar to the Discontinuous Galerkin (DG) and the Spectral Volume (SV) methods, but while these methods are based on the integrated forms of the equations, the new method is based on the differential form to attain a simpler formulation and higher efficiency. Conventional unstructured finite-difference and finite-volume methods require data reconstruction based on the least-squares formulation using neighboring point or cell data. Since each unknown employs a different stencil, one must repeat the least-squares inversion for every point or cell at each time step, or to store the inversion coefficients. In a high-order, three-dimensional computation, the former would involve impractically large CPU time, while for the latter the memory requirement becomes prohibitive. In addition, the finite-difference method does not satisfy the integral conservation in general. By contrast, the DG and SV methods employ a local, universal reconstruction of a given order of accuracy in each cell in terms of internally defined conservative unknowns. Since the solution is discontinuous across cell boundaries, a Riemann solver is necessary to evaluate boundary flux terms and maintain conservation. In the DG method, a Galerkin finite-element method is employed to update the nodal unknowns within each cell. This requires the inversion of a mass matrix, and the use of quadratures of twice the order of accuracy of the reconstruction to evaluate the surface integrals and additional volume integrals for nonlinear flux functions. In the SV method, the integral conservation law is used to update volume averages over subcells defined by a geometrically similar partition of each grid cell. As the order of accuracy increases, the partitioning for 3D requires the introduction of a large number of parameters, whose optimization to achieve convergence becomes increasingly more difficult. Also, the number of interior facets required to subdivide non-planar faces, and the additional increase in the number of quadrature points for each facet, increases the computational cost greatly.

Liu, Yen↗
NASA NTRS2002

Design Considerations for Lightweight Space Radiators Based on Fabrication and Test Experience With a Carbon-Carbon Composite Prototype Heat Pipe

This report discusses the design implications for spacecraft radiators made possible by the successful fabrication and proof-of-concept testing of a graphite-fiber-carbon-matrix composite (i.e., carbon-carbon (C-C)) heat pipe. The prototype heat pipe, or space radiator element, consists of a C-C composite shell with integrally woven fins. It has a thin-walled furnace-brazed metallic (Nb-1%Zr) liner with end caps for containment of the potassium working fluid. A short extension of this liner, at increased wall thickness beyond the C-C shell, forms the heat pipe evaporator section which is in thermal contact with the radiator fluid that needs to be cooled. From geometric and thermal transport properties of the C-C composite heat pipe tested, a specific radiator mass of 1.45 kg/sq m can be derived. This is less than one-fourth the specific mass of present day satellite radiators. The report also discusses the advantage of segmented space radiator designs utilizing heat pipe elements, or segments, in their survivability to micrometeoroid damage. This survivability is further raised by the use of condenser sections with attached fins, which also improve the radiation heat transfer rate. Since the problem of heat radiation from a fin does not lend itself to a closed analytical solution, a derivation of the governing differential equation and boundary conditions is given in appendix A, along with solutions for rectangular and parabolic fin profile geometries obtained by use of a finite difference computer code written by the author.

Juhasz, Albert J.↗
DOE OSTI2025

Modeling MTS pyrolysis and SiC deposition kinetics using principal component analysis and neural networks

Accurate chemical kinetics modeling is crucial for improving the efficiency of chemical processing and synthesis of ceramic matrix composites. Detailed kinetic models are computationally expensive due to the large number of transported chemical species, while the simplified physics-based models, such as single-step global mechanisms, are efficient but often overlook key chemical intermediates and pathways. Recent deep learning approaches promise accurate and cost-effective models. Yet, they require additional closures for the transported nonlinear latent variables, complicating integration with existing solvers. In this work, we develop a hybrid linear—nonlinear reduced model for silicon carbide deposition from methyltrichlorosilane precursor by combining principal component analysis (PCA) and autoencoder (AE) neural network (NN) approaches. PCA is used to identify a smaller set of linear transport variables, enabling direct reuse of conventional transport solvers. NNs then reconstruct the full chemical state from these reduced variables. We demonstrate the method on a chemical vapor deposition reactor—comprising a gas-phase pyrolysis plug flow reactor and a heterogeneous surface reactor—over a wide range of temperatures, pressures, and residence times. Our PCA–AE model achieves high accuracy with only five transported scalars, achieving an eightfold cost reduction compared to detailed mechanisms, in both a priori (using data from the test set only) and a posteriori (coupled with a differential equation solver). In conclusion, notable errors arise primarily near training domain boundaries and for long residence times, indicating the need for domain shift indicators and better long-horizon predictions in future reduced chemistry model development.

autoencoder neural networks↗
NASA NTRS1998

Design Considerations for Lightweight Space Radiators Based on Fabrication and Test Experience with a Carbon-Carbon Composite Prototype Heat Pipe

This report discusses the design implications for spacecraft radiators made possible by the successful fabrication and Proof-of-concept testing of a graphite-fiber-carbon-matrix composite (i.e., carbon-carbon (C-C)) heat pipe. The proto-type heat pipe, or space radiator element, consists of a C-C composite shell with integrally woven fins. It has a thin-walled furnace-brazed metallic (Nb-1%Zr) liner with end caps for containment of the potassium working fluid. A short extension of this liner, at increased wall thickness beyond the C-C shell, forms the heat pipe evaporator section which is in thermal contact with the radiator fluid that needs to be cooled. From geometric and thermal transport properties of the C-C composite heat pipe tested, a specific radiator mass of 1.45 kg/m2 can be derived. This is less than one-fourth the specific mass of present day satellite radiators. The report also discusses the advantage of segmented space radiator designs utilizing heat pipe elements, or segments, in their survivability to micro-meteoroid damage. This survivability is further raised by the use of condenser sections with attached fins, which also improve the radiation heat transfer rate. Since the problem of heat radiation from a fin does not lend itself to a closed analytical solution, a derivation of the governing differential equation and boundary conditions is given in appendix A, along with solutions for rectangular and parabolic fin profile geometries obtained by use of a finite difference computer code written by the author.

Juhasz, Albert J.↗
NASA NTRS2010

Ballistics Model for Particles on a Horizontal Plane in a Vacuum Propelled by a Vertically Impinging Gas Jet

A simple trajectory model has been developed and is presented. The particle trajectory path is estimated by computing the vertical position as a function of the horizontal position using a constant horizontal velocity and a vertical acceleration approximated as a power law. The vertical particle position is then found by solving the differential equation of motion using a double integral of vertical acceleration divided by the square of the horizontal velocity, integrated over the horizontal position. The input parameters are: x(sub 0) and y(sub 0), the initial particle starting point; the derivative of the trajectory at x(sub 0) and y(sub 0), s(sub 0) = s(x(sub 0))= dx(y)/dy conditional expectation y = y((sub 0); and b where bx(sub 0)/y(sub 0) is the final trajectory angle before gravity pulls the particle down. The final parameter v(sub 0) is an approximation to a constant horizontal velocity. This model is time independent, providing vertical position x as a function of horizontal distance y: x(y) = (x(sub 0) + s(sub 0) (y-y(sub 0))) + bx(sub 0) -(s(sub 0)y(sub 0) ((y - y(sub 0)/y(sub 0) - ln((y/y(sub 0)))-((g(y-y(sub 0)(exp 2))/ 2((v(sub 0)(exp 2). The first term on the right in the above equation is due to simple ballistics and a spherically expanding gas so that the trajectory is a straight line intersecting (0,0), which is the point at the center of the gas impingement on the surface. The second term on the right is due to vertical acceleration, which may be positive or negative. The last term on the right is the gravity term, which for a particle with velocities less than escape velocity will eventually bring the particle back to the ground. The parameters b, s(sub 0), and in some cases v(sub 0), are taken from an interpolation of similar parameters determined from a CFD simulation matrix, coupled with complete particle trajectory simulations.

Lane, J. E.↗
NASA NTRS1996

Multigrid Methods for Fully Implicit Oil Reservoir Simulation

In this paper we consider the simultaneous flow of oil and water in reservoir rock. This displacement process is modeled by two basic equations: the material balance or continuity equations and the equation of motion (Darcy's law). For the numerical solution of this system of nonlinear partial differential equations there are two approaches: the fully implicit or simultaneous solution method and the sequential solution method. In the sequential solution method the system of partial differential equations is manipulated to give an elliptic pressure equation and a hyperbolic (or parabolic) saturation equation. In the IMPES approach the pressure equation is first solved, using values for the saturation from the previous time level. Next the saturations are updated by some explicit time stepping method; this implies that the method is only conditionally stable. For the numerical solution of the linear, elliptic pressure equation multigrid methods have become an accepted technique. On the other hand, the fully implicit method is unconditionally stable, but it has the disadvantage that in every time step a large system of nonlinear algebraic equations has to be solved. The most time-consuming part of any fully implicit reservoir simulator is the solution of this large system of equations. Usually this is done by Newton's method. The resulting systems of linear equations are then either solved by a direct method or by some conjugate gradient type method. In this paper we consider the possibility of applying multigrid methods for the iterative solution of the systems of nonlinear equations. There are two ways of using multigrid for this job: either we use a nonlinear multigrid method or we use a linear multigrid method to deal with the linear systems that arise in Newton's method. So far only a few authors have reported on the use of multigrid methods for fully implicit simulations. Two-level FAS algorithm is presented for the black-oil equations, and linear multigrid for two-phase flow problems with strong heterogeneities and anisotropies is studied. Here we consider both possibilities. Moreover we present a novel way for constructing the coarse grid correction operator in linear multigrid algorithms. This approach has the advantage in that it preserves the sparsity pattern of the fine grid matrix and it can be extended to systems of equations in a straightforward manner. We compare the linear and nonlinear multigrid algorithms by means of a numerical experiment.

Molenaar, J.↗
NASA NTRS1993

Preconditioning for the Navier-Stokes equations with finite-rate chemistry

The extension of Van Leer's preconditioning procedure to generalized finite-rate chemistry is discussed. Application to viscous flow is begun with the proper preconditioning matrix for the one-dimensional Navier-Stokes equations. Eigenvalue stiffness is resolved and convergence-rate acceleration is demonstrated over the entire Mach-number range from nearly stagnant flow to hypersonic. Specific benefits are realized at the low and transonic flow speeds typical of complete propulsion-system simulations. The extended preconditioning matrix necessarily accounts for both thermal and chemical nonequilibrium. Numerical analysis reveals the possible theoretical improvements from using a preconditioner for all Mach number regimes. Numerical results confirm the expectations from the numerical analysis. Representative test cases include flows with previously troublesome embedded high-condition-number areas. Van Leer, Lee, and Roe recently developed an optimal, analytic preconditioning technique to reduce eigenvalue stiffness over the full Mach-number range. By multiplying the flux-balance residual with the preconditioning matrix, the acoustic wave speeds are scaled so that all waves propagate at the same rate, an essential property to eliminate inherent eigenvalue stiffness. This session discusses a synthesis of the thermochemical nonequilibrium flux-splitting developed by Grossman and Cinnella and the characteristic wave preconditioning of Van Leer into a powerful tool for implicitly solving two and three-dimensional flows with generalized finite-rate chemistry. For finite-rate chemistry, the state vector of unknowns is variable in length. Therefore, the preconditioning matrix extended to generalized finite-rate chemistry must accommodate a flexible system of moving waves. Fortunately, no new kind of wave appears in the system. The only existing waves are entropy and vorticity waves, which move with the fluid, and acoustic waves, which propagate in Mach number dependent directions. The nonequilibrium vibrational energies and species densities in the unknown state vector act strictly as convective waves. The essential concept for extending the preconditioning to generalized chemistry models is determining the differential variables which symmetrize the flux Jacobians. The extension is then straight-forward. This algorithm research effort will be released in a future version of the production level computational code coined the General Aerodynamic Simulation Program (GASP), developed by Walters, Slack, and McGrory.

Godfrey, Andrew G.↗