Results 51 to 60 of about 255 (138)
Stable computations by discrete mollification
, 2004 The discrete mollification method is a data smoothing procedure, based on convolution, that is appropriate for the stabilization of explicit schemes for the numerical solution of partial differential equations and the regularization of ill-posed problems.
Acosta, Carlos Daniel +1 more
openaire +1 more source
On solutions for a generalized Navier-Stokes-Fourier system fulfilling the entropy equality. [PDF]
Philos Trans A Math Phys Eng Sci, 2022 Abbatiello A, Bulíček M, Kaplický P.
europepmc +1 more source
Proactive Criminal Thinking and Restrictive Deterrence: A Pathway to Future Offending and Sanction Avoidance. [PDF]
Int J Environ Res Public Health, 2022 Guan X, Lo TW.
europepmc +1 more source
Harnack's inequality for doubly nonlinear equations of slow diffusion type. [PDF]
Calc Var Partial Differ Equ, 2021 Bögelein V +3 more
europepmc +1 more source
Mollification Does not Imply Convergence in Area [PDF]
Indiana University Mathematics Journal, 1973 openaire +1 more source
Efficient Path Generation with Curvature Guarantees by Mollification
Path generation, the process of converting high-level mission specifications, such as sequences of waypoints from a path planner, into smooth, executable paths, is a fundamental challenge in mobile robotics. Most path following and trajectory tracking algorithms require the desired path to be defined by at least twice continuously differentiable ...
González-Calvin, Alfredo +2 more
openaire +2 more sources
Anomalous Dissipation and Lack of Selection in the Obukhov-Corrsin Theory of Scalar Turbulence. [PDF]
Ann PDE, 2023 Colombo M, Crippa G, Sorella M.
europepmc +1 more source
A Dual Formula for the Noncommutative Transport Distance. [PDF]
J Stat Phys, 2022 Wirth M.
europepmc +1 more source
Local mollification of metrics with small curvature concentration
23 ...
Lee, Man-Chun, Lee, Tang-Kai
openaire +2 more sources