Further results on the L1 analysis of sampled-data systems via kernel approximation approach

In this paper, we consider the numerical solution of a class of optimal control problems involving variable time points in their cost functions. The control enhancing transform is first used to convert the optimal control problem with variable time points into an equivalent optimal control problem with fixed multiple characteristic time (MCT). Using the control parametrization technique, the time horizon is partitioned into several subintervals. Let the partition points also be taken as decision variables. The control functions are approximated by piecewise constant or piecewise linear functions in accordance with these variable partition points. We thus obtain a finite dimensional optimization problem. The control parametrization enhancing control transform (CPET) is again used to convert approximate optimal control problems with variable partition points into equivalent standard optimal control problems with MCT, where the control functions are piecewise constant or piecewise linear functions with pre-fixed partition points. The transformed problems are essentially optimal parameter selection problems with MCT. The gradient formulae for the objective function as well as the constraint functions with respect to relevant decision variables are obtained. Numerical examples are solved using the proposed method.

A weakly singular integral equation of the first kind on an open, smooth surface piece Γ in ℝ3is solved approximately via the Galerkin method. Owing to the singular behaviour of the solution of the integral equation near the edge of Γ, the Galerkin approximations converge only with orderO(h½ − ε), ε > 0, if a quasiuniform mesh is used on Γ. We show how to compensate the effect of the edge singularities by using an appropriately graded mesh. Numerical experiments for the Galerkin method, using piecewise constant and piecewise linear functions on triangles, demonstrate the effect of graded meshes and show experimental rates of convergence which underline the theoretical results.

The piecewise perturbation methods (PPM) have proven to be very efficient for the numerical solution of the linear time-independent Schrodinger equation. The underlying idea is to replace the potential function piecewisely by simpler approximations and then to solve the approximating problem. The accuracy is improved by adding some perturbation corrections. Two types of approximating potentials were considered in the literature, that is piecewise constant and piecewise linear functions, giving rise to the so-called CP methods (CPM) and LP methods (LPM). Piecewise polynomials of higher degree have not been used since the approximating problem is not easy to integrate analytically. As suggested by Ixaru (Comput Phys Commun 177:897–907, 2007), this problem can be circumvented using another perturbative approach to construct an expression for the solution of the approximating problem. In this paper, we show that there is, however, no need to consider PPM based on higher-order polynomials, since these methods are equivalent to the CPM. Also, LPM is equivalent to CPM, although it was sometimes suggested in the literature that an LP method is more suited for problems with strongly varying potentials. We advocate that CP schemes can (and should) be used in all cases, since it forms the most straightforward way of devising PPM and there is no advantage in considering other piecewise polynomial perturbation methods.

A lookup table (LUT) is a computationally inexpensive piecewise function used to approximate computationally expensive mathematical functions. Evaluating a LUT can be as quick as using Horner’s method to evaluate a polynomial after looking up its coefficients. A common choice of LUT is a piecewise constant or piecewise linear function; however, high-degree interpolating polynomials can also be valuable. Here, we describe the functionality of FunC 2.0 , a C++ library designed to streamline the process of building, comparing, and implementing univariate LUTs in practical applications. In particular, FunC 2.0 can build relatively small LUTs satisfying user-provided absolute and relative tolerances for error. Furthermore, FunC 2.0 can build nonuniform LUTs, it provides utilities to quickly determine reasonable LUT bounds and tolerances for error, and it provides a way to quickly profile a set of LUTs. We demonstrate FunC ’s utility in application by reducing the total runtime of a simulation performed by the Canadian Hydrological Model (CHM). This simulation modelled the snow mass distribution across Western Canada over one month. Now, CHM can evaluate the mathematical function of interest about \(28\) times faster, allowing the necessary algorithm to finish \(2\) times faster, and the overall simulation is about \(9\%\) faster.

Consideration was given to the numerical solution of the problem of parametric identification of the processes obeying the parabolic equations using an example of the processes of underground oil filtration. The identified parameters belong to the given functional classes such as the piecewise constant and piecewise linear functions. In the problem, needed is not only to determine the values of the coefficients, but also to identify the constancy boundaries of the coefficients. For numerical solution of the problem, an approach was suggested based on reduction of the initial problem to that of finite-dimensional optimization with a special structure of constraints. Obtained were the formulas for the gradient of the objective functional in the discretized problem allowing one to apply the efficient methods of first-order optimization. The results of numerical experiments on the model problems were presented.

In two and three dimensional Lipschitz, but not necessarily convex, polytopal domains, we devise and analyze a reliable and efficient a posteriori error estimator for a semilinear optimal control problem; control constraints are also considered. We consider a fully discrete scheme that discretizes the state and adjoint equations with piecewise linear functions and the control variable with piecewise constant functions. The devised error estimator can be decomposed as the sum of three contributions which are associated to the discretization of the state and adjoint equations and the control variable. We extend our results to a scheme that approximates the control variable with piecewise linear functions and also to a scheme that approximates the solution to a nondifferentiable optimal control problem. We illustrate the theory with two and three-dimensional numerical examples.

In this paper, the piecewise constant Block-Pulse functions and their operational matrices of integration have directly been used to solve a two-dimensional Fredholm-Volterra integral equation of second kind. This method presents a computational technique through converting this integral equation into a system of linear equations which can be easily solved by the known methods. Also the error analysis of this method will be considered. The efficiency and accuracy of the proposed method are illustrated by some examples.

