The stable ATA-orthogonal s-step Orthomin(k) algorithm with the CADNA library

The major drawback of the s-step iterative methods for nonsymmetric linear systems of equations is that, in the floating-point arithmetic, a quick loss of orthogonality of s-dimensional direction subspaces can occur, and consequently slow convergence and instability in the algorithm may be observed as s gets larger than 5. In [18], Swanson and Chronopoulos have demonstrated that the value of s in the s-step Orthomin(k) algorithm can be increased beyond s=5 by orthogonalizing the s direction vectors in each iteration, and have shown that the A^TA-orthogonal s-step Orthomin(k) is stable for large values of s (up to s=16). The subject of this paper is to show how by using the CADNA library, it is possible to determine a good value of s for A^TA-orthogonal s-step Orthomin(k), and during the run of its code to detect the numerical instabilities and to stop the process correctly, and to restart the A^TA-orthogonal s-step Orthomin(k) in order to improve the computed solution. Numerical examples are used to show the good numerical properties. This revised version was published online in June 2006 with corrections to the Cover Date.     

Generalized KKM Type Theorems in FC-Spaces with Applications (I)

The class KKM(X,Y) (resp., s-KKM(X,Y,Z)) of set-valued mappings with KKM (resp., s-KKM) property is introduced in FC-spaces without any convexity structure. Some generalized KKM (resp., s-KKM) type theorems are proved in FC-spaces under much weak assumptions. As applications, some new section theorems and coincidence theorems are established in FC-spaces. These theorems generalize many known results in literature. The further applications of these results will be given in a follow-up paper.     

A Graham-Sloane Type Construction for s-Surjective Matrices

We give a construction of (n–s)-surjective matrices with n columns over using Abelian groups and additive s-bases. In particular we show that the minimum number of rows ms _q(n,n–s) in such a matrix is at most s ^s q ^n–s for all q, n and s.     

直线上子集的H~s-拓扑及其应用

本文利用s-维Hausdorff测度给出了直线上一个子集E上的H~s拓扑和H~s-连通度的定义.讨论了它们的性质及其应用,解决了紧的s-集在欧氏拓扑下往往不连通的问题.     

Finite element approximation of nonlocal parabolic problem

In this article, we present a finite element scheme combined with backward Euler method to solve a nonlocal parabolic problem. An important issue in the numerical solution of nonlocal problems while using Newton's method is related to its structure. In fact differently from the local case where the Jacobian matrix is sparse and banded, in the nonlocal case the Jacobian matrix is dense and computations are much more onerous compared to that for differential equations. In order to avoid this difficulty, we use the technique given by Gudi (SIAM J Numer Anal 50 (2012), 657–668) for elliptic nonlocal problem of Kirchhoff type. We discuss the well‐posedness of the weak formulation at continuous as well as at discrete levels. We also derive a priori error estimates for semidiscrete and fully discrete formulations in L² and H¹ norms. Results based on the usual finite element method are provided to confirm the theoretical estimates. © 2016 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 786–813, 2017     

Monotone interpolation of scattered data in R s

We present a method to interpolate scattered monotone data in R ^s using a variational approach. We present both theoretical and practical properties and give a dual algorithm allowing us to compute the resulting function whens=2. The method is specially suited for scattered data but comparison with existing methods for data on grids shows that it is a valid approach even in that case.Communicated by Wolfgang Dahmen.     

Periodic problems and problems with discontinuities for nonlinear parabolic equations

In this paper we study nonlinear parabolic equations using the method of upper and lower solutions. Using truncation and penalization techniques and results from the theory of operators of monotone type, we prove the existence of a periodic solution between an upper and a lower solution. Then with some monotonicity conditions we prove the existence of extremal solutions in the order interval defined by an upper and a lower solution. Finally we consider problems with discontinuities and we show that their solution set is a compact R -set in (CT, L ²(Z)).     

Classifying cubic symmetric graphs of order 10p or 10p2

A graph is called s-regular if its automorphism group acts regularly on the set of its s-arcs. In this paper, the s-regular cyclic or elementary abelian coverings of the Petersen graph for each s ⩾ 1 are classified when the fibre-preserving automorphism groups act arc-transitively. As an application of these results, all s-regular cubic graphs of order 10p or 10p ² are also classified for each s ⩾ 1 and each prime p, of which the proof depends on the classification of finite simple groups.     

