Search NASA⌕ Search

SEARCH · Search NASA

Results for “linear equations”

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

Quantum algorithms for systems of linear equations inspired by adiabatic quantum computing

We present two quantum algorithms based on evolution randomization, a simple variant of adiabatic quantum computing, to prepare a quantum state |x⟩ that is proportional to the solution of the system of linear equations $A\overrightarrow{x} = \overrightarrow{b}$. The time complexities of our algorithms are O(κ 2 log(κ)/ε) and O(κ log(κ)/ε), where κ is the condition number of A and ε is the precision. Both algorithms are constructed using families of Hamiltonians that are linear combinations of products of A, the projector onto the initial state |b⟩, and single-qubit Pauli operators. The algorithms are conceptually simple and easy to implement. They are not obtained from equivalences between the gate model and adiabatic quantum computing. They do not use phase estimation or variable-time amplitude amplification, and do not require large ancillary systems. We discuss a gate-based implementation via Hamiltonian simulation and prove that our second algorithm is almost optimal in terms of κ. Like previous methods, our techniques yield an exponential quantum speed-up under some assumptions. Our results emphasize the role of Hamiltonian-based models of quantum computing for the discovery of important algorithms.

97 MATHEMATICS AND COMPUTING↗

On the equivalence of Gaussian elimination and Gauss-Jordan reduction in solving linear equations

A novel general approach to round-off error analysis using the error complexity concepts is described. This is applied to the analysis of the Gaussian Elimination and Gauss-Jordan scheme for solving linear equations. The results show that the two algorithms are equivalent in terms of our error complexity measures. Thus the inherently parallel Gauss-Jordan scheme can be implemented with confidence if parallel computers are available.

Tsao, Nai-Kuan↗

An interpretation and solution of ill-conditioned linear equations

Data insufficiency, poorly conditioned matrices and singularities in equations occur regularly in complex optimization, correlation, and interdisciplinary model studies. This work concerns itself with two methods of obtaining certain physically realistic solutions to ill-conditioned or singular algebraic systems of linear equations arising from such studies. Two efficient computational solution procedures that generally lead to locally unique solutions are presented when there is insufficient data to completely define the model, or a least-squares error formulation of this system results in an ill-conditioned system of equations. If it is assumed that a reasonable estimate of the uncertain data is available in both cases cited above, then we shall show how to obtain realistic solutions efficiently, in spite of the insufficiency of independent data. The proposed methods of solution are more efficient than singular-value decomposition for dealing with such systems, since they do not require solutions for all the non-zero eigenvalues of the coefficient matrix.

Ojalvo, I. U.↗

Parallel linear equation solvers for finite element computations

The overall objective of this research is to develop efficient methods for the solution of linear and nonlinear systems of equations on parallel and supercomputers, and to apply these methods to the solution of problems in structural analysis. Attention has been given so far only to linear equations. The methods considered for the solution of the stiffness equation Kx=f have been Choleski factorization and the conjugate gradient iteration with SSOR and Incomplete Choleski preconditioning. More detail on these methods will be given on subsequent slides. These methods have been used to solve for the static displacements for the mast and panel focus problems in conjunction with the CSM testbed system based on NICE/SPAR.

Ortega, James M.↗

Magnetic reconnection in 3D fusion devices: non-linear reduced equations and linear current-driven instabilities

Abstract Magnetic reconnection in 3D fusion devices is investigated. With the use of Boozer co-ordinates, we reduce the non-linear resistive magnetohydrodynamic equations in the limit of large aspect ratio and finite pressure fluctuations, to obtain a set of non-linear equations suitable for magnetic reconnection studies in stellarators. Magnetic flux unfreezing due to a finite electron mass is also considered. Equations that govern the linear regime and some of their general properties are given. We emphasise the role of magnetic geometry and identify how some aspects of stellarator optimisation could have an impact on reconnecting instabilities, in particular by exacerbating those enabled by electron inertia. The effect of 3D coupling on the linear reconnection rates and the mode structure is quantitatively addressed in the case in which the equilibrium rotational transform has one specific resonant location for which one mode can reconnect while coupled to an arbitrary number of non-resonant harmonics. The full problem is rigorously reduced to an equivalent cylindrical one, by introducing some geometrically modified plasma inertial and dissipative scales. The 3D scalings for the growth rates of reconnection instabilities and their destabilisation criteria are given.

Physics↗

Optimal trajectories based on linear equations

The Principal results of a recent theory of fuel optimal space trajectories for linear differential equations are presented. Both impulsive and bounded-thrust problems are treated. A new form of the Lawden Primer vector is found that is identical for both problems. For this reason, starting iteratives from the solution of the impulsive problem are highly effective in the solution of the two-point boundary-value problem associated with bounded thrust. These results were applied to the problem of fuel optimal maneuvers of a spacecraft near a satellite in circular orbit using the Clohessy-Wiltshire equations. For this case two-point boundary-value problems were solved using a microcomputer, and optimal trajectory shapes displayed. The results of this theory can also be applied if the satellite is in an arbitrary Keplerian orbit through the use of the Tschauner-Hempel equations. A new form of the solution of these equations has been found that is identical for elliptical, parabolic, and hyperbolic orbits except in the way that a certain integral is evaluated. For elliptical orbits this integral is evaluated through the use of the eccentric anomaly. An analogous evaluation is performed for hyperbolic orbits.

Carter, Thomas E.↗

Second order non-linear equations of motion for spinning highly flexible line elements

