The paper proposes a new recursive approach for the analysis of singular system using Taylor series. Firstly, theoretical foundation of the recursive algorithm using both first and second orders Taylor series has been...
详细信息
ISBN:
(纸本)9781479917693
The paper proposes a new recursive approach for the analysis of singular system using Taylor series. Firstly, theoretical foundation of the recursive algorithm using both first and second orders Taylor series has been established in a lucid manner. Numerical examples have been treated along with relevant tables and curves in support of effectiveness of the method. Further, mean integral square error (MISE) has been estimated for both first and second order Taylor series approaches and found to be within tolerable limits. Thus, the method proves to be attractive and efficient as well.
Multi-dimension linked lists is a new data structure,which has powerful function and well visiting performance. It can be applied in scientific computing analysis,image processing,database index and so on. With the de...
详细信息
ISBN:
(纸本)9787811240559
Multi-dimension linked lists is a new data structure,which has powerful function and well visiting performance. It can be applied in scientific computing analysis,image processing,database index and so on. With the development of computer science, multi-dimension linked lists may be applied in other rectangular coordinate system's spatial expression and multi-dimension linked lists recursive algorithm will give us very large significance. By the research of multi-dimension linked lists in this paper, it would be given out of the mathematical model and recursive algorithm of multi-dimension linked lists.
L1 norm estimator has been widely used as a robust parameter estimation method for outlier detection. Different algorithms have been applied for L1 norm minimization among which the linear programming problem based on...
详细信息
L1 norm estimator has been widely used as a robust parameter estimation method for outlier detection. Different algorithms have been applied for L1 norm minimization among which the linear programming problem based on the simplex method is well known. In the present contribution, in order to solve an L1 norm minimization problem in a linear model, an interior point algorithm is developed which is based on Dikin's method. The method can be considered as an appropriate alternative for the classical simplex method, which is sometimes time-consuming. The proposed method, compared with the simplex method, is thus easier for implementation and faster in performance. Furthermore, a recursive form of the Dikin's method is derived, which resembles the recursive least-squares method. Two simulated numerical examples show that the proposed algorithm gives as accurate results as the simplex method but in considerably less time. When dealing with a large number of observations, this algorithm can thus be used instead of the iteratively reweighted least-squares method and the simplex method.
A recursive algorithm of moving horizon estimation (MHE) with the convergence property is presented in this paper. In this work, we formulate the state estimation problem as a quadratic program problem with fixed-size...
详细信息
ISBN:
(纸本)078037729X
A recursive algorithm of moving horizon estimation (MHE) with the convergence property is presented in this paper. In this work, we formulate the state estimation problem as a quadratic program problem with fixed-size estimation window and a recursive formula for prior state estimation and covariance matrix is established. The proposed algorithm can improve the performance of MHE and offers advantages over other algorithm of MHE and Kalman filter.
This paper presents a new recursive algorithm for computing bounds on the reliability of a directed, source-sink network whose arcs either function or fail with known probabilities. The reliability is the probability ...
详细信息
Focusing on the unconstrained circle cutting problem, a recursive algorithm which can generate four-block cutting pattern was presented. With the four-block cutting pattern, a sheet can be cut into four blocks. Each b...
详细信息
ISBN:
(纸本)9781538612446
Focusing on the unconstrained circle cutting problem, a recursive algorithm which can generate four-block cutting pattern was presented. With the four-block cutting pattern, a sheet can be cut into four blocks. Each block contains strips of the same direction and length. In each strip more than one row of identical blanks can appear. The optimal arrangement of strips on each block was determined by the recursive algorithm. An implicit enumeration method was used to determine the combination of blocks in sheet to make the material usage reach its maximum. The experimental results show that, the algorithm is efficient in both the computation time and the material usage.
Multiple bridged knife-edge diffraction estimation can be seen as a generalization of the multiple knife-edge diffraction one which can be found in many applications of wireless communications. The considered model is...
详细信息
ISBN:
(纸本)9789082797060
Multiple bridged knife-edge diffraction estimation can be seen as a generalization of the multiple knife-edge diffraction one which can be found in many applications of wireless communications. The considered model is formed by bridging the spaces among knife-edges with reflecting planes. So far, the series-based standard solution for this problem suffers from high computational complexity, thus limiting its use in practice. We, thus, propose a fast recursive algorithm to tackle its computational burden. To illustrate the effectiveness of the proposed algorithm, we compare our results with the state-of-the-art algorithms. Numerical results show that the running time of the proposed algorithm is much faster than that of the standard solution while benefiting from similar accuracy.
recursive algorithm (RA) need a great number of storage space for continue operations (such as push) on stack, which easily causes stack overflow. In the paper, we present a novel recursive algorithm to solve this int...
详细信息
ISBN:
(纸本)1424400600
recursive algorithm (RA) need a great number of storage space for continue operations (such as push) on stack, which easily causes stack overflow. In the paper, we present a novel recursive algorithm to solve this intractability throw constructing recursive tree, which only restoring valuable data for decreasing the spatial complexity, and then traversing recursive tree. In this way, the problem of spatial complexity of recursive algorithm could be solved effectively, making recursive algorithm more practical in application.
Axial impact between two elastic rods with piecewise constant characteristic impedance is considered. The distribution of characteristic impedance of the impacted rod and the impact velocity are given. By use of a 1D ...
详细信息
Axial impact between two elastic rods with piecewise constant characteristic impedance is considered. The distribution of characteristic impedance of the impacted rod and the impact velocity are given. By use of a 1D recursive algorithm, the characteristic impedances of the impacting rod are determined as long as they are all positive so that a prescribed impact force is realized. A condition for positivity of the characteristic impedance is derived in terms of transmission coefficients for wave energy. At the time from which positivity of all characteristic impedances cannot be maintained, or earlier, the characteristic impedance of the impacting body is continued, e.g., at the level of the last positive characteristic impedance or at level zero corresponding to cutting off the impacting rod. Examples of prescribed exponentially decreasing and linearly increasing impact forces are presented for a uniform impacted rod with constant characteristic impedance. In these examples, there is good agreement between the prescribed impact force and the impact force obtained from 3D FE simulation with a piecewise linear diameter of the impacting body that approximates the piecewise constant diameter obtained by use of the 1D recursive algorithm.
Given a point set P of the general dimension we present a recursive algorithm for finding the sphere with the smallest radius which contains all points of P. For given point sets Q(1), ..., Q(l) we extend the algorith...
详细信息
暂无评论