A Study of the Direct Spectral Transform for the Defocusing Davey-Stewartson II Equation the Semiclassical Limit

The defocusing Davey-Stewartson II equation has been shown in numerical experiments to exhibit behavior in the semiclassical limit that qualitatively resembles that of its one-dimensional reduction, the defocusing nonlinear Schrödinger equation, namely the generation from smooth initial data of regular rapid oscillations occupying domains of space-time that become well-defined in the limit. As a first step to studying this problem analytically using the inverse scattering transform, we consider the direct spectral transform for the defocusing Davey-Stewartson II equation for smooth initial data in the semiclassical limit. The direct spectral transform involves a singularly perturbed elliptic Dirac system in two dimensions. We introduce a WKB-type method for this problem, proving that it makes sense formally for sufficiently large values of the spectral parameter k by controlling the solution of an associated nonlinear eikonal problem, and we give numerical evidence that the method is accurate for such k in the semiclassical limit. Producing this evidence requires both the numerical solution of the singularly perturbed Dirac system and the numerical solution of the eikonal problem. The former is carried out using a method previously developed by two of the authors, and we give in this paper a new method for the numerical solution of the eikonal problem valid for sufficiently large k. For a particular potential we are able to solve the eikonal problem in closed form for all k, a calculation that yields some insight into the failure of the WKB method for smaller values of k. Informed by numerical calculations of the direct spectral transform, we then begin a study of the singularly perturbed Dirac system for values of k so small that there is no global solution of the eikonal problem. We provide a rigorous semiclassical analysis of the solution for real radial potentials at k=0, which yields an asymptotic formula for the reflection coefficient at k=0 and suggests an annular structure for the solution that may be exploited when k ≠ 0 is small. The numerics also suggest that for some potentials the reflection coefficient converges pointwise as ɛ↓ 0 to a limiting function that is supported in the domain of k-values on which the eikonal problem does not have a global solution. It is expected that singularities of the eikonal function play a role similar to that of turning points in the one-dimensional theory. © 2019 Wiley Periodicals, Inc.     

A numerical method for the Benjamin-Ono equation

This paper is concerned with the numerical solution of the Cauchy problem for the Benjamin-Ono equationu _t +uu _x −Hu _xx =0, whereH denotes the Hilbert transform. Our numerical method first approximates this Cauchy problem by an initial-value problem for a corresponding 2L-periodic problem in the spatial variable, withL large. This periodic problem is then solved using the Crank-Nicolson approximation in time and finite difference approximations in space, treating the nonlinear term in a standard conservative fashion, and the Hilbert transform by a quadrature formula which may be computed efficiently using the Fast Fourier Transform.     

Numerical Optimization for the Location of Wastewater Outfalls

In this paper we solve a constrained optimal control problem related to the location of the wastewater outfalls in a sewage disposal system. This is a problem where the control is the position and the constraints are non-convex and pointwise, which makes difficult its resolution. We discretize the problem by means of a characteristics-Galerkin method and we use three algorithms for the numerical resolution of the discretized optimization problem: an interior point algorithm, the Nelder-Mead simplex method and a duality method. Finally, we compare the numerical results obtained by applying the described methods for a realistic problem posed in the ría of Vigo (Galicia, Spain).     

The C 1 wavelet method for numerical solutions of the Neumann problem

In this article we use the C ¹ wavelet bases on Powell-Sabin triangulations to approximate the solution of the Neumann problem for partial differential equations. The C ¹ wavelet bases are stable and have explicit expressions on a three-direction mesh. Consequently, we can approximate the solution of the Neumann problem accurately and stably. The convergence and error estimates of the numerical solutions are given. The computational results of a numerical example show that our wavelet method is well suitable to the Neumann boundary problem.     

Stable numerical differentiation for the second order derivatives

Consider a numerical differential problem, which aims to compute the second order derivative of a function stably from its given noisy data. For this ill-posed problem, we introduce the Lavrent′ev regularization scheme by reformulating this differentiation problem as an integral equation of the first kind. The advantage of this proposed scheme is that we can give the regularizing solution by an explicit integral expression, therefore it is easy to be implemented. The a-priori and a-posterior choice strategies for the regularization parameter are considered, with convergence analysis and error estimate of the regularizing solution for noisy data based on the integral operator decomposition. The validity of the proposed scheme is shown by several numerical examples.     

High-accuracy versions of the collocations and least squares method for the numerical solution of the Navier-Stokes equations

