Transformation matrix for time discretization based on Tustin's method
type: Item
instance of: scholarly article
title: Transformation matrix for time discretization based on Tustin's method
zbMATH Open document ID: 1407.93128
DOI: 10.1155/2014/905791
author: Yiming Jiang
author: Sen Wu
author: Xiaodong Hu
published in: Mathematical Problems in Engineering
publication date: 2019-02-08T00:00:00Z
review text: Summary: This paper studies rules in transformation of transfer function through time discretization. A method of using transformation matrix to realize bilinear transform (also known as Tustin's method) is presented. This method can be described as the conversion between the coefficients of transfer functions, which are expressed as transform by certain matrix. For a polynomial of degree \(n\), the corresponding transformation matrix of order \(n\) exists and is unique. Furthermore, the transformation matrix can be decomposed into an upper triangular matrix multiplied with another lower triangular matrix. And both have obvious regularity. The proposed method can achieve rapid bilinear transform used in automatic design of digital filter. The result of numerical simulation verifies the correctness of the theoretical results. Moreover, it also can be extended to other similar problems. Example in the last throws light on this point.
Mathematics Subject Classification ID: 93B40
Mathematics Subject Classification ID: 93B51
zbMATH DE Number: 7017562
Wikidata QID: Q59070580
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2014/905791
OpenAlex ID: W2156316901
cites work: The Cayley Transform as a Time Discretization Scheme
cites work: Digital redesign via the generalised bilinear transformation
cites work: Simple state-space formulations of 2-D frequency transformation and double bilinear transformation
cites work: A general state-space representation of \(n\)-variable bilinear transformation
description: scientific article; zbMATH DE number 7017562