Search results for "010103 numerical & computational mathematics"

showing 10 items of 260 documents

Generalized distance-squared mappings of the plane into the plane

2016

Abstract We define generalized distance-squared mappings, and we concentrate on the plane to plane case. We classify generalized distance-squared mappings of the plane into the plane in a recognizable way.

Plane (geometry)010102 general mathematicsMathematical analysisA-equivalence010103 numerical & computational mathematicsGeometry and Topology0101 mathematics01 natural sciencesMathematicsTOPOLOGIA DIFERENCIALAdvances in Geometry
researchProduct

Variational multiframe restoration of images degraded by noisy (stochastic) blur kernels

2013

This article introduces and explores a class of degradation models in which an image is blurred by a noisy (stochastic) point spread function (PSF). The aim is to restore a sharper and cleaner image from the degraded one. Due to the highly ill-posed nature of the problem, we propose to recover the image given a sequence of several observed degraded images or multiframes. Thus we adopt the idea of the multiframe approach introduced for image super-resolution, which reduces distortions appearing in the degraded images. Moreover, we formulate variational minimization problems with the robust (local or nonlocal) L^1 edge-preserving regularizing energy functionals, unlike prior works dealing wit…

Point spread functionSequenceMathematical optimizationApplied MathematicsComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION010103 numerical & computational mathematics02 engineering and technology01 natural sciencesImage (mathematics)Computational MathematicsComputer Science::Computer Vision and Pattern Recognition0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingSegmentationMinification0101 mathematicsAlgorithmEnergy (signal processing)Image restorationDegradation (telecommunications)MathematicsJournal of Computational and Applied Mathematics
researchProduct

A reliable incremental method of computing the limit load in deformation plasticity based on compliance : Continuous and discrete setting

2016

The aim of this paper is to introduce an enhanced incremental procedure that can be used for the numerical evaluation and reliable estimation of the limit load. A conventional incremental method of limit analysis is based on parametrization of the respective variational formulation by the loading parameter ? ? ( 0 , ? l i m ) , where ? l i m is generally unknown. The enhanced incremental procedure is operated in terms of an inverse mapping ? : α ? ? where the parameter α belongs to ( 0 , + ∞ ) and its physical meaning is work of applied forces at the equilibrium state. The function ? is continuous, nondecreasing and its values tend to ? l i m as α ? + ∞ . Reduction of the problem to a finit…

Pointwise convergenceReduction (recursion theory)Applied MathematicsMathematical analysista111Inverse010103 numerical & computational mathematics02 engineering and technologyFunction (mathematics)variational problems with linear growth energyfinite element approximation01 natural sciencesincremental limit analysisComputational Mathematics020303 mechanical engineering & transports0203 mechanical engineeringLimit analysisConvergence (routing)elastic-perfectly plastic problemsLimit loadLimit (mathematics)0101 mathematicsta216MathematicsJournal of Computational and Applied Mathematics
researchProduct

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…

PointwiseNumerical AnalysisPhysics and Astronomy (miscellaneous)Geophysical imagingApplied MathematicsFinite difference method010103 numerical & computational mathematicsMechanics01 natural sciencesPhysics::GeophysicsComputer Science ApplicationsPhysics::Fluid Dynamics010101 applied mathematicsComputational MathematicsNonlinear systemPermeability (earth sciences)Modeling and SimulationTwo-phase flow0101 mathematicsPorosityGradient descentGeologyJournal of Computational Physics
researchProduct

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 …

Poisson-like equationBiconjugate gradient method010504 meteorology & atmospheric sciencesTridiagonal matrixOperator (physics)Applied MathematicsLinear systemGeometryPreconditioning010103 numerical & computational mathematics01 natural sciencesComputational MathematicsConjugate gradient methodConvergence (routing)Convergence accelerationApplied mathematicsDynamic pressure0101 mathematicsCondition numberCondition numberAtmospheric model0105 earth and related environmental sciencesMathematicsFlat gridsJournal of Computational and Applied Mathematics
researchProduct

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.