The second order nonlinear equations of motion are formulated for spinning line elements having little or no intrinsic structural stiffness. The derivation is based on the extended Hamilton's principle and includes the effect of initial geometric imperfections (axial, curvature, and twist) on the line element dynamics. For comparison with previous work, the nonlinear equations are reduced to a linearized form frequently found in the literature. The comparison revealed several new spin-stiffening terms that have not been previously identified and/or retained. They combine geometric imperfections, rotary inertia, Coriolis, and gyroscopic terms.

Salama, M.↗

Disformal invariance of continuous media with linear equation of state

We show that the effective theory describing single component continuous media with a linear and constant equation of state of the form p = w ρ is invariant under a 1-parameter family of continuous disformal transformations. In the special case of w =1/3 (ultrarelativistic gas), such a family reduces to conformal transformations. As examples, perfect fluids, irrotational dust (mimetic matter) and homogeneous and isotropic solids are discussed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Efficient numerical methods to solve sparse linear equations with application to PageRank

Over the last two decades, the PageRank problem has received increased interest from the academic community as an efficient tool to estimate web-page importance in information retrieval. Despite numerous developments, the design of efficient optimization algorithms for the PageRank problem is still a challenge. Here, we propose three new algorithms with a linear time complexity for solving the problem over a bounded-degree graph. The idea behind them is to set up the PageRank as a convex minimization problem over a unit simplex, and then solve it using iterative methods with small iteration complexity. Our theoretical results are supported by an extensive empirical justification using real-world and simulated data.

97 MATHEMATICS AND COMPUTING↗

An analytical method as a preconditioning modeling for systems of linear equations

In this paper, we propose a simple and practical preconditioner based on the homotopy analysis method. Furthermore, using this modeling, we design an efficient algorithm to solve linear systems. Within the computational framework, convection–diffusion equation candidates are investigated and evaluated. Finally, computational comparisons of the standard methods against preconditioned methods based on experiments are presented which illustrate the merits of the simplicity, power, and effectiveness of the proposed algorithm.

97 MATHEMATICS AND COMPUTING↗

Identification of linearized equations of motion for the fixed wing configuration of the rotor systems research aircraft

The purpose of this report is to establish linear, decoupled models of rigid body motion for the fixed wing configuration of the Rotor Systems Research Aircraft (RSRA). Longitudinal and lateral control surface fixed linear models were created from aircraft time histories using current system identification techniques. Models were obtained from computer simulation at 160 KCAS and 200 KCAS, and from flight data at 160 KCAS. Comparisons were performed to examine modeling accuracy, variation of dynamics with airspeed and correlation of simulation and flight data results. The results showed that the longitudinal and lateral linear models accurately predicted RSRA dynamics. The flight data results showed that no significant handling qualities problems were present in the RSRA fixed wing aircraft at the flight speed tested.

Balough, D. L.↗

Preliminary results in implementing a model of the world economy on the CYBER 205: A case of large sparse nonsymmetric linear equations

A brief description of the Model of the World Economy implemented at the Institute for Economic Analysis is presented, together with our experience in converting the software to vector code. For each time period, the model is reduced to a linear system of over 2000 variables. The matrix of coefficients has a bordered block diagonal structure, and we show how some of the matrix operations can be carried out on all diagonal blocks at once.

Szyld, D. B.↗

Chaotic dynamics and diffusion in a piecewise linear equation

Genetic interactions are often modeled by logical networks in which time is discrete and all gene activity states update simultaneously. However, there is no synchronizing clock in organisms. An alternative model assumes that the logical network is preserved and plays a key role in driving the dynamics in piecewise nonlinear differential equations. We examine dynamics in a particular 4-dimensional equation of this class. In the equation, two of the variables form a negative feedback loop that drives a second negative feedback loop. By modifying the original equations by eliminating exponential decay, we generate a modified system that is amenable to detailed analysis. In the modified system, we can determine in detail the Poincaré (return) map on a cross section to the flow. By analyzing the eigenvalues of the map for the different trajectories, we are able to show that except for a set of measure 0, the flow must necessarily have an eigenvalue greater than 1 and hence there is sensitive dependence on initial conditions. Further, there is an irregular oscillation whose amplitude is described by a diffusive process that is well-modeled by the Irwin-Hall distribution. There is a large class of other piecewise-linear networks that might be analyzed using similar methods. The analysis gives insight into possible origins of chaotic dynamics in periodically forced dynamical systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Polynomial approximation of functions of matrices and its application to the solution of a general system of linear equations

During the process of solving a mathematical model numerically, there is often a need to operate on a vector v by an operator which can be expressed as f(A) while A is NxN matrix (ex: exp(A), sin(A), A sup -1). Except for very simple matrices, it is impractical to construct the matrix f(A) explicitly. Usually an approximation to it is used. In the present research, an algorithm is developed which uses a polynomial approximation to f(A). It is reduced to a problem of approximating f(z) by a polynomial in z while z belongs to the domain D in the complex plane which includes all the eigenvalues of A. This problem of approximation is approached by interpolating the function f(z) in a certain set of points which is known to have some maximal properties. The approximation thus achieved is almost best. Implementing the algorithm to some practical problem is described. Since a solution to a linear system Ax = b is x= A sup -1 b, an iterative solution to it can be regarded as a polynomial approximation to f(A) = A sup -1. Implementing the algorithm in this case is also described.

Tal-Ezer, Hillel↗

Program for the solution of multipoint boundary value problems of quasilinear differential equations

Linear equations are solved by a method of superposition of solutions of a sequence of initial value problems. For nonlinear equations and/or boundary conditions, the solution is iterative and in each iteration a problem like the linear case is solved. A simple Taylor series expansion is used for the linearization of both nonlinear equations and nonlinear boundary conditions. The perturbation method of solution is used in preference to quasilinearization because of programming ease, and smaller storage requirements; and experiments indicate that the desired convergence properties exist although no proof or convergence is given.

Source record↗