SEARCH · Engineering Papers

Results for “symmetric matrices”

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 145 records · Page 8

All sources NASA NTRS DOE OSTI

NASA NTRS1992

External calibration of polarimetric radar images using distributed targets

A new technique is presented for calibrating polarimetric synthetic aperture radar (SAR) images using only the responses from natural distributed targets. The model for polarimetric radars is assumed to be X = cRST where X is the measured scattering matrix corresponding to the target scattering matrix S distorted by the system matrices T and R (in general T does not equal R(sup t)). To allow for the polarimetric calibration using only distributed targets and corner reflectors, van Zyl assumed a reciprocal polarimetric radar model with T = R(sup t); when applied for JPL SAR data, a heuristic symmetrization procedure is used by POLCAL to compensate the phase difference between the measured HV and VH responses and then take the average of both. This heuristic approach causes some non-removable cross-polarization responses for corner reflectors, which can be avoided by a rigorous symmetrization method based on reciprocity. After the radar is made reciprocal, a new algorithm based on the responses from distributed targets with reflection symmetry is developed to estimate the cross-talk parameters. The new algorithm never experiences problems in convergence and is also found to converge faster than the existing routines implemented for POLCAL. When the new technique is implemented for the JPL polarimetric data, symmetrization and cross-talk removal are performed on a line-by-line (azimuth) basis. After the cross-talks are removed from the entire image, phase and amplitude calibrations are carried out by selecting distributed targets either with azimuthal symmetry along the looking direction or with some well-known volume and surface scattering mechanisms to estimate the relative phases and amplitude responses of the horizontal and vertical channels.

Yueh, Simon H.↗

NASA NTRS1981

Transfer of line radiation in differentially expanding atmospheres. VI The plane parallel atmosphere with expanding and contracting regions

The non-LTE radiative transfer problem for a two level atom with complete redistribution over a Doppler profile is solved for a plane parallel slab (overlying a radiating photosphere) that has a velocity field which rises symmetrically from zero at either face to a central maximum. Since the velocity gradient reverses, distant layers of the slab become coupled by radiation that jumps intervening layers. The Feautrier method is used, but an iterative variant is also employed as a check in cases where poorly conditioned matrices are encountered. Approximations are developed to explain some of the principal features. It is found that the source function S tends to have two plateaus with values near 2/3 I sub 0 and 1/3 I sub 0, where I sub 0 is the photospheric continuum incident from below; the larger value lies nearer the photosphere. The upper layers sometimes exhibit a rise in S owing to interconnection by radiation to the base. It is noted that the radiation force is largest at the two faces and the midplane. Some line profiles are found to have unusually steep absorptions at rest frequency because of the low excitation in the uppermost, stationary layers.

Noerdlinger, P. D.↗

NASA NTRS1993

Design of multiple-ply laminated composite tapered beams

A study of a special case of symmetric laminated composite cantilever beams is presented. The approach models beams that are tapered both in depth and width and investigates the effect of the ply layup angle and the ply taper on bending and interlaminar shearing stresses. For the determination of stresses and deflections, the beam stiffness matrices are expressed as linear functions of the beam length. Using classical lamination theory (CLT) the stiffness matrices are determined and assembled at strategic locations along the length of the beam. They are then inverted and necessary stiffness parameters are obtained numerically and extracted for determination of design information at each location chosen. Several ply layup configurations are investigated, and design considerations are presented based on the findings. Finally, recommendations for the design of these beams are presented, and a means for anticipating the location of highest stresses is offered.

Rodriguez, P.↗

DOE OSTI2020

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Linear solvers for power grid optimization problems: A review of GPU-accelerated linear solvers

The linear equations that arise in interior methods for constrained optimization are sparse symmetric indefinite, and they become extremely ill-conditioned as the interior method converges. These linear systems present a challenge for existing solver frameworks based on sparse LU or LDL T decompositions. Here, we benchmark five well known direct linear solver packages on CPU- and GPU-based hardware, using matrices extracted from power grid optimization problems. The achieved solution accuracy varies greatly among the packages. None of the tested packages delivers significant GPU acceleration for our test cases. For completeness of the comparison we include results for MA57, which is one of the most efficient and reliable CPU solvers for this class of problem.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1973

