Search NASA⌕ Search

SEARCH · Search NASA

Results for “subspace method”

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 91 records · Page 5

GSTS-Uzawa method for a class of complex singular saddle point problems

In this paper, we propose GSTS–Uzawa method for solving a class of complex singular saddle point problems based on generalized skew-Hermitian triangular splitting (GSTS) iteration method and classical Uzawa method. We research on its semi-convergence properties and the eigenvalues distributions of its preconditioned matrix. The resulting GSTS–Uzawa preconditioner is used to precondition Krylov subspace methods such as the restarted generalized minimal residual (GMRES) method for solving the equivalent formulation of the complex singular saddle point problems. The theoretical results and effectiveness of the GSTS–Uzawa method are supported by a numerical example.

97 MATHEMATICS AND COMPUTING↗

A fully coupled two-level Schwarz preconditioner based on smoothed aggregation for the transient multigroup neutron diffusion equations

The neutron multigroup diffusion equations is an important approximation of the neutron transport equation, and has been widely used for studying the motion of neutrons and their interactions with the stationary background materials. Solving the multigroup diffusion equations faces challenging because many variables are coupled together and a lot of computing resources are required. In this paper, we focus on the development of a scalable parallel algorithm framework for the system of equations arising from the discretization of the multigroup diffusion equations using a finite element method in space and using an implicit scheme in time. The parallel agorithm framweork consists of an inexact Jacobian-free Newton for the nonlinear equations, a Krylov subspace method for the Jacobian system and a parallel Schwarz preconditioner for the acceleration of the algorithm convergence. A coarse space based on smoothed aggregation is introduced to construct a two-level method to improve the parallel performance of the Schwarz preconditioner. We numerically shown that compared with the one-level method, the proposed two-level method works significantly better in terms of the number of linear iterations and the compute time for a system of equations with millions of unknowns and a supercomputer with thousands of processors.

97 MATHEMATICS AND COMPUTING↗

Rational approximations from power series of vector-valued meromorphic functions

Let F(z) be a vector-valued function, F: C yields C(sup N), which is analytic at z = 0 and meromorphic in a neighborhood of z = 0, and let its Maclaurin series be given. In this work we developed vector-valued rational approximation procedures for F(z) by applying vector extrapolation methods to the sequence of partial sums of its Maclaurin series. We analyzed some of the algebraic and analytic properties of the rational approximations thus obtained, and showed that they were akin to Pade approximations. In particular, we proved a Koenig type theorem concerning their poles and a de Montessus type theorem concerning their uniform convergence. We showed how optical approximations to multiple poles and to Laurent expansions about these poles can be constructed. Extensions of the procedures above and the accompanying theoretical results to functions defined in arbitrary linear spaces was also considered. One of the most interesting and immediate applications of the results of this work is to the matrix eigenvalue problem. In a forthcoming paper we exploited the developments of the present work to devise bona fide generalizations of the classical power method that are especially suitable for very large and sparse matrices. These generalizations can be used to approximate simultaneously several of the largest distinct eigenvalues and corresponding eigenvectors and invariant subspaces of arbitrary matrices which may or may not be diagonalizable, and are very closely related with known Krylov subspace methods.

Sidi, Avram↗

A projection preconditioner for solving the implicit immersed boundary equations

This study presents a method for solving the linear semi-implicit immersed boundary equations which avoids the severe time step restriction presented by explicit-time methods. The Lagrangian variables are eliminated via a Schur complement to form a purely Eulerian saddle point system, which is preconditioned by a projection operator and then solved by a Krylov subspace method. From the viewpoint of projection methods, we derive an ideal preconditioner for the saddle point problem and compare the efficiency of a number of simpler preconditioners that approximate this perfect one. For low Reynolds number and high stiffness, one particular projection preconditioner yields an efficiency improvement of the explicit IB method by a factor around thirty. Substantial speed-ups over explicit-time method are achieved for Reynolds number below 100. In conclusion, this speedup increases as the Eulerian grid size and/or the Reynolds number are further reduced.

42 ENGINEERING↗

