Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Numerical linear algebra”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
NASA NTRS1981

Analysis of cracks emanating from a circular hole in unidirectional fiber reinforced composites, part 2

An analytical method is developed for cracks emanating from a circular hole in an off-axis unidirectional fiber-reinforced composite. The method which is formulated by using conservation laws of elasticity and fundamental relationships in anisotropic fracture mechanics, provides a convenient and accurate means to examine the complicated crack behavior, when used in conjunction with a suitable numerical scheme such as the finite element method. The formulation is eventually reduced to a system of linear algebraic equations of mixed-mode stress intensity factors. Fracture parameters, describing crack-tip deformation and fracture in the composite, are obtained explicitly. Effects of material anisotropy and crack/hole geometry are examined also. Of particular interest are the energy release rates associated with crack extension; their values are evaluated for various cases. Results show that mixed-mode stress intensity factors and energy release rates associated with the cracks emanating from a hole change very appreciably with fiber orientation in the composite. K sub 1 and G increase monotonically with increasing theta; but K sub 2 reaches its maximum at theta = 45 deg, and then decreases gradually as theta increases further.

Wang, S. S.↗
NASA NTRS1989

Numerical methods in Markov chain modeling

Several methods for computing stationary probability distributions of Markov chains are described and compared. The main linear algebra problem consists of computing an eigenvector of a sparse, usually nonsymmetric, matrix associated with a known eigenvalue. It can also be cast as a problem of solving a homogeneous singular linear system. Several methods based on combinations of Krylov subspace techniques are presented. The performance of these methods on some realistic problems are compared.

Philippe, Bernard↗
NASA NTRS1981

Analysis of interface cracks in adhesively bonded lap shear joints, part 4

Conservation laws of elasticity for nonhomogeneous materials were developed and were used to study the crack behavior in adhesively bonded lap shear joints. By using these laws and the fundamental relationships in fracture mechanics of interface cracks, the problem is reduced to a pair of linear algebraic equations, and stress intensity solutions can be determined directly by information extracted from the far field. The numerical results obtained show that: (1) in the lap-shear joint with a given adherend, the opening-mode stress intensity factor, (K sub 1) is always larger than that of the shearing-mode (K sub 2); (2) (K sub 1) is not sensitive to adherent thickness abut (K sub 2) increases rapidly with increasing thickness; and (3) (K sub 1) and (K sub 2) increase simultaneously as the interfacial crack length increases.

Wang, S. S.↗
NASA NTRS1999

Computation of Turbulent Wake Flows in Variable Pressure Gradient

Transport aircraft performance is strongly influenced by the effectiveness of high-lift systems. Developing wakes generated by the airfoil elements are subjected to strong pressure gradients and can thicken very rapidly, limiting maximum lift. This paper focuses on the effects of various pressure gradients on developing symmetric wakes and on the ability of a linear eddy viscosity model and a non-linear explicit algebraic stress model to accurately predict their downstream evolution. In order to reduce the uncertainties arising from numerical issues when assessing the performance of turbulence models, three different numerical codes with the same turbulence models are used. Results are compared to available experimental data to assess the accuracy of the computational results.

Duquesne, N.↗
NASA NTRS1983

Development of finite analytic method for unsteady three-dimensional Navier-Stokes equation

A finite analytic (FA) numerical method is described for the numerical study of three-dimensional fluid flow problems. The FA method incorporates a local linearization scheme and a classical analytic solution technique to formulate the algebraic representation of unsteady three-dimensional Navier Stokes Equations. The twenty-eight point FA formula thus obtained gives all positive coefficients and desired upwind shift. Cubic cavity flows are then solved by the FA method for Reynolds numbers of 100 and 400. A simple variant of SIMPLER algorithm is used to resolve the pressure-velocity coupling problem. The numerical solutions show that the presence of side walls reduce the strength of the primary vortex when compared with the two-dimensional square cavity flows.

Chen, H.-C.↗
NASA NTRS1991

Computational study of the aerodynamics and control by blowing of asymmetric vortical flows over delta wings

Some of the work is described which was done in a study of the flow field produced by tangential leading edge blowing on a 60 deg. delta wing. The flow is studied computationally by solving the Thin Layer Navier-Stokes equations. Steady state flow fields are calculated for various angles of attack and yaw, with and without the presence of tangential leading edge blowing. The effectiveness of blowing as a rolling moment control mechanism to extend the envelope of controllability is illustrated at pre- and post-stall angles of attack. The numerical grid is generated using algebraic grid generation and various interpolation and blending techniques. The jet emanates from a slot with linearly varying thickness and is introduced into the flow field using the concept of an actuator plane, thereby not requiring resolution of the jet slot geometry. The Baldwin-Lomax algebraic turbulence model is used to provide turbulent closure. The computational results are compared with those of experiments.

Craig, Ken↗
NASA NTRS1994

Towards enhancing and delaying disturbances in free shear flows

