A Perturbed Iterative Method for a General Class of Variational Inequalities

The generalized Wiener-Hopf equation and the approximation methods are used to propose a perturbed iterative method to compute the solutions of a general class of nonlinear variational inequalities.

Perturbed Proximal Point Algorithm with Nonquadratic Kernel

Let H be a real Hilbert space and T be a maximal monotone operator on H. A well-known algorithm, developed by R. T. Rockafellar [16], for solving the problem (P) ”To find x ∈ H such that 0 ∈ T x” is the proximal point algorithm. Several generalizations have been considered by several authors: introduction of a perturbation, introduction of a variable metric in the perturbed algorithm, introduction of a pseudo-metric in place of the classical regularization, . . . We summarize some of these extensions by taking simultaneously into account a pseudo-metric as regularization and a perturbation in an inexact version of the algorithm.

A Recession Notion for a Class of Monotone Bivariate Functions

Using monotone bifunctions, we introduce a recession concept for general equilibrium problems relying on a variational convergence notion. The interesting purpose is to extend some results of P. L. Lions on variational problems. In the process we generalize some results by H. Brezis and H. Attouch relative to the convergence of the resolvents associated with maximal monotone operators.

The Perturbed Generalized Tikhonov's Algorithm

We work on the research of a zero of a maximal monotone operator on a real Hilbert space. Following the recent progress made in the context of the proximal point algorithm devoted to this problem, we introduce simultaneously a variable metric and a kind of relaxation in the perturbed Tikhonov’s algorithm studied by P. Tossings. So, we are led to work in the context of the variational convergence theory.

Epiconvergence D'une Suite De Sommes En Niveaux De Fonctions Convexes

We consider the problem of minimizing the max of two convex functions from both approximation and sensitivity point of view.This lead up to study the epiconvergence of a sequence of level sums of convex functions and the related dual problems.

Perturbations of Critical Values in Nonsmooth Critical Point Theory

* Supported by Ministero dell’Università e della Ricerca Scientifica e Tecnologica (40% – 1993). ** Supported by Ministero dell’Università e della Ricerca Scientifica e Tecnologica (40% – 1993).

Acceleration of Convergence in Dontchev’s Iterative Method for Solving Variational Inclusions

2000 Mathematics Subject Classification: 47H04, 65K10.

Convergence of the mass-transport steepest descent scheme for the sub-critical Patlak-Keller-Segel model

Variational steepest descent approximation schemes for the modified Patlak-Keller-Segel equation with a logarithmic interaction kernel in any dimension are considered. We prove the convergence of the suitably interpolated in time implicit Euler scheme, defined in terms of the Euclidean Wasserstein distance, associated to this equation for sub-critical masses. As a consequence, we recover the recent result about the global in time existence of weak-solutions to the modified Patlak-Keller-Segel equation for the logarithmic interaction kernel in any dimension in the sub-critical case. Moreover, we show how this method performs numerically in one dimension. In this particular case, this numerical scheme corresponds to a standard implicit Euler method for the pseudo-inverse of the cumulative distribution function. We demonstrate its capabilities to reproduce easily without the need of mesh-refinement the blow-up of solutions for super-critical masses.

Conditioning and preconditioning of the variational data assimilation problem

Numerical weather prediction (NWP) centres use numerical models of the atmospheric flow to forecast future weather states from an estimate of the current state. Variational data assimilation (VAR) is used commonly to determine an optimal state estimate that miminizes the errors between observations of the dynamical system and model predictions of the flow. The rate of convergence of the VAR scheme and the sensitivity of the solution to errors in the data are dependent on the condition number of the Hessian of the variational least-squares objective function. The traditional formulation of VAR is ill-conditioned and hence leads to slow convergence and an inaccurate solution. In practice, operational NWP centres precondition the system via a control variable transform to reduce the condition number of the Hessian. In this paper we investigate the conditioning of VAR for a single, periodic, spatially-distributed state variable. We present theoretical bounds on the condition number of the original and preconditioned Hessians and hence demonstrate the improvement produced by the preconditioning. We also investigate theoretically the effect of observation position and error variance on the preconditioned system and show that the problem becomes more ill-conditioned with increasingly dense and accurate observations. Finally, we confirm the theoretical results in an operational setting by giving experimental results from the Met Office variational system.

A variational method to retrieve the extinction profile in liquid clouds using multiple field-of-view lidar

