SEARCH · Engineering Papers
Results for “linear system”
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.
Solving Large Sparse Linear Systems in End-to-end Accelerator Structure Simulations
Explore the source record for details and available documents.
A Hierarchical Low-Rank Solver for Large Sparse Linear Systems.
Abstract not provided.
A Hierarchical Low-Rank Solver for Sparse Linear Systems and Its Variations.
Abstract not provided.
Hierarchical Low-rank Preconditioners and Solvers for Linear Systems from PDEs.
Abstract not provided.
New Results in the Design of Switched Feedback Controllers for Linear Systems.
Abstract not provided.
On Parallel Solution of Sparse Triangular Linear Systems in CUDA
Explore the source record for details and available documents.
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.
Linear optical response of finite systems using multishift linear system solvers
We discuss the application of multishift linear system solvers to linear-response time-dependent density functional theory. Using this technique the complete frequency-dependent electronic density response of finite systems to an external perturbation can be calculated at the cost of a single solution of a linear system via conjugate gradients. We show that multishift time-dependent density functional theory yields excitation energies and oscillator strengths in perfect agreement with the standard diagonalization of the response matrix (Casida's method), while being computationally advantageous. We present test calculations for benzene, porphin, and chlorophyll molecules. We argue that multishift solvers may find broad applicability in the context of excited-state calculations within density-functional theory and beyond.
Singular linear-quadratic control problem for systems with linear delay
A singular linear-quadratic optimization problem on the trajectories of non-autonomous linear differential equations with linear delay is considered. The peculiarity of this problem is the fact that this problem has no solution in the class of integrable controls. To ensure the existence of solutions is required to expand the class of controls including controls with impulse components. Dynamical systems with linear delay are used to describe the motion of pantograph from the current collector with electric traction, biology, etc. It should be noted that for practical problems fact singularity criterion of quality is quite commonly occurring, and therefore the study of these problems is surely important. For the problem under discussion optimal programming control contained impulse components at the initial and final moments of time is constructed under certain assumptions on the functional and the right side of the control system.
Hydrodynamic description of an unmagnetized plasma with multiple ion species. I. General formulation
A generalization of the Braginskii ion fluid description [S. I. Braginskii, Sov. Phys. JETP 6, 358 (1958)] to the case of an unmagnetized collisional plasma with multiple ion species is presented. An asymptotic expansion in the ion Knudsen number is used to derive the individual ion species continuity, as well as the total ion mass density, momentum, and energy evolution equations accurate through the second order. Expressions for the individual ion species drift velocities with respect to the center of mass reference frame, as well as for the total ion heat flux and viscosity, which are required to close the fluid equations, are evaluated in terms of the first-order corrections to the lowest order Maxwellian ion velocity distribution functions. A variational formulation for evaluating such corrections and its relation to the plasma entropy are presented. Employing trial functions for the corrections, written in terms of expansions in generalized Laguerre polynomials, and maximizing the resulting functionals produces two systems of linear equations (for “vector” and “tensor” portions of the corrections) for the expansion coefficients. A general matrix formulation of the linear systems as well as expressions for the resulting transport fluxes are presented in forms convenient for numerical implementation. The general formulation is employed in the companion paper [A. N. Simakov and K. Molvig, Hydrodynamic description of an unmagnetized plasma with multiple ion species. II. Two and three ion species plasmas, submitted to Phys. Plasmas (2015)] to evaluate the individual ion drift velocities and the total ion heat flux and viscosity for specific cases of two and three ion species plasmas.
A necessary and sufficient condition for the stability of linear Hamiltonian systems with periodic coefficients
Linear Hamiltonian systems with time-dependent coefficients are of importance to nonlinear Hamiltonian systems, accelerator physics, plasma physics, and quantum physics. It is shown here that the solution map of a linear Hamiltonian system with time-dependent coefficients can be parameterized by an envelope matrix w(t), which has a clear physical meaning and satisfies a nonlinear envelope matrix equation. It is proved that a linear Hamiltonian system with periodic coefficients is stable if and only if the envelope matrix equation admits a solution with periodic w † w and a suitable initial condition. The mathematical devices utilized in this theoretical development with significant physical implications are time-dependent canonical transformations, normal forms for stable symplectic matrices, and horizontal polar decomposition of symplectic matrices. These tools systematically decompose the dynamics of linear Hamiltonian systems with time-dependent coefficients and are expected to be effective in other studies as well, such as those on quantum algorithms for classical Hamiltonian systems.
Dual linear delta assemblies, linear delta systems, and related methods
A dual linear delta assembly includes a frame, a first linear delta system, and a second linear delta system concentric with the first linear delta system. Each of the first linear delta system and the second linear delta system may include rails mounted to the frame, linear actuators, each linear actuator coupled to a respective rail of the rails and configured to translate along a longitudinal length of the respective rail, pairs of parallel rods each operably coupled to a respective linear actuator of the linear actuators, and a platform coupled to a longitudinal end of each of the pairs of parallel rods opposite the respective linear actuator of the linear actuators.
Envelope Hamiltonian for charged-particle dynamics in general linear coupled systems
Not Available
Oscillation, Rotation, and Wandering of Solutions to Linear Differential Systems
For solutions of a linear system on the semi-axis, we introduce a series of Lyapunov exponents that describe the oscillation, rotation, and wandering properties of these solutions. In the case of systems with constant matrices, these exponents are closely related to the imaginary parts of the eigenvalues. We examine the problem on the existence of a similar relationship in the case of piecewise constant of arbitrary systems.
Final Report - Summer Visit 2010
During my visit to LLNL during the summer of 2010, I worked on algebraic multilevel solvers for large sparse systems of linear equations arising from discretizations of partial differential equations. The particular solver of interest is based on ILU decomposition. The setup phase for this AMG solve is just the single ILU decomposition, and its corresponding error matrix. Because the ILU uses a minimum degree or similar sparse matrix ordering, most of the fill-in, and hence most of the error, is concentrated in the lower right corner of the factored matrix. All of the major multigrid components - the smoother, the coarse level correction matrices, and the fine-to-coarse and coarse-to-fine rectangular transfer matrices, are defined in terms of various blocks of the ILU factorization. Although such a strategy is not likely to be optimal in terms of convergence properties, it has a relatively low setup cost, and therefore is useful in situations where setup costs for more traditional AMG approaches cannot be amortized over the solution of many linear systems using the same matrix. Such a situation arises in adaptive methods, where often just one linear system is solved at each step of an adaptive feedback loop, or in solving nonlinear equations by approximate Newton methods, where the approximate Jacobian might change substantially from iteration to iteration. In general terms, coarse levels are defined in terms of successively smaller lower right blocks of the matrix, typically decreasing geometrically in order. The most difficult issue was the coarse grid correction matrix. The preconditioner/smoother for a given level is just the corresponding lower right blocks of the ILU factorization. The coarse level matrix itself is just the Schur complement; this matrix is not known exactly using just the ILU decomposition in the setup phase. Thus we approximate this matrix using various combinations of the preconditioning matrix and the error matrix. During my visit, several approximations of this type were implemented and tested. While some improved the convergence rate of the overall method, these gains had to be balanced against the additional costs involved in creating and applying these matrices. By this more stringent criterion, none of the improved approximations could be characterized as an unqualified success.
Random circuit block-encoded matrix and a proposal of quantum LINPACK benchmark
The LINPACK benchmark reports the performance of a computer for solving a system of linear equations with dense random matrices. Although this task was not designed with a real application directly in mind, the LINPACK benchmark has been used to define the list of TOP500 supercomputers since the debut of the list in 1993. We propose that a similar benchmark, called the quantum LINPACK benchmark, could be used to measure the whole machine performance of quantum computers. The success of the quantum LINPACK benchmark should be viewed as the minimal requirement for a quantum computer to perform a useful task of solving linear algebra problems, such as linear systems of equations. We propose an input model called the Random Circuit Block-Encoded Matrix (RACBEM), which is a proper generalization of a dense random matrix in the quantum setting. The RACBEM model is efficient to be implemented on a quantum computer and can be designed to optimally adapt to any given quantum architecture, with relying on a black-box quantum compiler. Besides solving linear systems, the RACBEM model can be used to perform a variety of linear algebra tasks relevant to many physical applications, such as computing spectral measures, time series generated by a Hamiltonian simulation, and thermal averages of the energy. We implement these linear algebra operations on IBM Q quantum devices as well as quantum virtual machines, and demonstrate their performance in solving scientific computing problems.