Fast and Stable Recursive Algorithms for Continuous-Time and Discrete-Time Model Conversions

Abstract

Based on the Newton Raphson method, this paper presents recursive algorithms that are rapidly convergent and more stable for modeling the equivalent continuous-time (discrete-time) model from the available discrete-time (continuous-time) model for a fixed sampling period. The newly developed recursive algorithms relax the constraints imposed upon the existing model conversion algorithms, and, thus enhance the applications of microprocessors and associated microelectronics to digital control systems. A practical example is presented to demonstrate the effectiveness of the proposed procedures. Reprints.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1987
Accession Number
ADA211074

Entities

People

  • C. B. Park
  • L. S. Shieh
  • N. P. Coleman
  • S. R. Lian

Organizations

  • University of Houston

Tags

Communities of Interest

  • Energy and Power Technologies
  • Weapons Technologies

DTIC Thesaurus Topics

  • Abstracts
  • Accuracy
  • Algorithms
  • Classification
  • Computational Complexity
  • Computations
  • Computers
  • Control Systems
  • Convergence
  • Conversion
  • Eigenvalues
  • Equations
  • Exponential Functions
  • Infinite Series
  • Military Research
  • Simulations
  • Square Roots

Fields of Study

  • Engineering

Readers

  • Integrated Circuit Design and Technology.
  • Operations Research
  • Systems Analysis and Design

Technology Areas

  • Microelectronics