Search results for "Computational Mathematic"
showing 10 items of 987 documents
Adjoint-based inversion for porosity in shallow reservoirs using pseudo-transient solvers for non-linear hydro-mechanical processes
2020
Abstract Porous flow is of major importance in the shallow subsurface, since it directly impacts on reservoir-scale processes such as waste fluid sequestration or oil and gas exploration. Coupled and non-linear hydro-mechanical processes describe the motion of a low-viscous fluid interacting with a higher viscous porous rock matrix. This two-phase flow may trigger the initiation of solitary waves of porosity, further developing into vertical high-porosity pipes or chimneys. These preferred fluid escape features may lead to localised and fast vertical flow pathways potentially problematic in the case of for instance CO2 sequestration. Constraining the porosity and the non-linearly related pe…
Tridiagonal preconditioning for Poisson-like difference equations with flat grids: Application to incompressible atmospheric flow
2011
AbstractThe convergence of many iterative procedures, in particular that of the conjugate gradient method, strongly depends on the condition number of the linear system to be solved. In cases with a large condition number, therefore, preconditioning is often used to transform the system into an equivalent one, with a smaller condition number and therefore faster convergence. For Poisson-like difference equations with flat grids, the vertical part of the difference operator is dominant and tridiagonal and can be used for preconditioning. Such a procedure has been applied to incompressible atmospheric flows to preserve incompressibility, where a system of Poisson-like difference equations is …
Cell-average multiresolution based on local polynomial regression. Application to image processing
2014
In Harten (1996) [32] presented a general framework about multiresolution representation based on four principal operators: decimation and prediction, discretization and reconstruction. The discretization operator indicates the nature of the data. In this work the pixels of a digital image are obtained as the average of a function in some defined cells. A family of Harten cell-average multiresolution schemes based on local polynomial regression is presented. The stability is ensured by the linearity of the operators obtained and the order is calculated. Some numerical experiments are performed testing the accuracy of the prediction operators in comparison with the classical linear and nonli…
Non-separable local polynomial regression cell-average multiresolution operators. Application to compression of images
2016
Abstract Cell-average multiresolution Harten׳s algorithms have been satisfactorily used to compress data. These schemes are based on two operators: decimation and prediction. The accuracy of the method depends on the prediction operator. In order to design a precise function, local polynomial regression has been used in the last years. This paper is devoted to construct a family of non-separable two-dimensional linear prediction operators approximating the real values with this procedure. Some properties are proved as the order of the scheme and the stability. Some numerical experiments are performed comparing the new methods with the classical linear method.
Non-consistent cell-average multiresolution operators with application to image processing
2016
In recent years different techniques to process signal and image have been designed and developed. In particular, multiresolution representations of data have been studied and used successfully for several applications such as compression, denoising or inpainting. A general framework about multiresolution representation has been presented by Harten (1996) 20. Harten's schemes are based on two operators: decimation, D , and prediction, P , that satisfy the consistency property D P = I , where I is the identity operator. Recently, some new classes of multiresolution operators have been designed using learning statistical tools and weighted local polynomial regression methods obtaining filters…
Novel algorithms for 3D surface point cloud boundary detection and edge reconstruction
2019
Abstract Tessellated surfaces generated from point clouds typically show inaccurate and jagged boundaries. This can lead to tolerance errors and problems such as machine judder if the model is used for ongoing manufacturing applications. This paper introduces a novel boundary point detection algorithm and spatial FFT-based filtering approach, which together allow for direct generation of low noise tessellated surfaces from point cloud data, which are not based on pre-defined threshold values. Existing detection techniques are optimized to detect points belonging to sharp edges and creases. The new algorithm is targeted at the detection of boundary points and it is able to do this better tha…
Benchmarking parameter-free AMaLGaM on functions with and without noise.
2013
We describe a parameter-free estimation-of-distribution algorithm (EDA) called the adapted maximum-likelihood Gaussian model iterated density-estimation evolutionary algorithm (AMaLGaM-ID[Formula: see text]A, or AMaLGaM for short) for numerical optimization. AMaLGaM is benchmarked within the 2009 black box optimization benchmarking (BBOB) framework and compared to a variant with incremental model building (iAMaLGaM). We study the implications of factorizing the covariance matrix in the Gaussian distribution, to use only a few or no covariances. Further, AMaLGaM and iAMaLGaM are also evaluated on the noisy BBOB problems and we assess how well multiple evaluations per solution can average ou…
Superinvolutions on upper-triangular matrix algebras
2018
Let UTn(F) be the algebra of n×n upper-triangular matrices over an algebraically closed field F of characteristic zero. In [18], the authors described all abelian G-gradings on UTn(F) by showing that any G-grading on this algebra is an elementary grading. In this paper, we shall consider the algebra UTn(F) endowed with an elementary Z2-grading. In this way, it has a structure of superalgebra and our goal is to completely describe the superinvolutions which can be defined on it. To this end, we shall prove that the superinvolutions and the graded involutions (i.e., involutions preserving the grading) on UTn(F) are strictly related through the so-called superautomorphisms of this algebra. We …
A Characterization of Quintic Helices
2005
A polynomial curve of degree 5, @a, is a helix if and only if both @[email protected]^'@? and @[email protected]^'@[email protected]^''@? are polynomial functions.
Modeling elastic properties of short flax fiber-reinforced composites by orientation averaging
2010
Abstract Natural fibers of plant origin, used as reinforcement in polymer matrix composite materials, exhibit highly anisotropic elastic properties due to their complex internal structure. Mechanical properties can be evaluated not only by tests but also by mechanical models reflecting the principal morphological features of fibers. Such a FEM model is applied to estimate the elastic properties of a unit cell of a short-fiber-reinforced composite, an elementary flax fiber embedded in a polymer matrix. Orientation averaging approach is used for prediction of the stiffness of short flax fiber reinforced polymer matrix composite. The numerical estimates of Young’s modulus are compared to the t…