Results 1 to 10 of about 66 (62)
A Two Dimensional Discrete Mollification Operator and the Numerical Solution of an Inverse Source Problem [PDF]
Axioms, 2018 We consider a two-dimensional time fractional diffusion equation and address the important inverse problem consisting of the identification of an ingredient in the source term. The fractional derivative is in the sense of Caputo.
Manuel D. Echeverry, Carlos E. Mejía
doaj +3 more sources
Nonlinear Engineering, 2023 In this article, the inverse time problem is investigated. Regarding the ill-posed linear problem, utilize the quasi-reversibility method first. This problem has been regularized and after that provides an iterative regularizing strategy for noisy input ...
Rahimi Mostafa, Rostamy Davood
doaj +2 more sources
MULTISCALE ANALYSIS BY MEANS OF DISCRETE MOLLIFICATION FOR ECG NOISE REDUCTION
Dyna, 2009 El análisis multiescala es un área de gran actividad investigativa con fuerte impacto en computación científica y matemática aplicada, ocupando un lugar de privilegio en la forma como se entiende la relación entre la matemática y las demás ciencias ...
JUAN PULGARÍN-GIRALDO +2 more
doaj +8 more sources
Mollification in Strongly Lipschitz Domains with Application to Continuous and Discrete De Rham Complexes [PDF]
Computational Methods in Applied Mathematics, 2015 Abstract We construct mollification operators in strongly Lipschitz domains that do not invoke non-trivial extensions, are Lp stable for any real number p ∈
Ern, Alexandre, Guermond, Jean-Luc
openaire +3 more sources
Monotone difference schemes stabilized by discrete mollification for strongly degenerate parabolic equations [PDF]
Numerical Methods for Partial Differential Equations, 2011 AbstractThe discrete mollification method is a convolution‐based filtering procedure suitable for the regularization of ill‐posed problems and for the stabilization of explicit schemes for the solution of PDEs. This method is applied to the discretization of the diffusive terms of a known first‐order monotone finite difference scheme [Evje and Karlsen,
Acosta, Carlos D. +2 more
openaire +3 more sources
Discrete mollification and automatic numerical differentiation
Computers & Mathematics with Applications, 1998 Numerical differentiation is an unreliable procedure in the case of a function with noise. The authors continue the study of their proposal to remedy this by a mollification procedure. This is based on the idea of replacing the given function by a convolution product with a smooth function of a given type with small support.
Murio, D.A., Mejía, C.E., Zhan, S.
openaire +2 more sources
Numerical identification of forcing terms by discrete mollification
Computers & Mathematics with Applications, 1989 AbstractA new and totally automated technique for the approximate reconstruction of the unknown forcing terms in a system of ordinary differential equations when the experimental information is obtained through measured data, on a discrete set of points, is presented.
Murio, D.A., Hinestroza, D.
openaire +1 more source
A regularized version of the Kuwabara-Kono force scheme for 2nd order convergence in DEM simulations of granular materials [PDF]
EPJ Web of ConferencesThe Discrete Element Method is a technique widely used to simulate multi-particle systems, in particular granular materials. For conservative systems, the integration of the equations of motion is often performed via a Verlet-type method of order two ...
Bufolo Gabriel N., Sobral Yuri D.
doaj +1 more source
Numerical solution of generalized IHCP by discrete mollification
Computers & Mathematics with Applications, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mejía, C.E., Murio, D.A.
openaire +2 more sources
Surface fitting and numerical gradient computations by discrete mollification
Computers & Mathematics with Applications, 1999 The authors consider the problem of fitting of a surface, which is given only by noisy data (in \(\mathbb{R}^2)\). This is done by a so-called mollification procedure, which is a process of filtering and smoothing the data by a modified convolution process. Many results on the convergence of the method are presented, and also a large number of computed
Zhan, S., Murio, D.A.
openaire +1 more source