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,117 records · Page 62

Convergence of Weak-SINDy Surrogate Models

In this paper, we give an in-depth error analysis for surrogate models generated by a variant of the Sparse Identification of Nonlinear Dynamics (SINDy) method. We start with an overview of a variety of nonlinear system identification techniques, namely SINDy, weak-SINDy, and the occupation kernel method. Under the assumption that the dynamics are a finite linear combination of a set of basis functions, these methods establish a linear system to recover coefficients. We illuminate the structural similarities between these techniques and establish a projection property for the weak-SINDy technique. Following the overview, we analyze the error of surrogate models generated by a simplified version of weak-SINDy. In particular, under the assumption of boundedness of a composition operator given by the solution, we show that (i) the surrogate dynamics converges towards the true dynamics and (ii) the solution of the surrogate model is reasonably close to the true solution. Finally, as an application, we discuss the use of a combination of weak-SINDy surrogate modeling and proper orthogonal decomposition (POD) to build a surrogate model for partial differential equations (PDEs).

97 MATHEMATICS AND COMPUTING↗

Optimizing Dirac Wilson Operator and linear solvers for Intel KNL

Lattice Quantumchromodynamics (QCD) is a powerful tool to numerically access the low energy regime of QCD in a straightforward way with quantifyable uncertainties. In this approach, QCD is discretized on a four dimensional, euclidian space-time grid with millions of degrees of freedom. In modern lattice calculations, most of the work is still spent in solving large, sparse linear systems. This part has two challenges, i.e. optimizing the sparse matrix application as well as BLAS-like kernels used in the linear solver. We are going to present performance optimizations of the Dirac operator (dslash) with and without clover term for recent Intel architectures, including Knights Landing (KNL). Using only a single right hand side, we were able to achieve a good fraction of peak performance for slash, CG and BiCGStab. We will also present a series of experiments we performed on KNL, i.e. running MCDRAM in different modes, enabling or disabling hardware prefetching, using different SoA lengths as well as different sub-NUMA-clustering modes.

Joó, Bálint↗

Neural Ordinary Differential Equations for Nonlinear System Identification

Neural ordinary differential equations (NODE) have been recently proposed as a promising approach for nonlinear system identification tasks. In this work, we systematically compare their predictive performance with current state-of-the-art nonlinear and classical linear methods. In particular, we present a quantitative study comparing NODE's performance against neural state-space models and classical linear system identification methods and evaluate their inference speed and prediction performance on open-loop errors across eight different dynamical systems. The experiments show that NODEs can consistently improve the prediction accuracy by order of magnitude compared to benchmark methods. Besides improved accuracy, we also observed that NODEs are less sensitive to hyperparameters compared to neural state-space models by paying the cost of increased computation at the inference time.

machine leaning, system identification, physics in↗

symPACK: A GPU-Capable Fan-Out Sparse Cholesky Solver

Sparse symmetric positive definite systems of equations are ubiquitous in scientific workloads and applications. Parallel sparse Cholesky factorization is the method of choice for solving such linear systems. Therefore, the development of parallel sparse Cholesky codes that can efficiently run on today’s large-scale heterogeneous distributed-memory platforms is of vital importance. Modern supercomputers offer nodes that contain a mix of CPUs and GPUs. To fully utilize the computing power of these nodes, scientific codes must be adapted to offload expensive computations to GPUs. We present symPACK, a GPU-capable parallel sparse Cholesky solver that uses one-sided communication primitives and remote procedure calls provided by the UPC++ library. We also utilize the UPC++ "memory kinds" feature to enable efficient communication of GPU-resident data. We show that on a number of large problems, symPACK outperforms comparable state-of-the-art GPU-capable Cholesky factorization codes by up to 14x on the NERSC Perlmutter supercomputer.

Bellavita, Julian↗

Closed-loop structural stability for linear-quadratic optimal systems

An explicit parametrization of a subclass of linear constant gain feedback maps that never destabilize an originally open-loop stable system is presented. These results are used to obtain several new structural stability results for multiinput linear-quadratic feedback optimal designs.

Wong, P. K.↗

Modern digital flight control system design for VTOL aircraft

Methods for and results from the design and evaluation of a digital flight control system (DFCS) for a CH-47B helicopter are presented. The DFCS employed proportional-integral control logic to provide rapid, precise response to automatic or manual guidance commands while following conventional or spiral-descent approach paths. It contained altitude- and velocity-command modes, and it adapted to varying flight conditions through gain scheduling. Extensive use was made of linear systems analysis techniques. The DFCS was designed, using linear-optimal estimation and control theory, and the effects of gain scheduling are assessed by examination of closed-loop eigenvalues and time responses.

