On the well-posedness of periodic problems for the system of hyperbolic equations with finite time delay

A periodic problem for the system of hyperbolic equations with finite time delay is investigated. The investigated problem is reduced to an equivalent problem, consisting the family of periodic problems for a system of ordinary differential equations with finite delay and integral equations using the method of a new functions introduction. Relationship of periodic problem for the system of hyperbolic equations with finite time delay and the family of periodic problems for the system of ordinary differential equations with finite delay is established. Algorithms for finding approximate solutions of the equivalent problem are constructed, and their convergence is proved. Criteria of well-posedness of periodic problem for the system of hyperbolic equations with finite time delay are obtained.     

Finite procedures for sofic systems

A sofic system is a symbolic flow defined by a finite semigroup. We exhibit finite procedures, involving only the defining semigroup, for answering cetain questions about a sofic system and for constructing certain subshifts of finite type associated with a sofic system.     

LONG-TIME BEHAVIOR OF FINITE DIFFERENCE SOLUTIONS OF A NONLINEAR SCHRODINGER EQUATION WITH WEAKLY DAMPED

1. IntroductionThe nonlinear schr~r equation with weakly dampedwhere t = N, o > 0, together with appropriate boUndary and hatal condition, is ared inmany physical fields. The echtence of an attractor is one of the most boortant ~eristiCSfor a dissipative system. The long-tabs dynamics is completely determined by the attractorof the system. J.M. Ghidaglia[1] studied the lOng-the behavior of the nonlineaz Sequation (1.1) and proved the eAstence of a compact global attractor A in H'(n) which…     

Design of a robust nonlinear controller for a synchronous generator connected to an infinite bus

This article presents a new design of robust finite‐time controller which replaces the traditional automatic voltage regulator for excitation control of the third‐order model synchronous generator connected to an infinite bus. The effects of system uncertainties and external noises are fully taken into account. Then a single input robust controller is proposed to regulate the system states to reach the origin in a given finite time. The designed robust finite‐time excitation controller can refine the system behaviors in convergence and robustness against model uncertainties and external disturbances. The robustness and finite‐time stability of the closed‐loop system are analytically proved using the finite‐time control idea and Lyapunov stability theorem. The suitability and robustness of the designed controller are shown in contrast with two other strong nonlinear control strategies. The main advantages of the proposed controller are as follows: a) robustness against system uncertainties and external noises; b) convergence to the equilibrium point in a given finite time; and c) the use of a single control input. © 2015 Wiley Periodicals, Inc. Complexity 21: 203–213, 2016     

Explicit solution of the incompressible Navier–Stokes equations with linear finite elements

A three-field finite element scheme for the explicit iterative solution of the stationary incompressible Navier–Stokes equations is studied. In linearized form the scheme is associated with a generalized time-dependent Stokes system discretized in time. The resulting system of equations allows for a stable approximation of velocity, pressure and stress deviator tensor, by means of continuous piecewise linear finite elements, in both two- and three-dimensional space. Convergence in an appropriate sense applying to this finite element discretization is demonstrated, for the stationary Stokes system.     

Compactness of the product topology and the solvability of infinite systems of infinite linear equations

If every finite subsystem of an infinite system of linear equations (say, over the field of real numbers) each with finitely many unknowns has a solution then the entire system has a solution. The situation is not so if the equations contain infinitely many unknowns. In this case, as shown below, the solvability of every finite subsystem implies the solva. bility of the entire system provided finite subsystems have solution with common upper and lower bounds and the coefficients of ever equation satisfy some boundedness or convergence conditions. The passage from the solvability of finite subsystem to the solvability of the entire system is achieved based on Tychnoff’s theorem stating that any product of compact topological spaces is compact in their product topology.     

基于有限区域量化的系统稳定性分析与设计

