Search NASA⌕ Search

SEARCH · Search NASA

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

582 records · Page 33

Calibration of TOPEX/POSEIDON at Platform Harvest

We present estimates for the mean bias of the TOPEX/POSEIDON NASA altimeter (ALT) and the Centre National d'Etudes Spatiales altimeter (SSALT) using in-situ data gathered at Platform Harvest during the first 36 cycles of the mission. Data for 21 overflights of the ALT and six overflights of the SSALT have been analyzed. The analysis includes an independent assessment of in-situ measurements of sea level, the radial component of the orbit, wet tropospheric path delay, and ionospheric path delay. (The sign convention used is such that, to correct the geophysical data record values for sea level, add the bias algebraically. Unless otherwise stated, the uncertainty in a given parameter is depicted by +/- sigma(sub x), where sigma(sub x) is the sample standard deviation of x about the mean.) Tide gauges at Harvest provide estimates of sea level with an uncertainty of +/- 1.5 cm. The uncertainty in the radial component of the orbit is estimated to be +/- 1.3 cm. In-situ measurements of tropopsheric path delay at Harvest compare to within +/- 1.3 cm of the TOPEX/POSEIDON microwave radiometer, and in-situ measurements of the ionospheric path delay compare to within -0.4 +/- 0.7 cm of the dual-frequency ALT and 1.1 +/- 0.6 cm of Doppler orbitography and radiopositioning integrated by satellite. We obtain mean bias estimates of -14.5 +/- 2.9 cm for the ALT and +0.9 +/- 3.1 cm for the SSALT (where the uncertainties are based on the standard deviation of the estimated mean (sigma(sub bar x/y), which is derived from sample statistics and estimates for errors that cannot be observed). These results are consistent with independent estimates for the relative bias between the two altimeters. A linear regression applied to the complete set of data shows that there is a discernable secular trend in the time series for the ALT bias estimates. A preliminary analysis of data obtained through cycle 48 suggests that the apparent secular drift may be the result of a poorly sampled annual signal.

Christensen, E. J.↗

A fast and accurate domain decomposition nonlinear manifold reduced order model

Here, this paper integrates nonlinear-manifold reduced order models (NM-ROMs) with domain decomposition (DD). NM ROMs approximate the full order model (FOM) state in a nonlinear-manifold by training a shallow, sparse autoencoder using FOM snapshot data. These NM-ROMs can be advantageous over linear-subspace ROMs (LS-ROMs) for problems with slowly decaying Kolmogorov n-width. However, the number of NM-ROM parameters that need to be trained scales with the size of the FOM. Moreover, for “extreme-scale” problems, the storage of high-dimensional FOM snapshots alone can make ROM training expensive. To alleviate the training cost, this paper applies DD to the FOM, computes NM-ROMs on each subdomain, and couples them to obtain a global NM-ROM. This approach has several advantages: Subdomain NM-ROMs can be trained in parallel, involve fewer parameters to be trained than global NM-ROMs, require smaller subdomain FOM dimensional training data, and can be tailored to subdomain specific features of the FOM. The shallow, sparse architecture of the autoencoder used in each subdomain NM-ROM allows application of hyper-reduction (HR), reducing the complexity caused by nonlinearity and yielding computational speedup of the NM-ROM. This paper provides the first application of NM-ROM (with HR) to a DD problem. In particular, this paper details an algebraic DD reformulation of the FOM, training a NM-ROM with HR for each sub domain, and a sequential quadratic programming (SQP) solver to evaluate the coupled global NM-ROM. Theoretical convergence results for the SQP method and a priori and a posteriori error estimates for the DD NM-ROM with HR are provided. The proposed DD NM-ROM with HR approach is numerically compared to a DD LS-ROM with HR on the 2D steady-state Burgers’ equation, showing an order of magnitude improvement in accuracy of the proposed DD NM-ROM over the DD LS-ROM.

97 MATHEMATICS AND COMPUTING↗

A Linear-Complexity Tensor Butterfly Algorithm for Compressing High-Dimensional Oscillatory Integral Operators

This paper presents a multilevel tensor compression algorithm called tensor butterfly algorithm for efficiently representing large-scale and high-dimensional oscillatory integral operators, including Green's functions for wave equations and integral transforms such as Radon transforms and Fourier transforms. The proposed algorithm leverages a tensor extension of the so-called complementary low-rank property of existing matrix butterfly algorithms. The algorithm partitions the discretized integral operator tensor into subtensors of multiple levels and factorizes each subtensor at the middle level as a Tucker-type interpolative decomposition, whose factor matrices are formed in a multilevel fashion. For a d-dimensional (d > 1) integral operator discretized into a 2d-mode tensor with n2d entries, the overall CPU time and memory requirement scale as O(nd), in stark contrast to the O(nd log n) complexity of existing matrix algorithms such as matrix butterfly algorithms and fast Fourier transforms (FFTs), where n is the number of points per direction. When comparing with other tensor algorithms such as quantized tensor train (QTT), the proposed algorithm also shows superior CPU and memory performance for tensor contraction. Remarkably, the tensor butterfly algorithm can efficiently model high-frequency Green's function interactions between two unit cubes, each spanning 512 wavelengths per direction, which represents problems of scale over 512× larger than that existing butterfly algorithms can handle, with the same amount of computation resources. On the other hand, for a problem representing 64 wavelengths per direction, which is the largest size existing algebraic matrix algorithms can handle, our tensor butterfly algorithm exhibits 200x speedups and 30× memory reduction compared with existing ones. Moreover, the tensor butterfly algorithm also permits O(nd)-complexity FFTs and Radon transforms up to d = 6 dimensions.