Broussard, J. R.↗

A computationally efficient parallel Levenberg-Marquardt algorithm for highly parameterized inverse model analyses

Inverse modeling seeks model parameters given a set of observations. However, for practical problems because the number of measurements is often large and the model parameters are also numerous, conventional methods for inverse modeling can be computationally expensive. We have developed a new, computationally-efficient parallel Levenberg-Marquardt method for solving inverse modeling problems with a highly parameterized model space. Levenberg-Marquardt methods require the solution of a linear system of equations which can be prohibitively expensive to compute for moderate to large-scale problems. Our novel method projects the original linear problem down to a Krylov subspace, such that the dimensionality of the problem can be significantly reduced. Furthermore, we store the Krylov subspace computed when using the first damping parameter and recycle the subspace for the subsequent damping parameters. The efficiency of our new inverse modeling algorithm is significantly improved using these computational techniques. We apply this new inverse modeling method to invert for random transmissivity fields in 2D and a random hydraulic conductivity field in 3D. Our algorithm is fast enough to solve for the distributed model parameters (transmissivity) in the model domain. The algorithm is coded in Julia and implemented in the MADS computational framework (http://mads.lanl.gov). By comparing with Levenberg-Marquardt methods using standard linear inversion techniques such as QR or SVD methods, our Levenberg-Marquardt method yields a speed-up ratio on the order of ~10 1 to ~10 2 in a multi-core computational environment. Furthermore, our new inverse modeling method is a powerful tool for characterizing subsurface heterogeneity for moderate- to large-scale problems.

97 MATHEMATICS AND COMPUTING↗

Linear solvers for power grid optimization problems: A review of GPU-accelerated linear solvers

The linear equations that arise in interior methods for constrained optimization are sparse symmetric indefinite, and they become extremely ill-conditioned as the interior method converges. These linear systems present a challenge for existing solver frameworks based on sparse LU or LDL T decompositions. Here, we benchmark five well known direct linear solver packages on CPU- and GPU-based hardware, using matrices extracted from power grid optimization problems. The achieved solution accuracy varies greatly among the packages. None of the tested packages delivers significant GPU acceleration for our test cases. For completeness of the comparison we include results for MA57, which is one of the most efficient and reliable CPU solvers for this class of problem.

97 MATHEMATICS AND COMPUTING↗

Accuracy of momentum and gyrodensity transport in global gyrokinetic particle-in-cell simulations

Gyrokinetic Particle-In-Cell (PIC) simulations based on conservative Lagrangian formalisms admit transport equations for conserved quantities such as gyrodensity and toroidal momentum, and these can be derived for arbitrary wavelength, even though previous applications have used the long-wavelength approximation. In control-variate PIC simulations, a consequence of the different treatment of the background (f{sub 0}) and perturbed parts (δf), when a splitting f = f{sub 0} + δf is performed, is that analytical transport relations for the relevant fluxes and moments are only reproduced in the large marker number limit. The transport equations for f can be used to write the inconsistency in the perturbed quantities explicitly in terms of the sampling of the background distribution f{sub 0}. This immediately allows estimates of the error in consistency of momentum transport in control-variate PIC simulations. This inconsistency tends to accumulate secularly and is not directly affected by the sources and noise control in the system. Although physical tokamaks often rotate quite strongly, the standard gyrokinetic formalism assumes weak perpendicular flows, comparable to the drift speed. For systems with such weak flows, maintaining acceptably small relative errors requires that a number of markers scale with the fourth power of the linear system size to consistently resolve long-wavelength evolution. To avoid this unfavourable scaling, an algorithm for exact gyrodensity transport has been developed, and this is shown to allow accurate simulations with an order of magnitude fewer markers.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Improved Dyson series expansion for steady-state quantum transport beyond the weak coupling limit: Divergences and resolution

We present a general theory to calculate the steady-state heat and electronic currents for nonlinear systems using a perturbative expansion in the system-bath coupling. We explicitly demonstrate that using the truncated Dyson-series leads to divergences in the steady-state limit, thus making it impossible to be used for actual applications. In order to resolve the divergences, we propose a unique choice of initial condition for the reduced density matrix, which removes the divergences at each order. Our approach not only allows us to use the truncated Dyson-series, with a reasonable choice of initial condition, but also gives the expected result that the steady-state solutions should be independent of initial preparations. Using our improved Dyson series we evaluate the heat and electronic currents up to fourth-order in system-bath coupling, a considerable improvement over the standard quantum master equation techniques. We then numerically corroborate our theory for archetypal settings of linear systems using the exact nonequilibrium Green's function approach. Finally, to demonstrate the advantage of our approach, we deal with the nonlinear spin-boson model to evaluate heat current up to fourth-order and find signatures of cotunnelling process.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

High-precision quantum algorithms for partial differential equations

Quantum computers can produce a quantum encoding of the solution of a system of differential equations exponentially faster than a classical algorithm can produce an explicit description. However, while high-precision quantum algorithms for linear ordinary differential equations are well established, the best previous quantum algorithms for linear partial differential equations (PDEs) have complexity poly(1/ϵ), where ϵ is the error tolerance. By developing quantum algorithms based on adaptive-order finite difference methods and spectral methods, we improve the complexity of quantum algorithms for linear PDEs to be poly(d,log(1/ϵ)), where d is the spatial dimension. Our algorithms apply high-precision quantum linear system algorithms to systems whose condition numbers and approximation errors we bound. We develop a finite difference algorithm for the Poisson equation and a spectral algorithm for more general second-order elliptic equations.

97 MATHEMATICS AND COMPUTING↗

Approximate polynomial preconditioning applied to biharmonic equations on vector supercomputers

Applying a finite difference approximation to a biharmonic equation results in a very ill-conditioned system of equations. This paper examines the conjugate gradient method used in conjunction with the generalized and approximate polynomial preconditionings for solving such linear systems. An approximate polynomial preconditioning is introduced, and is shown to be more efficient than the generalized polynomial preconditionings. This new technique provides a simple but effective preconditioning polynomial, which is based on another coefficient matrix rather than the original matrix operator as commonly used.

Wong, Yau Shu↗

Algebraic Multigrid Benchmark

AMG2013 is a parallel algebraic multigrid solver for linear systems arising from problems on unstructured grids. It has been derived directly from the Boomer AMG solver in the hypre library, a large linear solvers library that is being developed in the Center for Applied Scientific Computing (CASC) at LLNL. The driver provided in the benchmark can build various test problems. The default problem is a Laplace type problem on an unstructured domain with various jumps and an anisotropy in one part.

Source record↗

Extending the QUDA Library with the eigCG Solver

While the incremental eigCG algorithm [ 1 ] is included in many LQCD software packages, its realization on GPU micro-architectures was still missing. In this session we report our experi- ence of the eigCG implementation in the QUDA library. In particular, we will focus on how to employ the mixed precision technique to accelerate solutions of large sparse linear systems with multiple right-hand sides on GPUs. Although application of mixed precision techniques is a well-known optimization approach for linear solvers, its utilization for the eigenvector com- puting within eigCG requires special consideration. We will discuss implementation aspects of the mixed precision deflation and illustrate its numerical behavior on the example of the Wilson twisted mass fermion matrix inversions

Strelchenko, Alexei↗

Performance of a parallel algebraic multilevel preconditioner for stabilized finite element semiconductor device modeling

In this study results are presented for the large-scale parallel performance of an algebraic multilevel preconditioner for solution of the drift-diffusion model for semiconductor devices. The preconditioner is the key numerical procedure determining the robustness, efficiency and scalability of the fully-coupled Newton-Krylov based, nonlinear solution method that is employed for this system of equations. The coupled system is comprised of a source term dominated Poisson equation for the electric potential, and two convection-diffusion-reaction type equations for the electron and hole concentration. The governing PDEs are discretized in space by a stabilized finite element method. Solution of the discrete system is obtained through a fully-implicit time integrator, a fully-coupled Newton-based nonlinear solver, and a restarted GMRES Krylov linear system solver. The algebraic multilevel preconditioner is based on an aggressive coarsening graph partitioning of the nonzero block structure of the Jacobian matrix. Representative performance results are presented for various choices of multigrid V-cycles and W-cycles and parameter variations for smoothers based on incomplete factorizations. Parallel scalability results are presented for solution of up to 10{sup 8} unknowns on 4096 processors of a Cray XT3/4 and an IBM POWER eServer system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Design and implementation of grid multi-scroll fractional-order chaotic attractors

This paper proposes a novel approach for generating multi-scroll chaotic attractors in multi-directions for fractional-order (FO) systems. The stair nonlinear function series and the saturated nonlinear function are combined to extend equilibrium points with index 2 in a new FO linear system. With the help of stability theory of FO systems, stability of its equilibrium points is analyzed, and the chaotic behaviors are validated through phase portraits, Lyapunov exponents, and Poincaré section. Choosing the order 0.96 as an example, a circuit for generating 2-D grid multiscroll chaotic attractors is designed, and 2-D 9 × 9 grid FO attractors are observed at most. Numerical simulations and circuit experimental results show that the method is feasible and the designed circuit is correct.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Report on activities and findings under DOE grant “Collaborative research. An Interactive Multi-Model for Consensus on Climate Change”

The project takes a hierarchical approach. The supermodeling scheme was first studied exhaustively with simple systems of ordinary differential equations. Results were described in detail in the previous report. The principal findings were that 1) for highly non-linear systems, such as Lorenz-63, including systems which describe phenomena on very different (atmosphere/ocean) times scales, supermodeling is far superior to any form of output-averaging; 2) negative coefficients can be used to advantage in situations where all models err in the same way, but to different degrees; 3) an interesting variant of supermodeling, “weighted supermodeling”, is the limiting case where inter-model nudging coefficients in the originally conceived “connected supermodel” become infinite, but with fixed ratios, corresponding to a direct combination of the tendencies that appear in corresponding equations for the alternative models; 4) noise is useful for avoiding local optima in training the inter-model coefficients in the supermodel. The supermodeling scheme was then investigated with simple quasigeostrophic (QG) models. As described in the previous report, it was found that QG models on a sphere can be coupled most efficaciously by working in a basis which captures the most variance, rather than the most instability, a somewhat unexpected result that still deserves scrutiny in a broader context. Further studies (since the last report) with QG channel models addressed the central question of when supermodeling is superior to output averaging in situations where nonlinearites are less extreme than with the ODEs initially studied. It was found that for realistic variations in a parameter in the QG model, output averaging is sufficient to capture all but the most subtle quantitative and qualitative behavior. Supermodeling helps when qualitative differences between the models result from unrealistically large parameter differences, or when very detailed spatial structure of the modes of variability are of interest. Therefore, the scheme may still be useful in the case of full climate models with qualitatively different parametrization schemes. A supermodel was constructed from the intermediate-complexity SPEEDO model, a primitive equation model with ocean and land. Versions defined by different parameter choices, in a realistic range, were connected and the coefficients trained. Some improvement was found as compared to output averaging. The learning algorithm used thus far gives sub-optimal, but still useful results when the CO 2 level and other parameters are varied. Spatial structure remains to be studied. The first use of supermodeling with full climate models has been with variants of the ECHAM model that use different convection schemes. As yet the models are only connected at the ocean-atmosphere interface, where weighted combinations of fluxes from the two atmospheres are passed to a common ocean, and the weights adapted during a training period. The supermodel was surprisingly successful at avoiding unrealistic features such as the double-ITCZ (Intertropical Convergence Zone), a problem that arises in both of the two models run separately. The supermodels constructed thus far have not identified dynamical regime shifts in future climate. Thus the planned connection with the work of Tsonis on the relationship between regime shifts and synchronization/de-synchronization among the major climate modes (see U. Wisconsin report) has not yet been made. However the network analysis of the climate system, in observations and models, that was done in conjunction with that study, shows that models differ strongly from one another and from observations in regard to the dynamical structure described by correlation networks [Steinhaeuser and Tsonis 2013], providing a further justification for supermodeling. Toward a general software framework for supermodeling, three versions of CAM (the Community Atmosphere Model) at NCAR were configured for inter-model nudging using the DART (Data Assimilation Research Testbed) capability to stop and re-start models in synchrony. It was clearly established that the inter-model nudging adds almost no computational burden to the runs, but there appears to be a problem with the re-initialization software that is still being debugged. Publications: Several papers were published on the basic idea of the interactive multi-model (supermodel) including demonstrations with low-order ODEs. The last of these, a semi-philosophical review paper on the relevance of synchronization generally, encountered considerable resistance but was finally published in Entropy [Duane 2015]. A paper on the ECHAM/COSMOS supermodel, containing the most promising results so far [Shen et al. 2015] is presently under review.

58 GEOSCIENCES↗