Multidimensional first and second order symmetric Strang splitting for hyperbolic systems

We propose an algebraic basis for symmetric Strang splitting for first and second order accurate schemes for hyperbolic systems in N dimensions. Examples are given for two and three dimensions. Optimal stability is shown for symmetric systems. Lack of strong stability is shown for a non-symmetric example. Some numerical examples are presented for some Euler-like constant coefficient problems.     

Half Space and Quarter Space Dirichlet Problems for the Partial Differential Equation

A customary, heuristic, method, by which the Poisson integral formula for the Dirichlet problem, for the half space, for Laplace's equation is obtained, involves Green's function, and Kelvin's method of images. Although this heuristic method leads one to guess the correct result, this Poisson formula still has to be verified directly, independently of the method by which it was arrived at, in order to be absolutely certain that a solution of the Dirichlet problem for the half space, for Laplace's equation, has been actually obtained. A similar heuristic method, as seems to be generally known, could be followed in solving the Dirichlet problem, for the half space, for the equation where is a real constant. However, in Part 1, a different, labor-saving, method is used to study Dirichlet problems for the equation. This method is essentially based on what Hadamard called the method of descent. Indeed, it is shown that he who has solved the half space Dirichlet problem for Laplace's equation has already solved the half space Dirichlet problem for the equation In Part 2, the solution formula for the quarter space Dirichlet problem for Laplace's equation is obtained from the Poisson integral formula for the half space Dirichlet problem for Laplace's equation. A representation theorem for harmonic functions in the quarter space is deduced. The method of descent is used, in Part 3, to obtain the solution formula for the quarter space Dirichlet problem for the equation by means of the solution formula for the quarter space Dirichlet problem for Laplace's equation. So that, indeed, it is also shown that he who has solved the quarter space Dirichlet problem for Laplace's equation has already solved the quarter space Dirichlet problem for the " equation" For the sake of completeness and clarity, and for the convenience of the reader, the appendix, at the end of Part 3, contains a detailed proof that the Poisson integral formula solves the half space Dirichlet problem for Laplace's equation. The Bibliography for Parts 1,2, 3 is to be found at the end of Part 1.     

Computing the nonabelian tensor squares of polycyclic groups

In this paper we develop a theory for computing the nonabelian tensor square and related computations for finitely presented groups and specialize it to polycyclic groups. This theory provides a framework for making nonabelian tensor square computations for polycyclic groups and is the basis of an algorithm for computing the nonabelian tensor square for any polycyclic group.     

Sequence of operations analysis for dynamic data structures

This paper introduces a rather general technique for computing the average-case performance of dynamic data structures, subjected to arbitrary sequences of insert, delete, and search operations. The method allows us effectively to evaluate the integrated cost of various interesting data structure implementations, for stacks, dictionaries, symbol tables, priority queues, and linear lists; it can thus be used as a basis for measuring the efficiency of each proposed implementation. For each data type, a specific continued fraction and a family of orthogonal polynomials are associated with sequences of operations: Tchebycheff for stacks, Laguerre for dictionaries, Charlier for symbol tables, Hermite for priority queues, and Meixner for linear lists. Our main result is an explicit expression, for each of the above data types, of the generating function for integrated costs, as a linear integral transform of the generating functions for individual operation costs. We use the result to compute explicitly integrated costs of various implementations of dictionaries and priority queues.     

Circle theorems for steady Stokes flow

Two circle theorems for two-dimensional steady Stokes flow are presented. The first theorem gives an expression for the stream function for a Stokes flow past a circular cylinder in terms of the stream function for a slow and steady irrotational flow in an unbounded incompressible viscous fluid. The second theorem gives a more general expression for the stream function for another Stokes flow past the circular cylinder in terms of the stream function for a slow and steady rotational flow in the same fluid.     

An approximation of stochastic hyperbolic equations: case with Wiener process

