Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algebraic models”

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 1,369 records · Page 76

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.↗

Microwave Imaging on Metal Objects

This final report for the project discusses the attempts to model, using different methods, microwave image reconstruction. Maximum Entropy Method was not successful. Attempts to use Singular Value Decomposition (SVD) got some good results after initial failure. SVD is based upon a theory of linear algebra, to the effect that any M X N Matrix A whose number of rows M is greater than or equal to its number of columns, N can be written as the product of an M X N column-orthogonal matrix U, an N X N diagonal Matrix, W, with m positive or zero elements (the singular values) and the transposition of an N X N orthogonal matrix V. In microwave imaging, the scattered fields can be expressed by the induced current distribution. The SVD method required more contiguous computer memory than was available. Work was also done on the Conjugate Gradient Method (CGM), which didn't work well when tried earlier. It was found that separation of the imaginary part and the real part during calculation may work. This work was considered incomplete as of the end of the grant period.

Tolliver, C. L.↗

Quadratic pseudospectrum for identifying localized states

Here we examine the utility of the quadratic pseudospectrum for understanding and detecting states that are somewhat localized in position and energy, in particular, in the context of condensed matter physics. Specifically, the quadratic pseudospectrum represents a method for approaching systems with incompatible observables {A j |1 ≤ j ≤ d} as it minimizes collectively the errors $\parallel$A j v - λ j v$\parallel$ while defining a joint approximate spectrum of incompatible observables. Moreover, we derive an important estimate relating the Clifford and quadratic pseudospectra. Finally, we prove that the quadratic pseudospectrum is local and derive the bounds on the errors that are incurred by truncating the system in the vicinity of where the pseudospectrum is being calculated.

97 MATHEMATICS AND COMPUTING↗

Gapless spin liquid and pair density wave of the Hubbard model on three-leg triangular cylinders

We study the ground state properties of the Hubbard model on three-leg triangular cylinders using large-scale density-matrix renormalization group simulations. At half-filling, we identify an intermediate gapless spin liquid phase, which has one gapless spin mode and algebraic spin–spin correlations but exponential decay scalar chiral–chiral correlations, between a metallic phase at weak coupling and Mott insulating dimer phase at strong interaction. Upon light doping the gapless spin liquid, the system exhibits power-law charge-density-wave (CDW) correlations but short-range single-particle, spin–spin, and chiral–chiral correlations. Similar to CDW correlations, the superconducting correlations also decay in power-law but oscillate in sign as a function of distance, which is consistent with the striped pair-density wave. When further doping the gapless spin liquid phase or doping the dimer order phase, another phase takes over, which has similar CDW correlations but all other correlations decay exponentially.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

hypredrive: high-level interface for solving linear systems with hypre

This software introduces a high-level interface designed to simplify solving linear systems using hypre, a renowned library for such computational challenges. It is crafted to be accessible and user-friendly, making the powerful capabilities of hypre available to a broader audience without requiring in-depth technical knowledge. The interface is characterized by its use of YAML for input, a format celebrated for its structured yet straightforward readability. This choice ensures that users can easily configure the software to meet their specific needs. Additionally, the software boasts an intuitive API that encapsulates hypre's functionalities, making it easier for users to interact with the process of solving linear systems. It is particularly beneficial for prototyping, offering a quick and efficient means to test various solver and preconditioner configurations. Furthermore, the software allows for the creation of an offline testing framework in which predefined linear systems are read from files and benchmarked with user-defined solution strategies. This makes it an invaluable tool for developers and researchers exploring and validating their computational models. Overall, the software serves as a bridge, bringing the advanced computational capabilities of hypre closer to users who may need more specialized technical expertise, thereby facilitating innovation and exploration in the field of numerical linear algebra.

Paludetto Magri, Victor↗

Parameter identification for nonlinear aerodynamic systems