Eigenproblem solution by a combined Sturm sequence and inverse iteration technique.

Description of an efficient and numerically stable algorithm, along with a complete listing of the associated computer program, developed for the accurate computation of specified roots and associated vectors of the eigenvalue problem Aq = lambda Bq with band symmetric A and B, B being also positive-definite. The desired roots are first isolated by the Sturm sequence procedure; then a special variant of the inverse iteration technique is applied for the individual determination of each root along with its vector. The algorithm fully exploits the banded form of relevant matrices, and the associated program written in FORTRAN V for the JPL UNIVAC 1108 computer proves to be most significantly economical in comparison to similar existing procedures. The program may be conveniently utilized for the efficient solution of practical engineering problems, involving free vibration and buckling analysis of structures. Results of such analyses are presented for representative structures.

Gupta, K. K.↗

NASA NTRS1991

Design and test of three active flutter suppression controllers

Three flutter suppression control law design techniques are presented. Each uses multiple control surfaces and/or sensors. The first uses linear combinations of several accelerometer signals together with dynamic compensation to synthesize the modal rate of the critical mode for feedback to distributed control surfaces. The second uses traditional tools (pole/zero loci and Nyquist diagrams) to develop a good understanding of the flutter mechanism and produce a controller with minimal complexity and good robustness to plant uncertainty. The third starts with a minimum energy Linear Quadratic Gaussian controller, applies controller order reduction, and then modifies weight and noise covariance matrices to improve multi-variable robustness. The resulting designs were implemented digitally and tested subsonically on the Active Flexible Wing (AFW) wind tunnel model. Test results presented here include plant characteristics, maximum attained closed-loop dynamic pressure, and Root Mean Square control surface activity. A key result is that simultaneous symmetric and antisymmetric flutter suppression was achieved by the second control law, with a 24 percent increase in attainable dynamic pressure.

Christhilf, David M.↗

DOE OSTI2023

Optimal Power Flow Derived Sparse Linear Solver Benchmarks

Due to the changing nature of the power grid, it is increasingly important to be able to solve a high-fidelity optimal power-flow models on large power networks. This high-fidelity problem, called AC Optimal Power Flow (ACOPF), is a nonlinear, nonconvex optimization problem. One of the few reliable ways of solving such a problem is interior point methods. These methods result in sparse linear systems where the coefficient matrix is symmetric, indefinite and nearly always ill-conditioned. As such, they are particularly challenging for sparse linear solvers and represent a considerable computational bottleneck in solving the ACOPF problem. In this paper, we introduce a repository of linear systems captured from ACOPF problems when solved by the open-source optimizer IPOPT. These matrices are meant to be used as a test suite for sparse linear solver development.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1993

A least-squares finite element method for 3D incompressible Navier-Stokes equations

The least-squares finite element method (LSFEM) based on the velocity-pressure-vorticity formulation is applied to three-dimensional steady incompressible Navier-Stokes problems. This method can accommodate equal-order interpolations, and results in symmetric, positive definite algebraic system. An additional compatibility equation, i.e., the divergence of vorticity vector should be zero, is included to make the first-order system elliptic. The Newton's method is employed to linearize the partial differential equations, the LSFEM is used to obtain discretized equations, and the system of algebraic equations is solved using the Jacobi preconditioned conjugate gradient method which avoids formation of either element or global matrices (matrix-free) to achieve high efficiency. The flow in a half of 3D cubic cavity is calculated at Re = 100, 400, and 1,000 with 50 x 52 x 25 trilinear elements. The Taylor-Gortler-like vortices are observed at Re = 1,000.

Jiang, Bo-Nan↗

NASA NTRS1992

Design, test, and evaluation of three active flutter suppression controllers

