143,316 research outputs found
Time-parallel iterative solvers for parabolic evolution equations
We present original time-parallel algorithms for the solution of the implicit
Euler discretization of general linear parabolic evolution equations with
time-dependent self-adjoint spatial operators. Motivated by the inf-sup theory
of parabolic problems, we show that the standard nonsymmetric time-global
system can be equivalently reformulated as an original symmetric saddle-point
system that remains inf-sup stable with respect to the same natural parabolic
norms. We then propose and analyse an efficient and readily implementable
parallel-in-time preconditioner to be used with an inexact Uzawa method. The
proposed preconditioner is non-intrusive and easy to implement in practice, and
also features the key theoretical advantages of robust spectral bounds, leading
to convergence rates that are independent of the number of time-steps, final
time, or spatial mesh sizes, and also a theoretical parallel complexity that
grows only logarithmically with respect to the number of time-steps. Numerical
experiments with large-scale parallel computations show the effectiveness of
the method, along with its good weak and strong scaling properties
Parallel-in-Time Multi-Level Integration of the Shallow-Water Equations on the Rotating Sphere
The modeling of atmospheric processes in the context of weather and climate
simulations is an important and computationally expensive challenge. The
temporal integration of the underlying PDEs requires a very large number of
time steps, even when the terms accounting for the propagation of fast
atmospheric waves are treated implicitly. Therefore, the use of
parallel-in-time integration schemes to reduce the time-to-solution is of
increasing interest, particularly in the numerical weather forecasting field.
We present a multi-level parallel-in-time integration method combining the
Parallel Full Approximation Scheme in Space and Time (PFASST) with a spatial
discretization based on Spherical Harmonics (SH). The iterative algorithm
computes multiple time steps concurrently by interweaving parallel high-order
fine corrections and serial corrections performed on a coarsened problem. To do
that, we design a methodology relying on the spectral basis of the SH to
coarsen and interpolate the problem in space. The methods are evaluated on the
shallow-water equations on the sphere using a set of tests commonly used in the
atmospheric flow community. We assess the convergence of PFASST-SH upon
refinement in time. We also investigate the impact of the coarsening strategy
on the accuracy of the scheme, and specifically on its ability to capture the
high-frequency modes accumulating in the solution. Finally, we study the
computational cost of PFASST-SH to demonstrate that our scheme resolves the
main features of the solution multiple times faster than the serial schemes
Dynamics estimation and generalized tuning of stationary frame current controller for grid-tied power converters
The integration of AC-DC power converters to manage the connection of generation to the grid has increased exponentially over the last years. PV or wind generation plants are one of the main applications showing this trend. High power converters are increasingly installed for integrating the renewables in a larger scale. The control design for these converters becomes more challenging due to the reduced control bandwidth and increased complexity in the grid connection filter. A generalized and optimized control tuning approach for converters becomes more favored. This paper proposes an algorithm for estimating the dynamic performance of the stationary frame current controllers, and based on it a generalized and optimized tuning approach is developed. The experience-based specifications of the tuning inputs are not necessary through the tuning approach. Simulation and experimental results in different scenarios are shown to evaluate the proposal.Peer ReviewedPostprint (published version
Fast Algorithms for the computation of Fourier Extensions of arbitrary length
Fourier series of smooth, non-periodic functions on are known to
exhibit the Gibbs phenomenon, and exhibit overall slow convergence. One way of
overcoming these problems is by using a Fourier series on a larger domain, say
with , a technique called Fourier extension or Fourier
continuation. When constructed as the discrete least squares minimizer in
equidistant points, the Fourier extension has been shown shown to converge
geometrically in the truncation parameter . A fast algorithm has been described to compute Fourier extensions for the case
where , compared to for solving the dense discrete
least squares problem. We present two algorithms for
the computation of these approximations for the case of general , made
possible by exploiting the connection between Fourier extensions and Prolate
Spheroidal Wave theory. The first algorithm is based on the explicit
computation of so-called periodic discrete prolate spheroidal sequences, while
the second algorithm is purely algebraic and only implicitly based on the
theory
- …