Parameter identification for nonlinear aerodynamic systems is examined. It is presumed that the underlying model can be arranged into an input/output (I/O) differential operator equation of a generic form. The algorithm estimation is especially efficient since the equation error can be integrated exactly given any I/O pair to obtain an algebraic function of the parameters. The algorithm for parameter identification was extended to the order determination problem for linear differential system. The degeneracy in a least squares estimate caused by feedback was addressed. A method of frequency analysis for determining the transfer function G(j omega) from transient I/O data was formulated using complex valued Fourier based modulating functions in contrast with the trigonometric modulating functions for the parameter estimation problem. A simulation result of applying the algorithm is given under noise-free conditions for a system with a low pass transfer function.

Pearson, Allan E.↗

Order reduction of z-transfer functions via multipoint Jordan continued-fraction expansion

The order reduction problem of z-transfer functions is solved by using the multipoint Jordan continued-fraction expansion (MJCFE) technique. An efficient algorithm that does not require the use of complex algebra is presented for obtaining an MJCFE from a stable z-transfer function with expansion points selected from the unit circle and/or the positive real axis of the z-plane. The reduced-order models are exactly the multipoint Pade approximants of the original system and, therefore, they match the (weighted) time-moments of the impulse response and preserve the frequency responses of the system at some characteristic frequencies, such as gain crossover frequency, phase crossover frequency, bandwidth, etc.

Lee, Ying-Chin↗

Diurnal forcing of planetary atmospheres

A free convection parameterization has been introduced into the Mars Planetary Boundary Layer Model (MPBL). Previously, the model would fail to generate turbulence under conditions of zero wind shear, even when statically unstable. This in turn resulted in erroneous results at the equator, for example, when the lack of Coriolis forcing allowed zero wind conditions. The underlying cause of these failures was the level 2 second-order turbulence closure scheme which derived diffusivities as algebraic functions of the Richardson number (the ratio of static stability to wind shear). In the previous formulation, the diffusivities were scaled by the wind shear--a convenient parameter since it is non-negative. This was the drawback that all diffusivities are zero under conditions of zero shear (viz., the free convection case). The new scheme tests for the condition of zero shear in conjunction with static instability and recalculates the diffusivities using a static stability scaling. The results for a simulation of the equatorial boundary layer at autumnal equinox are presented. (Note that after some wind shear is generated, the model reverts to the traditional diffusivity calculation.)

Houben, Howard C.↗

Solving complex eigenvalue problems on a quantum annealer with applications to quantum scattering resonances

Quantum computing is a new and rapidly evolving paradigm for solving chemistry problems. In previous work, we developed the Quantum Annealer Eigensolver (QAE) and applied it to the calculation of the vibrational spectrum of a molecule on the D-Wave quantum annealer. However, the original QAE methodology was applicable to real symmetric matrices only. For many physics and chemistry problems, the diagonalization of complex matrices is required. For example, the calculation of quantum scattering resonances can be formulated as a complex eigenvalue problem where the real part of the eigenvalue is the resonance energy and the imaginary part is proportional to the resonance width. In the present work, we generalize the QAE to treat complex matrices: first complex Hermitian matrices and then complex symmetric matrices. These generalizations are then used to compute a quantum scattering resonance state in a 1D model potential for O + O collisions. These calculations are performed using both a software (classical) annealer and hardware annealer (the D-Wave 2000Q). The results of the complex QAE are also benchmarked against a standard linear algebra library (LAPACK). Furthermore, this work presents the first numerical solution of a complex eigenvalue problem of any kind on a quantum annealer, and it is the first treatment of a quantum scattering resonance on any quantum device.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Iterative optical vector-matrix processors (survey of selected achievable operations)

An iterative optical vector-matrix multiplier with a microprocessor-controlled feedback loop capable of performing a wealth of diverse operations was described. A survey and description of many of its operations demonstrates the versatility and flexibility of this class of optical processor and its use in diverse applications. General operations described include: linear difference and differential equations, linear algebraic equations, matrix equations, matrix inversion, nonlinear matrix equations, deconvolution and eigenvalue and eigenvector computations. Engineering applications being addressed for these different operations and for the IOP are: adaptive phased-array radar, time-dependent system modeling, deconvolution and optimal control.