Three control law design techniques for flutter suppression are presented. Each technique uses multiple control surfaces and/or sensors. The first method uses traditional tools (such as pole/zero loci and Nyquist diagrams) for producing a controller that has minimal complexity and which is sufficiently robust to handle plant uncertainty. The second procedure uses linear combinations of several accelerometer signals and dynamic compensation to synthesize the model rate of the critical mode for feedback to the distributed control surfaces. The third technique starts with a minimum-energy linear quadratic Gaussian controller, iteratively modifies intensity matrices corresponding to input and output noise, and applies controller order reduction to achieve a low-order, robust controller. The resulting designs were implemented digitally and tested subsonically on the active flexible wing wind-tunnel model in the Langley Transonic Dynamics Tunnel. Only the traditional pole/zero loci design was sufficiently robust to errors in the nominal plant to successfully suppress flutter during the test. The traditional pole/zero loci design provided simultaneous suppression of symmetric and antisymmetric flutter with a 24-percent increase in attainable dynamic pressure. Posttest analyses are shown which illustrate the problems encountered with the other laws.

Adams, William M., Jr.↗

DOE OSTI2024

General approach to neutrino mass mechanisms with sterile neutrinos

We present a mathematical framework for constructing the most general neutrino mass matrices that yield the observed spectrum of light active neutrino masses in conjunction with arbitrarily many heavy sterile neutrinos, without the need to assume a hierarchy between Dirac and Majorana mass terms. The seesaw mechanism is a byproduct of the formalism, along with many other possibilities for generating tiny neutrino masses. We comment on phenomenological applications of this approach, in particular deriving a mechanism to address the long-standing ( g − 2 ) μ anomaly in the context of the left-right symmetric model. Published by the American Physical Society 2024

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

NASA NTRS1994

Numerical Generation of Asymmetric Flows about Slender Bodies of Revolution at Extreme Incidence

It is well known that slender bodies of revolution will develop an asymmetric, unsteady flow pattern in experimental tests, if the angle of incidence to the oncoming stream is above a critical value. It has been suggested that the origin of these asymmetric flows may stem from geometric imperfections of the model being tested, or from disturbances in the oncoming stream. In numerical simulations, it is possible to generate bodies of revolution which are perfectly symmetric about their longitudinal axis, and to impose uniform flow conditions which are free from disturbances. The current work presents numerical simulations of the flow about an ogive-cylinder configuration at 40 and 60 degree angle of incidence. These simulations. were performed using numerical algorithms which are also symmetric about the lateral plane of the cylinder body. The flowfields at 40 degree angle of attack were seen to remain symmetric to the round-off accuracy of the computer. At 60 degree angle of attack, a lateral force coefficient developed of O(1) which progressed to an alternate vortex shedding in time. The nature of this lateral force generation and vortex shedding was dependent on the choice of numerical algorithm. The origin of the asymmetries observed in the 60 degree angle of attack computations were traced to round-off errors in the implicit block-matrix inverter. A means of inverting the implicit operator matrices, which maintains the symmetry of the overall numerical algorithm was implemented.

Murman, Scott M.↗

NASA NTRS2022

Line Coupling and Line Mixing Effects on Calculated Widths of Symmetric-Top Molecules With the k-Degeneracy: A Theoretical Study of N 2 -, O 2 -, and Air-Broadened Lines of CH 3 I

Calculations of the N 2 -, O 2 - and air-broadened widths, together with their temperature dependence exponents have been made for transitions of CH 3 I in the v 5 and v 6 bands. The calculations are based on a semi-classical line shape formalism developed by the current authors through modifying and refining the Robert-Bonamy formalism. In recent years, we have applied this formalism for linear molecules, symmetric-top molecules with inversion symmetry, and asymmetric-top molecules. For symmetric-top molecules with the k degeneracy such as CH 3 I, the formalism has a new feature. In this case, one should consider each of the CH 3 I transitions labeled by k i or ƒ ≠ 0 as a doublet. Then, one needs to consider the effects of the line mixing process between these two components. Comparisons of our theoretical predictions with some data available demonstrate a very reasonable agreement. Finally we propose new experiments at higher perturber pressures that would enable one to check the theoretically calculated relaxation matrices and to extend the analysis to the interdoublet mixing effects.

Line coupling↗

DOE OSTI2022

Line coupling and line mixing effects on calculated widths of symmetric-top molecules with the k-degeneracy: A theoretical study of N 2 -, O 2 -, and air-broadened lines of CH 3 I

