arXiv subjects

Harbir Antil

Publications and source records attributed to Harbir Antil.

121 records · Page 7Linked to original sources

arXiv2016

Optimizing the Kelvin force in a moving target subdomain

In order to generate a desired Kelvin (magnetic) force in a target subdomain moving along a prescribed trajectory, we propose a minimization problem with a tracking type cost functional. We use the so-called dipole approximation to realize the magnetic field, where the location and the direction of the magnetic sources are assumed to be fixed. The magnetic field intensity acts as the control and exhibits limiting pointwise constraints. We address two specific problems: the first one corresponds to a fixed final time whereas the second one deals with an unknown force to minimize the final time. We prove existence of solutions and deduce local uniqueness provided that a second order sufficient condition is valid. We use the classical backward Euler scheme for time discretization. For both problems we prove the $H^1$-weak convergence of this semi-discrete numerical scheme. This result is motivated by $Γ$-convergence and does not require second order sufficient condition. If the latter holds then we prove $H^1$-strong local convergence. We report computational results to assess the performance of the numerical methods. As an application, we study the control of magnetic nanoparticles as those used in magnetic drug delivery, where the optimized Kelvin force is used to transport the drug to a desired location.

math.OC↗

arXiv2016

Galerkin v. least-squares Petrov--Galerkin projection in nonlinear model reduction