Casasent, D.↗

Software design as a problem in learning theory (a research overview)

Our interest in automating software design has come out of our research in automated reasoning, inductive inference, learnability, and algebraic machine theory. We have investigated these areas extensively, in connection with specific problems of language representation, acquisition, processing, and design. In the case of formal context-free (CF) languages we established existence of finite learnable models ('behavioral realizations') and procedures for constructing them effectively. We also determined techniques for automatic construction of the models, inductively inferring them from finite examples of how they should 'behave'. These results were obtainable due to appropriate representation of domain knowledge, and constraints on the domain that the representation defined. It was when we sought to generalize our results, and adapt or apply them, that we began investigating the possibility of determining similar procedures for constructing correct software. Discussions with other researchers led us to examine testing and verification processes, as they are related to inference, and due to their considerable importance in correct software design. Motivating papers by other researchers, led us to examine these processes in some depth. Here we present our approach to those software design issues raised by other researchers, within our own theoretical context. We describe our results, relative to those of the other researchers, and conclude that they do not compare unfavorably.

Fass, Leona F.↗

A representation for the turbulent mass flux contribution to Reynolds-stress and two-equation closures for compressible turbulence

The turbulent mass flux, or equivalently the fluctuating Favre velocity mean, appears in the first and second moment equations of compressible kappa-epsilon and Reynolds stress closures. Mathematically it is the difference between the unweighted and density-weighted averages of the velocity field and is therefore a measure of the effects of compressibility through variations in density. It appears to be fundamental to an inhomogeneous compressible turbulence, in which it characterizes the effects of the mean density gradients, in the same way the anisotropy tensor characterizes the effects of the mean velocity gradients. An evolution equation for the turbulent mass flux is derived. A truncation of this equation produces an algebraic expression for the mass flux. The mass flux is found to be proportional to the mean density gradients with a tensor eddy-viscosity that depends on both the mean deformation and the Reynolds stresses. The model is tested in a wall bounded DNS at Mach 4.5 with notable results.

Ristorcelli, J. R.↗

There aren't Non-Standard Solutions for the Braid Group Representations of the QYBE Associated with 10-D Representations of SU(4)

It is well known that the quantum Yang-Baxter equations (QYBE) play an important role in various theoretical and mathematical physics, such as completely integrable system in (1 + 1)-dimensions, exactly solvable models in statistical mechanics, the quantum inverse scattering method and the conformal field theories in 2-dimensions. Recently, much remarkable progress has been made in constructing the solutions of the QYBE associated with the representations of lie algebras. It is shown that for some cases except the standard solutions, there also exist new solutions, but the others have not non-standard solutions. In this paper by employing the weight conservation and the diagrammatic techniques we show that the solution associated with the 10-D representations of SU (4) are standard alone.

Yijun, Huang↗

Large-scale inverse model analyses employing fast randomized data reduction: INVERSE MODELING WITH DATA REDUCTION

