Results 1  10
of
35
Pseudotransient continuation and differentialalgebraic equations
 SIAM J. Sci. Comp
, 2003
"... Abstract. Pseudotransient continuation is a practical technique for globalizing the computation of steadystate solutions of nonlinear differential equations. The technique employs adaptive timestepping to integrate an initial value problem derived from an underlying ODE or PDE boundary value prob ..."
Abstract

Cited by 23 (8 self)
 Add to MetaCart
Abstract. Pseudotransient continuation is a practical technique for globalizing the computation of steadystate solutions of nonlinear differential equations. The technique employs adaptive timestepping to integrate an initial value problem derived from an underlying ODE or PDE boundary value problem until sufficient accuracy in the desired steadystate root is achieved to switch over to Newton’s method and gain a rapid asymptotic convergence. The existing theory for pseudotransient continuation includes a global convergence result for differential equations written in semidiscretized methodoflines form. However, many problems are better formulated or can only sensibly be formulated as differentialalgebraic equations (DAEs). These include systems in which some of the equations represent algebraic constraints, perhaps arising from the spatial discretization of a PDE constraint. Multirate systems, in particular, are often formulated as differentialalgebraic systems to suppress fast time scales (acoustics, gravity waves, Alfven waves, near equilibrium chemical oscillations, etc.) that are irrelevant on the dynamical time scales of interest. In this paper we present a global convergence result for pseudotransient continuation applied to DAEs of index 1, and we illustrate it with numerical experiments on model incompressible flow and reacting flow problems, in which a constraint is employed to step over acoustic waves.
Domain decomposition preconditioners for linear–quadratic elliptic optimal control problems
, 2004
"... ABSTRACT. We develop and analyze a class of overlapping domain decomposition (DD) preconditioners for linearquadratic elliptic optimal control problems. Our preconditioners utilize the structure of the optimal control problems. Their execution requires the parallel solution of subdomain linearquad ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
ABSTRACT. We develop and analyze a class of overlapping domain decomposition (DD) preconditioners for linearquadratic elliptic optimal control problems. Our preconditioners utilize the structure of the optimal control problems. Their execution requires the parallel solution of subdomain linearquadratic elliptic optimal control problems, which are essentially smaller subdomain copies of the original problem. This work extends to optimal control problems the application and analysis of overlapping DD preconditioners, which have been used successfully for the solution of single PDEs. We prove that for a class of problems the performance of the twolevel versions of our preconditioners is independent of the mesh size and of the subdomain size. 1.
PARALLEL ALGORITHMS FOR FLUIDSTRUCTURE INTERACTION PROBLEMS IN HAEMODYNAMICS
"... Abstract. The increasing computational load required by most applications and the limits in hardware performances affecting scientific computing contributed in the last decades to the development of parallel software and architectures. In FluidStructure Interaction (FSI, in short) for haemodynamic ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
Abstract. The increasing computational load required by most applications and the limits in hardware performances affecting scientific computing contributed in the last decades to the development of parallel software and architectures. In FluidStructure Interaction (FSI, in short) for haemodynamic applications, parallelization and scalability are key issues (see [20]). In this work we introduce a class of parallel preconditioners for the FSI problem obtained by exploiting the blockstructure of the linear system. We stress the possibility of extending the approach to a general linear system with a blockstructure, then we provide a bound in the condition number of the preconditioned system in terms of the conditioning of the preconditioned diagonal blocks, finally we show that the construction and evaluation of the devised preconditioner is modular. The preconditioners are tested on a benchmark 3D geometry discretized in both a coarse and a fine mesh, as well as on two physiological aorta geometries. The simulations that we have performed show an advantage in using the block preconditioners introduced and confirm our theoretical results.
A nonlinear dual domain decomposition method: application to structural problems with damage, international journal of multiscale computational engineering 6
 tel00634507, version 1  21 Oct 2011
, 2008
"... damage ..."
On Linear Monotone Iteration And Schwarz Methods For Nonlinear Elliptic PDEs
"... . The Schwarz Alternating Method can be used to solve elliptic boundary value problems on domains which consist of two or more overlapping subdomains. The solution is approximated by an infinite sequence of functions which results from solving a sequence of elliptic boundary value problems in each o ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
. The Schwarz Alternating Method can be used to solve elliptic boundary value problems on domains which consist of two or more overlapping subdomains. The solution is approximated by an infinite sequence of functions which results from solving a sequence of elliptic boundary value problems in each of the subdomains. In this paper, proofs of convergence of some Schwarz Alternating Methods for nonlinear elliptic problems which are known to have solutions by the monotone method (also known as the method of subsolutions and supersolutions) are given. In particular, an additive Schwarz method for scalar as well some coupled nonlinear PDEs are shown to converge to some solution on finitely many subdomains, even when multiple solutions are possible. In the coupled system case, each subdomain PDE is linear, decoupled and can be solved concurrently with other subdomain PDEs. These results are applicable to several models in population biology. Key words. domain decomposition, nonlinear elliptic PDE, Schwarz alternating method, monotone methods, subsolution, supersolution AMS subject classifications. 65N55, 65J15 1.
Parallel multilevel restricted Schwarz preconditioners with pollution removing for PDEconstrained optimization
 SIAM J. Sci. Comput
