Search NASA⌕ Search

SEARCH · Search NASA

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.

At least 73 records · Page 4

Parallel/distributed direct method for solving linear systems

A new family of parallel schemes for directly solving linear systems is presented and analyzed. It is shown that these schemes exhibit a near optimal performance and enjoy several important features: (1) For large enough linear systems, the design of the appropriate paralleled algorithm is insensitive to the number of processors as its performance grows monotonically with them; (2) It is especially good for large matrices, with dimensions large relative to the number of processors in the system; (3) It can be used in both distributed parallel computing environments and tightly coupled parallel computing systems; and (4) This set of algorithms can be mapped onto any parallel architecture without any major programming difficulties or algorithmical changes.

Lin, Avi↗

Solving Large‐Scale Linear Systems of Equations by a Quantum Hybrid Algorithm

Abstract Today's intermediate‐scale quantum computers, although imperfect, already perform computational tasks that are manifestly beyond the capabilities of modern classical supercomputers. However, so far, quantum‐enabled large‐scale solutions have been realized only for limited set of problems. Here a hybrid algorithm based on phase estimation and classical optimization of the circuit width and depth is employed for solving a specific class of large linear systems of equations ubiquitous to many areas of science and engineering. A classification of linear systems based on the entanglement properties of the associated phase‐estimation unitary operation is introduced, enabling a highly efficient search for solutions that is facilitated by a straightforward matrix‐to‐circuit map. A 2 17 ‐dimensional problem is implemented on several IBM quantum computer superconducting quantum processors, a record‐breaking result for a linear system solved by a quantum computer. Demonstrated realisation sets a clear benchmark in the quest for the future quantum speedup in the linear systems of equations solution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Nalu's Linear System Assembly using Tpetra

The Nalu Exascale Wind application assembles linear systems using data structures provided by the Tpetra package in Trilinos. This note describes the initialization and assembly process. The purpose of this note is to help Nalu developers and maintainers to understand the code surrounding linear system assembly, in order to facilitate debugging, optimizations, and maintenance.

17 WIND ENERGY↗

Extending the eigCG algorithm to non-symmetric linear systems with multiple right-hand sides

For Hermitian positive definite linear systems and eigenvalue problems, the eigCG algorithm is a memory efficient algorithm that solves the linear system and simultaneously computes some of its eigenvalues. The algorithm is based on the Conjugate-Gradient (CG) algorithm, however, it uses only a window of the vectors generated by the CG algorithm to compute approximate eigenvalues. The number and accuracy of the eigenvectors can be increased by solving more right-hand sides. For Hermitian systems with multiple right-hand sides, the computed eigenvectors can be used to speed up the solution of subsequent systems. The algorithm was tested on Lattice QCD problems by solving the normal equations and was shown to give large speed up factors and to remove the critical slowing down as we approach light quark masses. Here, an extension to the non-symmetric case based on the two-sided Lanczos algorithm is given. The new algorithm is tested on Lattice QCD problems and is shown to give promising results. We also study the removal of the critical slowing down and compare results with those of the eigCG algorithm. We also discuss the case when the system is gamma5-Hermitian.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Anderson acceleration of the Jacobi iterative method: An efficient alternative to Krylov methods for large, sparse linear systems

We employ Anderson extrapolation to accelerate the classical Jacobi iterative method for large, sparse linear systems. Specifically, we utilize extrapolation at periodic intervals within the Jacobi iteration to develop the Alternating Anderson–Jacobi (AAJ) method. We verify the accuracy and efficacy of AAJ in a range of test cases, including nonsymmetric systems of equations. We demonstrate that AAJ possesses a favorable scaling with system size that is accompanied by a small prefactor, even in the absence of a preconditioner. In particular, we show that AAJ is able to accelerate the classical Jacobi iteration by over four orders of magnitude, with speed-ups that increase as the system gets larger. Moreover, we find that AAJ significantly outperforms the Generalized Minimal Residual (GMRES) method in the range of problems considered here, with the relative performance again improving with size of the system. As a result, the proposed method represents a simple yet efficient technique that is particularly attractive for large-scale parallel solutions of linear systems of equations.

97 MATHEMATICS AND COMPUTING↗

A comparative study of iterative solutions to linear systems arising in quantum mechanics

This study is mainly focused on iterative solutions with simple diagonal preconditioning to two complex-valued nonsymmetric systems of linear equations arising from a computational chemistry model problem proposed by Sherry Li of NERSC. Numerical experiments show the feasibility of iterative methods to some extent when applied to the problems and reveal the competitiveness of our recently proposed Lanczos biconjugate A-orthonormalization methods to other classic and popular iterative methods. By the way, experiment results also indicate that application specific preconditioners may be mandatory and required for accelerating convergence.

97 MATHEMATICS AND COMPUTING↗

Input-output description of linear systems with multiple time-scales

It is pointed out that the study of systems evolving at multiple time-scales is simplified by studying reduced-order models of these systems valid at specific time-scales. The present investigation is concerned with an extension of results on the time-scale decomposition of autonomous systems to that of input-output systems. The results are employed to study conditions under which positive realness of a transfer function is preserved under singular perturbation. Attention is given to the perturbation theory for linear operators, the multiple time-scale structure of autonomous linear systems, the input-output description of two time-scale linear systems, the positive realness of two time-scale systems, and multiple time-scale linear systems.

Madriz, R. S.↗

Polynomial compensation, inversion, and approximation of discrete time linear systems

