Approximation of the Scattering Amplitude using Nonsymmetric Saddle Point Matrices

In this thesis we look at iterative methods for solving the primal (Ax = b) and dual (AT y = g) systems of linear equations to approximate the scattering amplitude defined by gTx =yTb. We use a conjugate gradient-like iteration for a unsymmetric saddle point matrix that is contructed so as to have a real positive spectrum. We find that this method is more consistent than known methods for computing the scattering amplitude such as GLSQR or QMR. Then, we use techniques from matrices, moments, and quadrature to compute the scattering amplitude without solving the system directly

BiLQ: An Iterative Method for Nonsymmetric Linear Systems with a Quasi-Minimum Error Property

We introduce an iterative method named BiLQ for solving general square linear systems Ax = b based on the Lanczos biorthogonalization process defined by least-norm subproblems, and that is a natural companion to BiCG and QMR. Whereas the BiCG (Fletcher, 1976), CGS (Sonneveld, 1989) and BiCGSTAB (van der Vorst, 1992) iterates may not exist when the tridiagonal projection of A is singular, BiLQ is reliable on compatible systems even if A is ill-conditioned or rank deficient. As in the symmetric case, the BiCG residual is often smaller than the BiLQ residual and, when the BiCG iterate exists, an inexpensive transfer from the BiLQ iterate is possible. Although the Euclidean norm of the BiLQ error is usually not monotonic, it is monotonic in a different norm that depends on the Lanczos vectors. We establish a similar property for the QMR (Freund and Nachtigal, 1991) residual. BiLQ combines with QMR to take advantage of two initial vectors and solve a system and an adjoint system simultaneously at a cost similar to that of applying either method. We derive an analogous combination of USYMLQ and USYMQR based on the orthogonal tridiagonalization process (Saunders, Simon, and Yip, 1988). The resulting combinations, named BiLQR and TriLQR, may be used to estimate integral functionals involving the solution of a primal and an adjoint system. We compare BiLQR and TriLQR with Minres-qlp on a related augmented system, which performs a comparable amount of work and requires comparable storage. In our experiments, BiLQR terminates earlier than TriLQR and MINRES-QLP in terms of residual and error of the primal and adjoint systems

Review of Output-Based Error Estimation and Mesh Adaptation in Computational Fluid Dynamics

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/90641/1/AIAA-53965-537.pd

An a posteriori error control framework for adaptive precision optimization using discontinuous Galerkin finite element method

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2005.Includes bibliographical references (leaves 169-178).Introduction: Aerodynamic design optimization has seen significant development over the past decade. Adjoint-based shape design for elliptic systems was first proposed by Pironneau and applied to transonic flow by Jameson . A review of the aerodynamic shape optimization literature and a large list of references is given in. Over the years much technology has been developed, allowing engineers to contemplate applying optimization methods to a wide variety of problems. In the context of structured grids, adjoint-based applications include multipoint, multi-objective airfoil design using compressible Navier-Stokes equations and 3D multipoint design of aircraft configurations using inviscid Euler equations. There have also been significant effort in applying adjoint methods to the unstructured grid setting. In this context, Newman et al., Elliot and Peraire were among the first to develop discrete adjoint approaches for the inviscid Euler equations.by James Ching-ChiPh.D