Nonlinear acceleration of SN transport calculations

The use of nonlinear iterative methods, Jacobian-Free Newton-Krylov (JFNK) in particular, for solving eigenvalue problems in transport applications has recently become an active subject of research. While JFNK has been shown to be effective for k-eigenvalue problems, there are a number of input parameters that impact computational efficiency, making it difficult to implement efficiently in a production code using a single set of default parameters. We show that different selections for the forcing parameter in particular can lead to large variations in the amount of computational work for a given problem. In contrast, we present a nonlinear subspace method that sits outside and effectively accelerates nonlinear iterations of a given form and requires only a single input parameter, the subspace size. It is shown to consistently and significantly reduce the amount of computational work when applied to fixed-point iteration, and this combination of methods is shown to be more efficient than JFNK for our application.

97 MATHEMATICS AND COMPUTING↗

$O(N)$ ab initio calculation scheme for large-scale moiré structures

Here we present a two-step method specifically tailored for band structure calculation of the small-angle moiré-pattern materials which contain tens of thousands of atoms in a unit cell. In the first step, the self-consistent field calculation for the ground state is performed with the O(N) Krylov subspace method implemented in openmx. Second, the crystal momentum-dependent Bloch Hamiltonian and overlap matrix are constructed from the results obtained in the first step and only a small number of eigenvalues near the Fermi energy are solved with shift-invert and Lanczos techniques. By systematically tuning two key parameters, the cutoff radius for electron hopping interaction and the dimension of the Krylov subspace, we obtained the band structures for both rigid and corrugated twisted bilayer graphene structures down to the first magic angle (θ = 1.08°) with high enough accuracy at affordable costs. The band structures are in good agreement with those from tight-binding models, continuum models, plane-wave pseudopotential based ab initio calculations, and experimental observations. This method is also shown to be efficient in twisted double-bilayer graphene and bilayer WSe 2 . We think this two-step method can play a crucial role in other twisted two-dimensional materials, especially those with much more complex band structure and where the effective model is hard to construct.

36 MATERIALS SCIENCE↗

Sparse Linear Algebra Toolkit for Computational Aerodynamics

Finding solutions to sparse linear systems of equations is an essential step in Computational Engineering applications of interest to NASA. Linear systems of equations are composed and solved in almost every computational engineering application. The characteristics of linear systems vary greatly from one application to another. Accordingly, there are a wide variety of methods for the solution of linear systems of equations. The operations and methods prepared by the authors are focused on linear systems of interest to NASA, primarily those associated with Computational Fluid Dynamics (CFD), Aeroelasticity, and Aeroacoustics. The Sparse Linear Algebra Toolkit (SLAT) is a coordinated collection of software featuring operations, methods, and data structures that are useful when solving sparse linear systems of equations on modern computer architectures. The implemented operations and methods are designed and tuned for parallelism in shared memory, in distributed memory, and across the hybrid combination of distributed-shared memory. The toolkit includes novel methods and implementations for modern architectures and facilitates development of new approaches for meeting NASA’s evolving computational engineering challenges using evolving computer architectures that are not available in vendor libraries. In this paper, significant features and interfaces within SLAT are presented and verified for simulations performed with NASA’s CFD solver, FUN3D. The runtime and scaling performance of the Generalized Minimum Residual (GMRES) method implemented in SLAT is analyzed for the linear subproblems within the solution of turbulent Navier-Stokes equations employed in the simulation of high-lift configurations. Prior to this work, the SPARSKIT GMRES implementation was the only Krylov subspace method available within FUN3D. A strong scaling study shows the SLAT GMRES implementation facilitates accurate Reynolds-averaged Navier-Stokes CFD solutions between 15% and 56% faster than the SPARSKIT GMRES implementation.

Stephen L Wood↗

Avoiding Communication in Primal and Dual Block Coordinate Descent Methods

