Search NASA⌕ Search

SEARCH · Search NASA

Results for “Algebraic singularity”

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 37 records · Page 2

Interface cracks in adhesively bounded lap-shear joints

A study on the elastic behavior of interface cracks in adhesively bonded lap-shear joints is presented. The problem is investigated by using a recently developed method of analysis based on conservation laws in elasticity for nonhomogeneous solids and fundamental relationships in fracture mechanics of dissimilar materials. The formulation leads to a pair of linear algebraic equations in mixed-mode stress intensity factors. Singular crack-tip stress intensity solutions are determined directly by information extracted from the far field. Stress intensity factors and associated energy release rates are obtained for various cases of interest. Fundamental nature of the interfacial flaw behavior in lap-shear adhesive joints is examined in detail.

Wang, S. S.↗

Optical systolic solutions of linear algebraic equations

The philosophy and data encoding possible in systolic array optical processor (SAOP) were reviewed. The multitude of linear algebraic operations achievable on this architecture is examined. These operations include such linear algebraic algorithms as: matrix-decomposition, direct and indirect solutions, implicit and explicit methods for partial differential equations, eigenvalue and eigenvector calculations, and singular value decomposition. This architecture can be utilized to realize general techniques for solving matrix linear and nonlinear algebraic equations, least mean square error solutions, FIR filters, and nested-loop algorithms for control engineering applications. The data flow and pipelining of operations, design of parallel algorithms and flexible architectures, application of these architectures to computationally intensive physical problems, error source modeling of optical processors, and matching of the computational needs of practical engineering problems to the capabilities of optical processors are emphasized.

Neuman, C. P.↗

SODAs: sparse optimization for the discovery of differential and algebraic equations

Differential-algebraic equations (DAEs) integrate ordinary differential equations (ODEs) with algebraic constraints, providing a fundamental framework for developing models of dynamical systems characterized by time-scale separation, conservation laws and physical constraints. While sparse optimization has revolutionized model development by allowing data-driven discovery of parsimonious models from a library of possible equations, existing approaches for dynamical systems assume DAEs can be reduced to ODEs by eliminating variables before model discovery. This assumption limits the applicability of such methods for DAE systems with unknown constraints and time scales. We introduce sparse optimization for differential-algebraic systems (SODAs), a data-driven method for the identification of DAEs in their explicit form. By discovering the algebraic and dynamic components sequentially without prior identification of the algebraic variables, this approach leads to a sequence of convex optimization problems. It has the advantage of discovering interpretable models that preserve the structure of the underlying physical system. To this end, SODAs improves since SODAs is singular numerical stability when handling high correlations between library terms, caused by near-perfect algebraic relationships, by iteratively refining the conditioning of the candidate library. We demonstrate the performance of our method on biological, mechanical and electrical systems, showcasing its robustness to noise in both simulated time series and real-time experimental data.

DAE↗

Semiclassical Trans-Series from the Perturbative Hopf-Algebraic Dyson-Schwinger Equations: $\phi$ 3 QFT in 6 Dimensions

We analyze the asymptotically free massless scalar $\phi$ 3 quantum field theory in 6 dimensions, using resurgent asymptotic analysis to find the trans-series solutions which yield the non-perturbative completion of the divergent perturbative solutions to the Kreimer–Connes Hopf-algebraic Dyson–Schwinger equations for the anomalous dimension. This scalar conformal field theory is asymptotically free and has a real Lipatov instanton. In the Hopf-algebraic approach we find a trans-series having an intricate Borel singularity structure, with three distinct but resonant non-perturbative terms, each repeated in an infinite series. These expansions are in terms of the renormalized coupling. The resonant structure leads to powers of logarithmic terms at higher levels of the trans-series, analogous to logarithmic terms arising from interactions between instantons and anti-instantons, but arising from a purely perturbative formalism rather than from a semi-classical analysis.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Image restoration consequences of the lack of a two variable fundamental theorem of algebra