Calculations of the N 2 -, O 2 -, and air-broadened widths, together with their temperature dependence exponents have been made for transitions of CH 3 I in the ν 5 and ν 6 bands. The calculations are based on a semi-classical line shape formalism developed by the current authors through modifying and refining the Robert-Bonamy formalism. In recent years, we have applied this formalism for linear molecules, symmetric-top molecules with inversion symmetry, and asymmetric-top molecules. For symmetric-top molecules with the k degeneracy such as CH 3 I, the formalism has a new feature. In this case, one should consider each of the CH 3 I transitions labeled by k i or f ≠ 0 as a doublet. Then, one needs to consider the effects of the line mixing process between these two components. Furthermore, comparisons of our theoretical predictions with some data available demonstrate a very reasonable agreement. Finally, we propose new experiments at higher perturber pressures that would enable one to check the theoretically calculated relaxation matrices and to extend the analysis to the inter-doublet mixing effects.

74 ATOMIC AND MOLECULAR PHYSICS↗

NASA NTRS1993

Large-scale computation of incompressible viscous flow by least-squares finite element method

The least-squares finite element method (LSFEM) based on the velocity-pressure-vorticity formulation is applied to large-scale/three-dimensional steady incompressible Navier-Stokes problems. This method can accommodate equal-order interpolations and results in symmetric, positive definite algebraic system which can be solved effectively by simple iterative methods. The first-order velocity-Bernoulli function-vorticity formulation for incompressible viscous flows is also tested. For three-dimensional cases, an additional compatibility equation, i.e., the divergence of the vorticity vector should be zero, is included to make the first-order system elliptic. The simple substitution of the Newton's method is employed to linearize the partial differential equations, the LSFEM is used to obtain discretized equations, and the system of algebraic equations is solved using the Jacobi preconditioned conjugate gradient method which avoids formation of either element or global matrices (matrix-free) to achieve high efficiency. To show the validity of this scheme for large-scale computation, we give numerical results for 2D driven cavity problem at Re = 10000 with 408 x 400 bilinear elements. The flow in a 3D cavity is calculated at Re = 100, 400, and 1,000 with 50 x 50 x 50 trilinear elements. The Taylor-Goertler-like vortices are observed for Re = 1,000.

Jiang, Bo-Nan↗

NASA NTRS1988

Multigrid method for stability problems

The problem of calculating the stability of steady state solutions of differential equations is addressed. Leading eigenvalues of large matrices that arise from discretization are calculated, and an efficient multigrid method for solving these problems is presented. The resulting grid functions are used as initial approximations for appropriate eigenvalue problems. The method employs local relaxation on all levels together with a global change on the coarsest level only, which is designed to separate the different eigenfunctions as well as to update their corresponding eigenvalues. Coarsening is done using the FAS formulation in a nonstandard way in which the right-hand side of the coarse grid equations involves unknown parameters to be solved on the coarse grid. This leads to a new multigrid method for calculating the eigenvalues of symmetric problems. Numerical experiments with a model problem are presented which demonstrate the effectiveness of the method.

Ta'asan, Shlomo↗

DOE OSTI2021

Nonlinear Matrix Approximation with Radial Basis Function Components

We introduce and investigate matrix approximation by decomposition into a sum of radial basis function (RBF) components. An RBF component is a generalization of the outer product between a pair of vectors, where an RBF function replaces the scalar multiplication between individual vector elements. Even though the RBF functions are positive definite, the summation across components is not restricted to convex combinations and allows us to compute the decomposition for any real matrix that is not necessarily symmetric or positive definite. We formulate the problem of seeking such a decomposition as an optimization problem with a nonlinear and non-convex loss function. Several modern versions of the gradient descent method, including their scalable stochastic counterparts, are used to solve this problem. We provide extensive empirical evidence of the effectiveness of the RBF decomposition and that of the gradient-based fitting algorithm. While being conceptually motivated by singular value decomposition (SVD), our proposed nonlinear counterpart outperforms SVD by drastically reducing the memory required to approximate a data matrix with the same L2 error for a wide range of matrix types. For example, it leads to 2 to 6 times memory save for Gaussian noise, graph adjacency matrices, and kernel matrices. Moreover, this proximity-based decomposition can offer additional interpretability in applications that involve, e.g., capturing the inner low-dimensional structure of the data, retaining graph connectivity structure, and preserving the acutance of images.

Rebrova, Elizaveta↗