Primal and dual block coordinate descent methods are iterative methods for solving regularized and unregularized optimization problems. Distributed-memory parallel implementations of these methods have become popular in analyzing large machine learning datasets. However, existing implementations communicate at every iteration, which, on modern data center and supercomputing architectures, often dominates the cost of floating-point computation. Recent results on communication-avoiding Krylov subspace methods suggest that large speedups are possible by re-organizing iterative algorithms to avoid communication. We show how applying similar algorithmic transformations can lead to primal and dual block coordinate descent methods that only communicate every $s$ iterations---where $s$ is a tuning parameter---instead of every iteration for the regularized least-squares problem. We show that the communication-avoiding variants reduce the number of synchronizations by a factor of $s$ on distributed-memory parallel machines without altering the convergence rate and attain strong scaling speedups of up to $6.1\times$ over the “standard algorithm" on a Cray XC30 supercomputer.

97 MATHEMATICS AND COMPUTING↗

Krylov Subspace and Multigrid Methods Applied to the Incompressible Navier-Stokes Equations

We consider numerical solution methods for the incompressible Navier-Stokes equations discretized by a finite volume method on staggered grids in general coordinates. We use Krylov subspace and multigrid methods as well as their combinations. Numerical experiments are carried out on a scalar and a vector computer. Robustness and efficiency of these methods are studied. It appears that good methods result from suitable combinations of GCR and multigrid methods.

Vuik, C.↗

An Efficient Sampling-Based Method for Sensitivity and Uncertainty Analysis Through RAVEN

Sensitivity analysis (SA) and uncertainty quantification (UQ) are now widely recognized as essential parts of analyses for complex nuclear systems. Plenty of well-established methodologies are already available for performing SA and UQ, such as Monte Carlo analysis, adjoint-based method, and variance decomposition. The focus of this summary is on developing an efficient sampling-based approach to perform SA and UQ through RAVEN. RAVEN (Risk Analysis and Virtual control Environment) is a software framework able to perform SA and UQ, currently under development at the Idaho National Laboratory. In literature, a number of approaches have been developed to accelerate the process of SA and UQ for large complex systems, such as principal component analysis (PCA) of input space, input-output correlation analysis, and intersection subspace methods. The fundamental idea is to identify the dominant active directions in the parameter space prior to conducting SA and UQ. The premise is that the number of active directions is much less than the dimensionality of input space. In this work, the PCA or Karhunen-Loeve expansion or SVD method is implemented in RAVEN to identify the active directions. This approach is also combined with the forward sampling approaches, such as Monte Carlo, Grid, Latin Hypercube, and Response Surface Design sampling approaches that are currently available in RAVEN, to perform SA and UQ more efficiently. The summary is organized as follows. In the following section, we present the PCA-based forward sampling approach. The effectiveness and efficiency are discussed in the numerical results section. The paper then ends with a concluding summary. In this summary, we have presented PCA-based forward sampling approach to perform SA and UQ. The goal is to reduce the computational overhead for repetitive executions of complex nuclear systems that are generally required when performing SA and UQ. The control of correlations between input parameters is implemented in RAVEN to better represent the input relationships. In addition, we are currently examining our implementations with more realistic models, and we are also focusing on implementation of some new high-dimensional input reduction techniques in RAVEN. (authors)

97 MATHEMATICS AND COMPUTING↗

Fast Simulating High Order Models Application to Micro Electro-Mechanical Systems (MEMS)

The approximation of high order systems by low order models is one of the important problems in system theory. The use of a reduced order model makes it easier to implement analysis, simulations and control system designs. Numerous methods are available in the literature for order reduction of linear continuous systems in time domain as well as in frequency domain. But, this is not the case for non linear systems. The well known Trajectory Piece-Wise Linear approach (TPWL) elaborated to nonlinear model order reduction guarantees a simplification and an accurate representation of the behaviour of strongly non linear systems handling local and global approximation. The present attempt is towards evolving an improvement for the TPWL order reduction technique, which ensures a good quality of approximation combining the advantages of the Krylov subspaces method and the local linearization. We illustrate the technique on a MEMS circuit (Micro Electro-Mechanical System)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A time-parallel method for the solution of PDE-constrained optimization problems

