𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for the computation of the Tustin bilinear transformation

✍ Scribed by Westreich, D.


Publisher
Wiley (John Wiley & Sons)
Year
1989
Tongue
English
Weight
79 KB
Volume
5
Category
Article
ISSN
0748-8025

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A Comparison of Algorithms for the Compu
✍ Dr. rer. nat. E. Schuster πŸ“‚ Article πŸ“… 1985 πŸ› John Wiley and Sons 🌐 English βš– 242 KB πŸ‘ 1 views

An algorithm is proposed for the computation of the Mann-Whitney Test which only requires the separate ordering of the individual samples and is therefore more suitable than the usual one. It is also more suitable as t o computation time than the algorithm described by KUMMER, 1981, if the two sampl

A new proposed algorithm of arbitrary ra
✍ D. Chikouche; A. Khellaf; S. Bouguezel πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 109 KB πŸ‘ 2 views

In this paper, we propose a new approach for computing 2D FFT's that are suitable for implementation on a systolic array architecture. Our algorithm is derived in this paper from a Cooley decimation-in-time algorithm by using an appropriate indexing process. It is proved that the number of multiplic

Fast boundary-domain integral algorithm
✍ M. HriberΕ‘ek; L. Ε kerget πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 229 KB πŸ‘ 2 views

The paper deals with the numerical solution of fluid dynamics using the boundary-domain integral method (BDIM). A velocity-vorticity formulation of the Navier -Stokes equations is adopted, where the kinematic equation is written in its parabolic form. Computational aspects of the numerical simulatio

Linear time algorithms for computing the
✍ Xue, Guoliang πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 121 KB πŸ‘ 2 views

Given a tree network with n vertices where each edge has an operational probability, we are interested in finding a vertex on the tree whose expected number of reachable vertices is maximum. This problem was studied in Networks 27 (1996) 219-237, where an O(n 3 ) time algorithm and an O(n 2 ) time a