An algorithm for the computation of the Tustin bilinear transformation

DOI10.1002/CNM.1630050704zbMATH Open0691.65010OpenAlexW2008562772MaRDI QIDQ3033191FDOQ3033191

Authors: David Westreich 

Publication date: 1989

Published in: Communications in Applied Numerical Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/cnm.1630050704

Recommendations

• A new transformation matrix for bilinear transformation
• Bilinear transformation method
• Number theoretic fast algorithms for bilinear and other generalized transformations
• scientific article; zbMATH DE number 16811
• A fast algorithm for the linear canonical transform
• An algorithmic approach to the Mellin transform method
• Hirota's bilinear method, Shanks' transformation, and the \(\varepsilon\)-algorithms
• Iteration and bilinear transformations
• On some applications of bilateral orthogonalization in computational algebra

zbMATH Keywords

algorithmTustin bilinear transformation

Mathematics Subject Classification ID

General theory of numerical methods in complex analysis (potential theory, etc.) (65E05)

Cited In (7)

• A new algorithm for computing modified z-transforms
• Bilinear transformation method
• Generation of discrete and continuous time transfer function coefficients
• Comments on "S-plane to Z-plane mapping using a simultaneous equation algorithm based on the bilinear transformation" by F.D. Groutage, et al
• Comments on "S-plane to Z-plane mapping using a simultaneous equation algorithm based on the bilinear transformation" by F.D. Groutage, et al
• Computational aspects of the bilinear transformation based algorithm for S-plane to Z-plane mapping
• Transformation matrix for time discretization based on Tustin's method

This page was built for publication: An algorithm for the computation of the Tustin bilinear transformation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3033191)