When the number of observations is large, it is computationally challenging to apply classical inverse modeling techniques. We have developed a new computationally efficient technique for solving inverse problems with a large number of observations (e.g., on the order of 10 7 or greater). Our method, which we call the randomized geostatistical approach (RGA), is built upon the principal component geostatistical approach (PCGA). We employ a data reduction technique combined with the PCGA to improve the computational efficiency and reduce the memory usage. Specifically, we employ a randomized numerical linear algebra technique based on a so-called “sketching” matrix to effectively reduce the dimension of the observations without losing the information content needed for the inverse analysis. In this way, the computational and memory costs for RGA scale with the information content rather than the size of the calibration data. Our algorithm is coded in Julia and implemented in the MADS open-source high-performance computational framework (http://mads.lanl.gov). We apply our new inverse modeling method to invert for a synthetic transmissivity field. Compared to a standard geostatistical approach (GA), our method is more efficient when the number of observations is large. Moreover, our method is capable of solving larger inverse problems than the standard GA and PCGA approaches. Thus, our new model inversion method is a powerful tool for solving large-scale inverse problems. The method can be applied in any field and is not limited to hydrogeological applications such as the characterization of aquifer heterogeneity.

54 ENVIRONMENTAL SCIENCES↗

A projection method for particle resampling

Particle discretizations of partial differential equations are advantageous for high-dimensional kinetic models in phase-space due to their better scalability than continuum approaches with respect to dimension. Complex processes collectively referred to as particle noise hamper long time simulations with particle methods. One approach to address this problem is particle mesh adaptivity, or remapping, known as particle resampling and remeshing. Here, this work introduces a resampling method that projects particles to and from a (finite element) function space. The method is simple, using standard sparse linear algebra and finite element techniques, and it preserves all moments up to the order of a polynomial represented exactly by the continuum function space. It is distinguished from most other mesh-based methods in that new particle positions and number are decoupled from the mesh, allowing particle and continuum meshes to be adapted relatively independently. While this work is developed with structured particle and continuum phase-space grids on 1X + 1V Vlasov-Poisson models of Landau damping and two-stream instability, the method is well-suited to unstructured grids. Stable long time dynamics are demonstrated up to time T = 500. Reproducibility artifacts and data are publicly available.

Kinetic methods↗

Topological Rigidity and Non-Abelian Defect Junctions in Chiral Nematic Systems with Effective Biaxial Symmetry

We study topologically stable defect structures in systems where the defect line classification in three dimensions and associated algebra of interactions (the fundamental group) are governed by the non-Abelian eight-element group, the quaternions 𝑄 8 . The non-Abelian character of the defect algebra leads to a topological rigidity of bound defect pairs, and trivalent junctions which are the building blocks of multijunction trivalent networks. We realize such structures in laboratory chiral nematics and analyze their behavior analytically, along with numerical modeling.

Liquid crystals↗

WE-G-207-02: Full Sequential Projection Onto Convex Sets (FS-POCS) for X-Ray CT Reconstruction

Purpose: To develop an iterative reconstruction method for X-ray CT, in which the reconstruction can quickly converge to the desired solution with much reduced projection views. Methods: The reconstruction is formulated as a convex feasibility problem, i.e. the solution is an intersection of three convex sets: 1) data fidelity (DF) set – the L2 norm of the difference of observed projections and those from the reconstructed image is no greater than an error bound; 2) non-negativity of image voxels (NN) set; and 3) piecewise constant (PC) set - the total variation (TV) of the reconstructed image is no greater than an upper bound. The solution can be found by applying projection onto convex sets (POCS) sequentially for these three convex sets. Specifically, the algebraic reconstruction technique and setting negative voxels as zero are used for projection onto the DF and NN sets, respectively, while the projection onto the PC set is achieved by solving a standard Rudin, Osher, and Fatemi (ROF) model. The proposed method is named as full sequential POCS (FS-POCS), which is tested using the Shepp-Logan phantom and the Catphan600 phantom and compared with two similar algorithms, TV-POCS and CP-TV. Results: Using the Shepp-Logan phantom, the root mean square error (RMSE) of reconstructed images changing along with the number of iterations is used as the convergence measurement. In general, FS- POCS converges faster than TV-POCS and CP-TV, especially with fewer projection views. FS-POCS can also achieve accurate reconstruction of cone-beam CT of the Catphan600 phantom using only 54 views, comparable to that of FDK using 364 views. Conclusion: We developed an efficient iterative reconstruction for sparse-view CT using full sequential POCS. The simulation and physical phantom data demonstrated the computational efficiency and effectiveness of FS-POCS.

60 APPLIED LIFE SCIENCES↗

Computing Relative Joint Positions of Robot Arms

Vector-algebra method developed for extracting Denavit-Hartenberg parameters for any assembled robot arm. Method for extracting relative joint geometry of robot arms useful to researchers who need data for existing robot arms for either validation of mathematical models or for studies involving actual control of these devices. Method, does not require robot arm to be disassembled, also useful in recalibration of misalined or bent robot arm and becomes useful industrial procedure. Merit of method is errors not propagated.

Barker, L. K.↗