7,519 research outputs found
Preconditioning of weighted H(div)-norm and applications to numerical simulation of highly heterogeneous media
In this paper we propose and analyze a preconditioner for a system arising
from a finite element approximation of second order elliptic problems
describing processes in highly het- erogeneous media. Our approach uses the
technique of multilevel methods and the recently proposed preconditioner based
on additive Schur complement approximation by J. Kraus (see [8]). The main
results are the design and a theoretical and numerical justification of an
iterative method for such problems that is robust with respect to the contrast
of the media, defined as the ratio between the maximum and minimum values of
the coefficient (related to the permeability/conductivity).Comment: 28 page
Relativistic MHD and black hole excision: Formulation and initial tests
A new algorithm for solving the general relativistic MHD equations is
described in this paper. We design our scheme to incorporate black hole
excision with smooth boundaries, and to simplify solving the combined Einstein
and MHD equations with AMR. The fluid equations are solved using a finite
difference Convex ENO method. Excision is implemented using overlapping grids.
Elliptic and hyperbolic divergence cleaning techniques allow for maximum
flexibility in choosing coordinate systems, and we compare both methods for a
standard problem. Numerical results of standard test problems are presented in
two-dimensional flat space using excision, overlapping grids, and elliptic and
hyperbolic divergence cleaning.Comment: 22 pages, 8 figure
Multicore-optimized wavefront diamond blocking for optimizing stencil updates
The importance of stencil-based algorithms in computational science has
focused attention on optimized parallel implementations for multilevel
cache-based processors. Temporal blocking schemes leverage the large bandwidth
and low latency of caches to accelerate stencil updates and approach
theoretical peak performance. A key ingredient is the reduction of data traffic
across slow data paths, especially the main memory interface. In this work we
combine the ideas of multi-core wavefront temporal blocking and diamond tiling
to arrive at stencil update schemes that show large reductions in memory
pressure compared to existing approaches. The resulting schemes show
performance advantages in bandwidth-starved situations, which are exacerbated
by the high bytes per lattice update case of variable coefficients. Our thread
groups concept provides a controllable trade-off between concurrency and memory
usage, shifting the pressure between the memory interface and the CPU. We
present performance results on a contemporary Intel processor
Spectral methods for CFD
One of the objectives of these notes is to provide a basic introduction to spectral methods with a particular emphasis on applications to computational fluid dynamics. Another objective is to summarize some of the most important developments in spectral methods in the last two years. The fundamentals of spectral methods for simple problems will be covered in depth, and the essential elements of several fluid dynamical applications will be sketched
Computational and numerical analysis of differential equations using spectral based collocation method.
Doctoral Degree. University of KwaZulu-Natal, Pietermaritzburg.In this thesis, we develop accurate and computationally eļ¬cient spectral collocation-based methods,
both modiļ¬ed and new, and apply them to solve diļ¬erential equations. Spectral collocation-based
methods are the most commonly used methods for approximating smooth solutions of diļ¬erential
equations deļ¬ned over simple geometries. Procedurally, these methods entail transforming the gov
erning diļ¬erential equation(s) into a system of linear algebraic equations that can be solved directly.
Owing to the complexity of expanding the numerical algorithms to higher dimensions, as reported
in the literature, researchers often transform their models to reduce the number of variables or
narrow them down to problems with fewer dimensions. Such a process is accomplished by making
a series of assumptions that limit the scope of the study. To address this deļ¬ciency, the present
study explores the development of numerical algorithms for solving ordinary and partial diļ¬erential
equations deļ¬ned over simple geometries. The solutions of the diļ¬erential equations considered are
approximated using interpolating polynomials that satisfy the given diļ¬erential equation at se
lected distinct collocation points preferably the Chebyshev-Gauss-Lobatto points. The size of the
computational domain is particularly emphasized as it plays a key role in determining the number
of grid points that are used; a feature that dictates the accuracy and the computational expense of
the spectral method. To solve diļ¬erential equations deļ¬ned on large computational domains much
eļ¬ort is devoted to the development and application of new multidomain approaches, based on
decomposing large spatial domain(s) into a sequence of overlapping subintervals and a large time
interval into equal non-overlapping subintervals. The rigorous analysis of the numerical results con
ļ¬rms the superiority of these multiple domain techniques in terms of accuracy and computational
eļ¬ciency over the single domain approach when applied to problems deļ¬ned over large domains.
The structure of the thesis indicates a smooth sequence of constructing spectral collocation method
algorithms for problems across diļ¬erent dimensions. The process of switching between dimensions
is explained by presenting the work in chronological order from a simple one-dimensional problem
to more complex higher-dimensional problems. The preliminary chapter explores solutions of or
dinary diļ¬erential equations. Subsequent chapters then build on solutions to partial diļ¬erential
i
equations in order of increasing computational complexity. The transition between intermediate
dimensions is demonstrated and reinforced while highlighting the computational complexities in
volved. Discussions of the numerical methods terminate with development and application of a
new method namely; the trivariate spectral collocation method for solving two-dimensional initial
boundary value problems. Finally, the new error bound theorems on polynomial interpolation are
presented with rigorous proofs in each chapter to benchmark the adoption of the diļ¬erent numerical
algorithms. The numerical results of the study conļ¬rm that incorporating domain decomposition
techniques in spectral collocation methods work eļ¬ectively for all dimensions, as we report highly
accurate results obtained in a computationally eļ¬cient manner for problems deļ¬ned on large do
mains. The ļ¬ndings of this study thus lay a solid foundation to overcome major challenges that
numerical analysts might encounter
- ā¦