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.     

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.     

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.     

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.     

Error estimates for shooting methods in two-point boundary value problems for second-order equations

This paper is concerned with a procedure for estimating the global discretization error arising when a boundary value problem for a system of second order differential equations is solved by the simple shooting method, without transforming the original problem in an equivalent first order problem. Expressions of the global discretization error are derived for both linear and nonlinear boundary value problems, which reduce the error estimation for a boundary value problem to that for an initial value problem of same dimension. The procedure extends to second order equations a technique for global error estimation given elsewhere for first order equations. As a practical result the accuracy of the estimates for a second order problem is increased compared with the estimates for the equivalent first order problem.     

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.     

Sharp two-weight inequalities for singular integrals, with applications to the Hilbert transform and the Sarason conjecture

We prove two-weight norm inequalities for Calderón-Zygmund singular integrals that are sharp for the Hilbert transform and for the Riesz transforms. In addition, we give results for the dyadic square function and for commutators of singular integrals. As an application we give new results for the Sarason conjecture on the product of unbounded Toeplitz operators on Hardy spaces.     

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.     

Trigonometric polynomial or exponential fitting approach?

The application of a trigonometric polynomial and an exponential fitting approach is compared for a three-point formula for second-order derivatives, for Simpson’s quadrature rule and for Numerov’s scheme for second-order differential equations. The expressions for the occurring parameters are constructed in both the approaches and the behaviour of these parameters with respect to the introduced frequency is studied. The errors for specific problems obtained in both the approaches as a function of the frequency are compared.     

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.     

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.     

‘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.     

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.     

非强制混合向量变分不等式解的存在性研究

本文利用例外簇方法研究非强制混合向量变分不等式的弱有效解的存在性:首先证明若混合向量变分不等式问题不存在例外簇,则混合向量变分不等式问题的弱有效解集为非空集合:利用向量值映射的渐近映射给出自反Banach空间中非强制混合向量变分不等式的弱有效解集不存在例外簇的充分条件,从而得到混合向量变分不等式问题的弱有效解的存在性结果;我们研究了当算子为余正仿射算子时,给出混合仿射向量变分不等式不存在例外簇的充分条件,得到混合仿射向量变分不等式弱有效解的存在性,给出了混合仿射向量变分不等式的弱有效解集为非空紧致集的充分条件.将Iusem等人(2019)在有限维空间中标量混合变分不等式解的存在性结果推广到自反Banach空间中混合向量变分不等式.     

Stabilized finite element schemes with LBB-stable elements for incompressible flows

We study stabilized FE approximations of SUPG type to the incompressible Navier–Stokes problem. Revisiting the analysis for the linearized model, we show that for conforming LBB-stable elements the design of the stabilization parameters for many practical flows differs from that commonly suggested in literature and initially designed for the case of equal-order approximation. Then we analyze a reduced SUPG scheme often used in practice for LBB-stable elements. To provide the reduced scheme with appropriate stability estimates we introduce a modified LBB condition which is proved for a family of FE approximations. The analysis is given for the linearized equations. Numerical experiments for some linear and nonlinear benchmark problems support the theoretical results.     

Scheduling problems in transportation networks of line topology

In this paper we consider online scheduling problems for linear topology under various objective functions: minimizing the maximum completion time, minimizing the largest delay, and minimizing the sum of completion times. We give optimal solutions for uni-directional version of the problem for each of the objectives and show that for the two-directional versions of each problem, no online algorithm can deterministically achieve the optimal solution for any of the considered objective functions. We also propose 2-approximation on-line algorithms for the MinMakespan and the MinSum minimization objectives. We also prove that no online algorithm can deterministically achieve the optimal solution for any of the considered objective functions for the weighted case of uni-directional scenarios.     

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.     

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.     

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.