An approach for the creation of high-accuracy versions of the collocations and least squares method for the numerical solution of the Navier-Stokes equations is proposed. New versions of up to the eighth order of accuracy inclusive are implemented. For smooth solutions, numerical experiments on a sequence of grids show that the approximate solutions produced by these versions converge to the exact one with a high order of accuracy as h → 0, where h is the maximal linear cell size of a grid. The numerical results obtained for the benchmark problem of the lid-driven cavity flow suggest that the collocations and least squares method is well suited for the numerical simulation of viscous flows.     

On the solution of the generalized steiner problem by the subgradient method

This paper is concerned with the problem of constructing a minimal cost weighted tree connecting a set ofn given terminal vertices on an Euclidean plane. Both theoretical and numerical aspect of the problem are considered. As regards the first ones, the convexity of the objective function is studied and the necessary and sufficient optimality conditions are deduced. As regards the numerical aspects, a subgradient type algorithm is presented.     

A new approximation for the generalized fractional derivative and its application to generalized fractional diffusion equation

In this paper, we derive a fourth order approximation for the generalized fractional derivative that is characterized by a scale function z(t) and a weight function w(t) . Combining the new approximation with compact finite difference method, we develop a numerical scheme for a generalized fractional diffusion problem. The stability and convergence of the numerical scheme are proved by the energy method, and it is shown that the temporal and spatial convergence orders are both 4. Several numerical experiments are provided to illustrate the efficiency of our scheme.     

Marching schemes for inverse acoustic scattering problems

Summary For the numerical solution of inverse Helmholtz problems the boundary value problem for a Helmholtz equation with spatially variable wave number has to be solved repeatedly. For large wave numbers this is a challenge. In the paper we reformulate the inverse problem as an initial value problem, and describe a marching scheme for the numerical computation that needs only n² log n operations on an n × n grid. We derive stability and error estimates for the marching scheme. We show that the marching solution is close to the low-pass filtered true solution. We present numerical examples that demonstrate the efficacy of the marching scheme.     

p-Adic Analogue of the Wave Equation

In this paper, a p-adic analogue of the wave equation with Lipschitz source is considered. Since it is hard to arrive the solution of the problem, we propose a regularized method to solve the problem from a modified p-adic integral equation. Moreover, we give an iterative scheme for numerical computation of the regularlized solution.

     

Parallel algorithms for variational inequalities over the Cartesian product of the intersections of the fixed point sets of nonexpansive mappings

This paper presents a framework of iterative algorithms for the variational inequality problem over the Cartesian product of the intersections of the fixed point sets of nonexpansive mappings in real Hilbert spaces. Strong convergence theorems are established under a certain contraction assumption with respect to the weighted maximum norm. The proposed framework produces as a simplest example the hybrid steepest descent method, which has been developed for solving the monotone variational inequality problem over the intersection of the fixed point sets of nonexpansive mappings. An application to a generalized power control problem and numerical examples are demonstrated.     

On the convergence of the Nyström method for the integral equation eigenvalue problem

Summary Approximate solutions of the linear integral equation eigenvalue problem can be obtained by the replacement of the integral by a numerical quadrature formula and then collocation to obtain a linear algebraic eigenvalue problem. This method is often called the Nyström method and a framework for its error analysis was introduced by Noble [15]. In this paper the convergence of the method is considered when the integral operator is a compact operator from a Banach spaceX intoX.     

Balance function for the optimal control problem

The balance-function concept for transforming constrained optimization problems into unconstrained optimization problems, for the purpose of finding numerical iterative solutions, is extended to the optimal control problem. This function is a combination orbalance between the penalty and Lagrange functions. It retains the advantages of the penalty function, while eliminating its numerical disadvantages. An algorithm is developed and applied to an orbit transfer problem, showing the feasibility and usefulness of this concept.These results are part of the author's doctoral thesis written under Professors H. Lo and D. Alspaugh of Purdue University.     

Two‐level discretization of the Navier‐Stokes equations with r‐Laplacian subgridscale viscosity

The r‐Laplacian has played an important role in the development of computationally efficient models for applications, such as numerical simulation of turbulent flows. In this article, we examine two‐level finite element approximation schemes applied to the Navier‐Stokes equations with r‐Laplacian subgridscale viscosity, where r is the order of the power‐law artificial viscosity term. In the two‐level algorithm, the solution to the fully nonlinear coarse mesh problem is utilized in a single‐step linear fine mesh problem. When modeling parameters are chosen appropriately, the error in the two‐level algorithm is comparable to the error in solving the fully nonlinear problem on the fine mesh. We provide rigorous numerical analysis of the two‐level approximation scheme and derive scalings which vary based on the coefficient r, coarse mesh size H, fine mesh size h, and filter radius δ. We also investigate the two‐level algorithm in several computational settings, including the 3D numerical simulation of flow past a backward‐facing step at Reynolds number Re = 5100. In all numerical tests, the two‐level algorithm was proven to achieve the same order of accuracy as the standard one‐level algorithm, at a fraction of the computational cost. © 2011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2011     

