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 1,747 records · Page 97

Quantifying Uncertainties through Advanced Theoretical Analysis for Image and Signal Reconstruction NLV-02-15, Year 1 of 2

Presentation describes project to (1) adapt accelerated matrix-free linear system solvers for applying new statistical approaches to very large–scale problems, (2) characterize the degree to which new statistical methods are superior to classical methods in respect to the sensitivity to “tuning parameters,” and (3) develop a new mathematical theory and associated numerical methods for computing the point spread function of an x-ray imaging system.

97 MATHEMATICS AND COMPUTING↗

Quantifying Uncertainties Through Advanced Theoretical Analysis for Image and Signal Reconstruction, NLV-02-15, Year 2 of 2

Presentation describes project to (1) adapt accelerated matrix-free linear system solvers for applying new statistical approaches to very large–scale problems, (2) characterize the degree to which new statistical methods are superior to classical methods in respect to the sensitivity to “tuning parameters,” and (3) develop a new mathematical theory and associated numerical methods for computing the point spread function of an x-ray imaging system.

97 MATHEMATICS AND COMPUTING↗

Critical Literature Review of Quantitative Sustainability Assessment Methods for the Circular Economy

The circular economy (CE) has been proposed to be an operational framework for sustainable development that decouples economic growth from resource consumption. The CE ambition is to maximize the retention of value in products, materials, and resources in the economy over time with the help of CE strategies such as selling a service rather than a product, reusing and repairing products or their components, and recycling. The social, economic, and environmental performances of CE strategies need to be measured against their linear counterparts to avoid strategies that increase circularity but have other unintended externalities. However, there is currently no tool specifically designed to compare circular to linear systems and, thus, various methods from different fields have been applied. This session aims at reviewing, contrasting, and critiquing different methods that have been applied to assess the CE until now, along with an up to date state of the science in this field. Methods from the industrial ecology field have most often been applied to study the CE. However, the transition to CE involves both technological improvements as well as social changes. New business models such as collaborative consumption models (e.g., Uber or Airbnb) are examples of the new patterns of production and consumption of the CE, which may be difficult to analyze from a purely industrial ecology perspective. Methods from complexity science and humanities could therefore complement the industrial ecology perspective to extend the scope of the analysis. Such an approach could also answer a longstanding criticism of the CE which, in contrast with sustainability, solely focuses on the environment and the economy. Moreover, the hybridization of two or more existing methods can yield additional capabilities, which may enable the exploration of additional CE-related research questions. The 90 minutes session will have several presentations and conclude with a moderated, interactive panel discussion on how methods from different fields could be combined to harness their relative strengths.

circular economy↗

Learning Stochastic Parametric Differentiable Predictive Control Policies

We present a scalable unsupervised learning-based method for obtaining explicit control policies for model predictive control problems for stochastic linear systems with additive uncertainties subject to nonlinear chance constraints. We call the proposed method stochastic parametric differentiable predictive control (SP-DPC), which extends the recently proposed deterministic DPC policy optimization algorithm. We formulate the SP-DPC as a deterministic approximation to the stochastic parametric constrained optimal control problem via independent sampling of the problem's parameters and uncertainties. This formulation allows us to directly compute the policy gradients via automatic differentiation of the problem's value function, evaluated over sampled parameters and uncertainties. In particular, the computed expectation of the problem's value function is backpropagated through the finite-time closed-loop system rollouts parametrized by a known nominal system dynamics model and neural control policy. We also provide theoretical probabilistic guarantees on closed-loop stability and chance constraints satisfaction for systems controlled by learned neural policies. We demonstrate the computational efficiency and scalability of the proposed policy optimization algorithm in three numerical examples, including systems with a large number of states or subject to nonlinear constraints.

Drgona, Jan↗

Using Laguerre polynomials to compute the matrix exponential in burnup calculations

An essential part of burnup analysis is to solve the burnup equations. The burnup equations can be regarded as a first-order linear system and solved by means of matrix exponential methods. Because of its large spectrum, it is difficult to compute the exponential of the burnup matrix. Conventional methods of computing the matrix exponential, such as the truncated Taylor expansion and the Pade approximation, are not applicable to burnup calculations. Recently the Chebyshev Rational Approximation Method (CRAM) has been applied to solve burnup matrix exponential and shown to be robust and accurate. However, the main defect of CRAM is that its coefficients are not easy to obtain. In this paper, an orthogonal polynomial expansion method, called Laguerre Polynomial Approximation Method (LPAM), is proposed to compute the matrix exponential in burnup calculations. The polynomial sequence of LPAM can be easily computed in any order and thus LPAM is quite convenient to be utilized into burnup codes. Two typical test cases with the decay and cross-section data taken from the standard ORIGEN 2.1 libraries are calculated for validation, against the reference results provided by CRAM of 14 order. Numerical results show that, LPAM is sufficiently accurate for burnup calculations. The influences of the parameters on the convergence of LPAM are also discussed. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Second order perturbation theory for nonlinear time-dependent problems: Application to a simplified coupled transient