针对基于输出反馈和具有有限区域信号量化的离散时间系统,进行了系统稳定性分析与量化参数设计的研究.首先,分别对状态观测误差系统和对象系统在有限区域对数量化作用下的系统渐近稳定性进行了分析,得到了相应的稳定性条件,接着针对对数型量化器,给出了两个系统稳定性之间的内在关联,同时得到了各有限区域量化器的量化区间上界值.在此基础上,得到了保证各子系统稳定的系统通信速率比值.最后,给出了在时变量化作用下基于状态观测的控制策略和仿真例子.     

On stability in terms of two measures of a hybrid system having partly invisible solutions

We consider three different dynamic systems. The first runs “smoothly” during a certain finite time interval, undergoes an abrupt change in the dynamics during the next (finite) time interval and is governed by the second system. The solution of this second system lies on a surface for a finite amount of time and becomes invisible. At the beginning of the third phase, the system is subjected to an impulse which causes the solution to leave the surface and we have the new hybrid impulsive system. In this paper, we employ two measures to find suitable conditions so that the new system again runs as smoothly as the first.     

Non-overlapping Domain Decomposition Method for a Nodal Finite Element Method

A new approach is proposed for constructing nonoverlapping domain decomposition procedures for solving a linear system related to a nodal finite element method. It applies to problems involving either positive semi-definite or complex indefinite local matrices. The main feature of the method is to preserve the continuity requirements on the unknowns and the finite element equations at the nodes shared by more than two subdomains and to suitably augment the local matrices. We prove that the corresponding algorithm can be seen as a converging iterative method for solving the finite element system and that it cannot break down. Each iteration is obtained by solving uncoupled local finite element systems posed in each subdomain and, in contrast to a strict domain decomposition method, is completed by solving a linear system whose unknowns are the degrees of freedom attached to the above special nodes.     

A cryptographic system based on finite field transforms

In this paper, we develop a cipher system based on finite field transforms. In this system, blocks of the input character-string are enciphered using congruence or modular transformations with respect to either primes or irreducible polynomials over a finite field. The polynomial system is shown to be clearly superior to the prime system for conventional cryptographic work.     

Multilevel Preconditioners for Mixed Methods for Second Order Elliptic Problems

A new approach for constructing algebraic multilevel preconditioners for mixed finite element methods for second order elliptic problems with tensor coefficients on general geometry is proposed. The linear system arising from the mixed methods is first algebraically condensed to a symmetric, positive definite system for Lagrange multipliers, which corresponds to a linear system generated by standard nonconforming finite element methods. Algebraic multilevel preconditioners for this system are then constructed based on a triangulation of the domain into tetrahedral substructures. Explicit estimates of condition numbers and simple computational schemes are established for the constructed preconditioners. Finally, numerical results for the mixed finite element methods are presented to illustrate the present theory.     

The entropies and periods of renewal systems

In this work the set of entropies of shifts of finite type is proved to be the same as the set of entropies of renewal systems that are shifts of finite type. The period of a finite set of words is the greatest common divisor of the lengths of the words. We show that the period of a renewal system as a shift space and the minimum of the periods of its generating sets coincide when the system is of finite type or mixing. This work was supported by grant No.R04-2004-000-10157-0 from the Basic Research Program of the Korea Research Foundation.     

An operator splitting method with FDM and FEM for the convection- diffusion equation using boundary-fitted coordinate system

An operator splitting method combining finite difference method and finite element method is proposed in this paper by using boundary-fitted coordinate system. The governing equation is split into advection and diffusion equations and solved by finite difference method using boundary-fitted coordinate system and finite element method respectively. An example for which analytic solution is available is used to verified the proposed methods and the agreement is very good. Numerical results show that it is very efficient.     

Numerical treatment for solving fractional Riccati differential equation