We study a time-parallel approach to solving quadratic optimization problems with linear time-dependent partial differential equation (PDE) constraints. These problems arise in formulations of optimal control, optimal design and inverse problems that are governed by parabolic PDE models. They may also arise as subproblems in algorithms for the solution of optimization problems with nonlinear time-dependent PDE constraints, e.g., in sequential quadratic programming methods. We apply a piecewise linear finite element discretization in space to the PDE constraint, followed by the Crank-Nicolson discretization in time. The objective function is discretized using finite elements in space and the trapezoidal rule in time. At this point in the discretization, auxiliary state variables are introduced at each discrete time interval, with the goal to enable: (i) a decoupling in time; and (ii) a fixed-point iteration to recover the solution of the discrete optimality system. The fixed-point iterative schemes can be used either as preconditioners for Krylov subspace methods or as smoothers for multigrid (in time) schemes. We present promising numerical results for both use cases.

97 MATHEMATICS AND COMPUTING↗

Rapid sampling of stochastic displacements in Brownian dynamics simulations

Here, we present a new method for sampling stochastic displacements in Brownian Dynamics (BD) simulations of colloidal scale particles. The method relies on a new formulation for Ewald summation of the Rotne-Prager-Yamakawa (RPY) tensor, which guarantees that the real-space and wave-space contributions to the tensor are independently symmetric and positive-definite for all possible particle configurations. Brownian displacements are drawn from a superposition of two independent samples: a wave-space (far-field or long-ranged) contribution, computed using techniques from fluctuating hydrodynamics and non-uniform fast Fourier transforms; and a real-space (near-field or short-ranged) correction, computed using a Krylov subspace method. The combined computational complexity of drawing these two independent samples scales linearly with the number of particles. The proposed method circumvents the super-linear scaling exhibited by all known iterative sampling methods applied directly to the RPY tensor that results from the power law growth of the condition number of tensor with the number of particles. For geometrically dense microstructures (fractal dimension equal three), the performance is independent of volume fraction, while for tenuous microstructures (fractal dimension less than three), such as gels and polymer solutions, the performance improves with decreasing volume fraction. This is in stark contrast with other related linear-scaling methods such as the force coupling method and the fluctuating immersed boundary method, for which performance degrades with decreasing volume fraction. Calculations for hard sphere dispersions and colloidal gels are illustrated and used to explore the role of microstructure on performance of the algorithm. In practice, the logarithmic part of the predicted scaling is not observed and the algorithm scales linearly for up to 4×10 6 particles, obtaining speed ups of over an order of magnitude over existing iterative methods, and making the cost of computing Brownian displacements comparable to the cost of computing deterministic displacements in BD simulations. Finally, a high-performance implementation employing non-uniform fast Fourier transforms implemented on graphics processing units and integrated with the software package HOOMD-blue is used for benchmarking.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Low rank approach to computing first and higher order derivatives using automatic differentiation

This manuscript outlines a new approach for increasing the efficiency of applying automatic differentiation (AD) to large scale computational models. By using the principles of the Efficient Subspace Method (ESM), low rank approximations of the derivatives for first and higher orders can be calculated using minimized computational resources. The output obtained from nuclear reactor calculations typically has a much smaller numerical rank compared to the number of inputs and outputs. This rank deficiency can be exploited to reduce the number of derivatives that need to be calculated using AD. The effective rank can be determined according to ESM by computing derivatives with AD at random inputs. Reduced or pseudo variables are then defined and new derivatives are calculated with respect to the pseudo variables. Two different AD packages are used: OpenAD and Rapsodia. OpenAD is used to determine the effective rank and the subspace that contains the derivatives. Rapsodia is then used to calculate derivatives with respect to the pseudo variables for the desired order. The overall approach is applied to two simple problems and to MATWS, a safety code for sodium cooled reactors. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Binary tree eigen solver in finite element analysis