It has been shown that, at least for one pair of otherwise attractive spaces of images and operators, singular convolution operators do not necessarily have nonsingular neighbors. This result is a nuisance in image restoration. It is suggested that this difficulty might be overcome if the following three conditions are satisfied: (1) a weaker constraint than absolute summability can be identified for useful operators: (2) if the z-transform of an operator has at most a finite number of zeros on the unit torus, then the inverse z-transform formula yields an inverse operator meeting the weaker constraint: and (3) operators whose z-transforms are zero in a set of real, closed curves on the unit torus have neighbors which are zero in only a finite set of points on the unit torus.

Kreznar, J. E.↗

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

Three-dimensional algebraic grid generation

One of the major approaches to numerical grid generation is the explicit algebraic expression of a physical grid as a function of a uniform grid in a rectangular computational coordinate system. The algebraic methods are based on mathematical interpolation, and the primary advantages are speed and directness. The relation between interpolation and grid generation is described. For three-dimensional grid generation, transfinite interpolation using the coordinate control processes developed in the multisurface method and two-boundary technique are advocated. Grid singularities encountered in three dimensions are discussed, and the exploration of multiple overlapping grids is proposed. Some aspects of interactive algebraic grid computation in three dimensions are discussed.

Smith, R. E.↗

Semantic embedding for quantum algorithms

The study of classical algorithms is supported by an immense understructure, founded in logic, type, and category theory, that allows an algorithmist to reason about the sequential manipulation of data irrespective of a computation’s realizing dynamics. As quantum computing matures, a similar need has developed for an assurance of the correctness of high-level quantum algorithmic reasoning. Parallel to this need, many quantum algorithms have been unified and improved using quantum signal processing (QSP) and quantum singular value transformation (QSVT), which characterize the ability, by alternating circuit ansätze, to transform the singular values of sub-blocks of unitary matrices by polynomial functions. However, while the algebraic manipulation of polynomials is simple (e.g., compositions and products), the QSP/QSVT circuits realizing analogous manipulations of their embedded polynomials are non-obvious. This work constructs and characterizes the runtime and expressivity of QSP/QSVT protocols where circuit manipulation maps naturally to the algebraic manipulation of functional transforms (termed semantic embedding). In this way, QSP/QSVT can be treated and combined modularly, purely in terms of the functional transforms they embed, with key guarantees on the computability and modularity of the realizing circuits. We also identify existing quantum algorithms whose use of semantic embedding is implicit, spanning from distributed search to proofs of soundness in quantum cryptography. The methods used, based in category theory, establish a theory of semantically embeddable quantum algorithms, and provide a new role for QSP/QSVT in reducing sophisticated algorithmic problems to simpler algebraic ones.

Physics↗

Dynamic mode decomposition with core sketch

With the increase in collected data volumes, either from experimental measurements or high fidelity simulations, there is an ever-growing need to develop computationally efficient tools to process, analyze, and interpret these datasets. Modal analysis techniques have gained great interest due to their ability to identify patterns in the data and extract valuable information about the system being considered. Dynamic mode decomposition (DMD) relies on elements of the Koopman approximation theory to compute a set of modes, each associated with a fixed oscillation frequency and a decay/growth rate. Extracting these details from large datasets can be computationally expensive due to the need to implement singular value decomposition of the input data matrix. Sketching algorithms have become popular in numerical linear algebra where statistical theoretic approaches are utilized to reduce the cost of major operations. A sketch of a matrix is another matrix, which is significantly smaller, but still sufficiently approximates the original system. We put forth an efficient DMD framework, SketchyDMD, based on a core sketching algorithm that captures information about the range and corange (their mutual relationship) of input data. The proposed sketching-based framework can accelerate various portions of the DMD routines, compared to classical methods that operate directly on the raw input data. We conduct numerical experiments using the spherical shallow water equations as a prototypical model in the context of geophysical flows. In conclusion, we show that the proposed SketchyDMD is superior to existing randomized DMD methods that are based on capturing only the range of the input data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Control of nonlinear systems with applications to constrained robots and spacecraft attitude stabilization