Kielstra, P Michael↗

Compositional Reasoning for Hierarchical State Machines

Harel statecharts and its derivatives are popular graphical languages for specifying discrete control systems via hierarchical state machines. Separately, there has been a long line of work on specifying concurrent systems with process calculi which come equipped with an algebraic theory, the ability reason compositionally about various temporal properties, and strong type systems. While these two approaches to modeling systems are tantalizingly similar, the integrated reasoning principles that exist for process calculi have not been demonstrated in hierarchical state machines. A key issue is that operational theories for process calculi do not behave like control systems, and thus, there is virtually no tool support for modeling control systems with such languages. For a control system designer, bringing the integrated, more scalable reasoning from the process calculi to state-machine languages would enable the specification of more complex systems and a more modular systems development process. Our insight is that we can recover many important results from the process calculi in hierarchical state machines with local scope. We employ a structural operational semantics, which is ubiquitous in process and 𝜆-calculi but uncommon in hierarchical statemachine formalizations, to enable inductive reasoning about behavior. Taking inspiration from the structure of process calculi metatheories, we define a calculus of refinement and equivalence that we prove sound with respect to local notion of (bi)simulation. Furthermore, we prove that the calculus preserves the behavioral properties of reactivity, observational determinism, traces, and linear temporal properties. Our results are mechanized in the Rocq proof assistant.

97 MATHEMATICS AND COMPUTING↗

A new method for solving the linearized 1D Vlasov–Poisson system yielding a new class of solutions

We describe a new method for solving the linearized 1D Vlasov–Poisson system by using properties of Cauchy-type integrals. Our method remedies critical flaws of the two standard methods, reveals a previously unrecognized Gaussian-in-time-like decay, and can also account for an externally applied electric field. The Landau approximation involves deforming the Bromwich contour around the poles closest to the real axis due to the analytically continued dielectric function, finding the long-time behavior for a stable system: Landau damping. Jackson's generalization encircles all poles while sending the contour to infinity, assuming its contribution vanishes, which is not true in general. This gives incorrect solutions for physically reasonable configurations and can exhibit pathological behavior, of which we show examples. The van Kampen method expresses the solution for a stable equilibrium as a continuous superposition of waves, resulting in an opaque integral. Case's generalization includes unstable systems and predicts a decaying discrete mode for each growing discrete mode, an apparent contradiction to both the Jackson solution and ours. We show, without imposing additional constraints, that the decaying modes are never present in the time evolution due to an exact cancellation with part of the continuum. Our solution is free of integral expressions, is obtained using algebra and Laurent series expansions, does not rely on analytic continuations, and results in a correct asymptotically convergent form in the case of infinite sums. The analysis used can be readily applied in higher-dimensional, electromagnetic systems and also provides a new technique for evaluating certain inverse Laplace transforms.

Physics↗

On the Response of the Special Sensor Microwave/Imager to the Marine Environment: Implications for Atmospheric Parameter Retrievals

A reasonably rigorous basis for understanding and extracting the physical information content of Special Sensor Microwave/Imager (SSM/I) satellite images of the marine environment is provided. To this end, a comprehensive algebraic parameterization is developed for the response of the SSM/I to a set of nine atmospheric and ocean surface parameters. The brightness temperature model includes a closed-form approximation to microwave radiative transfer in a non-scattering atmosphere and fitted models for surface emission and scattering based on geometric optics calculations for the roughened sea surface. The combined model is empirically tuned using suitable sets of SSM/I data and coincident surface observations. The brightness temperature model is then used to examine the sensitivity of the SSM/I to realistic variations in the scene being observed and to evaluate the theoretical maximum precision of global SSM/I retrievals of integrated water vapor, integrated cloud liquid water, and surface wind speed. A general minimum-variance method for optimally retrieving geophysical parameters from multichannel brightness temperature measurements is outlined, and several global statistical constraints of the type required by this method are computed. Finally, a unified set of efficient statistical and semi-physical algorithms is presented for obtaining fields of surface wind speed, integrated water vapor, cloud liquid water, and precipitation from SSM/I brightness temperature data. Features include: a semi-physical method for retrieving integrated cloud liquid water at 15 km resolution and with rms errors as small as approximately 0.02 kg/sq m; a 3-channel statistical algorithm for integrated water vapor which was constructed so as to have improved linear response to water vapor and reduced sensitivity to precipitation; and two complementary indices of precipitation activity (based on 37 GHz attenuation and 85 GHz scattering, respectively), each of which are relatively insensitive to variations in other environmental parameters.

Petty, Grant W.↗