Search NASA⌕ Search

SEARCH · Search NASA

Results for “Sylvester 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.

12 records
All sourcesNASA NTRSDOE OSTI
NASA NTRSDate not supplied

Constrained Field Construction Using Bernstein Polynomial Derived Operators

This method recasts the mass-conservation equation as a Sylvester equation employing high-order derivative operators derived from modified Bernstein polynomial expansions. Given prescribed velocity fields, the algorithm yields a constrained, least-squared solution for the associated density field. To demonstrate the practical utility of this methodology, it is applied to a computationally-derived two-dimensional isolator dataset. This reconstruction method is envisioned to be used in conjunction with diagnostic techniques to aid in the quantification of isolator flow fields, since obtaining highly characterized datasets within this engine component is exceedingly difficult.

Isolator↗
NASA NTRSDate not supplied

Field Reconstruction from PIV Measurements Employing Bernstein Polynomial Derived Operators

A fluid-dynamic reconstruction algorithm is presented that generates a least-squares best-fit, two-dimensional density field from a prespecified two-dimensional velocity field. This method recasts the mass-conservation equation as a modified Sylvester equation employing high-order operators derived from modified Bernstein polynomial expansions. To demonstrate its practical utility, this analytic methodology is applied to two canonical cases and a Particle Image Velocimetry dataset obtained from a Mach-2, mechanically back-pressured, isolator experiment. This methodology is envisioned to be used in conjunction with hypersonic-diagnostic techniques to aid in the quantification of isolator flow fields. However, also note that this reconstruction technique is well suited to other applications relevant to fluid dynamics, such as obtaining three-dimensional flow field reconstructions.

Bernstein Polynomials↗
DOE OSTI2021

Numerical solution of singular Lyapunov equations

We consider the numerical solution of large scale singular (continuous-time) Lyapunov equations of the form AX + XA T + BB T = 0, where A is semistable, that is, its spectrum is contained in the left half plane, with the exception of a few semisimple eigenvalues at zero. We also consider the case of a few semisimple eigenvalues on the imaginary axis. We assume that we know these few eigenvalues (zero or imaginary), and that we have or can compute the corresponding invariant subspaces. We use this information to build an appropriate newly proposed subspace on which to project the Lyapunov equations, and then compute a low-rank approximation to the least squares solution. Selected illustrative numerical examples are provided.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2017

Performance Optimizing Adaptive Control with Time-Varying Reference Model Modification

This paper presents a new adaptive control approach that involves a performance optimization objective. The control synthesis involves the design of a performance optimizing adaptive controller from a subset of control inputs. The resulting effect of the performance optimizing adaptive controller is to modify the initial reference model into a time-varying reference model which satisfies the performance optimization requirement obtained from an optimal control problem. The time-varying reference model modification is accomplished by the real-time solutions of the time-varying Riccati and Sylvester equations coupled with the least-squares parameter estimation of the sensitivities of the performance metric. The effectiveness of the proposed method is demonstrated by an application of maneuver load alleviation control for a flexible aircraft.

Adaptive Control↗
NASA NTRS2018

Time-Varying Modification of Reference Model for Adaptive Control with Performance Optimization

This paper presents a new adaptive control ap- proach that involves a performance optimization objective. The control synthesis involves the design of a performance optimizing adaptive controller from a subset of control inputs. The resulting effect of the performance optimizing adaptive controller is to modify the initial reference model into a time-varying reference model which satisfies the performance optimization requirement obtained from an optimal control problem. The time-varying reference model modification is accomplished by the real-time solutions of the time-varying Riccati and Sylvester equations coupled with the least-squares parameter estimation of the sen- sitivities of the performance metric. The effectiveness of the proposed method is demonstrated by an application of maneuver load alleviation control for a flexible aircraft.

Adaptive Control↗
NASA NTRSDate not supplied

Time-Varying Reference Model Modification of Adaptive Control with Multi-Objective Performance Optimization

This paper presents an adaptive control approach that modifies a reference model in order to satisfy a multi-objective optimization of two performance signals: a linear signal and a quadratic signal. The time varying reference model modification is accomplished by the real-time solutions of the time-varying Riccati and Sylvester equations coupled with the least-squares parameter estimation of the sensitivities of the performance signals to be minimized. The effectiveness of the proposed method is to be demonstrated by a flight control application of maneuver load alleviation and drag minimization.

Adaptive Control↗
DOE OSTI2020

The Sylvester Graphical Lasso (SyGlasso)

This paper introduces the Sylvester graphical lasso (SyGlasso) that captures multiway dependencies present in tensor-valued data. The model is based on the Sylvester equation that defines a generative model. The proposed model complements the tensor graphical lasso that imposes a Kronecker sum model for the inverse covariance matrix by providing an alternative Kronecker sum model that is generative and interpretable. A nodewise regression approach is adopted for estimating the conditional independence relationships among variables. The statistical convergence of the method is established, and empirical studies are provided to demonstrate the recovery of meaningful conditional dependency graphs. Here we apply the SyGlasso to an electroencephalography (EEG) study to compare the brain connectivity of alcoholic and nonalcoholic subjects. Here, we demonstrate that our model can simultaneously estimate both the brain connectivity and its temporal dependencies.