This paper presents a transputer-based binary tree eigensolver for the solution of the generalized eigenproblem in linear elastic finite element analysis. The algorithm is based on the method of recursive doubling, which parallel implementation of a number of associative operations on an arbitrary set having N elements is of the order of o(log2N), compared to (N-1) steps if implemented sequentially. The hardware used in the implementation of the binary tree consists of 32 transputers. The algorithm is written in OCCAM which is a high-level language developed with the transputers to address parallel programming constructs and to provide the communications between processors. The algorithm can be replicated to match the size of the binary tree transputer network. Parallel and sequential finite element analysis programs have been developed to solve for the set of the least-order eigenpairs using the modified subspace method. The speed-up obtained for a typical analysis problem indicates close agreement with the theoretical prediction given by the method of recursive doubling.

Akl, F. A.↗

MODAL FREQUENCY TRACKING: Performance Analysis on Noisy Experimental Ground Test Data

Mechanical devices operating in an environment contaminated by noise, uncertainties, and extraneous disturbances lead to low signal-to-noise-ratios creating an extremely challenging signal processing problem—especially for on-line, realtime, in-flight application. In this report, we discuss a model-based approach to incorporate physical device features into a dynamic structure that can be used to perform on-line tracking of modal frequencies. The approach we take, after pre-processing the raw measurement data, is to obtain a representation of the structural device under test that captures its underlying response to a suite of excitations and operating conditions. One approach is to apply modern system identification techniques based on stochastic subspace methods capable of both: (1) identifying the underlying black-box structure enabling the extraction of structural modes that can be used for analysis; and (2) modal tracking under continued vibrational excitation as in a real-time, in-flight like environment. The vibrational signature of the structural device is measured directly using a suite of tri-axial accelerometers characterizing a multiple input/multiple output (MIMO) dynamic system. In this analysis, we have 15 tri-axial accelerometer measurements or 45 total output channels along with a single excitation also measured with a tri-axial accelerometer providing a 3-input system for processing. We initially describe the experiment and then briefly develop the necessary background in stochastic subspace realization, discuss the algorithm and apply it to the isolated structural device, first, characterized by the set of noisy MIMO accelerometer measurements extracting the modal model from the data (subspace identification), extract the unique modal frequencies (modal coordinate transformation), track their evolution (real-time tracker) to evaluate the overall performance of the processor. Next we evaluate processor performance when the structural device is incorporated into a flight vehicle for further performance analysis. We summarize the results and predict performance.

42 ENGINEERING↗

Parallel eigenanalysis of finite element models in a completely connected architecture

A parallel algorithm is presented for the solution of the generalized eigenproblem in linear elastic finite element analysis, (K)(phi) = (M)(phi)(omega), where (K) and (M) are of order N, and (omega) is order of q. The concurrent solution of the eigenproblem is based on the multifrontal/modified subspace method and is achieved in a completely connected parallel architecture in which each processor is allowed to communicate with all other processors. The algorithm was successfully implemented on a tightly coupled multiple-instruction multiple-data parallel processing machine, Cray X-MP. A finite element model is divided into m domains each of which is assumed to process n elements. Each domain is then assigned to a processor or to a logical processor (task) if the number of domains exceeds the number of physical processors. The macrotasking library routines are used in mapping each domain to a user task. Computational speed-up and efficiency are used to determine the effectiveness of the algorithm. The effect of the number of domains, the number of degrees-of-freedom located along the global fronts and the dimension of the subspace on the performance of the algorithm are investigated. A parallel finite element dynamic analysis program, p-feda, is documented and the performance of its subroutines in parallel environment is analyzed.

Akl, F. A.↗

The tensor t‐function: A definition for functions of third‐order tensors

Summary A definition for functions of multidimensional arrays is presented. The definition is valid for third‐order tensors in the tensor t‐product formalism, which regards third‐order tensors as block circulant matrices. The tensor function definition is shown to have similar properties as standard matrix function definitions in fundamental scenarios. To demonstrate the definition's potential in applications, the notion of network communicability is generalized to third‐order tensors and computed for a small‐scale example via block Krylov subspace methods for matrix functions. A complexity analysis for these methods in the context of tensors is also provided.

Lund, Kathryn↗