Krylov precise time-step integration method

An efficient precise time‐step integration (PTI) algorithm to solve large‐scale transient problems is presented in this paper. The Krylov subspace method and the Padé approximations are applied to modify the original PTI algorithm in order to improve the computational efficiency. Both the stability...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal for numerical methods in engineering Jg. 68; H. 11; S. 1115 - 1136
Hauptverfasser: Fung, T. C., Chen, Z. L.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Chichester, UK John Wiley & Sons, Ltd 10.12.2006
Wiley
Schlagworte:
Algorithms
Arnoldi algorithm
Computational efficiency
Computational techniques
Exact sciences and technology
Fundamental areas of phenomenology (including applications)
Krylov subspace method
Mathematical methods in physics
Mathematical models
Nonlinearity
Numerical analysis
Padé approximations
Physics
precise time-step integration (PTI) algorithm
Resultants
Stability
Subspace methods
High performance
Transient response
Numerical integration
Padé approximations
Krylov subspace method
Step method
Distributed computing
Arnoldi algorithm
Time domain method
precise time-step integration (PTI) algorithm
Particular solution
Modelling
Non linear effect
Padé approximation
ISSN:0029-5981, 1097-0207
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:An efficient precise time‐step integration (PTI) algorithm to solve large‐scale transient problems is presented in this paper. The Krylov subspace method and the Padé approximations are applied to modify the original PTI algorithm in order to improve the computational efficiency. Both the stability and accuracy characteristics of the resultant algorithms are investigated. The efficiency can be further improved by expanding the dimension to avoid the computation of the particular solutions. The present algorithm can also be extended to tackle nonlinear problems without difficulty. Two numerical examples are given to illustrate the highly accurate and efficient algorithm. Copyright © 2006 John Wiley & Sons, Ltd.
Bibliographie:ArticleID:NME1737
istex:F916D72E1D338AB1EFE808F6469ED911E656F28A
ark:/67375/WNG-913HS68Z-B
ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0029-5981
1097-0207
DOI:10.1002/nme.1737