The least-squares transformation of a discrete-time multivariable linear system into a desired one by convolving the first with a polynomial system yields optimal polynomial solutions to the problems of system compensation, inversion, and approximation. The polynomial coefficients are obtained from the solution to a so-called normal linear matrix equation, whose coefficients are shown to be the weighting patterns of certain linear systems. These, in turn, can be used in the recursive solution of the normal equation.

Baram, Yoram↗

SU-F-J-41: Experimental Validation of a Cascaded Linear System Model for MVCBCT with a Multi-Layer EPID

Purpose: The purpose of this study was to validate the use of a cascaded linear system model for MV cone-beam CT (CBCT) using a multi-layer (MLI) electronic portal imaging device (EPID) and provide experimental insight into image formation. A validated 3D model provides insight into salient factors affecting reconstructed image quality, allowing potential for optimizing detector design for CBCT applications. Methods: A cascaded linear system model was developed to investigate the potential improvement in reconstructed image quality for MV CBCT using an MLI EPID. Inputs to the three-dimensional (3D) model include projection space MTF and NPS. Experimental validation was performed on a prototype MLI detector installed on the portal imaging arm of a Varian TrueBeam radiotherapy system. CBCT scans of up to 898 projections over 360 degrees were acquired at exposures of 16 and 64 MU. Image volumes were reconstructed using a Feldkamp-type (FDK) filtered backprojection (FBP) algorithm. Flat field images and scans of a Catphan model 604 phantom were acquired. The effect of 2×2 and 4×4 detector binning was also examined. Results: Using projection flat fields as an input, examination of the modeled and measured NPS in the axial plane exhibits good agreement. Binning projection images was shown to improve axial slice SDNR by a factor of approximately 1.4. This improvement is largely driven by a decrease in image noise of roughly 20%. However, this effect is accompanied by a subsequent loss in image resolution. Conclusion: The measured axial NPS shows good agreement with the theoretical calculation using a linear system model. Binning of projection images improves SNR of large objects on the Catphan phantom by decreasing noise. Specific imaging tasks will dictate the implementation image binning to two-dimensional projection images. The project was partially supported by a grant from Varian Medical Systems, Inc. and grant No. R01CA188446-01 from the National Cancer Institute.

60 APPLIED LIFE SCIENCES↗

A method for high order linear system reduction and nonlinear system simplification

Least-squares-type algorithms for reducing the order of linear systems in the frequency domain and simplifying nonlinear systems in time domain are developed and demonstrated. The possible model structures are represented as nodes in a tree, and costs along the branches are assigned using the repeated-Gram-Schmidt orthogonalization procedure of Desrochers and Saridis (1980), permitting identification of the optimal n-term model by searching the tree to depth n, with no need for parameter identification. The efficiency and flexibility of the algorithms is shown in applications to the eighth-order linear system studied by Hsia (1972), a three-state eight-nonlinear-term aircraft-dynamics problem, and the related linear-controller problem (Garrard and Jordan, 1977).

Desrochers, A. A.↗

Hybrid state-space self-tuning control of uncertain linear systems

The paper presents a hybrid state-space self-tuner using a new dual-rate sampling scheme for digital adaptive control of continuous-time uncertain linear systems. A state-space-based recursive least-squares algorithm, together with a variable forgetting factor, is used for direct estimations of both the equivalent discrete-time uncertain linear system parameters and the associated discrete-time state of a continuous-time uncertain linear system from the sampled input and output data. An analogue optimal regional pole-placement design method is used for designing an optimal observer-based analogue controller. A suboptimal observer-based digital controller is then designed from the designed analogue controller using digital redesign technique. To enhance the robustness of parameter identification and state estimation algorithms, a dynamic bound for a class of uncertain bilinear parameters and a fast-rate digital controller are developed at each fast-sampling period. Also, to accommodate computation loads and computation delay for developing the advanced hybrid self-tuner, the designed analogue controller and observer gains are both updated at each slow-sampling period. This control technique has been successfully applied to benchmark control problems.

Shieh, L. S.↗

A discrete analog of the extended Bass algorithm for stabilizing constant linear systems

Two methods for stabilizing constant linear systems, namely, the extended Bass algorithm for continuous systems and a discrete system analog, are discussed. For the continuous algorithm, a new result on the degree of stability of the closed-loop eigenvalues is presented, and for both methods, typical results and asymptotic trends in the data are illustrated through an example computation.

Armstrong, E. S.↗

Full-System Linearization for Floating Offshore Wind Turbines in OpenFAST

The wind engineering community relies on multiphysics engineering software to run nonlinear time-domain simulations (e.g., for design-standards-based loads analysis). Although most physics involved in wind energy are nonlinear, linearization of the underlying nonlinear system equations is often advantageous to understand the system properties and exploit well-established methods and tools for analyzing linear systems. This paper presents the development of the new linearization functionality of the open-source engineering tool OpenFAST for floating offshore wind turbines, as well as the concepts and mathematical background needed to understand and apply it.

17 WIND ENERGY↗

Full-System Linearization for Floating Offshore Wind Turbines in OpenFAST: Preprint

The wind engineering community relies on multiphysics engineering software to run nonlinear time-domain simulations, e.g. for design-standards-based loads analysis. Although most physics involved in wind energy are nonlinear, linearization of the underlying nonlinear system equations is often advantageous to understand the system properties and exploit well-established methods and tools for analyzing linear systems. This paper presents the development of the new linearization functionality of the open-source engineering tool OpenFAST for floating offshore wind turbines (FOWTs), as well as the concepts and mathematical background needed to understand and apply it correctly.

17 WIND ENERGY↗