Search NASA⌕ Search

SEARCH · Search NASA

Results for “Inverse Multiplication”

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 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS1979

Inverse multiple scattering problems. III - Inadequacy of certain limb darkening and phase curves for retrieving atmospheric information and limitations of approximate scattering models

The paper considers three complementary inverse multiple scattering problems relating to a uniquely defined atmospheric scattering model. Consideration is given to the appropriateness, for data inversion purposes, of intensities observed in diffuse reflection under a variety of experimental conditions; the uniqueness of the inverse solution is investigated. It is found that light curves representing monotonic variations, such as limb darkening curves and phase curves for a planetary (e.g., Venus) disk center are unsuitable for inferring atmospheric and scattering parameters.

Fymat, A. L.↗
NASA NTRS1985

VLSI architectures for computing multiplications and inverses in GF(2m)

Finite field arithmetic logic is central in the implementation of Reed-Solomon coders and in some cryptographic algorithms. There is a need for good multiplication and inversion algorithms that are easily realized on VLSI chips. Massey and Omura recently developed a new multiplication algorithm for Galois fields based on a normal basis representation. A pipeline structure is developed to realize the Massey-Omura multiplier in the finite field GF(2m). With the simple squaring property of the normal-basis representation used together with this multiplier, a pipeline architecture is also developed for computing inverse elements in GF(2m). The designs developed for the Massey-Omura multiplier and the computation of inverse elements are regular, simple, expandable and, therefore, naturally suitable for VLSI implementation.

Wang, C. C.↗
NASA NTRS1983

VLSI architectures for computing multiplications and inverses in GF(2-m)

Finite field arithmetic logic is central in the implementation of Reed-Solomon coders and in some cryptographic algorithms. There is a need for good multiplication and inversion algorithms that are easily realized on VLSI chips. Massey and Omura recently developed a new multiplication algorithm for Galois fields based on a normal basis representation. A pipeline structure is developed to realize the Massey-Omura multiplier in the finite field GF(2m). With the simple squaring property of the normal-basis representation used together with this multiplier, a pipeline architecture is also developed for computing inverse elements in GF(2m). The designs developed for the Massey-Omura multiplier and the computation of inverse elements are regular, simple, expandable and, therefore, naturally suitable for VLSI implementation.

Wang, C. C.↗
DOE OSTI2024

Estimate of background baseline and upper limit on the chiral magnetic effect in isobar collisions at $\sqrt{S_{NN}}$=200 GeV at the BNL Relativistic Heavy Ion Collider

For the search of the chiral magnetic effect (CME), STAR previously presented the results from isobar collisions ($^{96}_{44}$Ru + $^{96}_{44}$Ru, $^{96}_{40}$Zr + $^{96}_{40}$Zr) obtained through a blind analysis. The ratio of results in Ru+Ru to Zr+Zr collisions for the CME-sensitive charge-dependent azimuthal correlator (Δ⁢𝛾), normalized by elliptic anisotropy (𝑣2), was observed to be close to but systematically larger than the inverse multiplicity ratio. The background baseline for the isobar ratio, 𝑌= (Δ⁢𝛾/𝑣2) Ru /(Δ⁢𝛾/𝑣2) Zr , is naively expected to be (1/𝑁) Ru /(1/𝑁) Zr ; however, genuine two- and three-particle correlations are expected to alter it. We estimate the contributions to 𝑌 from those correlations, utilizing both the isobar data and hijing simulations. After including those contributions, we arrive at a final background baseline for 𝑌, which is consistent with the isobar data. Here, we extract an upper limit for the CME fraction in the Δ⁢𝛾 measurement of approximately 10% at a 95% confidence level on in isobar collisions at $\sqrt{S_{NN}}$=200 GeV, with an expected 15% difference in their squared magnetic fields.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Upper limit on the chiral magnetic effect in isobar collisions at the Relativistic Heavy-Ion Collider

The chiral magnetic effect (CME) is a phenomenon that arises from the QCD anomaly in the presence of an external magnetic field. The experimental search for its evidence has been one of the key goals of the physics program of the Relativistic Heavy-Ion Collider. The STAR Collaboration has previously presented the results of a blind analysis of isobar collisions ( Ru 44 96 + Ru 44 96 , Zr 40 96 + Zr 40 96 ) in the search for the CME. The isobar ratio ( Y ) of CME-sensitive observable, charge separation scaled by elliptic anisotropy, is close to but systematically larger than the inverse multiplicity ratio, the naive background baseline. This indicates the potential existence of a CME signal and the presence of remaining nonflow background due to two- and three-particle correlations, which are different between the isobars. In this postblind analysis, we estimate the contributions from those nonflow correlations as a background baseline to Y , utilizing the isobar data as well as Heavy Ion Jet Interaction Generator simulations. This baseline is found consistent with the isobar ratio measurement, and an upper limit of 10% at 95% confidence level is extracted for the CME fraction in the charge separation measurement in isobar collisions at s NN = 200 GeV. Published by the American Physical Society 2024

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS1991