In this paper a second-order perturbation technique for nonlinear time-dependent problems is presented and applied to a simplified multi-physics model. This method is developed by using the properties of the adjoint problem which allows calculating the set of first and second order coefficients by solving a number of linear systems. As an illustrative example the adjoint procedure is applied to a reference transient problem, represented by a coupled point-kinetic/lumped-parameters model, and used to calculate the sensitivity coefficients of a safety related response with respect to a set of input parameters. The results obtained are compared with the values given by a direct sampling of the forward nonlinear problem. A way to reduce the number of calculations required for the application of second order adjoint techniques is also discussed. Our first results show that the procedure provides good estimations in presence of higher order perturbation components, being able to reconstruct the responses of interest even in presence of non-Gaussian probability density functions. Furthermore, the use of reduced second order information decreases the computational requirements of the method, making it appealing for possible large scale applications. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A 2D/1D coupling neutron transport method based on the matrix MOC and NEM methods

A new 2D/1D coupling method based on the matrix MOC method (MMOC) and nodal expansion method (NEM) is proposed for solving the three-dimensional heterogeneous neutron transport problem. The MMOC method, used for radial two-dimensional calculation, constructs a response matrix between source and flux with only one sweep and then solves the linear system by using the restarted GMRES algorithm instead of the traditional trajectory sweeping process during within-group iteration for angular flux update. Long characteristics are generated by using the customization of commercial software AutoCAD. A one-dimensional diffusion calculation is carried out in the axial direction by employing the NEM method. The 2D and ID solutions are coupled through the transverse leakage items. The 3D CMFD method is used to ensure the global neutron balance and adjust the different convergence properties of the radial and axial solvers. A computational code is developed based on these theories. Two benchmarks are calculated to verify the coupling method and the code. It is observed that the corresponding numerical results agree well with references, which indicates that the new method is capable of solving the 3D heterogeneous neutron transport problem directly. (authors)

97 MATHEMATICS AND COMPUTING↗

Phase-space finite elements in a least-squares solution of the transport equation

The linear Boltzmann transport equation is solved using a least-squares finite element approximation in the space, angular and energy phase-space variables. The method is applied to both neutral particle transport and also to charged particle transport in the presence of an electric field, where the angular and energy derivative terms are handled with the energy/angular finite elements approximation, in a manner analogous to the way the spatial streaming term is handled. For multi-dimensional problems, a novel approach is used for the angular finite elements: mapping the surface of a unit sphere to a two-dimensional planar region and using a meshing tool to generate a mesh. In this manner, much of the spatial finite-elements machinery can be easily adapted to handle the angular variable. The energy variable and the angular variable for one-dimensional problems make use of edge/beam elements, also building upon the spatial finite elements capabilities. The methods described here can make use of either continuous or discontinuous finite elements in space, angle and/or energy, with the use of continuous finite elements resulting in a smaller problem size and the use of discontinuous finite elements resulting in more accurate solutions for certain types of problems. The work described in this paper makes use of continuous finite elements, so that the resulting linear system is symmetric positive definite and can be solved with a highly efficient parallel preconditioned conjugate gradients algorithm. The phase-space finite elements capability has been built into the Sceptre code and applied to several test problems, including a simple one-dimensional problem with an analytic solution available, a two-dimensional problem with an isolated source term, showing how the method essentially eliminates ray effects encountered with discrete ordinates, and a simple one-dimensional charged-particle transport problem in the presence of an electric field. (authors)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A new solution for the 1D neutral particle transport equation in heterogeneous media - Paper 89

The equation of photon transport in directionally discretized 2N streams has been the subject of various numerical algorithms over the past 65 years since Chandrasekhar first explored the concept. The importance of this equation cannot be overemphasized, as it characterizes neutral particles (in this case photons) undergoing collisions as characterized by the scattering phase function in a 1D slab medium. More precisely, particles enter a homogeneous slab medium with the particle intensity distribution to be numerically determined. We find applications in light scattering for graphical rendering as well as deep penetration photon transport in a scattering medium as considered here. Noting the algebraic nature of the solution, numerous numerical attempts at an efficient algorithm have appeared in the literature-- many involving numerical linear algebra. Most notable are the Discrete Ordinates Method [DOM] of Stamnes and the Analytical Discrete Ordinates (ADO) method of Siewert as well as the Laplace Transform (LTSN) method of Vilhena. The methods are all centered on the determination of eigenvalues (or zeros of a polynomial in the case of the LTSN method) of a linear system enabling the solution to be represented as a sum of exponential eigenvectors. Because of the unstable nature of the solution, unless one takes care, such a representation leads to numerical catastrophe. Here, we derive an alternative form of solution to overcome this difficulty for application to deep penetration.

