skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Hessian-based model reduction for large-scale systems with initial condition inputs.

Abstract

No abstract prepared.

Authors:
 [1]; ; ;  [2]
+ Show Author Affiliations
  1. (University of Texas at Austin, Austin, TX)
  2. (Massachusetts Institute of Technology, Cambridge, MA)
Publication Date:
Research Org.:
Sandia National Laboratories
Sponsoring Org.:
USDOE
OSTI Identifier:
908882
Report Number(s):
SAND2007-0017J
TRN: US200722%%807
DOE Contract Number:
AC04-94AL85000
Resource Type:
Journal Article
Resource Relation:
Journal Name: Proposed for publication in the International Journal for Numerical Methods in Engineering.
Country of Publication:
United States
Language:
English
Subject:
42 ENGINEERING; 99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; MATHEMATICAL MODELS; MECHANICAL STRUCTURES; SYSTEMS ANALYSIS

Citation Formats

Ghattas, Omar, van Bloemen Waanders, Bart Gustaaf, Hill, J. C., and Bashir, O.. Hessian-based model reduction for large-scale systems with initial condition inputs.. United States: N. p., 2007. Web.
Copy to clipboard
Ghattas, Omar, van Bloemen Waanders, Bart Gustaaf, Hill, J. C., & Bashir, O.. Hessian-based model reduction for large-scale systems with initial condition inputs.. United States.
Copy to clipboard
Ghattas, Omar, van Bloemen Waanders, Bart Gustaaf, Hill, J. C., and Bashir, O.. Mon . "Hessian-based model reduction for large-scale systems with initial condition inputs.". United States. doi:.
Copy to clipboard
@article{osti_908882,
title = {Hessian-based model reduction for large-scale systems with initial condition inputs.},
author = {Ghattas, Omar and van Bloemen Waanders, Bart Gustaaf and Hill, J. C. and Bashir, O.},
abstractNote = {No abstract prepared.},
doi = {},
journal = {Proposed for publication in the International Journal for Numerical Methods in Engineering.},
number = ,
volume = ,
place = {United States},
year = {Mon Jan 01 00:00:00 EST 2007},
month = {Mon Jan 01 00:00:00 EST 2007}
}
Copy to clipboard
Journal Article:
Other availability
Find in Google Scholar Find in Google Scholar
Search WorldCat Search WorldCat to find libraries that may hold this journal
Save / Share:
Export Metadata
Save to My Library
You must Sign In or Create an Account in order to save documents to your library.

  • ; ; ; ... - SIAM Journal on Scientific Computing
    We consider the problem of estimating the uncertainty in large-scale linear statistical inverse problems with high-dimensional parameter spaces within the framework of Bayesian inference. When the noise and prior probability densities are Gaussian, the solution to the inverse problem is also Gaussian, and is thus characterized by the mean and covariance matrix of the posterior probability density. Unfortunately, explicitly computing the posterior covariance matrix requires as many forward solutions as there are parameters, and is thus prohibitive when the forward problem is expensive and the parameter dimension is large. However, for many ill-posed inverse problems, the Hessian matrix of themore » data misfit term has a spectrum that collapses rapidly to zero. We present a fast method for computation of an approximation to the posterior covariance that exploits the lowrank structure of the preconditioned (by the prior covariance) Hessian of the data misfit. Analysis of an infinite-dimensional model convection-diffusion problem, and numerical experiments on large-scale 3D convection-diffusion inverse problems with up to 1.5 million parameters, demonstrate that the number of forward PDE solves required for an accurate low-rank approximation is independent of the problem dimension. This permits scalable estimation of the uncertainty in large-scale ill-posed linear inverse problems at a small multiple (independent of the problem dimension) of the cost of solving the forward problem.« less

  • ; ; ; ... - Linear Algebra and its Applcations
    Abstract not provided.

  • ; - Physical Review D
    Cited by 3

  • ; - Physical Review D
    There is an apparent power deficit relative to the Λ CDM prediction of the cosmic microwave background spectrum at large scales, which, though not yet statistically significant, persists from WMAP to Planck data. Proposals that invoke some form of initial condition for the inflation have been made to address this apparent power suppression, albeit with conflicting conclusions. By studying the curvature perturbations of a scalar field in the Friedmann-Lemaître-Robertson-Walker universe parameterized by the equation of state parameter w, we find that the large-scale spectrum at the end of inflation reflects the superhorizon spectrum of the initial state. The large-scale spectrummore » is suppressed if the universe begins with the adiabatic vacuum in a superinflation (w < –1) or positive-pressure (w > 0) era. In the latter case, there is however no causal mechanism to establish the initial adiabatic vacuum. On the other hand, as long as the universe begins with the adiabatic vacuum in an era with –1 < w < 0, even if there exists an intermediate positive-pressure era, the large-scale spectrum would be enhanced rather than suppressed. In conclusion, we further calculate the spectrum of a two-stage inflation model with a two-field potential and show that the result agrees with that obtained from the ad hoc single-field analysis.« less
    Cited by 3

  • ; ; ; ... - International Journal of High Performance Computing and Networking, vol. 4, no. 3-2, June 1, 2006, pp. 122-136
    Efficient algorithms for reduction operations across a group of processes are crucial for good performance in many large-scale, parallel scientific applications. While previous algorithms limit processing to the host CPU, we utilize the programmable processors and local memory available on modern cluster network interface cards (NICs) to explore a new dimension in the design of reduction algorithms. In this paper, we present the benefits and challenges, design issues and solutions, analytical models, and experimental evaluations of a family of NIC-based reduction algorithms. Performance and scalability evaluations were conducted on the ASCI Linux Cluster (ALC), a 960-node, 1920-processor machine at Lawrencemore » Livermore National Laboratory, which uses the Quadrics QsNet interconnect. We find NIC-based reductions on modern interconnects to be more efficient than host-based implementations in both scalability and consistency. In particular, at large-scale--1812 processes--NIC-based reductions of small integer and floating-point arrays provided respective speedups of 121% and 39% over the host-based, production-level MPI implementation.« less