Search results for "010103 numerical & computational mathematics"
showing 10 items of 260 documents
Highlighting numerical insights of an efficient SPH method
2018
Abstract In this paper we focus on two sources of enhancement in accuracy and computational demanding in approximating a function and its derivatives by means of the Smoothed Particle Hydrodynamics method. The approximating power of the standard method is perceived to be poor and improvements can be gained making use of the Taylor series expansion of the kernel approximation of the function and its derivatives. The modified formulation is appealing providing more accurate results of the function and its derivatives simultaneously without changing the kernel function adopted in the computation. The request for greater accuracy needs kernel function derivatives with order up to the desidered …
A multi-domain approach for smoothed particle hydrodynamics simulations of highly complex flows
2018
Abstract An efficient and accurate method is proposed to solve the incompressible flow momentum and continuity equations in computational domains partitioned into subdomains in the framework of the smoothed particle hydrodynamics method. The procedure does not require any overlap of the subdomains, which would result in the increase of the computational effort. Perfectly matching solutions are obtained at the surfaces separating neighboring blocks. The block interfaces can be both planar and curved surfaces allowing to easily decompose even geometrically complex domains. The smoothing length of the kernel function is maintained constant in each subdomain, while changing between blocks where…
Nonnegative Tensor Train Decompositions for Multi-domain Feature Extraction and Clustering
2016
Tensor train (TT) is one of the modern tensor decomposition models for low-rank approximation of high-order tensors. For nonnegative multiway array data analysis, we propose a nonnegative TT (NTT) decomposition algorithm for the NTT model and a hybrid model called the NTT-Tucker model. By employing the hierarchical alternating least squares approach, each fiber vector of core tensors is optimized efficiently at each iteration. We compared the performances of the proposed method with a standard nonnegative Tucker decomposition (NTD) algorithm by using benchmark data sets including event-related potential data and facial image data in multi-domain feature extraction and clustering tasks. It i…
On the application of the generalized means to construct multiresolution schemes satisfying certain inequalities proving stability
2021
Multiresolution representations of data are known to be powerful tools in data analysis and processing, and they are particularly interesting for data compression. In order to obtain a proper definition of the edges, a good option is to use nonlinear reconstructions. These nonlinear reconstruction are the heart of the prediction processes which appear in the definition of the nonlinear subdivision and multiresolution schemes. We define and study some nonlinear reconstructions based on the use of nonlinear means, more in concrete the so-called Generalized means. These means have two interesting properties that will allow us to get associated reconstruction operators adapted to the presence o…
Decentralized Subspace Projection for Asymmetric Sensor Networks
2020
A large number of applications in Wireless Sensor Networks include projecting a vector of noisy observations onto a subspace dictated by prior information about the field being monitored. In general, accomplishing such a task in a centralized fashion, entails a large power consumption, congestion at certain nodes and suffers from robustness issues against possible node failures. Computing such projections in a decentralized fashion is an alternative solution that solves these issues. Recent works have shown that this task can be done via the so-called graph filters where only local inter-node communication is performed in a distributed manner using a graph shift operator. Most of the existi…
Subpixel determination of imperfect circles characteristics
2008
This article deals with the problem of the determination of characteristics of imperfect circular objects in discrete images, namely the radius and center coordinates. To limit distortion, a multi-level method based on active contours was developed. Its originality is to furnish a set of geometric envelopes in one pass, with a correspondence between grayscale and a regularity scale. The adequacy of this approach was tested with several methods, among them is the Radon-based method. More particularly, this study indicates the relevance of the use of active contours combined with a Radon transform-based method which was improved using a fitting considering the discrete implementation of the R…
Fuzzy Control of Uncertain Nonlinear Systems with Numerical Techniques: A Survey
2019
This paper provides an overview of numerical methods in order to solve fuzzy equations (FEs). It focuses on different numerical methodologies to solve FEs, dual fuzzy equations (DFEs), fuzzy differential equations (FDEs) and partial fuzzy differential equations (PFDEs). The solutions which are produced by these equations are taken to be the controllers. This paper also analyzes the existence of the roots of FEs and some important implementation problems. Finally, several examples are reviewed with different methods.
High Order Extrapolation Techniques for WENO Finite-Difference Schemes Applied to NACA Airfoil Profiles
2017
Finite-difference WENO schemes are capable of approximating accurately and efficiently weak solutions of hyperbolic conservation laws. In this context high order numerical boundary conditions have been proven to increase significantly the resolution of the numerical solutions. In this paper a finite-difference WENO scheme is combined with a high order boundary extrapolation technique at ghost cells to solve problems involving NACA airfoil profiles. The results obtained are comparable with those obtained through other techniques involving unstructured meshes.
Approximate Lax–Wendroff discontinuous Galerkin methods for hyperbolic conservation laws
2017
Abstract The Lax–Wendroff time discretization is an alternative method to the popular total variation diminishing Runge–Kutta time discretization of discontinuous Galerkin schemes for the numerical solution of hyperbolic conservation laws. The resulting fully discrete schemes are known as LWDG and RKDG methods, respectively. Although LWDG methods are in general more compact and efficient than RKDG methods of comparable order of accuracy, the formulation of LWDG methods involves the successive computation of exact flux derivatives. This procedure allows one to construct schemes of arbitrary formal order of accuracy in space and time. A new approximation procedure avoids the computation of ex…
Linearly implicit-explicit schemes for the equilibrium dispersive model of chromatography
2018
Abstract Numerical schemes for the nonlinear equilibrium dispersive (ED) model for chromatographic processes with adsorption isotherms of Langmuir type are proposed. This model consists of a system of nonlinear, convection-dominated partial differential equations. The nonlinear convection gives rise to sharp moving transitions between concentrations of different solute components. This property calls for numerical methods with shock capturing capabilities. Based on results by Donat, Guerrero and Mulet (Appl. Numer. Math. 123 (2018) 22–42), conservative shock capturing numerical schemes can be designed for this chromatography model. Since explicit schemes for diffusion problems can pose seve…