The family of shear flows comprising the jet, wake, and the mixing layer are subjected to perturbations in an inviscid incompressible fluid. By modeling the basic mean flows as parallel with piecewise linear variations for the velocities, complete and general solutions to the linearized equations of motion can be obtained in closed form as functions of all space variables and time when posed as an initial value problem. The results show that there is a continuous as well as the discrete spectrum that is more familiar in stability theory and therefore there can be both algebraic and exponential growth of disturbances in time. These bases make it feasible to consider control of such flows. To this end, the possibility of enhancing the disturbances in the mixing layer and delaying the onset in the jet and wake is investigated. It is found that growth of perturbations can be delayed to a considerable degree for the jet and the wake but, by comparison, cannot be enhanced in the mixing layer. By using moving coordinates, a method for demonstrating the predominant early and long time behavior of disturbances in these flows is given for continuous velocity profiles. It is shown that the early time transients are always algebraic whereas the asymptotic limit is that of an exponential normal mode. Numerical treatment of the new governing equations confirm the conclusions reached by use of the piecewise linear basic models. Although not pursued here, feedback mechanisms designed for control of the flow could be devised using the results of this work.

Criminale, W. O.↗
DOE OSTI2025

Hardware acceleration for HPS algorithms in two and three dimensions

We provide a flexible, open-source framework for hardware acceleration, namely massively-parallel execution on general-purpose graphics processing units (GPUs), applied to the hierarchical Poincaré–Steklov (HPS) family of algorithms for building fast direct solvers for linear elliptic partial differential equations. To take full advantage of the power of hardware acceleration, we propose two variants of HPS algorithms to improve performance on two- and three-dimensional problems. In the two-dimensional setting, we introduce a novel recomputation strategy that minimizes costly data transfers to and from the GPU; in three dimensions, we modify and extend the adaptive discretization technique of Geldermans and Gillman [1] to greatly reduce peak memory usage. We provide an open-source implementation of these methods written in JAX, a high-level accelerated linear algebra package, which allows for the first integration of a high-order fast direct solver with automatic differentiation tools. We conclude with extensive numerical examples showing our methods are fast and accurate on two- and three-dimensional problems.

Fast direct solvers↗
NASA NTRS1981

Finite-analytic numerical solution of heat transfer in two-dimensional cavity flow

Heat transfer in cavity flow is numerically analyzed by a new numerical method called the finite-analytic method. The basic idea of the finite-analytic method is the incorporation of local analytic solutions in the numerical solutions of linear or nonlinear partial differential equations. In the present investigation, the local analytic solutions for temperature, stream function, and vorticity distributions are derived. When the local analytic solution is evaluated at a given nodal point, it gives an algebraic relationship between a nodal value in a subregion and its neighboring nodal points. A system of algebraic equations is solved to provide the numerical solution of the problem. The finite-analytic method is used to solve heat transfer in the cavity flow at high Reynolds number (1000) for Prandtl numbers of 0.1, 1, and 10.

Chen, C.-J.↗
NASA NTRS1989

Progress on a Taylor weak statement finite element algorithm for high-speed aerodynamic flows

A new finite element numerical Computational Fluid Dynamics (CFD) algorithm has matured to the point of efficiently solving two-dimensional high speed real-gas compressible flow problems in generalized coordinates on modern vector computer systems. The algorithm employs a Taylor Weak Statement classical Galerkin formulation, a variably implicit Newton iteration, and a tensor matrix product factorization of the linear algebra Jacobian under a generalized coordinate transformation. Allowing for a general two-dimensional conservation law system, the algorithm has been exercised on the Euler and laminar forms of the Navier-Stokes equations. Real-gas fluid properties are admitted, and numerical results verify solution accuracy, efficiency, and stability over a range of test problem parameters.

Baker, A. J.↗
NASA NTRS1975

Some estimation formulae for continuous time-invariant linear systems

In this brief paper we examine a Riccati equation decomposition due to Reid and Lainiotis and apply the result to the continuous time-invariant linear filtering problem. Exploitation of the time-invariant structure leads to integration-free covariance recursions which are of use in covariance analyses and in filter implementations. A super-linearly convergent iterative solution to the algebraic Riccati equation (ARE) is developed. The resulting algorithm, arranged in a square-root form, is thought to be numerically stable and competitive with other ARE solution methods. Certain covariance relations that are relevant to the fixed-point and fixed-lag smoothing problems are also discussed.

Bierman, G. J.↗
NASA NTRS1992

Optimal matrix approximants in structural identification

Problems of model correlation and system identification are central in the design, analysis, and control of large space structures. Of the numerous methods that have been proposed, many are based on finding minimal adjustments to a model matrix sufficient to introduce some desirable quality into that matrix. In this work, several of these methods are reviewed, placed in a modern framework, and linked to other previously known ideas in computational linear algebra and optimization. This new framework provides a point of departure for a number of new methods which are introduced here. Significant among these is a method for stiffness matrix adjustment which preserves the sparsity pattern of an original matrix, requires comparatively modest computational resources, and allows robust handling of noisy modal data. Numerical examples are included to illustrate the methods presented herein.

Beattie, C. A.↗
DOE OSTI2024

Improving the five-point bootstrap