61 RADIATION PROTECTION AND DOSIMETRY↗

Identification of the threshold security applied for fuel under reactivity-initiated conditions by self-organizing maps and neural networks - 14386

In recent times, we have 439 reactors distributed in 31 countries that give about 377 GW, covering around 12% of world capacity of energy. Currently, it accounts for an estimated 40 serious accidents reported in nuclear power plants. In this article, turns out the behavior of fuel rod in light-water reactors under accident conditions. Besides, we investigate deeply about reactivity-initiated accidents, by introducing Nordheim-Fuchs model as state equations. The early research showed that pre-irradiated fuels and afterward subjected to a rapid pulse of energy. It adopts the key items necessary to check the threshold of failure. These items are few limits as burning the fuel; the value applied to the peak of energy, pulse width, oxidation layer, and cladding. The kinetic equations of nuclear reactors modeled as a non-linear system. In this way, it can apply the paradigm of artificial intelligence using the self-organized maps. Where the goal is to find the cluster of failure for irradiated fuels until 75 GWd/MTU. The second model based on statistical is the logistic regression theory. Hence, the tests carried out and compared against the results found by neural networks for classification of clusters. It proofs that both approaches present capacity to find the flaws accurately of about 80% of cases. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Frequency-domain vs time-domain SP{sub N} equations to simulate neutron noise

Inside the reactor core mechanical vibrations of fuel assemblies can produce high fluctuations around a steady-state configuration, known as neutron noise. This effect can cause the triggering of power reduction measures. Classically, diffusion theory has been used to simulate this behavior. However, this equation has some limitations if the materials of the reactor have strong variations. In this work, we use the diffusive time-dependent simplified spherical harmonics equations that improve the previous results without the necessity of using high computational requirements. In particular, two types of analyses with these equations (SP{sub 3}) are made: a frequency-domain and a time-domain. A numerical neutron noise benchmark tests the methodology and compare both formulations. First, numerical results show a good agreement between the amplitudes and phases of the SP3 equations computed with the frequency-domain and time-domain. Therefore, as the frequency-domain computation only requires to solve a linear system, it is a recommendable option for neutron noise computations. Second, one can conclude that for this type of nuclear systems, where the assemblies are not homogenized, the SP{sub 3} approximation results improve considerably the accuracy of the diffusion theory.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

AUTOMATIC GENERATION OF EVENT TREES AND FAULT TREES: A MODEL-BASED APPROACH

In the past few decades, increasing complexity in modern engineering systems has been driven by the integration of a large number of components and by the fact that the system operations involve many disciplines (e.g., thermal-hydraulics, plant operations, cyber-security). Current safety/reliability modeling approaches to such systems are labor intensive, difficult to learn, and rely heavily on simplistic Boolean logic to depict failure propagation and accident progression. While these methods serve well for simple systems (i.e., linear causal systems with limited small inter- and intra-system interactions), their results are difficult to verify when modeling complex systems (typically performed through the extensive use of modeling assumptions). The development of new methods is addressed to meet these challenges through a model-based system engineering (MBSE) lens. Under MBSE philosophy, every aspect of the system (form or function) is represented by a model that completely characterizes its architecture or behavior. MBSE approach greatly improves the management of design, analysis and verification of complex systems. An integration of Dynamic Probabilistic Risk Assessment (DPRA) methods with MBSE models is proposed to perform safety/reliability analyses of engineering systems. In particular, MBSE representation of the system (performed using Systems Modeling Language [SysML]) is coupled with DPRA methods to automatically generate event trees and fault trees.

97 - MATHEMATICS AND COMPUTING↗

Two-Tower Quantum Matrix Chain Multiplication: Trading Qubits for Depth

Matrix chain multiplication -- computing $\mathcal{W} = M^{(0)}\cdots M^{(K-1)}$ where $M^{(k)} \in \mathbb{R}^{P_k \times P_{k+1}}$-- arises in scientific computing, machine learning, and graph analysis. Despite the importance of this problem, for chains of distinct matrices, the classical number of operations grows linearly with the chain length $K$ and polynomially in the matrix dimensions. We present \emph{Two-Tower Matrix Multiplication}, a quantum subroutine that encodes the product $\mathcal{W}$ of the $K$ matrices into a quantum state in circuit depth $\mathcal{O}(\max_{k} \mathrm{polylog} (P_k P_{k+1}))$, which is independent of~$K$ within the QRAM-based state-preparation model, whereas the qubit count is $\mathcal{O}\bigl(\sum_{k} \log P_k \bigr)$; the total gate count remains linear in $K$, so the gain is in the circuit depth. The construction interleaves state-preparation operators across two layers; within each layer, all operators act on disjoint registers and execute in parallel. This subroutine can be specialized for the chain-vector case, which computes the product of $K-1$ matrices applied to a vector. We prove the correctness of the subroutine for all $K$ and provide two implementations using the Qiskit and QCLAB frameworks. The subroutine is applicable to any downstream quantum algorithm that operates on a matrix encoded in the statevector, including norm estimation, graph-matrix powers, linear system solving, and quantum machine learning kernels.

