107,295 research outputs found
Parallel-In-Time Simulation of Eddy Current Problems Using Parareal
In this contribution the usage of the Parareal method is proposed for the
time-parallel solution of the eddy current problem. The method is adapted to
the particular challenges of the problem that are related to the differential
algebraic character due to non-conducting regions. It is shown how the
necessary modification can be automatically incorporated by using a suitable
time stepping method. The paper closes with a first demonstration of a
simulation of a realistic four-pole induction machine model using Parareal
Solving 1D Conservation Laws Using Pontryagin's Minimum Principle
This paper discusses a connection between scalar convex conservation laws and
Pontryagin's minimum principle. For flux functions for which an associated
optimal control problem can be found, a minimum value solution of the
conservation law is proposed. For scalar space-independent convex conservation
laws such a control problem exists and the minimum value solution of the
conservation law is equivalent to the entropy solution. This can be seen as a
generalization of the Lax--Oleinik formula to convex (not necessarily uniformly
convex) flux functions. Using Pontryagin's minimum principle, an algorithm for
finding the minimum value solution pointwise of scalar convex conservation laws
is given. Numerical examples of approximating the solution of both
space-dependent and space-independent conservation laws are provided to
demonstrate the accuracy and applicability of the proposed algorithm.
Furthermore, a MATLAB routine using Chebfun is provided (along with
demonstration code on how to use it) to approximately solve scalar convex
conservation laws with space-independent flux functions
An Optimized and Scalable Eigensolver for Sequences of Eigenvalue Problems
In many scientific applications the solution of non-linear differential
equations are obtained through the set-up and solution of a number of
successive eigenproblems. These eigenproblems can be regarded as a sequence
whenever the solution of one problem fosters the initialization of the next. In
addition, in some eigenproblem sequences there is a connection between the
solutions of adjacent eigenproblems. Whenever it is possible to unravel the
existence of such a connection, the eigenproblem sequence is said to be
correlated. When facing with a sequence of correlated eigenproblems the current
strategy amounts to solving each eigenproblem in isolation. We propose a
alternative approach which exploits such correlation through the use of an
eigensolver based on subspace iteration and accelerated with Chebyshev
polynomials (ChFSI). The resulting eigensolver is optimized by minimizing the
number of matrix-vector multiplications and parallelized using the Elemental
library framework. Numerical results show that ChFSI achieves excellent
scalability and is competitive with current dense linear algebra parallel
eigensolvers.Comment: 23 Pages, 6 figures. First revision of an invited submission to
special issue of Concurrency and Computation: Practice and Experienc
- …