We present a new algorithm for the numerical evaluation of five-point conformal blocks in d-dimensions, greatly improving the efficiency of their computation. To do this we use an appropriate ansatz for the blocks as a series expansion in radial coordinates, derive a set of recursion relations for the unknown coefficients in the ansatz, and evaluate the series using a Padé approximant to accelerate its convergence. We then study the 〈σσϵσσ〉 correlator in the 3d critical Ising model by truncating the operator product expansion (OPE) and only including operators with conformal dimension below a cutoff ∆ ⩽ ∆cutoff. We approximate the contributions of the operators above the cutoff by the corresponding contributions in a suitable disconnected five-point correlator. Using this approach, we compute a number of OPE coefficients with greater accuracy than previous methods.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS1989

Convergence of infinite dimensional sampled LQR problems - Theory and numerical results

A theory is developed for the convergence of the closed-loop solution to infinite-dimensional discrete-time linear-quadratic regulator (LQR) problems on the infinite time interval to the solution of a corresponding continuous-time LQR problem as the length of the sampling interval tends toward zero. Convergence of solutions to the operator algebraic Riccati equation and corresponding optimal feedback control gains is guaranteed under appropriate uniform stabilizability and detectability conditions and consistent sampling. Also presented are numerical results involving the optimal LQ control of a heat or diffusion equation, a hereditary or delay differential equation, and a hybrid system of ordinary and partial differential equations describing the transverse vibration of a cantilevered Voigt-Kelvin viscoelastic beam with tip mass.

Rosen, I. G.↗
NASA NTRS1981

Closed form evaluation of symmetric two-sided complex integrals

Evaluation of two-sided complex integrals is often required when analyzing linear systems to determine signal variances resulting from stochastic inputs and system noise bandwidths. Algebraic solutions of integrals in a closed matrix equation form, using coefficients of the numerator and denominator polynomials, are presented. The closed forms provide the possibility of obtaining some insight into parameter sensitivity in addition to greatly reducing the computational complexity required by the normal method of evaluation by residues.

Winkelstein, R.↗
DOE OSTI2026

Algebraic Multigrid with Filtering: An Efficient Preconditioner for Interior Point Methods in Large-Scale Contact Mechanics Optimization

Large-scale contact mechanics simulations are crucial in many engineering fields such as structural design and manufacturing. In the frictionless case, contact can be modeled by minimizing an energy functional; however, these problems are often nonlinear, nonconvex, and increasingly difficult to solve as mesh resolution increases. In this work, we employ a Newton-based interior-point (IP) filter line-search method, an effective approach for large-scale constrained optimization. While this method converges rapidly, each iteration requires solving a large saddle-point linear system that becomes ill-conditioned as the optimization process converges, largely due to IP treatment of the contact constraints. Such ill-conditioning can hinder solver scalability and increase iteration counts with mesh refinement. Here, to address this, we introduce a novel preconditioner, algebraic multigrid with filtering (AMGF), tailored to the Schur complement of the saddle-point system. Building on the classical AMG solver, commonly used for elasticity, we augment it with a specialized subspace correction that filters near null space components introduced by contact interface constraints. Through theoretical analysis and numerical experiments on a range of linear and nonlinear contact problems, we demonstrate that the proposed solver achieves mesh independent convergence and maintains robustness against the ill-conditioning that notoriously plagues IP methods. These results indicate that AMGF makes contact mechanics simulations more tractable and broadens the applicability of Newton-based IP methods in challenging engineering scenarios. More broadly, AMGF is well suited for problems, optimization or otherwise, where solver performance is limited by a low-dimensional subspace, such as those arising from localized constraints, interface conditions, or model heterogeneities. This makes the method widely applicable beyond contact mechanics and constrained optimization.

Mathematics and Computing↗
DOE OSTI2022

High performance sparse multifrontal solvers on modern GPUs

Here, we have ported the numerical factorization and triangular solve phases of the sparse direct solver STRUMPACK to GPU. STRUMPACK implements sparse LU factorization using the multifrontal algorithm, which performs most of its operations in dense linear algebra operations on so-called frontal matrices of various sizes. Our GPU implementation off-loads these dense linear algebra operations, as well as the sparse scatter–gather operations between frontal matrices. For the larger frontal matrices, our GPU implementation relies on vendor libraries such as cuBLAS and cuSOLVER for NVIDIA GPUs and rocBLAS and rocSOLVER for AMD GPUs. For the smaller frontal matrices we developed custom CUDA and HIP kernels to reduce kernel launch overhead. Overall, high performance is achieved by identifying submatrix factorizations corresponding to sub-trees of the multifrontal assembly tree which fit entirely in GPU memory. The multi-GPU setting uses SLATE (Software for Linear Algebra Targeting Exascale) as a modern GPU-aware replacement for ScaLAPACK. On 4 nodes of SUMMIT the code runs ~10X faster when using all 24 V100 GPUs compared to when it only uses the 168 POWER9 cores. On 8 SUMMIT nodes, using 48 V100 GPUs, the sparse solver reaches over 50TFlop/s. Compared to SuperLU, on a single V100, for a set of 17 matrices our implementation is faster for all but one matrix, and is on average 5X (median 4X) faster

97 MATHEMATICS AND COMPUTING↗