 Award ID(s):
 2031213
 NSFPAR ID:
 10308836
 Date Published:
 Journal Name:
 2022 AIAA SciTech Conference (Space Flight Mechanics Meeting)
 Format(s):
 Medium: X
 Sponsoring Org:
 National Science Foundation
More Like this

A structure detection method is developed for solving statevariable inequality path con strained optimal control problems. The method obtains estimates of activation and deactiva tion times of active statevariable inequality path constraints (SVICs), and subsequently al lows for the times to be included as decision variables in the optimization process. Once the identification step is completed, the method partitions the problem into a multipledomain formulation consisting of constrained and unconstrained domains. Within each domain, LegendreGaussRadau (LGR) orthogonal direct collocation is used to transcribe the infinite dimensional optimal control problem into a finitedimensional nonlinear programming (NLP) problem. Within constrained domains, the corresponding time derivative of the active SVICs that are explicit in the control are enforced as equality path constraints, and at the beginning of the constrained domains, the necessary tangency conditions are enforced. The accuracy of the proposed method is demonstrated on a wellknown optimal control problem where the analytical solution contains a state constrained arc.more » « less

We prove the well‐posedness and smoothing properties of a distributed‐order time‐fractional diffusion equation with a singular density function in multiple space dimensions, which could model the ultraslow subdiffusion processes. We accordingly derive a finite element approximation to the problem and prove its optimal‐order error estimate. Numerical results are presented to support the mathematical and numerical analysis.

The image processing task of the recovery of an image from a noisy or compromised image is an illposed inverse problem. To solve this problem, it is necessary to incorporate prior information about the smoothness, or the structure, of the solution, by incorporating regularization. Here, we consider linear blur operators with an efficientlyfound singular value decomposition. Then, regularization is obtained by employing a truncated singular value expansion for image recovery. In this study, we focus on images for which the image blur operator is separable and can be represented by a Kronecker product such that the associated singular value decomposition is expressible in terms of the singular value decompositions of the separable components. The truncation index k can then be identified without forming the full Kronecker product of the two terms. This report investigates the problem of learning an optimal k using two methods. For one method to learn k we assume the knowledge of the true images, yielding a supervised learning algorithm based on the average relative error. The second method uses the method of generalized cross validation and does not require knowledge of the true images. The approach is implemented and demonstrated to be successful for Gaussian, Poisson and salt and pepper noise types across noise levels with signal to noise ratios as low as 10. This research contributes to the field by offering insights into the use of the supervised and unsupervised estimators for the truncation index, and demonstrates that the unsupervised algorithm is not only robust and computationally efficient, but is also comparable to the supervised method.more » « less

We consider an unconstrained tangential Dirichlet boundary control problem for the Stokes equations with an $ L^2 $ penalty on the boundary control. The contribution of this paper is twofold. First, we obtain wellposedness and regularity results for the tangential Dirichlet control problem on a convex polygonal domain. The analysis contains new features not found in similar Dirichlet control problems for the Poisson equation; an interesting result is that the optimal control has higher local regularity on the individual edges of the domain compared to the global regularity on the entire boundary. Second, we propose and analyze a hybridizable discontinuous Galerkin (HDG) method to approximate the solution. For convex polygonal domains, our theoretical convergence rate for the control is optimal with respect to the global regularity on the entire boundary. We present numerical experiments to demonstrate the performance of the HDG method.more » « less

We consider the numerical solution of a fourth‐order total variation flow problem representing surface relaxation below the roughening temperature. Based on a regularization and scaling of the nonlinear fourth‐order parabolic equation, we perform an implicit discretization in time and a C^{0}Interior Penalty Discontinuous Galerkin (C^{0}IPDG) discretization in space. The C^{0}IPDG approximation can be derived from a mixed formulation involving numerical flux functions where an appropriate choice of the flux functions allows to eliminate the discrete dual variable. The fully discrete problem can be interpreted as a parameter dependent nonlinear system with the discrete time as a parameter. It is solved by a predictor corrector continuation strategy featuring an adaptive choice of the time step sizes. A documentation of numerical results is provided illustrating the performance of the C^{0}IPDG method and the predictor corrector continuation strategy. The existence and uniqueness of a solution of the C^{0}IPDG method will be shown in the second part of this paper.