On designing for quality

The problem of ensuring the required quality of products and/or technological processes often becomes more difficult due to the fact that there is not general theory of determining the optimal sets of value of the primary factors, i.e., of the output parameters of the parts and units comprising an object and ensuring the correspondence of the object's parameters to the quality requirements. This is the main reason for the amount of time taken to finish complex vital article. To create this theory, one has to overcome a number of difficulties and to solve the following tasks: the creation of reliable and stable mathematical models showing the influence of the primary factors on the output parameters; finding a new technique of assigning tolerances for primary factors with regard to economical, technological, and other criteria, the technique being based on the solution of the main problem; well reasoned assignment of nominal values for primary factors which serve as the basis for creating tolerances. Each of the above listed tasks is of independent importance. An attempt is made to give solutions for this problem. The above problem dealing with quality ensuring an mathematically formalized aspect is called the multiple inverse problem.

Vajingortin, L. D.↗
NASA NTRS1981

Remote sensing of temperature profiles in vegetation canopies using multiple view angles and inversion techniques

A mathematical method is presented which allows the determination of vertical temperature profiles of vegetation canopies from multiple sensor view angles and some knowledge of the vegetation geometric structure. The technique was evaluated with data from several wheat canopies at different stages of development, and shown to be most useful in the separation of vegetation and substrate temperatures with greater accuracy in the case of intermediate and dense vegetation canopies than in sparse ones. The converse is true for substrate temperatures. Root-mean-square prediction accuracies of temperatures for intermediate-density wheat canopies were 1.8 C and 1.4 C for an exact and an overdeterminate system, respectively. The findings have implication for remote sensing research in agriculture, geology or other earth resources disciplines.

Kimes, D. S.↗
NASA NTRS1972

Application of stepwise multiple regression techniques to inversion of Nimbus 'IRIS' observations.

Exploratory studies with Nimbus-3 infrared interferometer-spectrometer (IRIS) data indicate that, in addition to temperature, such meteorological parameters as geopotential heights of pressure surfaces, tropopause pressure, and tropopause temperature can be inferred from the observed spectra with the use of simple regression equations. The technique of screening the IRIS spectral data by means of stepwise regression to obtain the best radiation predictors of meteorological parameters is validated. The simplicity of application of the technique and the simplicity of the derived linear regression equations - which contain only a few terms - suggest usefulness for this approach. Based upon the results obtained, suggestions are made for further development and exploitation of the stepwise regression analysis technique.

Ohring, G.↗
NASA NTRS1979

On the multiplicity of solutions of the inverse problem for a vibrating beam

The paper considers a specific inverse problem for a vibrating beam with three nonsympathetic spectra. More specifically, the spectral data consist of the natural frequencies of vibration of the beam in the following three configurations: (1) clamped-clamped, (2) clamped-supported, and (3) clamped-free. The basic equations for an inhomogeneous discrete beam are derived, where this simple mechanical system provides valuable insight into the inverse problem. All the necessary ingredients for a consideration of the inverse problem are given. Attention is given to an analysis of the particular inverse problem for which the spectral data are associated with the natural frequencies of vibrations in the above configurations. It is shown that with such data, the inverse problem has a 2exp(N-1)-fold multiplicity of solutions.

Barcilon, V.↗
NASA NTRS1992

LAI inversion from optical reflectance using a neural network trained with a multiple scattering model

The inversion of the leaf area index (LAI) canopy parameter from optical spectral reflectance measurements is obtained using a backpropagation artificial neural network trained using input-output pairs generated by a multiple scattering reflectance model. The problem of LAI estimation over sparse canopies (LAI < 1.0) with varying soil reflectance backgrounds is particularly difficult. Standard multiple regression methods applied to canopies within a single homogeneous soil type yield good results but perform unacceptably when applied across soil boundaries, resulting in absolute percentage errors of >1000 percent for low LAI. Minimization methods applied to merit functions constructed from differences between measured reflectances and predicted reflectances using multiple-scattering models are unacceptably sensitive to a good initial guess for the desired parameter. In contrast, the neural network reported generally yields absolute percentage errors of <30 percent when weighting coefficients trained on one soil type were applied to predicted canopy reflectance at a different soil background.

Smith, James A.↗
NASA NTRS1992

Inversion of snow parameters from passive microwave remote sensing measurements by a neural network trained with a multiple scattering model

Simultaneous inversion of the three parameters was performed which included mean-grain size of ice particles in snow, snow density, and snow temperatures from five brightness temperatures. Good results for the inversion of parameters were obtained using the neural network based on the simulated data computed from the dense media radiative transfer equation that takes into account the effects of multiple scattering.

Tsang, Leung↗
DOE OSTI2024

Multiple magnetic interactions and large inverse magnetocaloric effect in TbSi and TbSi 0.6 Ge 0.4

