Computing periodic solutions of linear differential-algebraic equations by waveform relaxation

Research output: Contribution to journalArticlepeer-review

28 Scopus citations

Abstract

We propose an algorithm, which is based on the waveform relaxation (WR) approach, to compute the periodic solutions of a linear system described by differential-algebraic equations. For this kind of two-point boundary problems, we derive an analytic expression of the spectral set for the periodic WR operator. We show that the periodic WR algorithm is convergent if the supremum value of the spectral radii for a series of matrices derived from the system is less than 1. Numerical examples, where discrete waveforms are computed with a backward-difference formula, further illustrate the correctness of the theoretical work in this paper.

Original languageEnglish
Pages (from-to)781-804
Number of pages24
JournalMathematics of Computation
Volume74
Issue number250
DOIs
StatePublished - Apr 2005

Keywords

  • Circuit simulation
  • Differential-algebraic equations
  • Finite-difference
  • Linear multistep methods
  • Numerical analysis
  • Periodic solutions
  • Scientific computing
  • Spectra of linear operators
  • Waveform relaxation

Fingerprint

Dive into the research topics of 'Computing periodic solutions of linear differential-algebraic equations by waveform relaxation'. Together they form a unique fingerprint.

Cite this