On the nonlinear matrix equation

Based on fixed point theorems for monotone and mixed monotone operators in a normal cone, we prove that the nonlinear matrix equation always has a unique positive definite solution. A conjecture which is proposed in [X.G. Liu, H. Gao, On the positive definite solutions of the matrix equation X^s±A^TX^-tA=I_n, Linear Algebra Appl. 368 (2003) 83–97] is solved. Multi-step stationary iterative method is proposed to compute the unique positive definite solution. Numerical examples show that this iterative method is feasible and effective.     

Riesz Spherical Potentials with External Fields and Minimal Energy Points Separation

In this paper we consider the minimal energy problem on the sphere S ^d for Riesz potentials with external fields. Fundamental existence, uniqueness, and characterization results are derived about the associated equilibrium measure. The discrete problem and the corresponding weighted Fekete points are investigated. As an application we obtain the separation of the minimal s-energy points for d – 2 < s < d. The explicit form of the separation constant is new even for the classical case of s = d – 1. Research supported, in part, by a National Science Foundation Research grant DMS 0532154.     

Global dynamics of a nonlocal population model with age structure in a bounded domain:A non-monotone case

We study the global dynamics of a nonlocal population model with age structure in a bounded domain. We mainly concern with the case where the birth rate decreases as the mature population size become large. The analysis is rather subtle and it is inadequate to apply the powerful theory of monotone dynamical systems. By using the method of super-sub solutions, combined with the careful analysis of the kernel function in the nonlocal term, we prove nonexistence, existence and uniqueness of positive steady states of the model.Moreover, due to the mature individuals do not diffuse, the solution semiflow to the model is not compact. To overcome the difficulty of non-compactness in describing the global asymptotic stability of the unique positive steady state, we first establish an appropriate comparison principle. With the help of the comparison principle,we can employ the theory of dissipative systems to obtain the global asymptotic stability of the unique positive steady state. The main results are illustrated with the nonlocal Nicholson's blowflies equation and the nonlocal Mackey-Glass equation.     

AnM/M/s-consistent diffusion model for theGI/G/s queue

This paper develops a diffusion-approximation model for a stableGI/G/s queue: The queue-length process in theGI/G/s queue is approximated by a diffusion process on the nonnegative real line. Some heuristics on the state space and the infinitesimal parameters of the approximating diffusion process are introduced to obtain an approximation formula for the steady-state queue-length distribution. It is shown that the formula is consistent with the exact results for theM/M/s andM/G/ queues. The accuracy of the approximations for principal congestion measures are numerically examined for some particular cases.     

Erratum to the paper “An Integral Delay Inequality and its Applications to Boundary Value Problems”

We consider the infinitesimal generator of the time reversal of a time-homogeneous one-dimensional gap diffusion with state space [0, 1] given by the infinitesimal generator A^o = dD_s⁺ - dk / dm with nonlocal boundary conditions of Feller-Wentzell-type. This leads to an infinitesimal generator which belongs to a class of generators introduced in the earlier note [W1].     

Age Process, Workload Process, Sojourn Times, and Waiting Times in a Discrete Time SM[K]/PH[K]/1/FCFS Queue

In this paper, we study a discrete time queueing system with multiple types of customers and a first-come-first-served (FCFS) service discipline. Customers arrive according to a semi-Markov arrival process and the service times of individual customers have PH-distributions. A GI/M/1 type Markov chain for a generalized age process of batches of customers is introduced. The steady state distribution of the GI/M/1 type Markov chain is found explicitly and, consequently, the steady state distributions of the age of the batch in service, the total workload in the system, waiting times, and sojourn times of different batches and different types of customers are obtained. We show that the generalized age process and a generalized total workload process have the same steady state distribution. We prove that the waiting times and sojourn times have PH-distributions and find matrix representations of those PH-distributions. When the arrival process is a Markov arrival process with marked transitions, we construct a QBD process for the age process and the total workload process. The steady state distributions of the waiting times and the sojourn times, both at the batch level and the customer level, are obtained from the steady state distribution of the QBD process. A number of numerical examples are presented to gain insight into the waiting processes of different types of customers.AMS subject classification: 60K25, 60J10This revised version was published online in June 2005 with corrected coverdate     