We present a comprehensive investigation of the electronic structure, magnetization, specific heat, and crystallography of TbSi (FeB structure type) and TbSi 0.6 ⁢Ge 0.4 (CrB structure type) compounds. Both TbSi and TbSi 0.6 ⁢Ge 0.4 exhibit two antiferromagnetic (AFM) transitions at T N⁢1 ≈ 58 and 57 K, and T N⁢2 ≈ 36 and 44 K, respectively, along with an onset of weak metamagneticlike transition around 6 T between T N⁢1 and T N⁢2 . High-resolution specific heat (C P ) measurements show the second- and first-order nature of the magnetic transition at T N⁢1 and T N⁢2 , respectively, for both samples. However, in the case of TbSi, the low-temperature (LT) AFM to high-temperature (HT) AFM transition takes place via an additional AFM phase at the intermediate temperature (IT), where both LT to IT AFM and IT to HT AFM phase transitions exhibit a first-order nature. Both TbSi and TbSi 0.6 ⁢Ge 0.4 manifest significant magnetic entropy changes (Δ⁢S M ) of 9.6 and 11.6 J/kg-K, respectively, for Δ⁢μ 0 ⁢H=7 T, at T N⁢2 . The HT AFM phase of TbSi 0.6 ⁢Ge 0.4 is found to be more susceptible to the external magnetic field, causing a significant broadening in the peaks of Δ⁢S M curves at higher magnetic fields. Temperature- and field-dependent specific-heat data have been utilized to construct the complex HT phase diagram of these compounds. As a result, temperature-dependent x-ray diffraction measurements demonstrate substantial magnetostriction and anisotropic thermal expansion of the unit cell in both samples.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2026

Quantum Time-Space Tradeoffs for Matrix Problems

We consider the time and space required for quantum computers to solve a wide variety of problems involving matrices, many of which have only been analyzed classically in prior work. Our main results show that for a range of linear algebra problems—including matrix-vector product, matrix inversion, matrix multiplication and powering—existing classical time-space tradeoffs, several of which are tight for every space bound, also apply to quantum algorithms with at most a constant factor loss. For example, for almost all fixed matrices 𝐴, including the discrete Fourier transform matrix, we prove that quantum circuits with at most 𝑇 input queries and 𝑆 qubits of memory require 𝑇 = Ω⁢(𝑛 2 /𝑆) to compute matrix-vector product 𝐴⁢𝑥 for 𝑥 ∈{0,1 𝑛 . We similarly prove that matrix multiplication for 𝑛 ×𝑛 binary matrices requires 𝑇 = Ω⁢(𝑛 3 /$\sqrt{𝑆}$). Because many of our lower bounds are matched by deterministic algorithms with the same time and space complexity, our results show that quantum computers cannot provide any asymptotic advantage for these problems with any space bound. We obtain matching lower bounds for the stronger notion of quantum cumulative memory complexity—the sum of the space per layer of a circuit. We also consider Boolean (i.e., AND-OR) matrix multiplication and matrix-vector products, improving the previous quantum time-space tradeoff lower bounds for 𝑛 × 𝑛 Boolean matrix multiplication to 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/4 ) from 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/2 ). Our improved lower bound for Boolean matrix multiplication is based on a new coloring argument that extracts more from the strong direct product theorem that was the basis for prior work. To obtain our tight lower bounds for linear algebra problems, we require much stronger bounds than strong direct product theorems. We obtain these bounds by adding a new bucketing method to the quantum recording-query technique of Zhandry that lets us apply classical arguments to upper bound the success probability of quantum circuits.

lower bounds↗
NASA NTRS1983

Matrix differentiation formulas

A compact differentiation technique (without using indexes) is developed for scalar functions that depend on complex matrix arguments which are combined by operations of complex conjugation, transposition, addition, multiplication, matrix inversion and taking the direct product. The differentiation apparatus is developed in order to simplify the solution of extremum problems of scalar functions of matrix arguments.

Usikov, D. A.↗
NASA NTRS1986

Multiplier Architecture for Coding Circuits

Multipliers based on new algorithm for Galois-field (GF) arithmetic regular and expandable. Pipeline structures used for computing both multiplications and inverses. Designs suitable for implementation in very-large-scale integrated (VLSI) circuits. This general type of inverter and multiplier architecture especially useful in performing finite-field arithmetic of Reed-Solomon error-correcting codes and of some cryptographic algorithms.

Wang, C. C.↗
NASA NTRS1988

Control strategies

Techniques for improving the performance of robotic-manipulator path-control systems comprising independent SISO feedback controllers for each joint are discussed and illustrated with block diagrams, reviewing the results of recent analytical investigations. Topics examined include the servo design for a single link, the equations of motion for manipulators, SISO servo design for multiple links, inverse methods, pole placement with compensation of the gravity terms, linear state-feedback control based on the perturbation equations, and adaptive control methods. Consideration is given to variable-structure systems, suboptimal controllers, and the optimal-design-strategy approach.

Wang, J. C.↗