This thesis is organized in two parts. In Part 1, control systems described by a class of nonlinear differential and algebraic equations are introduced. A procedure for local stabilization based on a local state realization is developed. An alternative approach to local stabilization is developed based on a classical linearization of the nonlinear differential-algebraic equations. A theoretical framework is established for solving a tracking problem associated with the differential-algebraic system. First, a simple procedure is developed for the design of a feedback control law which ensures, at least locally, that the tracking error in the closed loop system lies within any given bound if the reference inputs are sufficiently slowly varying. Next, by imposing additional assumptions, a procedure is developed for the design of a feedback control law which ensures that the tracking error in the closed loop system approaches zero exponentially for reference inputs which are not necessarily slowly varying. The control design methodologies are used for simultaneous force and position control in constrained robot systems. The differential-algebraic equations are shown to characterize the slow dynamics of a certain nonlinear control system in nonstandard singularly perturbed form. In Part 2, the attitude stabilization (reorientation) of a rigid spacecraft using only two control torques is considered. First, the case of momentum wheel actuators is considered. The complete spacecraft dynamics are not controllable. However, the spacecraft dynamics are small time locally controllable in a reduced sense. The reduced spacecraft dynamics cannot be asymptotically stabilized using continuous feedback, but a discontinuous feedback control strategy is constructed. Next, the case of gas jet actuators is considered. If the uncontrolled principal axis is not an axis of symmetry, the complete spacecraft dynamics are small time locally controllable. However, the spacecraft attitude cannot be asymptotically stabilized using continuous feedback, but a discontinuous stabilizing feedback control strategy is constructed. If the uncontrolled principal axis is an axis of symmetry, the complete spacecraft dynamics cannot be stabilized. However, the spacecraft dynamics are small time locally controllable in a reduced sense. The reduced spacecraft dynamics cannot be asymptotically stabilized using continuous feedback, but again a discontinuous feedback control strategy is constructed.

Krishnan, Hariharan↗

A Method to Solve Interior and Exterior Camera Calibration Parameters for Image Resection

An iterative method is presented to solve the internal and external camera calibration parameters, given model target points and their images from one or more camera locations. The direct linear transform formulation was used to obtain a guess for the iterative method, and herein lies one of the strengths of the present method. In all test cases, the method converged to the correct solution. In general, an overdetermined system of nonlinear equations is solved in the least-squares sense. The iterative method presented is based on Newton-Raphson for solving systems of nonlinear algebraic equations. The Jacobian is analytically derived and the pseudo-inverse of the Jacobian is obtained by singular value decomposition.

Samtaney, Ravi↗

Conditioning of the Stable, Discrete-time Lyapunov Operator

The Schatten p-norm condition of the discrete-time Lyapunov operator L(sub A) defined on matrices P is identical with R(sup n X n) by L(sub A) P is identical with P - APA(sup T) is studied for stable matrices A is a member of R(sup n X n). Bounds are obtained for the norm of L(sub A) and its inverse that depend on the spectrum, singular values and radius of stability of A. Since the solution P of the the discrete-time algebraic Lyapunov equation (DALE) L(sub A)P = Q can be ill-conditioned only when either L(sub A) or Q is ill-conditioned, these bounds are useful in determining whether P admits a low-rank approximation, which is important in the numerical solution of the DALE for large n.

Tippett, Michael K.↗

Two bonded half planes with a crack going through the interface

The plane problem of two bonded elastic half planes containing a finite crack perpendicular to and going through the interface is considered. The problem is formulated as a system of singular integral equations with generalized Cauchy kernels. Even though the system has three irregular points, it is shown that the unknown functions are algebraically related at the irregular point on the interface and the integral equations can be solved by a method developed previously. The system of integral equations is shown to yield the same characteristic equation as that for two bonded quarter planes in the general case of the through crack, and the characteristic equation for a crack tip terminating at the interface in the special case. The numerical results given in the paper include the stress intensity factors at the crack tips, the normal and shear components of the stress intensity factors at the singular point on the interface, and the crack surface displacements.

Erdogan, F.↗