"... Abstract. We develop a class of Vcycle type multilevel restricted additive Schwarz (RAS) methods and study the numerical and parallel performance of the new fully coupled methods for solving large sparse Jacobian systems arising from the discretization of some optimization problems constrained by n ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Abstract. We develop a class of Vcycle type multilevel restricted additive Schwarz (RAS) methods and study the numerical and parallel performance of the new fully coupled methods for solving large sparse Jacobian systems arising from the discretization of some optimization problems constrained by nonlinear partial differential equations. Straightforward extensions of the onelevel RAS to multilevel do not work due to the pollution effects of the coarse interpolation. We then introduce, in this paper, a pollution removing coarsetofine interpolation scheme for one of the components of the multicomponent linear system, and show numerically that the combination of the new interpolation scheme with the RAS smoothed multigrid method provides an effective family of techniques for solving rather difficult PDEconstrained optimization problems. Numerical examples involving the boundary control of incompressible NavierStokes flows are presented in detail. Key words. Schwarz preconditioners, domain decomposition, multilevel methods, parallel computing, partial differential equations constrained optimization, inexact Newton, flow control. 1. Introduction. There are two major families of Newton techniques for solving nonlinear optimization problems: reduced space methods, characterized by the partition of the problem into smaller ones at each Newton step, and full space ones. As
Using domain decomposition in the JacobiDavidson method
, 2000
"... The JacobiDavidson method is suitable for computing solutions of large ndimensional eigenvalue problems. It needs (approximate) solutions of specific ndimensional linear systems. Here we propose a strategy based on a nonoverlapping domain decomposition technique in order to reduce the wall clock ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The JacobiDavidson method is suitable for computing solutions of large ndimensional eigenvalue problems. It needs (approximate) solutions of specific ndimensional linear systems. Here we propose a strategy based on a nonoverlapping domain decomposition technique in order to reduce the wall clock time and local memory requirements. For a model eigenvalue problem we derive optimal coupling parameters. Numerical experiments show the effect of this approach on the overall JacobiDavidson process. The implementation of the eventual process on a parallel computer is beyond the scope of this paper. 2000 Mathematics Subject Classification: 65F15, 65N25, 65N55. Keywords and Phrases: Eigenvalue problems, domain decomposition, JacobiDavidson, Schwarz method, nonoverlapping, iterative methods. Note: The first author's contribution was carried out partly under project MAS2, and sponsored by the Netherlands Organization for Scientific Research (NWO) under Grant No. 611302100. Note: This wo...
Using Automatic Differentiation for SecondOrder Matrixfree Methods in PDEconstrained Optimization
, 2000
"... Classical methods of constrained optimization are often based on the assumptions that projection onto the constraint manifold is routine but accessing secondderivative information is not. Both assumptions need revision for the application of optimization to systems constrained by partial differe ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Classical methods of constrained optimization are often based on the assumptions that projection onto the constraint manifold is routine but accessing secondderivative information is not. Both assumptions need revision for the application of optimization to systems constrained by partial differential equations, in the contemporary limit of millions of state variables and in the parallel setting. Largescale PDE solvers are complex pieces of software that exploit detailed knowledge of architecture and application and cannot easily be modified to fit the interface requirements of a blackbox optimizer. Furthermore, in view of the expense of PDE analyses, optimization methods not using second derivatives may require too many iterations to be practical. For general problems, automatic differentiation is likely to be the most convenient means of exploiting second derivatives. We delineate a role for automatic differentiation in matrixfree optimization formulations involving Newto...
ROBUST MULTISCALE ITERATIVE SOLVERS FOR NONLINEAR FLOWS IN HIGHLY HETEROGENEOUS MEDIA
"... Abstract. In this paper, we study robust iterative solvers for finite element systems resulting in approximation of steadystate Richards ’ equation in porous media with highly heterogeneous conductivity fields. It is known that in such cases the contrast, ratio between the highest and lowest values ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. In this paper, we study robust iterative solvers for finite element systems resulting in approximation of steadystate Richards ’ equation in porous media with highly heterogeneous conductivity fields. It is known that in such cases the contrast, ratio between the highest and lowest values of the conductivity, can adversely affect the performance of the preconditioners and, consequently, a design of robust preconditioners is important for many practical applications. Theproposediterativesolversconsistoftwokindsofiterations, outerandinneriterations. Outer iterations are designed to handle nonlinearities by linearizing the equation around the previous solution state. As a result of the linearization, a largescale linear system needs to be solved. This linear system is solved iteratively (called inner iterations), and since it can have large variations in the coefficients, a robust preconditioner is needed. First, we show that under some assumptions the number of outer iterations is independent of the contrast. Second, based on the recently developed iterative methods (see [15, 17]), we construct a class of preconditioners that yields convergence rate that is independent of the contrast. Thus, the proposed iterative solvers are optimal with respect to the large variation in the physical parameters. Since the same preconditioner can be reused in every outer iteration, this provides an additional computational savings in the overall solution process. Numerical tests are presented to confirm the theoretical results. 1.