Search results for "numerical analysis"
showing 10 items of 883 documents
Comparison between adaptive and uniform discontinuous Galerkin simulations in dry 2D bubble experiments
2013
Accepted by the Journal of Computational Physics Adaptive mesh refinement generally aims to increase computational efficiency without compromising the accuracy of the numerical solution. However it is an open question in which regions the spatial resolution can actually be coarsened without affecting the accuracy of the result. This question is investigated for a specific example of dry atmospheric convection, namely the simulation of warm air bubbles. For this purpose a novel numerical model is developed that is tailored towards this specific application. The compressible Euler equations are solved with a Discontinuous Galerkin method. Time integration is done with an IMEXmethod and the dy…
Constructing adaptive generalized polynomial chaos method to measure the uncertainty in continuous models: A computational approach
2015
Due to errors in measurements and inherent variability in the quantities of interest, models based on random differential equations give more realistic results than their deterministic counterpart. The generalized polynomial chaos (gPC) is a powerful technique used to approximate the solution of these equations when the random inputs follow standard probability distributions. But in many cases these random inputs do not have a standard probability distribution. In this paper, we present a step-by-step constructive methodology to implement directly a useful version of adaptive gPC for arbitrary distributions, extending the applicability of the gPC. The paper mainly focuses on the computation…
A semi-Lagrangian AMR scheme for 2D transport problems in conservation form
2013
In this paper, we construct a semi-Lagrangian (SL) Adaptive-Mesh-Refinement (AMR) solver for 1D and 2D transport problems in conservation form. First, we describe the a-la-Harten AMR framework: the adaptation process selects a hierarchical set of grids with different resolutions depending on the features of the integrand function, using as criteria the point value prediction via interpolation from coarser meshes, and the appearance of large gradients. We integrate in time by reconstructing at the feet of the characteristics through the Point-Value Weighted Essentially Non-Oscillatory (PV-WENO) interpolator. We propose, then, an extension to the 2D setting by making the time integration dime…
Padé approximants and the prediction of non-perturbative parameters in particle physics
2010
Conference on Approximation and extrapolation of Convergent and Divergent Sequences and Series Luminy, FRANCE, SEP 28-OCT 02, 2009
Fractional differential equations solved by using Mellin transform
2014
In this paper, the solution of the multi-order differential equations, by using Mellin Transform, is proposed. It is shown that the problem related to the shift of the real part of the argument of the transformed function, arising when the Mellin integral operates on the fractional derivatives, may be overcame. Then, the solution may be found for any fractional differential equation involving multi-order fractional derivatives (or integrals). The solution is found in the Mellin domain, by solving a linear set of algebraic equations, whose inverse transform gives the solution of the fractional differential equation at hands.
Mellin transform approach for the solution of coupled systems of fractional differential equations
2015
In this paper, the solution of a multi-order, multi-degree-of-freedom fractional differential equation is addressed by using the Mellin integral transform. By taking advantage of a technique that relates the transformed function, in points of the complex plane differing in the value of their real part, the solution is found in the Mellin domain by solving a linear set of algebraic equations. The approximate solution of the differential (or integral) equation is restored, in the time domain, by using the inverse Mellin transform in its discretized form.
Mesoscopic aspects of the computational homogenization with meshless modeling for masonry material
2020
The multiscale homogenization scheme is becoming a diffused tool for the analysis of heterogeneous materials as masonry since it allows dealing with the complexity of formulating closed-form constitutive laws by retrieving the material response from the solution of a unit cell (UC) boundary value problem (BVP). The robustness of multiscale simulations depends on the robustness of the nested macroscopic and mesoscopic models. In this study, specific attention is paid to the meshless solution of the UC BVP under plane stress conditions, comparing performances related to the application of linear displacement or periodic boundary conditions (BCs). The effect of the geometry of the UC is also i…
GPU accelerated Monte Carlo simulation of the 2D and 3D Ising model
2009
The compute unified device architecture (CUDA) is a programming approach for performing scientific calculations on a graphics processing unit (GPU) as a data-parallel computing device. The programming interface allows to implement algorithms using extensions to standard C language. With continuously increased number of cores in combination with a high memory bandwidth, a recent GPU offers incredible resources for general purpose computing. First, we apply this new technology to Monte Carlo simulations of the two dimensional ferromagnetic square lattice Ising model. By implementing a variant of the checkerboard algorithm, results are obtained up to 60 times faster on the GPU than on a curren…
Gradings on the algebra of upper triangular matrices of size three
2013
Abstract Let UT 3 ( F ) be the algebra of 3 × 3 upper triangular matrices over a field F . On UT 3 ( F ) , up to isomorphism, there are at most five non-trivial elementary gradings and we study the graded polynomial identities for such gradings. In case F is of characteristic zero we give a complete description of the space of multilinear graded identities in the language of Young diagrams through the representation theory of a Young subgroup of S n . We finally compute the multiplicities in the graded cocharacter sequence for every elementary G -grading on UT 3 ( F ) .
Weighted ENO interpolation and applications
2004
Abstract Data-dependent interpolatory techniques such as essentially non-oscillatory (ENO) technique [J. Comput. Phys. 71 (1987) 231] have long been used as a reconstruction process in multiresolution schemes. In this work we analyze the weighted ENO (WENO) technique introduced by Liu et al. in the context of conservation laws [J. Comput. Phys. 115 (1994) 200] and improved by Jiang and Shu [J. Comput. Phys. 126 (1996) 202], and apply it to the compression of images, using multiresolution techniques.