11,763 research outputs found
On the stability of projection methods for the incompressible Navier-Stokes equations based on high-order discontinuous Galerkin discretizations
The present paper deals with the numerical solution of the incompressible
Navier-Stokes equations using high-order discontinuous Galerkin (DG) methods
for discretization in space. For DG methods applied to the dual splitting
projection method, instabilities have recently been reported that occur for
coarse spatial resolutions and small time step sizes. By means of numerical
investigation we give evidence that these instabilities are related to the
discontinuous Galerkin formulation of the velocity divergence term and the
pressure gradient term that couple velocity and pressure. Integration by parts
of these terms with a suitable definition of boundary conditions is required in
order to obtain a stable and robust method. Since the intermediate velocity
field does not fulfill the boundary conditions prescribed for the velocity, a
consistent boundary condition is derived from the convective step of the dual
splitting scheme to ensure high-order accuracy with respect to the temporal
discretization. This new formulation is stable in the limit of small time steps
for both equal-order and mixed-order polynomial approximations. Although the
dual splitting scheme itself includes inf-sup stabilizing contributions, we
demonstrate that spurious pressure oscillations appear for equal-order
polynomials and small time steps highlighting the necessity to consider inf-sup
stability explicitly.Comment: 31 page
Splitting and composition methods in the numerical integration of differential equations
We provide a comprehensive survey of splitting and composition methods for
the numerical integration of ordinary differential equations (ODEs). Splitting
methods constitute an appropriate choice when the vector field associated with
the ODE can be decomposed into several pieces and each of them is integrable.
This class of integrators are explicit, simple to implement and preserve
structural properties of the system. In consequence, they are specially useful
in geometric numerical integration. In addition, the numerical solution
obtained by splitting schemes can be seen as the exact solution to a perturbed
system of ODEs possessing the same geometric properties as the original system.
This backward error interpretation has direct implications for the qualitative
behavior of the numerical solution as well as for the error propagation along
time. Closely connected with splitting integrators are composition methods. We
analyze the order conditions required by a method to achieve a given order and
summarize the different families of schemes one can find in the literature.
Finally, we illustrate the main features of splitting and composition methods
on several numerical examples arising from applications.Comment: Review paper; 56 pages, 6 figures, 8 table
Kadath: a spectral solver for theoretical physics
Kadath is a library that implements spectral methods in a very modular
manner. It is designed to solve a wide class of problems that arise in the
context of theoretical physics. Several types of coordinates are implemented
and additional geometries can be easily encoded. Partial differential equations
of various types are discretized by means of spectral methods. The resulting
system is solved using a Newton-Raphson iteration. Doing so, Kadath is able to
deal with strongly non-linear situations. The algorithms are validated by
applying the library to four different problems of contemporary physics, in the
fields of gauge field theory and general relativityComment: Accepted to Journal of Computational Physic
Decoding Generalized Reed-Solomon Codes and Its Application to RLCE Encryption Schemes
This paper compares the efficiency of various algorithms for implementing
quantum resistant public key encryption scheme RLCE on 64-bit CPUs. By
optimizing various algorithms for polynomial and matrix operations over finite
fields, we obtained several interesting (or even surprising) results. For
example, it is well known (e.g., Moenck 1976 \cite{moenck1976practical}) that
Karatsuba's algorithm outperforms classical polynomial multiplication algorithm
from the degree 15 and above (practically, Karatsuba's algorithm only
outperforms classical polynomial multiplication algorithm from the degree 35
and above ). Our experiments show that 64-bit optimized Karatsuba's algorithm
will only outperform 64-bit optimized classical polynomial multiplication
algorithm for polynomials of degree 115 and above over finite field
. The second interesting (surprising) result shows that 64-bit
optimized Chien's search algorithm ourperforms all other 64-bit optimized
polynomial root finding algorithms such as BTA and FFT for polynomials of all
degrees over finite field . The third interesting (surprising)
result shows that 64-bit optimized Strassen matrix multiplication algorithm
only outperforms 64-bit optimized classical matrix multiplication algorithm for
matrices of dimension 750 and above over finite field . It should
be noted that existing literatures and practices recommend Strassen matrix
multiplication algorithm for matrices of dimension 40 and above. All our
experiments are done on a 64-bit MacBook Pro with i7 CPU and single thread C
codes. It should be noted that the reported results should be appliable to 64
or larger bits CPU architectures. For 32 or smaller bits CPUs, these results
may not be applicable. The source code and library for the algorithms covered
in this paper are available at http://quantumca.org/
Computing zeta functions of arithmetic schemes
We present new algorithms for computing zeta functions of algebraic varieties
over finite fields. In particular, let X be an arithmetic scheme (scheme of
finite type over Z), and for a prime p let zeta_{X_p}(s) be the local factor of
its zeta function. We present an algorithm that computes zeta_{X_p}(s) for a
single prime p in time p^(1/2+o(1)), and another algorithm that computes
zeta_{X_p}(s) for all primes p < N in time N (log N)^(3+o(1)). These generalise
previous results of the author from hyperelliptic curves to completely
arbitrary varieties.Comment: 23 pages, to appear in the Proceedings of the London Mathematical
Societ
- …