In the present paper, the two‐step difference scheme for the Cauchy problem for the stochastic hyperbolic equation is presented. The convergence estimate for the solution of the difference scheme is established. In applications, the convergence estimates for the solution of difference schemes for the numerical solution of four problems for hyperbolic equations are obtained. The theoretical statements for the solution of this difference scheme are supported by the results of the numerical experiment. Copyright © 2012 John Wiley & Sons, Ltd.     

General observers for discrete-time nonlinear systems

This paper is a geometric study of finding general exponential observers for discrete-time nonlinear systems. Using center manifold theory for maps, we derive necessary and sufficient conditions for general exponential observers for Lyapunov stable discrete-time nonlinear systems. As an application of our characterization of general exponential observers, we give a construction procedure for identity exponential observers for discrete-time nonlinear systems.     

Asymptotic for the cumulative distribution function of the degrees and homomorphism densities for random graphs sampled from a graphon

We give asymptotics for the cumulative distribution function (CDF) for degrees of large dense random graphs sampled from a graphon. The proof is based on precise asymptotics for binomial random variables. This result is a first step for giving a nonparametric test for identifying the degree function of a large random graph. Replacing the indicator function in the empirical CDF by a smoother function, we get general asymptotic results for functionals of homomorphism densities for partially labeled graphs. This general setting allows to recover recent results on asymptotics for homomorphism densities of sampled graphon.     

Lower Bounds for the Rate of Convergence of Dynamic Reconstruction Algorithms for Distributed-Parameter Systems

We obtain lower bounds for the rate of convergence of reconstruction algorithms for distributed-parameter systems of parabolic type. In the case of a pointwise constraint on control for known reconstruction algorithms, we establish a lower bound on the rate of convergence, which shows that, given certain conditions, for each solution of the system one can choose such a collection of measurements so that the reconstruction error will not be less than a certain value. In the case of unbounded controls, we obtain lower bounds for a possible reconstruction error for each trajectory as well as for a given set of trajectories. For a system of special form, we construct an algorithm for which we obtain upper and lower bounds for accuracy having identical order for a specific choice of matching of the parameters.     

Stokes方程的压力梯度局部投影间断有限元法

本文对定常的Stokes方程提出了一种新的间断有限元法,通过将通常的间断Galerkin有限元法与压力梯度局部投影相结合,建立了一个稳定的间断有限元格式,对速度和压力的任意分片多项式空间P_l(K),P_m(K)的间断有限元逼近证明了解的存在唯一性,给出了关于速度和压力的L~2范数的最优误差估计.     

Various motivations for managerial (mis)reporting – an experimental study

In the experiment we model all possible consequences from misreporting for both the shareholder and for the manager, since we are interested in patterns in reporting behaviour resulting from different motivations for potential misrepresentation. This allows for examining the stability of the (mis)reporting behaviour in different treatments. Agents are primarily driven by the consequences for themselves rather than by the consequences for the principal, while deciding on misreporting. Participants are willing to sacrifice a small gain for themselves in order to prevent a greater loss for the principal. If agents misreport, they do it in order to generate positive rather than negative consequences for themselves. Reports in favour of the principal, but fruitless or even costly for the agent are very rare. The experiment indicates also that pro-social agents report more truthfully than pro-self agents.     

Fast Algorithms for Identification and Comparison of Braids

A method for constructing algorithms solving the word and comparison problems for mapping class groups (in particular, for the braid group) is presented, and a family of one-side invariant orderings on the mapping class group of a surface with boundary is described. A method for constructing comparison algorithms for all finite orderings on the mapping class group of any surface with boundary is described, a fast and simple comparison algorithm for the Dehornoy order on the braid group is presented, examples of normal forms for braid groups are given, and algorithms for finding the forms are indicated. Bibliography: 15 titles.     

The Clique Complex and Hypergraph Matching

The width of a hypergraph is the minimal for which there exist such that for any , for some . The matching width of is the minimal such that for any matching there exist such that for any , for some . The following extension of the Aharoni-Haxell matching Theorem [3] is proved: Let be a family of hypergraphs such that for each either or , then there exists a matching such that for all . This is a consequence of a more general result on colored cliques in graphs. The proofs are topological and use the Nerve Theorem. Received June 14, 1999     

