A numerical scheme for solving advection equations is presented. The scheme is derived from a rational interpolation function. Some properties of the scheme with respect to convex-concave preserving and monotone prese...
详细信息
A numerical scheme for solving advection equations is presented. The scheme is derived from a rational interpolation function. Some properties of the scheme with respect to convex-concave preserving and monotone preserving are discussed. We find that the scheme is attractive in suppressing overshoots and undershoots even in the vicinities of discontinuity. The scheme can also be easily switched as the CIP (Cubic interpolated Pseudo-Particle) method to get a third-order accuracy in smooth region. Numbers of numerical tests are carried out to show the non-oscillatory and less diffusive nature of the scheme.
A simple computational algorithm is presented for determining the Markov parameters of a multivariable linear system specified by a transfer function matrix or right matrix fraction description. In addition, the proce...
详细信息
A simple computational algorithm is presented for determining the Markov parameters of a multivariable linear system specified by a transfer function matrix or right matrix fraction description. In addition, the procedure gives the observability/controllability index and the order of the minimal realization. The dual version of the algorithm can be used when the transfer function matrix is given by a left matrix fraction description. computational examples are given to show the feasibility of the suggested procedure.
In this paper a new algorithm for generating values of Bernstein-Bezier polynomials is proposed and investigated. Opposite to the known algorithms, its computational complexity does not depend on the degree of a calcu...
详细信息
In this paper a new algorithm for generating values of Bernstein-Bezier polynomials is proposed and investigated. Opposite to the known algorithms, its computational complexity does not depend on the degree of a calculated polynomial. However, it allows to calculate only approximate values of the polynomial. These features allow to recommend the proposed algorithm for solving curve fitting and image processing problems in which processing a large number of data is necessary. The proposed method is based on a probabilistic interpretation of Bernstein-Bezier (BB-) polynomials and its properties are investigated in the statistical language. As a byproduct, a local nature of BB-polynomial approximation is displayed.
This paper presents an Adaptive Chain Oriented algorithm (ACAL) for the analysis of closed product form queueing networks with multiple chains. The algorithm calculates the joint queue length distributions as well as ...
详细信息
This paper presents an Adaptive Chain Oriented algorithm (ACAL) for the analysis of closed product form queueing networks with multiple chains. The algorithm calculates the joint queue length distributions as well as the mean performance values. It is shown to be more efficient than existing ones, e.g. MVAC, RECAL or DAC, in dealing with networks with a large number of chains and a small number of nodes. In addition, it has an adaptive nature, which further improves the efficiency of ACAL. The adaptive nature also distinguishes ACAL from existing algorithms.
An improved computer code, MRPS, for solving global optimization problems is presented. In this code, the salient features of random-to-pattern search algorithm proposed by Heydweiller et al. [6] and controlled random...
详细信息
An improved computer code, MRPS, for solving global optimization problems is presented. In this code, the salient features of random-to-pattern search algorithm proposed by Heydweiller et al. [6] and controlled random search algorithm (CRS2) of Price [13] are suitably incorporated. The performance of MRPS was tested with nine constrained problems, reported in the literature. The results obtained clearly indicate the efficiency and reliability of the proposed code in achieving the global optimum.
A hybrid method for computing the feedback gains in linear quadratic regulator problems is proposed. The method, which combines use of a Chandrasekhar type system with an iteration of the Newton-Kleinman form with var...
详细信息
A hybrid method for computing the feedback gains in linear quadratic regulator problems is proposed. The method, which combines use of a Chandrasekhar type system with an iteration of the Newton-Kleinman form with variable acceleration parameter Smith schemes, is formulated to efficiently compute directly the feedback gains rather than solutions of an associated Riccati equation. The hybrid method is particularly appropriate when used with large dimensional systems such as those arising in approximating infinite-dimensional (distributed parameter) control systems (e.g., those governed by delay-differential and partial differential equations). computational advantages of the proposed algorithm over the standard eigenvector (Potter, Laub-Schur) based techniques are discussed, and numerical evidence of the efficacy of these ideas is presented.
Until now, the various computing equations for standard additions methods have been empirical. Workers have used their own judgement to decide whether a solution existed to a given equation and selected an iterative e...
详细信息
Until now, the various computing equations for standard additions methods have been empirical. Workers have used their own judgement to decide whether a solution existed to a given equation and selected an iterative equation and an initial approximation accordingly. If the computed results were wrong, it was not ap
暂无评论