Liquid clouds play a profound role in the global radiation budget but it is difficult to remotely retrieve their vertical profile. Ordinary narrow field-of-view (FOV) lidars receive a strong return from such clouds but the information is limited to the first few optical depths. Wideangle multiple-FOV lidars can isolate radiation scattered multiple times before returning to the instrument, often penetrating much deeper into the cloud than the singly-scattered signal. These returns potentially contain information on the vertical profile of extinction coefficient, but are challenging to interpret due to the lack of a fast radiative transfer model for simulating them. This paper describes a variational algorithm that incorporates a fast forward model based on the time-dependent two-stream approximation, and its adjoint. Application of the algorithm to simulated data from a hypothetical airborne three-FOV lidar with a maximum footprint width of 600m suggests that this approach should be able to retrieve the extinction structure down to an optical depth of around 6, and total opticaldepth up to at least 35, depending on the maximum lidar FOV. The convergence behavior of Gauss-Newton and quasi-Newton optimization schemes are compared. We then present results from an application of the algorithm to observations of stratocumulus by the 8-FOV airborne “THOR” lidar. It is demonstrated how the averaging kernel can be used to diagnose the effective vertical resolution of the retrieved profile, and therefore the depth to which information on the vertical structure can be recovered. This work enables exploitation of returns from spaceborne lidar and radar subject to multiple scattering more rigorously than previously possible.

Discontinuous Galerkin methods for the p-biharmonic equation from a discrete variational perspective

We study discontinuous Galerkin approximations of the p-biharmonic equation for p∈(1,∞) from a variational perspective. We propose a discrete variational formulation of the problem based on an appropriate definition of a finite element Hessian and study convergence of the method (without rates) using a semicontinuity argument. We also present numerical experiments aimed at testing the robustness of the method.

Conditioning of the weak-constraint variational data assimilation problem for numerical weather prediction

4-Dimensional Variational Data Assimilation (4DVAR) assimilates observations through the minimisation of a least-squares objective function, which is constrained by the model flow. We refer to 4DVAR as strong-constraint 4DVAR (sc4DVAR) in this thesis as it assumes the model is perfect. Relaxing this assumption gives rise to weak-constraint 4DVAR (wc4DVAR), leading to a different minimisation problem with more degrees of freedom. We consider two wc4DVAR formulations in this thesis, the model error formulation and state estimation formulation. The 4DVAR objective function is traditionally solved using gradient-based iterative methods. The principle method used in Numerical Weather Prediction today is the Gauss-Newton approach. This method introduces a linearised `inner-loop' objective function, which upon convergence, updates the solution of the non-linear `outer-loop' objective function. This requires many evaluations of the objective function and its gradient, which emphasises the importance of the Hessian. The eigenvalues and eigenvectors of the Hessian provide insight into the degree of convexity of the objective function, while also indicating the difficulty one may encounter while iterative solving 4DVAR. The condition number of the Hessian is an appropriate measure for the sensitivity of the problem to input data. The condition number can also indicate the rate of convergence and solution accuracy of the minimisation algorithm. This thesis investigates the sensitivity of the solution process minimising both wc4DVAR objective functions to the internal assimilation parameters composing the problem. We gain insight into these sensitivities by bounding the condition number of the Hessians of both objective functions. We also precondition the model error objective function and show improved convergence. We show that both formulations' sensitivities are related to error variance balance, assimilation window length and correlation length-scales using the bounds. We further demonstrate this through numerical experiments on the condition number and data assimilation experiments using linear and non-linear chaotic toy models.

Convergent variational calculation of positronium-hydrogen-atom scattering lengths

We present a convergent variational basis-set calculational scheme for elastic scattering of the positronium atom by the hydrogen atom in S wave. Highly correlated trial functions with appropriate symmetry are needed to achieve convergence. We report convergent results for scattering lengths in atomic units for both singlet (= 3.49 +/-0.20) and triplet (= 2.46 +/-0.10) states.

Self-consistent equilibrium calculation through a direct variational technique in tokamak plasmas

A self-consistent equilibrium calculation, valid for arbitrary aspect ratio tokamaks, is obtained through a direct variational technique that reduces the equilibrium solution, in general obtained from the 2D Grad-Shafranov equation, to a 1D problem in the radial flux coordinate rho. The plasma current profile is supposed to have contributions of the diamagnetic, Pfirsch-Schluter and the neoclassical ohmic and bootstrap currents. An iterative procedure is introduced into our code until the flux surface averaged toroidal current density (J(T)), converges to within a specified tolerance for a given pressure profile and prescribed boundary conditions. The convergence criterion is applied between the (J(T)) profile used to calculate the equilibrium through the variational procedure and the one that results from the equilibrium and given by the sum of all current components. The ohmic contribution is calculated from the neoclassical conductivity and from the self-consistently determined loop voltage in order to give the prescribed value of the total plasma current. The bootstrap current is estimated through the full matrix Hirshman-Sigmar model with the viscosity coefficients as proposed by Shaing, which are valid in all plasma collisionality regimes and arbitrary aspect ratios. The results of the self-consistent calculation are presented for the low aspect ratio tokamak Experimento Tokamak Esferico. A comparison among different models for the bootstrap current estimate is also performed and their possible Limitations to the self-consistent calculation is analysed.

Variational iterative method for scattering problems

A parameter-free variational iterative method is proposed for scattering problems. The present method yields results that are far better, in convergence, stability and precision, than any other momentum space method. Accurate result is obtained for the atomic exponential (Yukawa) potential with an estimated error of less than 1 in 1015 (1010) after some 13 (10) iterations.