Numerical solutions of the triple-deck equations for laminar trailing-edge stall

The problem of determining the effect of laminar boundary layers on the lift of thin wings in subsonic flow at high Reynolds numbers is considered. The boundary value problem is formulated in the framework of the triple-deck theory of Brown and Stewartson. The resulting fourth-order boundary value was solved by an iterative finite-difference technique. An inverse iteration procedure provides proper treatment of the trailing-edge singularity, and asymptotic far-field expansions and coordinate stretchings are used to deal with the problem of the slow algebraic decay of the solution.

Chow, R.↗

Efficient and Singularity-Aware Inverse Kinematics for 6-DOF and 7-DOF Revolute Manipulators

Inverse kinematics (IK) for 6-DOF and 7-DOF revolute robot manipulators may be decomposed into canonical subproblems which find the angles on circles where they intersect with other geometric objects. We present new algebraic solutions and geometric interpretations for six subproblems. We demonstrate significant performance improvements over existing IK methods. 7-DOF manipulators have one redundant DOF to parameterize, so we introduce the general SEW angle, which generalizes the conventional SEW angle but with an arbitrary reference direction function. One special choice, the stereographic SEW angle, has a singularity when the wrist is on a half-line instead of a full line.

Computational Geometry↗

Fast truncated SVD of sparse and dense matrices on graphics processors

We investigate the solution of low-rank matrix approximation problems using the truncated singular value decomposition (SVD). For this purpose, we develop and optimize graphics processing unit (GPU) implementations for the randomized SVD and a blocked variant of the Lanczos approach. Our work takes advantage of the fact that the two methods are composed of very similar linear algebra building blocks, which can be assembled using numerical kernels from existing high-performance linear algebra libraries. Furthermore, the experiments with several sparse matrices arising in representative real-world applications and synthetic dense test matrices reveal a performance advantage of the block Lanczos algorithm when targeting the same approximation accuracy.

Computer Science↗

Modifications of the law of the wall and algebraic turbulence modelling for separated boundary layers

Various modifications of the conventional algebraic eddy viscosity turbulence model are investigated for application to separated flows. Friction velocity is defined in a way that avoids singular behavior at separation and reattachment but reverts to the conventional definition for flows with small pressure gradients. This leads to a modified law of the wall for separated flows. The effect on the calculated flow field of changes in the model that affect the eddy viscosity at various distances from the wall are determined by (1) switching from Prandtl's form to an inner layer formula due to Clauser at various distances from the wall, (2) varying the constant in the Van Driest damping factor, (3) using Clauser's inner layer formula all the way to the wall, and (4) applying a relaxation procedure in the evaluation of the constant in Clauser's inner layer formula. Numerical solutions of the compressible Navier-Stokes equations are used to determine the effects of the modifications. Experimental results from shock-induced separated flows at Mach numbers 2.93 and 8.45 are used for comparison. For these cases improved predictions of wall pressure distribution and positions of separation and reattachment are obtained from the relaxation version of the Clauser inner layer eddy viscosity formula.

Baldwin, B. S.↗

On obtaining the forward phase functions of Saturn ring features from radio occultation observations

It is noted that the near-forward scattering functions of particles in Saturn ring features are related to 3.6 cm radio occultation power spectra by a Fredholm integral equation of the first kind. The equation reduces to an algebraic system of equation whose solution by usual inversion techniques (that is, least mean squares) is ruled out by the near singularity of the forward transformation matrix. A combination of constrained linear inversion and a filtering algorithm based on eigenvector decomposition of the matrix reduces the instabilities; this yields derived phase functions valid over the range of zero to about 12 mrad. It is noted that these functions represent the collective forward diffraction lobe of particles greater than about 1 m in radius. Since multiple scattering of the signal is a significant effect, the measured phase functions must be adjusted to obtain the singly scattered component. This single-scattering correction is examined for two physical models, namely the monolayer and the classical discrete random slab; in addition, the fraction of opacity in submeter particles for each model for particular ring features is estimated.

Zebker, H. A.↗