Antonioli, Giacomo [Pisa U.] (ORCID:00090000668703↗

BDDC for nonsymmetric positive definite and symmetric indefinite problems

The balancing domain decomposition methods by constraints are extended to solving both nonsymmetric, positive definite and symmetric, indefinite linear systems. In both cases, certain nonstandard primal constraints are included in the coarse problems of BDDC algorithms to accelerate the convergence. Under the assumption that the subdomain size is small enough, a convergence rate estimate for the GMRES iteration is established that the rate is independent of the number of subdomains and depends only slightly on the subdomain problem size. Numerical experiments for several two-dimensional examples illustrate the fast convergence of the proposed algorithms.

97 MATHEMATICS AND COMPUTING↗

A Supernodal Approach to Incomplete LU Factorization with Partial Pivoting

We present a new supernode-based incomplete LU factorization method to construct a preconditioner for solving sparse linear systems with iterative methods. The new algorithm is primarily based on the ILUTP approach by Saad, and we incorporate a number of techniques to improve the robustness and performance of the traditional ILUTP method. These include the new dropping strategies that accommodate the use of supernodal structures in the factored matrix. We present numerical experiments to demonstrate that our new method is competitive with the other ILU approaches and is well suited for today's high performance architectures.

97 MATHEMATICS AND COMPUTING↗

A ROBUST ARBITRARILY HIGH ORDER TRANSPORT METHOD OF THE CHARACTERISTIC TYPE FOR UNSTRUCTURED TETRAHEDRAL GRIDS

We present a robust arbitrarily high order transport method of the characteristic type for unstructured tetrahedral grids. Previously encountered difficulties have been addressed through the reformulation of the method based on coordinate transformations, evaluation of the moments balance relation as a linear system of equations involving the expansion coefficients of the projected basis, and the asymptotic expansion of the integral kernels in the thin cell limit. The proper choice of basis functions for the high-order spatial expansion of the solution is discussed and its effect on problems involving scattering discussed. Numerical tests are presented to illustrate the beneficial effect of these improvements, and the improved robustness they yield.

97 MATHEMATICS AND COMPUTING↗

Accuracy evaluation of the optical surface monitoring system on EDGE linear accelerator in a phantom study

Frameless stereotactic radiosurgery (SRS) requires dedicated systems to monitor the patient position during the treatment to avoid target underdosage due to involuntary shift. The optical surface monitoring system (OSMS) is here evaluated in a phantom-based study. The new EDGE linear accelerator from Varian (Varian, Palo Alto, CA) integrates, for cranial lesions, the common cone beam computed tomography (CBCT) and kV-MV portal images to the optical surface monitoring system (OSMS), a device able to detect real-time patient's face movements in all 6 couch axes (vertical, longitudinal, lateral, rotation along the vertical axis, pitch, and roll). We have evaluated the OSMS imaging capability in checking the phantoms' position and monitoring its motion. With this aim, a home-made cranial phantom was developed to evaluate the OSMS accuracy in 4 different experiments: (1) comparison with CBCT in isocenter location, (2) capability to recognize predefined shifts up to 2° or 3 cm, (3) evaluation at different couch angles, (4) ability to properly reconstruct the surface when the linac gantry visually block one of the cameras. The OSMS system showed, with a phantom, to be accurate for positioning in respect to the CBCT imaging system with differences of 0.6 ± 0.3 mm for linear vector displacement, with a maximum rotational inaccuracy of 0.3°. OSMS presented an accuracy of 0.3 mm for displacement up to 1 cm and 1°, and 0.5 mm for larger displacements. Different couch angles (45° and 90°) induced a mean vector uncertainty < 0.4 mm. Coverage of 1 camera produced an uncertainty < 0.5 mm. Translations and rotations of a phantom can be accurately detect with the optical surface detector system.

61 RADIATION PROTECTION AND DOSIMETRY↗

Closed-loop structural stability for linear-quadratic optimal systems

This paper contains an explicit parametrization of a subclass of linear constant gain feedback maps that will not destabilize an originally open-loop stable system. These results can then be used to obtain several new structural stability results for multiinput linear-quadratic feedback optimal designs.

Wong, P. K.↗