Purity and Equational Compactness of Projection Algebras

The notions of purity and equational compactness of universal algebras have been studied by Banaschewski and Nelson. Also, Banaschewski deals with these notions in the special case of G-sets for a group G. In this paper we study these and related concepts in the category PRO of projection algebras, that is in N -sets, for the monoid N with the binary operation m.n=min{m,n}. We show that every monomorphism in PRO is pure and hence every equationally compact projection algebra is in fact injective. Then, we introduce the notions of s-purity and s-compactness by which we characterize the retractions and hence equationally compact projection algebras. And, among other results, we show that equationally compact, injective, and complete projection algebras are the same. Finally, we characterize (pure-)essential monomorphisms and construct the Equationally Compact Hulls, equivalently the Injective Hulls, of projection algebras. These results, among other things, generalize the main results of Guili, regarding completeness and s-injectivity in the category PRO _s of separated projection algebras.     

Wavelet-Taylor Galerkin Method for the Burgers Equation

In this paper, we propose a wavelet-Taylor Galerkin method for the numerical solution of the Burgers equation. In deriving the computational scheme, Taylor-generalized Euler time discretization is performed prior to wavelet-based Galerkin spatial approximation. The linear system of equations obtained in the process are solved by approximate-factorization-based simple explicit schemes, and the resulting solution is compared with that from regular methods. To deal with transient advection-diffusion situations that evolve toward a convective steady state, a splitting-up strategy is known to be very effective. So the Burgers equation is also solved by a splitting-up method using a wavelet-Taylor Galerkin approach. Here, the advection and diffusion terms in the Burgers equation are separated, and the solution is computed in two phases by appropriate wavelet-Taylor Galerkin schemes. Asymptotic stability of all the proposed schemes is verified, and the L_∞ errors relative to the analytical solution together with the numerical solution are reported. AMS subject classification (2000) 65M70     

Stochastic decomposition in production inventory with service time

We study an (s, S) production inventory system where the processing of inventory requires a positive random amount of time. As a consequence a queue of demands is formed. Demand process is assumed to be Poisson, duration of each service and time required to add an item to the inventory when the production is on, are independent, non-identically distributed exponential random variables. We assume that no customer joins the queue when the inventory level is zero. This assumption leads to an explicit product form solution for the steady state probability vector, using a simple approach. This is despite the fact that there is a strong correlation between the lead-time (the time required to add an item into the inventory) and the number of customers waiting in the system. The technique is: combine the steady state vector of the classical M/M/1 queue and the steady state vector of a production inventory system where the service is instantaneous and no backlogs are allowed. Using a similar technique, the expected length of a production cycle is also obtained explicitly. The optimal values of S and the production switching on level s have been studied for a cost function involving the steady state system performance measures. Since we have obtained explicit expressions for the performance measures, analytic expressions have been derived for calculating the optimal values of S and s.     

Monotone methods and stability results for nonlocal reaction-diffusion equations with time delay

In this paper, we study the applications of the monotone iteration method for investigating the existence and stability of solutions to nonlocal reaction-diffusion equations with time delay. We emphasize the importance of the idea of monotone iteration schemes for investigating the stability of solutions to such equations. We show that every steady state of such equations obtained by using the monotone iteration method is priori stable and all stable steady states can be obtained by using such method. Finally, we apply our main results to three population models.     

Numerical approximation of entropy solutions for hyperbolic integro-differential equations

Summary. Scalar hyperbolic integro-differential equations arise as models for e.g. radiating or self-gravitating fluid flow. We present finite volume schemes on unstructured grids applied to the Cauchy problem for such equations. For a rather general class of integral operators we show convergence of the approximate solutions to a possibly discontinuous entropy solution of the problem. For a specific model problem in radiative hydrodynamics we introduce a convergent fully discrete finite volume scheme. Under the assumption of sufficiently fast spatial decay of the entropy solution we can even establish the convergence rate h^1/4|ln(h)| where h denotes the grid parameter. The convergence proofs rely on appropriate variants of the classical Kruzhkov method for local balance laws together with a truncation technique to cope with the nonlocal character of the integral operator.Mathematics Subject Classification (2000): 35L65, 35Q35, 65M15