In this paper, the optimal control problem of parabolic integro-differential equations is solved by gradient recovery based two-grid finite element method. Piecewise linear functions are used to approximate state and co-state variables, and piecewise constant function is used to approximate control variables. Generally, the optimal conditions for the problem are solved iteratively until the control variable reaches error tolerance. In order to calculate all the variables individually and parallelly, we introduce a gradient recovery based two-grid method. First, we solve the small scaled optimal control problem on coarse grids. Next, we use the gradient recovery technique to recover the gradients of state and co-state variables. Finally, using the recovered variables, we solve the large scaled optimal control problem for all variables independently. Moreover, we estimate priori error for the proposed scheme, and use an example to validate the theoretical results.

This paper investigates the finite element approximation of a class of parameter estimation problems which is the form of performance as the optimal control problems governed by bilinear parabolic equations, where the state and co-state are discretized by piecewise linear functions and control is approximated by piecewise constant functions. The authors derive some a priori error estimates for both the control and state approximations. Finally, the numerical experiments verify the theoretical results.

A boundary‐location method is developed for finite element simulation of steady, two‐dimensional flows of Newtonian liquid with free boundaries. In the method, boundary shape and position and the velocity and pressure fields are determined simultaneously. Inertial, viscous, gravitational, and surface tension effects are included in the development. The complete set of nonlinear finite element equations is solved by a modified frontal method combined with Newton‐Raphson iteration to speed convergence. The finite element used to illustrate the method approximates the pressure as a piecewise constant function and the velocity and free boundaries as piecewise linear functions. Example calculations for flow from a slit show that the method can be effective.

This paper is concerned with recovery type a posteriori error estimates of fully discrete finite element approximation for general convex parabolic optimal control problems with pointwise control constraints. The time discretization is based on the backward Euler method. The state and the adjoint state are approximated by piecewise linear functions and the control is approximated by piecewise constant functions. We derive the superconvergence properties of finite element solutions. By using the superconvergence results, we obtain recovery type a posteriori error estimates. Some numerical examples are presented to verify the theoretical results.

The MLFMM (Multilevel Fast Multipole Method) is an alternative formulation of the technology behind the MoM (Method of Moment) and is applicable to much larger structures than the MoM, making full-wave current-based solutions of electrically large structures a possibility. This fact implies that it can be applied to most large models that were previously treated with the MoM without having to change the mesh. In this paper we discuss the development and implementation of volumetric integral equations for both dielectric and magnetically permeable materials using curvilinear hexahedral elements. Both piecewise constant and higher order basis functions will be examined in the context of volumetric multilevel fast multipole method implementation. Comparisons with corresponding finite element-boundary integral solutions will also be presented and compared in terms of accuracy and efficiency.

An Approach for Estimating Vibration Characteristics of Nonuniform Rotor Blades

Safe and simultaneous arrival of constant speed, constant altitude unmanned air vehicles (UAVs) on target is solved by design of paths of equal lengths. The starting point for our solution is the well-known Dubins path, which is composed of circular arc and line segments, thus requiring only one simple maneuver—constant rate turn. An explicit bound can be imposed on the rate during the design and the resulting paths are the minimum time solution of the problem. However, transition between arc and line segments entails discontinuous changes in lateral acceleration (latax), making this approach impractical for real fixed wing UAVs. Therefore, we replace the Dubins solution with a novel one, based on quintic Pythagorean hodograph (PH) curves, whose latax demand is continuous. The PH paths are designed to have lengths close to the lengths of the Dubins paths to stay close to the minimum time solution. To derive the PH paths, the Dubins solution is first interpreted in terms of differential geometry of curves using the path length and curvature as the key parameters. The curvature of a Dubins path is a piecewise constant and discontinuous function of its path length, which is a differential geometric expression of the discontinuous latax demand involved in transitions between the arc and the line segment. By contrast, the curvature of the PH path is a fifth order polynomial of its path length. This is not only continuous but also has enough design parameters (polynomial coefficients) to meet the latax (curvature) constraints (bounds) and make the PH solution close to the minimum time one. The solution involves the design of paths meeting the curvature constraint and is followed by producing multiple paths of equal length by increasing the lengths of the shorter paths to match the longest one. The safety constraint, intercollision avoidance is achieved by satisfying two conditions: minimum separation distance and nonintersection at equal distance. The offset curves of the PH path are used to design a safety region along each path.

A gradient-estimation procedure for a general class of stochastic discrete-event systems is developed. In contrast to most previous work, the authors focus on performance measures whose realizations are inherently discontinuous (in fact, piecewise constant) functions of the parameter of differentiation. Two broad classes of finite-horizon discontinuous performance measures arising naturally in applications are considered. Because of their discontinuity, these important classes of performance measures are not susceptible to infinitesimal perturbation analysis (IPA). Instead, the authors apply smoothed perturbation analysis, formalizing it and generalizing it in the process. Smoothed perturbation analysis uses conditional expectations to smooth jumps. The resulting gradient estimator involves two factors: the conditional rate at which jumps occur, and the expected effect of a jump. Among the types of performance measures to which the methods can be applied are transient state probabilities, finite-horizon throughputs, distributions on arrival, and expected terminal cost.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>