Accuracy-enhancement scheme for the Sturm-Liouville equation

Enhanced-accuracy spline-difference schemes are constructed and analyzed for the one-dimensional Sturm-Liouville problem with piecewise-constant coefficients. Uniformmetric bounds are obtained for eigenvalues, eigenfunctions, and their derivatives. The results of numerical experiments using a test problem are reported.Translated from Vychislitel'naya i Prikladnaya Matematika, No. 61, pp. 3–8, 1987.     

Finite-difference methods for solving the reaction-diffusion equations of a simple isothermal chemical system

Numerical methods are proposed for the numerical solution of a system of reaction-diffusion equations, which model chemical wave propagation. The reaction terms in this system of partial differential equations contain nonlinear expressions. Nevertheless, it is seen that the numerical solution is obtained by solving a linear algebraic system at each time step, as opposed to solving a nonlinear algebraic system, which is often required when integrating nonlinear partial differential equations. The development of each numerical method is made in the light of experience gained in solving the system of ordinary differential equations, which model the well-stirred analogue of the chemical system. The first-order numerical methods proposed for the solution of this initialvalue problem are characterized to be implicit. However, in each case it is seen that the numerical solution is obtained explicitly. In a series of numerical experiments, in which the ordinary differential equations are solved first of all, it is seen that the proposed methods have superior stability properties to those of the well-known, first-order, Euler method to which they are compared. Incorporating the proposed methods into the numerical solution of the partial differential equations is seen to lead to two economical and reliable methods, one sequential and one parallel, for solving the travelling-wave problem. © 1994 John Wiley & Sons, Inc.     

Solving the Vehicle Routing Problem with Stochastic Demands using the Cross-Entropy Method

An alternate formulation of the classical vehicle routing problem with stochastic demands (VRPSD) is considered. We propose a new heuristic method to solve the problem, based on the Cross-Entropy method. In order to better estimate the objective function at each point in the domain, we incorporate Monte Carlo sampling. This creates many practical issues, especially the decision as to when to draw new samples and how many samples to use. We also develop a framework for obtaining exact solutions and tight lower bounds for the problem under various conditions, which include specific families of demand distributions. This is used to assess the performance of the algorithm. Finally, numerical results are presented for various problem instances to illustrate the ideas.     

On approximation in the fictitious domain method for a bidimensional transport equation

In this article a numerical method for solving a two‐dimensional transport equation in the stationary case is presented. Using the techniques of the variational calculus, we find the approximate solution for a homogeneous boundary‐value problem that corresponds to a square domain D₂. Then, using the method of the fictitious domain, we extend our algorithm to a boundary value problem for a set D that has an arbitrary shape. In this approach, the initial computation domain D (called physical domain) is immersed in a square domain D₂. We prove that the solution obtained by this method is a good approximation of the exact solution. The theoretical results are verified with the help of a numerical example. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2010     

Numerical calculation of salt leaching from rocks in the presence of head-driven flow

A numerical procedure is proposed for solving the problem of leaching of water-soluble salts from multilayer rocks in the presence of a head-driven flow, allowing for the interaction of seepage and desalinisation processes. The results of a numerical experiment are reported.Translated from Vychislitel'naya i Prikladnaya Matematika, No. 61, pp. 47–53, 1987.     

A note on the complex semi‐definite matrix Procrustes problem

This note outlines an algorithm for solving the complex ‘matrix Procrustes problem’. This is a least‐squares approximation over the cone of positive semi‐definite Hermitian matrices, which has a number of applications in the areas of Optimization, Signal Processing and Control. The work generalizes the method of Allwright (SIAM J. Control Optim. 1988; 26 (3):537–556), who obtained a numerical solution to the real‐valued version of the problem. It is shown that, subject to an appropriate rank assumption, the complex problem can be formulated in a real setting using a matrix‐dilation technique, for which the method of Allwright is applicable. However, this transformation results in an over‐parametrization of the problem and, therefore, convergence to the optimal solution is slow. Here, an alternative algorithm is developed for solving the complex problem, which exploits fully the special structure of the dilated matrix. The advantages of the modified algorithm are demonstrated via a numerical example. Copyright © 2007 John Wiley & Sons, Ltd.