Results 11 to 20 of about 14,047 (249)
Approximate deconvolution discretisation [PDF]
Computers & Mathematics with Applications, 2023 A new strategy is presented for the construction of high-order spatial discretisations extracted from a lower-order basic discretisation. The key consideration is that any spatial discretisation of a derivative of a solution can be expressed as the exact
Tyliszczak, A. +2 more
core +3 more sources
Discretisation and Product Distributions in Ring-LWE [PDF]
Journal of Mathematical Cryptology, 2020 A statistical framework applicable to Ring-LWE was outlined by Murphy and Player (IACR eprint 2019/452). Its applicability was demonstrated with an analysis of the decryption failure probability for degree-1 and degree-2 ciphertexts in the homomorphic ...
Murphy Sean, Player Rachel
doaj +4 more sources
Discretisation of regularity structures [PDF]
Annales de l'Institut Henri Poincaré, Probabilités et Statistiques, 2017 We introduce a general framework allowing to apply the theory of regularity structures to discretisations of stochastic PDEs. The approach pursued in this article is that we do not focus on any one specific discretisation procedure.
Erhard, Dirk, Hairer, Martin
core +6 more sources
Discretisation of conditions in decision rules induced for continuous data. [PDF]
PLoS ONE, 2020 Typically discretisation procedures are implemented as a part of initial pre-processing of data, before knowledge mining is employed. It means that conclusions and observations are based on reduced data, as usually by discretisation some information is ...
Urszula Stańczyk +2 more
doaj +2 more sources
Attractors under discretisation
, 2017 This work focuses on the preservation of attractors and saddle points of ordinary differential equations under discretisation. In the 1980s, key results for autonomous ordinary differential equations were obtained – by Beyn for saddle points and by ...
Kloeden, Peter +3 more
core +2 more sources
The Domination over Time and its Discretisation
Operations Research and Decisions, 2020 Domination in graphs is well known and has been an extensively researched branch of graph theory. Since the variation over time is one of the important properties of real-world networks, we study the influence of time on the domination problem.
Nazanin Abbasnezhad +2 more
doaj +4 more sources
Discretising the Herman–Kluk propagator [PDF]
Numerische Mathematik, 2017 The Herman--Kluk propagator is a popular semi-classical approximation of the unitary evolution operator in quantum molecular dynamics. In this paper we formulate the Herman--Kluk propagator as a phase space integral and discretise it by Monte Carlo and quasi-Monte Carlo quadrature.
Caroline Lasser, David Sattlegger
openaire +4 more sources
The Grid Method of Discretisation for Type-2 Fuzzy Sets [PDF]
, 2012 In order to perform fuzzy inferencing, it is normal practice to discretise fuzzy sets. For type-1 fuzzy sets there is only one method of discretisation, but type-2 fuzzy sets may be discretised in more than one way.
Greenfield, Sarah
core +7 more sources
The Gradient Discretisation Method [PDF]
, 2018 This monograph is dedicated to the presentation of the gradient discretisation method (GDM) and to some of its applications. It is intended for masters students, researchers and experts in the field of the numerical analysis of partial differential equations.The GDM is a framework which contains classical and recent discretisation schemes for diffusion
Droniou, Jérôme +4 more
openaire +2 more sources
THE EULER NUMBER OF DISCRETISED SETS – SURPRISING RESULTS IN THREE DIMENSIONS
Image Analysis and Stereology, 2011 The problem of estimating the Euler-Poincare' characteristic (Euler number for short) of a set in the 3d Euclidean space is considered, given that this set is observed in the points of a lattice. In this situation, which is typical in image analysis, the
Joachim Ohser +2 more
doaj +1 more source