On a family of finite-difference schemes with discrete transparent boundary conditions for a parabolic equation on the half-axis
An initial–boundary value problem for the generalized Schrödinger equation in a semi-infinite strip is solved.
A new family of two level finite-difference schemes with averaging over spatial variables on a finite mesh is constructed, which covers a set of finite-difference schemes built using various methods. For the family, an abstract approximate transparent boundary condition (TBC) is formulated and the solutions are proved to be absolutely stable in two norms with respect to both initial data and free terms. A discrete TBC is derived, and the stability of the family of schemes with this TBC is proved. The implementation of schemes with the discrete TBC is discussed.
A scalable method for mining graph patterns stable under subsampling is proposed. The existing subsample stability and robustness measures are not antimonotonic according to definitions known so far. We study a broader notion of antimonotonicity for graph patterns, so that measures of subsample stability become antimonotonic. Then we propose gSOFIA for mining the most subsample-stable graph patterns. The experiments on numerous graph datasets show that gSOFIA is very efficient for discovering subsample-stable graph patterns.
The object of study of this paper is a regional economic system which is complex, dynamic and developable by nature. The reproduction of material wealth necessary for the region is provided in the process of functioning of the above system through the interaction between the combinations of subjective (personal) and objective (material) elements, thereby meeting regional environmental and economic needs.
We construct an example of blow-up in a ”ow of min-plus linear operators arising as solution operators for a Hamilton…Jacobi equation @S/@t+|∇S|/ + U(x, t) = 0, where > 1 and the potential U(x, t) is uniformly bounded together with its gradient. The construction is based on the fact that, for a suitable potential de“ned on a time interval of length T, the absolute value of velocity for a Lagrangian minimizer can be as large as O(log T)2−2/. We also show that this growth estimate cannot be surpassed. Implications of this example for existence of global generalized solutions to randomly forced Hamilton…Jacobi or Burgers equations are discussed.
This proceedings publication is a compilation of selected contributions from the “Third International Conference on the Dynamics of Information Systems” which took place at the University of Florida, Gainesville, February 16–18, 2011. The purpose of this conference was to bring together scientists and engineers from industry, government, and academia in order to exchange new discoveries and results in a broad range of topics relevant to the theory and practice of dynamics of information systems. Dynamics of Information Systems: Mathematical Foundation presents state-of-the art research and is intended for graduate students and researchers interested in some of the most recent discoveries in information theory and dynamical systems. Scientists in other disciplines may also benefit from the applications of new developments to their own area of study.