Solving Large Sparse Linear Systems in End-to-end Accelerator Structure Simulations
Explore the source record for details and available documents.
SEARCH · Search NASA
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.
Explore the source record for details and available documents.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Explore the source record for details and available documents.
Linear nonautonomous random system stability, presenting theorem, two corollaries and second order examples
Linear nonautonomous random system stability, presenting theorem, two corollaries and second order examples
Linear computer-controlled closed loop systems sensitivity analysis, deriving estimation error incremental covariance to demonstrate quality deterioration under perturbed initial conditions, parameters, etc
Linear networks fault detection and isolation using computerized test procedure and symbolic transfer function generation technique
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.
An iterative method for solving nonsymmetric indefinite linear systems is proposed. The method involves the successive use of a modified version of the conjugate residual method. A numerical example is given to illustrate the method.
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.
A linear system with two sets of controls, one primary and the other redundant, is considered. A two level optimization procedure is used to control the system and to maintain maximal availability of the primary control.
Acausal linear systems are studied as well as their controllability and observability properties, and the weighting patterns that they realize. A complete classification is given of all minimal real analytic realizations of a given weighting pattern and of all minimal autonomous realizations of a stationary weighting pattern.
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.
A method for modeling linear time-varying differential systems by linear time-invariant systems of lower order is proposed, extending the results obtained by Bierman (1972) by resolving such qualities as the model stability, various possible models of differing dimensions, and the uniqueness or nonuniqueness of the model coefficient matrix. In addition to the advantages cited by Heffes and Sarachik (1969) and Bierman, often by modeling a subsystem of a larger system it is possible to analyze the overall system behavior more easily, with resulting savings in computation time.