Least-squares Petrov--Galerkin (LSPG) model-reduction techniques such as the Gauss--Newton with Approximated Tensors (GNAT) method have shown promise, as they have generated stable, accurate solutions for large-scale turbulent, compressible flow problems where standard Galerkin techniques have failed. However, there has been limited comparative analysis of the two approaches. This is due in part to difficulties arising from the fact that Galerkin techniques perform optimal projection associated with residual minimization at the time-continuous level, while LSPG techniques do so at the time-discrete level. This work provides a detailed theoretical and computational comparison of the two techniques for two common classes of time integrators: linear multistep schemes and Runge--Kutta schemes. We present a number of new findings, including conditions under which the LSPG ROM has a time-continuous representation, conditions under which the two techniques are equivalent, and time-discrete error bounds for the two approaches. Perhaps most surprisingly, we demonstrate both theoretically and computationally that decreasing the time step does not necessarily decrease the error for the LSPG ROM; instead, the time step should be `matched' to the spectral content of the reduced basis. In numerical experiments carried out on a turbulent compressible-flow problem with over one million unknowns, we show that increasing the time step to an intermediate value decreases both the error and the simulation time of the LSPG reduced-order model by an order of magnitude.

math.NA↗

arXiv2016

A note on semilinear fractional elliptic equation: analysis and discretization

In this paper we study existence, regularity, and approximation of solution to a fractional semilinear elliptic equation of order $s \in (0,1)$. We identify minimal conditions on the nonlinear term and the source which leads to existence of weak solutions and uniform $L^\infty$-bound on the solutions. Next we realize the fractional Laplacian as a Dirichlet-to-Neumann map via the Caffarelli-Silvestre extension. We introduce a first-degree tensor product finite elements space to approximate the truncated problem. We derive a priori error estimates and conclude with an illustrative numerical example.

math.AP↗

arXiv2016

Some applications of weighted norm inequalities to the error analysis of PDE constrained optimization problems

The purpose of this work is to illustrate how the theory of Muckenhoupt weights, Muckenhoupt weighted Sobolev spaces and the corresponding weighted norm inequalities can be used in the analysis and discretization of PDE constrained optimization problems. We consider: a linear quadratic constrained optimization problem where the state solves a nonuniformly elliptic equation; a problem where the cost involves pointwise observations of the state and one where the state has singular sources, e.g. point masses. For all three examples we propose and analyze numerical schemes and provide error estimates in two and three dimensions. While some of these problems might have been considered before in the literature, our approach allows for a simpler, Hilbert space-based, analysis and discretization and further generalizations.

math.OC↗

arXiv2016

An a posteriori error analysis for an optimal control problem involving the fractional Laplacian

In a previous work, we introduced a discretization scheme for a constrained optimal control problem involving the fractional Laplacian. For such a control problem, we derived optimal a priori error estimates that demand the convexity of the domain and some compatibility conditions on the data. To relax such restrictions, in this paper, we introduce and analyze an efficient and, under certain assumptions, reliable a posteriori error estimator. We realize the fractional Laplacian as the Dirichlet-to-Neumann map for a nonuniformly elliptic problem posed on a semi--infinite cylinder in one more spatial dimension. This extra dimension further motivates the design of an posteriori error indicator. The latter is defined as the sum of three contributions, which come from the discretization of the state and adjoint equations and the control variable. The indicator for the state and adjoint equations relies on an anisotropic error estimator in Muckenhoupt weighted Sobolev spaces. The analysis is valid in any dimension. On the basis of the devised a posteriori error estimator, we design a simple adaptive strategy that exhibits optimal experimental rates of convergence.

math.OC↗

arXiv2015

The Stokes problem with Navier slip boundary condition: Minimal fractional Sobolev regularity of the domain

We prove well-posedness in reflexive Sobolev spaces of weak solutions to the stationary Stokes problem with Navier slip boundary condition over bounded domains $Ω$ of $\mathbb{R}^n$ of class $W^{2-1/s}_s$, $s>n$. Since such domains are of class $C^{1,1-n/s}$, our result improves upon the recent one by Amrouche-Seloula, who assume $Ω$ to be of class $C^{1,1}$. We deal with the slip boundary condition directly via a new localization technique, which features domain, space and operator decompositions. To flatten the boundary of $Ω$ locally, we construct a novel $W^2_s$ diffeomorphism for $Ω$ of class $W^{2-1/s}_s$. The fractional regularity gain, from $2-1/s$ to $2$, guarantees that the Piola transform is of class $W^1_s$. This allows us to transform $W^1_r$ vector fields without changing their regularity, provided $r\le s$, and preserve the unit normal which is Hölder. It is in this sense that the boundary regularity $W^{2-1/s}_s$ seems to be minimal.

math.AP↗

arXiv2015

A FEM for an optimal control problem of fractional powers of elliptic operators

We study solution techniques for a linear-quadratic optimal control problem involving fractional powers of elliptic operators. These fractional operators can be realized as the Dirichlet-to-Neumann map for a nonuniformly elliptic problem posed on a semi-infinite cylinder in one more spatial dimension. Thus, we consider an equivalent formulation with a nonuniformly elliptic operator as state equation. The rapid decay of the solution to this problem suggests a truncation that is suitable for numerical approximation. We discretize the proposed truncated state equation using first degree tensor product finite elements on anisotropic meshes. For the control problem we analyze two approaches: one that is semi-discrete based on the so-called variational approach, where the control is not discretized, and the other one is fully discrete via the discretization of the control by piecewise constant functions. For both approaches, we derive a priori error estimates with respect to the degrees of freedom. Numerical experiments validate the derived error estimates and reveal a competitive performance of anisotropic over quasi-uniform refinement.

math.OC↗

arXiv2015

A fractional space-time optimal control problem: analysis and discretization\

We study a linear-quadratic optimal control problem involving a parabolic equation with fractional diffusion and Caputo fractional time derivative of orders $s \in (0,1)$ and $γ\in (0,1]$, respectively. The spatial fractional diffusion is realized as the Dirichlet-to-Neumann map for a nonuniformly elliptic operator. Thus, we consider an equivalent formulation with a quasi-stationary elliptic problem with a dynamic boundary condition as state equation. The rapid decay of the solution to this problem suggests a truncation that is suitable for numerical approximation. We consider a fully-discrete scheme: piecewise constant functions for the control and, for the state, first-degree tensor product finite elements in space and a finite difference discretization in time. We show convergence of this scheme and, for $s \in (0,1)$ and $γ= 1$, we derive a priori error estimates.

math.OC↗

arXiv2015

Optimal Control of a Free Boundary Problem with Surface Tension Effects: A Priori Error Analysis

We present a finite element method along with its analysis for the optimal control of a model free boundary problem with surface tension effects, formulated and studied in \cite{HAntil_RHNochetto_PSodre_2014a}. The state system couples the Laplace equation in the bulk with the Young-Laplace equation on the free boundary to account for surface tension. We first prove that the state and adjoint system have the requisite regularity for the error analysis (strong solutions). We discretize the state, adjoint and control variables via piecewise linear finite elements and show optimal $O(h)$ error estimates for all variables, including the control. This entails using the second order sufficient optimality conditions of \cite{HAntil_RHNochetto_PSodre_2014a}, and the first order necessary optimality conditions for both the continuous and discrete systems. We conclude with two numerical examples which examine the various error estimates.

math.OC↗

arXiv2014

Optimal Control Of Surface Shape

Controlling the shapes of surfaces provides a novel way to direct self-assembly of colloidal particles on those surfaces and may be useful for material design. This motivates the investigation of an optimal control problem for surface shape in this paper. Specifically, we consider an objective (tracking) functional for surface shape with the prescribed mean curvature equation in graph form as a state constraint. The control variable is the prescribed curvature. We prove existence of an optimal control, and using improved regularity estimates, we show sufficient differentiability to make sense of the first order optimality conditions. This allows us to rigorously compute the gradient of the objective functional for both the continuous and discrete (finite element) formulations of the problem. Moreover, we provide error estimates for the state variable and adjoint state. Numerical results are shown to illustrate the minimizers and optimal controls on different domains.

math.OC↗

arXiv2014

Approximation of elliptic equations with BMO coefficients

We study solution techniques for elliptic equations in divergence form, where the coefficients are only of bounded mean oscillation (BMO). For $|p-2|<\varepsilon$ and a right hand side in $W^{-1}_p$ we show convergence of a finite element scheme, where $\varepsilon$ depends on the oscillation of the coefficients.

math.NA↗

arXiv2014

Optimal Control of a Free Boundary Problem: Analysis with Second Order Sufficient Conditions

We consider a PDE-constrained optimization problem governed by a free boundary problem. The state system is based on coupling the Laplace equation in the bulk with a Young-Laplace equation on the free boundary to account for surface tension, as proposed by P.\ Saavedra and L.\ R.\ Scott \cite{PSaavedra_RScott_1991}. This amounts to solving a second order system both in the bulk and on the interface. Our analysis hinges on a convex control constraint such that the state constraints are always satisfied. Using only first order regularity we show that the control to state operator is twice continuously Fréchet differentiable. We improve slightly the regularity of the state variables and exploit it to show existence of a control together with second order sufficient optimality conditions.

math.OC↗

arXiv2013

Two-step greedy algorithm for reduced order quadratures

We present an algorithm to generate application-specific, global reduced order quadratures (ROQ) for multiple fast evaluations of weighted inner products between parameterized functions. If a reduced basis (RB) or any other projection-based model reduction technique is applied, the dimensionality of integrands is reduced dramatically; however, the cost of approximating the integrands by projection still scales as the size of the original problem. In contrast, using discrete empirical interpolation (DEIM) points as ROQ nodes leads to a computational cost which depends linearly on the dimension of the reduced space. Generation of a reduced basis via a greedy procedure requires a training set, which for products of functions can be very large. Since this direct approach can be impractical in many applications, we propose instead a two-step greedy targeted towards approximation of such products. We present numerical experiments demonstrating the accuracy and the efficiency of the two-step approach. The presented ROQ are expected to display very fast convergence whenever there is regularity with respect to parameter variation. We find that for the particular application here considered, one driven by gravitational wave physics, the two-step approach speeds up the offline computations to build the ROQ by more than two orders of magnitude. Furthermore, the resulting ROQ rule is found to converge exponentially with the number of nodes, and a factor of ~50 savings, without loss of accuracy, is observed in evaluations of inner products when ROQ are used as a downsampling strategy for equidistant samples using the trapezoidal rule. While the primary focus of this paper is on quadrature rules for inner products of parameterized functions, our method can be easily adapted to integrations of single parameterized functions, and some examples of this type are considered.

math.NA↗