POD acceleration of fully implicit solver for unsteady nonlinear flows and its application on grid architecture

Authors:
D. Tromeur-Dervout;Y. Vassilevski
Affiliations:
Center for the Development of Parallel Scientific Computing, UMR5208 Université Lyon1-CNRS, Institut Camille Jordan, 15Bd Latarjet, 69622 Villeurbanne, France;Institute of Numerical Mathematics, 8, Gubkina Street, 119991 Moscow, Russia
Venue:
Advances in Engineering Software
Year:
2007

Citing 11
Cited 0

Hybrid Krylov methods for nonlinear systems of equations

SIAM Journal on Scientific and Statistical Computing
Metacomputing

Communications of the ACM
Choosing the forcing terms in an inexact Newton method

SIAM Journal on Scientific Computing - Special issue on iterative methods in numerical linear algebra; selected papers from the Colorado conference
NITSOL: A Newton Iterative Solver for Nonlinear Systems

SIAM Journal on Scientific Computing
A parallel adaptive coupling algorithm for systems of differential equations

Journal of Computational Physics
Dynamic Iteration Using Reduced Order Models: A Method for Simulation of Large Scale Modular Systems

SIAM Journal on Numerical Analysis
High Performance Computing on Heterogeneous Clusters with the Madeleine II Communication Library

Cluster Computing
A Client/Server Approach for HPC Applications within a Networking Environment

HPCN Europe 1998 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
The Globus Project: A Status Report

HCW '98 Proceedings of the Seventh Heterogeneous Computing Workshop
Efficient metacomputing of elliptic linear and non-linear problems

Journal of Parallel and Distributed Computing - Special issue on computational grids
A New Look at Proper Orthogonal Decomposition

SIAM Journal on Numerical Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

A method for the acceleration of a fully implicit solution of nonlinear unsteady boundary value problem is presented. The principle of acceleration is for provide to the inexact Newton backtracking method a better initial guess, for the current time step, than the conventional choice from the previous time step. This initial guess is built on the reduced model obtained by a proper orthogonal decomposition of solutions at the previous time steps. This approach is appealing to GRID computing: spare processors may help to improve the numerical efficiency and to manage the computing in a reliable way.