This paper presents an accurate numerical method for solving fractional Riccati differential equation (FRDE). The proposed method so called fractional Chebyshev finite difference method (FCheb-FDM). In this technique, we approximate FRDE with a finite dimensional problem. The method is based on the combination of the useful properties of Chebyshev polynomials approximation and finite difference method. The Caputo fractional derivative is replaced by a difference quotient and the integral by a finite sum. By this method the given problem is reduced to a problem for solving a system of algebraic equations, and by solving this system, we obtain the solution of FRDE. Special attention is given to study the convergence analysis and estimate an error upper bound of the obtained approximate formula. Illustrative examples are included to demonstrate the validity and applicability of the proposed technique.     

Monte Carlo method via a numerical algorithm to solve a parabolic problem

This paper is intended to provide a numerical algorithm consisted of the combined use of the finite difference method and Monte Carlo method to solve a one-dimensional parabolic partial differential equation. The numerical algorithm is based on the discretize governing equations by finite difference method. Due to the application of the finite difference method, a large sparse system of linear algebraic equations is obtained. An approach of Monte Carlo method is employed to solve the linear system. Numerical tests are performed in order to show the efficiency and accuracy of the present work.     

Finite difference reaction-diffusion systems with coupled boundary conditions and time delays

This paper is concerned with finite difference solutions of a coupled system of reaction-diffusion equations with nonlinear boundary conditions and time delays. The system is coupled through the reaction functions as well as the boundary conditions, and the time delays may appear in both the reaction functions and the boundary functions. The reaction-diffusion system is discretized by the finite difference method, and the investigation is devoted to the finite difference equations for both the time-dependent problem and its corresponding steady-state problem. This investigation includes the existence and uniqueness of a finite difference solution for nonquasimonotone functions, monotone convergence of the time-dependent solution to a maximal or a minimal steady-state solution for quasimonotone functions, and local and global attractors of the time-dependent system, including the convergence of the time-dependent solution to a unique steady-state solution. Also discussed are some computational algorithms for numerical solutions of the steady-state problem when the reaction function and the boundary function are quasimonotone. All the results for the coupled reaction-diffusion equations are directly applicable to systems of parabolic-ordinary equations and to reaction-diffusion systems without time delays.     

Finite Difference Method for an Optimal Control Problem for a Nonlinear Time-dependent Schrödinger Equation

The finite difference method is applied to an optimal control problem for a system governed by a nonlinear Schrödinger equation with a complex coe?cient. The optimal control problem is discretized by the finite difference method, the error estimate for the finite difference scheme is established and the convergence of difference approximations of the optimal control according to the functional is proved.     

Tandem queueing system with infinite and finite intermediate buffers and generalized phase-type service time distribution

A tandem queueing system with infinite and finite intermediate buffers, heterogeneous customers and generalized phase-type service time distribution at the second stage is investigated. The first stage of the tandem has a finite number of servers without buffer. The second stage consists of an infinite and a finite buffers and a finite number of servers. The arrival flow of customers is described by a Marked Markovian arrival process. Type 1 customers arrive to the first stage while type 2 customers arrive to the second stage directly. The service time at the first stage has an exponential distribution. The service times of type 1 and type 2 customers at the second stage have a phase-type distribution with different parameters. During a waiting period in the intermediate buffer, type 1 customers can be impatient and leave the system. The ergodicity condition and the steady-state distribution of the system states are analyzed. Some key performance measures are calculated. The Laplace–Stieltjes transform of the sojourn time distribution of type 2 customers is derived. Numerical examples are presented.     

The entropies of renewal systems

Renewal systems are symbolic dynamical systems originally introduced by Adler. IfW is a finite set of words over a finite alphabetA, then the renewal system generated byW is the subshiftX _W ⊂A ^Z formed by bi-infinite concatenations of words fromW. Motivated by Adler’s question of whether every irreducible shift of finite type is conjugate to a renewal system, we prove that for every shift of finite type there is a renewal system having the same entropy. We also show that every shift of finite type can be approximated from above by renewal systems, and that by placing finite-type constraints on possible concatenations, we obtain all sofic systems. The authors were supported in part by NFS grants DMS-8706284, DMS-8814159 and DMS-8820716.