Preconditioned Pseudo-time Continuation for Parameterized Inverse Problems
Explore the source record for details and available documents.
SEARCH · Engineering Papers
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.
Explore the source record for details and available documents.
MueLu is intended for the research and development of multigrid algorithms used in the solution of sparse linear systems arising from systems of partial differential equations. The software provides multigrid source code, test programs, and short example programs to demonstrate the various interfaces for creating, accessing, and applying the solvers. MueLu currently provides an implementation of smoothed aggregation algebraic multigrid method and interfaces to many commonly used smoothers. However, the software is intended to be extensible, and new methods can be incorporated easily. MueLu also allows for advanced usage, such as combining multiple methods and segregated solves. The library supports point and block access to matrix data. All algorithms and methods in MueLu have been or will be published in the open scientific literature.
Abstract The Weddell Sea polynya is a large opening in the open-ocean sea ice cover associated with intense deep convection in the ocean. A necessary condition to form and maintain a polynya is the presence of a strong subsurface heat reservoir. This study investigates the processes that control the stratification and hence the buildup of the subsurface heat reservoir in the Weddell Sea. To do so, a climate model run for 200 years under preindustrial forcing with two eddying resolutions in the ocean (0.25° CM2.5 and 0.10° CM2.6) is investigated. Over the course of the simulation, CM2.6 develops two polynyas in the Weddell Sea, while CM2.5 exhibits quasi-continuous deep convection but no polynyas, exemplifying that deep convection is not a sufficient condition for a polynya to occur. CM2.5 features a weaker subsurface heat reservoir than CM2.6 owing to weak stratification associated with episodes of gravitational instability and enhanced vertical mixing of heat, resulting in an erosion of the reservoir. In contrast, in CM2.6, the water column is more stably stratified, allowing the subsurface heat reservoir to build up. The enhanced stratification in CM2.6 arises from its refined horizontal grid spacing and resolution of topography, which allows, in particular, a better representation of the restratifying effect by transient mesoscale eddies and of the overflows of dense waters along the continental slope.
Not Available
Abstract not provided.
An accurate implementation of glued mechanical contact was developed in MOOSE based on its Constraint system. This approach results in a superior convergence of elastic structure problems, in particular in BISON. Adaptation of this technique to frictionless and frictional contact models is under way. Additionally, the improved convergence of elastic problems results from the application of the split-based preconditioners to constraint-based systems. This yields a substantial increase in the robustness of elastic solvers when the number of nodes in contact is increased and/or the mesh is refined.
We present a parallelizable direct method for computing the solution to graph Laplacian-based linear systems derived from graphs that can be hierarchically bipartitioned with small edge cuts. For a graph of size n with constant-size edge cuts, our method decomposes a graph Laplacian in time O(n log n), and then uses that decomposition to perform a linear solve in time O(n log n). We then use the developed technique to design a preconditioner for graph Laplacians that do not have this property. Finally, we augment this preconditioner with a two-grid method that accounts for much of the preconditioner's weaknesses. We present an analysis of this method, as well as a general theorem for the condition number of a general class of two-grid support graph-based preconditioners. Numerical experiments illustrate the performance of the studied methods.
In this study, we present spectral equivalence results for higher-order tensor product edge-, face- and interior-based finite elements. Specifically, we show for certain choices of shape functions that the mass and stiffness matrices of the higher-order elements are spectrally equivalent to those for an assembly of lowest-order elements on the associated Gauss-Lobatto-Legendre mesh. Based on this equivalence, efficient preconditioners can be designed with favorable computational complexity. Numerical results are presented which confirm the theory and demonstrate the benefits of the equivalence results for overlapping Schwarz preconditioners.
A study was performed to identify a method to minimize the effect of a linear time-invariant (LTI) system impulse response on an input. Three methods were studied: Wiener filter, the N4SID algorithm and transfer function estimation, the latter two using functions from MATLAB’s System Identification Toolbox. Although all three methods were able estimate an unknown forward impulse response given an input/output time series pair, only the Wiener filter was able to estimate a system inverse which satisfactorily solved the problem using a cosine similarity measure.
Abstract not provided.
Abstract not provided.
A graph is a mathematical representation of a network; we say it consists of a set of vertices, which are connected by edges. Graphs have numerous applications in various fields, as they can model all sorts of connections, processes, or relations. For example, graphs can model intricate transit systems or the human nervous system. However, graphs that are large or complicated become difficult to analyze. This is why there is an increased interest in the area of graph partitioning, reducing the size of the graph into multiple partitions. For example, partitions of a graph representing a social network might help identify clusters of friends or colleagues. Graph partitioning is also a widely used approach to load balancing in parallel computing. The partitioning of a graph is extremely useful to decompose the graph into smaller parts and allow for easier analysis. There are different ways to solve graph partitioning problems. For this work, we focus on a spectral partitioning method which forms a partition based upon the eigenvectors of the graph Laplacian (details presented in Acer, et. al.). This method uses the LOBPCG algorithm to compute these eigenvectors. LOBPCG can be accelerated by an operator called a preconditioner. For this internship, we evaluate a randomized Cholesky (rchol) preconditioner for its effectiveness on graph partitioning problems with LOBPCG. We compare it with two standard preconditioners: Jacobi and Incomplete Cholesky (ichol). This research was conducted from August to December 2021 in conjunction with Sandia National Laboratories.
The goal is to apply principles of linear/nonlinear solvers to lab applications.
Graph partitioning has emerged as an area of interest due to its use in various applications in computational research. One way to partition a graph is to solve for the eigenvectors of the corresponding graph Laplacian matrix. This project focuses on the eigensolver LOBPCG and the evaluation of a new preconditioner: Randomized Cholesky Factorization (rchol). This proconditioner was tested for its speed and accuracy against other well-known preconditioners for the method. After experiments were run on several known test matrices, rchol appears to be a better preconditioner for structured matrices. This research was sponsored by National Nuclear Security Administration Minority Serving Institutions Internship Program (NNSA-MSIIP) and completed at host facility Sandia National Laboratories. As such, after discussion of the research project itself, this report contains a brief reflection on experience gained as a result of participating in the NNSA-MSIIP.
The purpose of this protocol is to bring metal halide perovskite (MHP) modules to a repeatable and relevant state prior to making a performance measurement. Performance measurements are made before and after a stressor has been applied to the module to quantify the degree of loss resulting from the stressor. This procedure is intended to be carried out both before and after the accelerated test.
Abstract not provided.