Wang, Yu↗
DOE OSTI2025

Sylvester-preconditioned adaptive-rank implicit time integrators for advection-diffusion equations with variable coefficients

Here, we consider the adaptive-rank integration of multi-dimensional time-dependent advection-diffusion partial differential equations (PDEs) with variable coefficients. We employ a standard finite-difference method for spatial discretization coupled with high-order diagonally implicit Runge-Kutta temporal schemes. The discrete equation is a generalized Sylvester equation (GSE), which we solve with a projection-based adaptive-rank algorithm structured around two key strategies: (i) constructing dimension-wise subspaces using a novel atypical extended Krylov strategy, and (ii) efficiently solving the basis coefficient matrix with a preconditioned GMRES solver. The low-rank decomposition is performed in 2D using SVD and with high-order SVD (HOSVD) in 3D to represent the tensor in a compressed Tucker format. For d-dimensional problems (here, d = 2 or 3), the computational complexity and memory storage of the approach are found numerically to scale as and $\mathscr{O}(Nr^2) + \mathscr{O} (r^{d+1})$ and $\mathscr{O}(Nr) + \mathscr{O} (r^{d})$, respectively, with the one-dimensional resolution and the maximal rank during the Krylov iteration (which we find to be largely independent of on our numerical examples). We present numerical examples that illustrate the advertised properties of the algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Parallel Algorithms for Computing the Tensor-Train Decomposition

The tensor-train (TT) decomposition expresses a tensor in a data-sparse format used in molecular simulations, high-order correlation functions, and optimization. In this paper, we propose four parallelizable algorithms that compute the TT format from various tensor inputs: (1) Parallel-TTSVD for traditional format, (2) PSTT and its variants for streaming data, (3) Tucker2TT for Tucker format, and (4) TT-fADI for solutions of Sylvester tensor equations. We provide theoretical guarantees of accuracy, parallelization methods, scaling analysis, and numerical results. For example, for a d-dimension tensor in $\mathbb{R}$ $n\times∙∙∙$$\times$$n$ a two-sided sketching algorithm PSTT2 is shown to have a memory complexity of $O(n^{[d/2]})$, improving upon $O(n^{d—1})$ from previous algorithms.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1989

Overview of Krylov subspace methods with applications to control problems

An overview of projection methods based on Krylov subspaces are given with emphasis on their application to solving matrix equations that arise in control problems. The main idea of Krylov subspace methods is to generate a basis of the Krylov subspace Span and seek an approximate solution the the original problem from this subspace. Thus, the original matrix problem of size N is approximated by one of dimension m typically much smaller than N. Krylov subspace methods have been very successful in solving linear systems and eigenvalue problems and are now just becoming popular for solving nonlinear equations. It is shown how they can be used to solve partial pole placement problems, Sylvester's equation, and Lyapunov's equation.

Saad, Youcef↗
NASA NTRS1992

The algebraic decoding of the (41, 21, 9) quadratic residue code

A new algebraic approach for decoding the quadratic residue (QR) codes, in particular the (41, 21, 9) QR code is presented. The key ideas behind this decoding technique are a systematic application of the Sylvester resultant method to the Newton identities associated with the code syndromes to find the error-locator polynomial, and next a method for determining error locations by solving certain quadratic, cubic and quartic equations over GF(2 exp m) in a new way which uses Zech's logarithms for the arithmetic. The algorithms developed here are suitable for implementation in a programmable microprocessor or special-purpose VLSI chip. It is expected that the algebraic methods developed here can apply generally to other codes such as the BCH and Reed-Solomon codes.

Reed, Irving S.↗
DOE OSTI2026

Phosphorus sorption and its environmental predictors across pantropical forest soils sampled over the past decade

Tropical forest productivity is frequently constrained by soil phosphorus (P) availability, yet global Land Surface Model (LSM), which are used to simulate ecosystem processes, still represent P cycling in tropical regions only in a limited way, largely because of scarce observational data. Phosphorus adsorption and desorption of dissolved inorganic P to and from soil minerals (hereafter termed sorption), is an important process for predicting how much P is available to plants. This dataset was created to improve predictions of soil P sorption in tropical soils by identifying the isotherm equation that best describes pantropical soils. It includes raw measurements of environmental variables, such as soil properties and climate, together with P sorption data collected from 40 forest soil pits from 9 Forest Global Earth Observatory (ForestGEO) sites across 7 tropical countries during 2018-2022. The data are organized by site, country, and continent. Each site may include several soil pits. For each pit, P sorption was measured across a range of soil P concentrations to build sorption isotherm curves, typically with about 6 to 8 measurements per curve. While sorbed P varies across these concentration levels, the other environmental variables remain constant at the plot level.

Aluminum oxide↗