Polynomial regressionDecimationMathematical optimizationComputer Networks and CommunicationsApplied Mathematics020206 networking & telecommunicationsLinear prediction010103 numerical & computational mathematics02 engineering and technologyFunction (mathematics)01 natural sciencesStability (probability)Separable spaceOperator (computer programming)Control and Systems EngineeringCompression (functional analysis)Signal Processing0202 electrical engineering electronic engineering information engineering0101 mathematicsAlgorithmMathematicsJournal of the Franklin Institute
researchProduct

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…

Polynomial regressionDecimationTheoretical computer scienceApplied MathematicsInpaintingImage processing010103 numerical & computational mathematics01 natural sciences010101 applied mathematicsComputational MathematicsOperator (computer programming)Consistency (statistics)0101 mathematicsRepresentation (mathematics)AlgorithmMathematicsImage compressionApplied Mathematics and Computation
researchProduct

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 …

PolynomialPure mathematicsAlgebra and Number Theory010102 general mathematicsPolynomial identity superinvolution upper-triangular matrices.Zero (complex analysis)Triangular matrixStructure (category theory)010103 numerical & computational mathematicsSingle class01 natural sciencesSuperalgebraSettore MAT/02 - Algebrapolynomial identity superinvolutions upper triangular matrices cocharacter0101 mathematicsAbelian groupAlgebraically closed fieldMathematics
researchProduct

An Efficient Numerical Method for Time Domain Computational Electromagnetic Simulation

2018

In this paper an efficient numerical method in approximating the electric and magnetic fields is provided. The method is based on an implicit leapfrog arrangement in time and without mesh in space. Moreover, a projection scheme is introduced in order to improve the accuracy of the proposed approach and applied into the computational electromagnetic (CEM) framework. The PDEs governing the process are solved and some numerical results are reported to validate the numerical process.

Projection schemeEnvironmental EngineeringRenewable Energy Sustainability and the EnvironmentComputer scienceNumerical analysisCEMProcess (computing)Finite difference methodEnergy Engineering and Power Technology010103 numerical & computational mathematicsSpace (mathematics)01 natural sciencesIndustrial and Manufacturing EngineeringProjection (linear algebra)Magnetic field010101 applied mathematicsSettore ING-IND/31 - ElettrotecnicaSettore MAT/08 - Analisi NumericaKernel (linear algebra)Hardware and ArchitectureApplied mathematicsNumerical accuracyTime domainElectrical and Electronic Engineering0101 mathematics2018 IEEE International Conference on Environment and Electrical Engineering and 2018 IEEE Industrial and Commercial Power Systems Europe (EEEIC / I&CPS Europe)
researchProduct

Cocharacters of group graded algebras and multiplicities bounded by one

2017

Let G be a finite group and A a G-graded algebra over a field F of characteristic zero. We characterize the (Formula presented.)-ideals (Formula presented.) of graded identities of A such that the multiplicities (Formula presented.) in the graded cocharacter of A are bounded by one. We do so by exhibiting a set of identities of the (Formula presented.)-ideal. As a consequence we characterize the varieties of G-graded algebras whose lattice of subvarieties is distributive.

Pure mathematics010103 numerical & computational mathematics01 natural sciencesGraded Lie algebraFiltered algebrasymbols.namesakeDifferential graded algebra0101 mathematicsAlgebra over a fieldMathematicsDiscrete mathematicsHilbert series and Hilbert polynomialFinite groupAlgebra and Number TheoryMathematics::Commutative AlgebraMathematics::Rings and Algebras010102 general mathematicsGraded ringPolynomial identitycocharactergraded polynomialSettore MAT/02 - AlgebraBounded functiongraded algebrasymbolsANÉIS E ÁLGEBRAS ASSOCIATIVOS
researchProduct