Superconvergence of mixed finite element semi-discretizations of two time-dependent problems

We will show that some of the superconvergence properties for the mixed finite element method for elliptic problems are preserved in the mixed semi-discretizations for a diffusion equation and for a Maxwell equation in two space dimensions. With the help of mixed elliptic projection we will present estimates global and pointwise in time. The results for the Maxwell equations form an extension of existing results. For both problems, our results imply that post-processing and a posteriori error estimation for the error in the space discretization can be performed in the same way as for the underlying elliptic problem.     

Reduced order observer design for discrete-time nonlinear systems

This work is a geometric study of reduced order observer design for discrete-time nonlinear systems. Our reduced order observer design is applicable for Lyapunov stable discrete-time nonlinear systems with a linear output equation and is a generalization of Luenberger’s reduced order observer design for linear systems. We establish the error convergence for the reduced order estimator for discrete-time nonlinear systems using the center manifold theory for maps. We illustrate our reduced order observer construction for discrete-time nonlinear systems with an example.     

Reduced order observer design for nonlinear systems

This work is a geometric study of reduced order observer design for nonlinear systems. Our reduced order observer design is applicable for Lyapunov stable nonlinear systems with a linear output equation and is a generalization of Luenberger’s reduced order observer design for linear systems. We establish the error convergence for the reduced order estimator for nonlinear systems using the center manifold theory for flows. We illustrate our reduced order observer construction for nonlinear systems with a physical example, namely a nonlinear pendulum without friction.     

A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem

In this paper, we present a branch-and-bound approach for solving a two-machine flow shop scheduling problem, in which the objective is to minimize a weighted combination of job flowtime and schedule makespan. Experimental results show that the algorithm works very well for certain special cases and moderately well for others. In fact, it is able to produce optimal schedules for 500-job problems in which the second machine dominates the first machine. It is also shown that the algorithm developed to provide an upper bound for the branch-and-bound is optimal when processing times for jobs are the same on both machines. The primary reason for developing the branch-and-bound approach is that its results can be used to guide other heuristic techniques, such as simulated annealing, tabu search and genetic algorithms, in their search for optimal solutions for larger problems.     

流动稳定性弱非线性理论的重新考虑*

弱非性理论已被广泛用于流动稳定性理论及其它领域.然而其应用对某些问题虽是成功的,但对另一些问题,其结果却常不令人满意,特别是对转捩或自由剪切流中涡的演化这类问题,这时理论研究的目的不是寻找稳态解,而是预测演化过程.在本文中,我们将研究不成功的原因并建议一些改进的办法.     

‘Strong’-‘weak’ precedence in scheduling: Extensions to series-parallel orders

We examine computational complexity implications for scheduling problems with job precedence relations with respect to strong precedence versus weak precedence. We propose a consistent definition of strong precedence for chains, trees, and series-parallel orders. Using modular decomposition for partially ordered sets (posets), we restate and extend past complexity results for chains and trees as summarized in Dror (1997) [5]. Moreover, for series-parallel posets we establish new computational complexity results for strong precedence constraints for single- and multi-machine problems.     

On bounds for the mode and median of the generalized hyperbolic and related distributions

Except for certain parameter values, a closed form formula for the mode of the generalized hyperbolic (GH) distribution is not available. In this paper, we exploit results from the literature on modified Bessel functions and their ratios to obtain simple but tight two-sided inequalities for the mode of the GH distribution for general parameter values. As a special case, we deduce tight two-sided inequalities for the mode of the variance-gamma (VG) distribution, and through a similar approach we also obtain tight two-sided inequalities for the mode of the McKay Type I distribution. The analogous problem for the median is more challenging, but we conjecture some monotonicity results for the median of the VG and McKay Type I distributions, from we which we conjecture some tight two-sided inequalities for their medians. Numerical experiments support these conjectures and also lead us to a conjectured tight lower bound for the median of the GH distribution.