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

Title: General-Purpose Algorithms for Large-Scale Time-Periodic Flow Problems.


Abstract not provided.

Publication Date:
Research Org.:
Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
Sponsoring Org.:
USDOE National Nuclear Security Administration (NNSA)
OSTI Identifier:
Report Number(s):
DOE Contract Number:
Resource Type:
Resource Relation:
Conference: Proposed for presentation at the SIAM Dynamical Systems conference held May 28 - June 1, 2007 in Snowbird, UT.
Country of Publication:
United States

Citation Formats

Salinger, Andrew G., and Phipps, Eric Todd. General-Purpose Algorithms for Large-Scale Time-Periodic Flow Problems.. United States: N. p., 2007. Web.
Salinger, Andrew G., & Phipps, Eric Todd. General-Purpose Algorithms for Large-Scale Time-Periodic Flow Problems.. United States.
Salinger, Andrew G., and Phipps, Eric Todd. Tue . "General-Purpose Algorithms for Large-Scale Time-Periodic Flow Problems.". United States. doi:.
title = {General-Purpose Algorithms for Large-Scale Time-Periodic Flow Problems.},
author = {Salinger, Andrew G. and Phipps, Eric Todd},
abstractNote = {Abstract not provided.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Tue May 01 00:00:00 EDT 2007},
month = {Tue May 01 00:00:00 EDT 2007}

Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share:
  • A software development and testing system is being used to support the operation and experimental utilization of a large-scale electrical distribution automation system. The testing system provides the mechanisms to simulate the characteristics of both the large-scale control system and the electrical distribution system that is being controlled.
  • In this talk we investigate the performance of interior-point and pivoting algorithms for the solution of large-scale monotone LCP`s and mixed LCPs. These techniques are also applied to the solution of linear least squares problems, separable convex quadratic programs, elliptic partial differential equations and spatial equilibrium models by exploiting their equivalent complementarity problems. Hybrid algorithms combining these two types of techniques are also introduced to deal with some of these problems.
  • We discuss issues that affect the performance of algorithms for the solution of large-scale bound constrained problems on parallel computers. The discussion centers on the solution of the elastic-plastic torsion problem and the journal bearing problem. These two problems are model large-scale quadratic programming problems that arise as finite element approximations to elliptic variational inequalities. Performance issues are illustrated with the GPCG algorithm of More and Toraldo. This algorithm uses the gradient projection method to select an active set and the conjugate gradient method to explore the active set defined by the current iterate. We show that significant improvements inmore » the performance of the GPCG algorithm can be obtained by using partitioning techniques in a parallel environment. We also show that these partitioning techniques lead to almost linear speedups on function-gradient evaluations and Hessian-vector products for partially separable functions. 12 refs., 2 figs., 8 tabs.« less
  • We have developed a large scale sequential quadratic programming (SQP) code based on an interior-point method for solving general (convex or nonconvex) quadratic programs (QP). We often halt this QP solver prematurely by employing a trust-region strategy. This procedure typically reduces the overall cost of the code. In this talk we briefly review the algorithm and some of its theoretical justification and then discuss recent enhancements including automatic procedures for both increasing and decreasing the parameter in the merit function, a regularization procedure for dealing with linearly dependent active constraint gradients, and a method for modifying the linearized equality constraints.more » Some numerical results on a significant set of {open_quotes}real-world{close_quotes} problems will be presented.« less