2004
DOI: 10.1109/tmag.2004.824583
|View full text |Cite
|
Sign up to set email alerts
|

Subspace Projection Extrapolation Scheme for Transient Field Simulations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
24
0

Year Published

2006
2006
2018
2018

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 30 publications
(24 citation statements)
references
References 10 publications
0
24
0
Order By: Relevance
“…the finite elements FE, finite difference FD, or the coupled finite element boundary elements BEM-FEM) commonly produces a large scale systems of nonlinear ordinary differential equations or differential algebraic equations [15]. By applying one of the time integration schemes, the values of the EM field variables can be found and the corresponding magnetic forces and torques can be calculated.…”
Section: Solving the Electromagnetic Field Equationsmentioning
confidence: 99%
“…the finite elements FE, finite difference FD, or the coupled finite element boundary elements BEM-FEM) commonly produces a large scale systems of nonlinear ordinary differential equations or differential algebraic equations [15]. By applying one of the time integration schemes, the values of the EM field variables can be found and the corresponding magnetic forces and torques can be calculated.…”
Section: Solving the Electromagnetic Field Equationsmentioning
confidence: 99%
“…The truncated models were reduced in height, and the injection rates were reduced proportionally. All versions of model C were tested with steady-state flow rates (tests 3-5) and with randomly fluctuating rates (tests [6][7][8]. In case of steady-state rates, the sum of the injection rates was taken equal to the sum of the production rates, whereas in the case of random rates the averages of injection and production rates where equal.…”
Section: Resultsmentioning
confidence: 99%
“…In the numerical tests, this procedure will be denoted as 'restart algorithm'. Finally, the first presented iterative method combines the recurrence formulae (8) and possibly the convergence acceleration method (10). In the application, it will be referred as 'proposed method'.…”
Section: Convergence Accelerationmentioning
confidence: 99%
“…One remarks that the recurrence formulae (19) are rather similar to formula (8) and to the iterative process of Section 2.1, except for the Lagrange multiplier and the pseudo-penalization that had been introduced in [10] to stabilize the result of the perturbation process. We no longer discuss this algorithm that is only the linear version of the one presented in [10].…”
Section: A Variant Based On Homotopy and Perturbationmentioning
confidence: 99%