A Simplified Method for the Bilinear s-z Transformation
نویسنده
چکیده
A new technique for performing the bilinear transformation of polynomials is presented. The technique is both simple to understand as well as efficient in its computer implementation. The key to the method is the way in which the successive derivatives of a particular polynomial are computed. A simple recursion formula is used which can be done either by hand, if desired, or by computer. The order of complexity of the algorithm is found to be O(n*), while storage requirements are O(n), where n is the degree of the polynomial. The new method will handle completely general bilinear transformations. A computer implementation is presented which was found to be satisfactory for both precision and speed.
منابع مشابه
Multi soliton solutions, bilinear Backlund transformation and Lax pair of nonlinear evolution equation in (2+1)-dimension
As an application of Hirota bilinear method, perturbation expansion truncated at different levels is used to obtain exact soliton solutions to (2+1)-dimensional nonlinear evolution equation in much simpler way in comparison to other existing methods. We have derived bilinear form of nonlinear evolution equation and using this bilinear form, bilinear Backlund transformations and construction of ...
متن کاملA Simplified Modal Pushover Analysis-based Method for Incremental Dynamic Analysis of Regular RC Moment-resisting Frames
Incremental Dynamic Analysis (IDA) procedure is now considered as a robust tool for estimating the seismic sidesway collapse capacity of structures. However, the procedure is time-consuming and requires numerous nonlinear response-history analyses. This paper proposes a simplified Modal Pushover Analysis (MPA) procedure for IDA of RC moment-resisting frames. The proposed method uses the dynamic...
متن کاملReduced-Order Modeling Based on PRONY's and SHANK's Methods via the Bilinear Transformation
In this paper, we propose a new model-order reduction technique for linear dynamic systems. The idea behind this technique is to transform the dynamic system function from the s-domain into the z-domain via the bilinear transformation, then use Prony’s [1, 2] or Shank’s [3] least-squares approximation methods instead of the commonly employed Padé approximation method, and finally transform the ...
متن کاملFrequency Transformation with Pascal Matrix Equations
Abstract—Frequency transformation with Pascal matrix equations is a method for transforming an electronic filter (analogue or digital) into another filter. The technique is based on frequency transformation in the s-domain, bilinear z-transform with pre-warping frequency, inverse bilinear transformation and a very useful application of the Pascal’s triangle that simplifies computing and enables...
متن کامل$n$-factorization Property of Bilinear Mappings
In this paper, we define a new concept of factorization for a bounded bilinear mapping $f:Xtimes Yto Z$, depended on a natural number $n$ and a cardinal number $kappa$; which is called $n$-factorization property of level $kappa$. Then we study the relation between $n$-factorization property of level $kappa$ for $X^*$ with respect to $f$ and automatically boundedness and $w^*$-$w^*$-continuity...
متن کامل