Search results for "Euler"

showing 10 items of 159 documents

A New Time Dependent Model Based on Level Set Motion for Nonlinear Deblurring and Noise Removal

1999

In this paper we summarize the main features of a new time dependent model to approximate the solution to the nonlinear total variation optimization problem for deblurring and noise removal introduced by Rudin, Osher and Fatemi. Our model is based on level set motion whose steady state is quickly reached by means of an explicit procedure based on an ENO Hamilton-Jacobi version of Roe's scheme. We show numerical evidence of the speed, resolution and stability of this simple explicit procedure in two representative 1D and 2D numerical examples.

Euler–Lagrange equationDeblurringMathematical optimizationLevel set (data structures)Nonlinear systemSteady state (electronics)Optimization problemSimple (abstract algebra)Applied mathematicsStability (probability)Mathematics
researchProduct

On new ways of group methods for reduction of evolution-type equations

2005

AbstractNew exact solutions of the evolution-type equations are constructed by means of a non-point (contact) symmetries. Also we analyzed the discrete symmetries of Maxwell equations in vacuum and decoupled ones to the four independent equations that can be solved independently.

Exact solutionGroup (mathematics)Independent equationApplied MathematicsMathematical analysisInhomogeneous electromagnetic wave equationEuler equationsSymmetrysymbols.namesakereaction-diffusion equationsExact solutions in general relativityMaxwell's equationsSimultaneous equationsHomogeneous spacesymbolsAnalysisMathematicsJournal of Mathematical Analysis and Applications
researchProduct

A permutation code preserving a double Eulerian bistatistic

2016

Visontai conjectured in 2013 that the joint distribution of ascent and distinct nonzero value numbers on the set of subexcedant sequences is the same as that of descent and inverse descent numbers on the set of permutations. This conjecture has been proved by Aas in 2014, and the generating function of the corresponding bistatistics is the double Eulerian polynomial. Among the techniques used by Aas are the M\"obius inversion formula and isomorphism of labeled rooted trees. In this paper we define a permutation code (that is, a bijection between permutations and subexcedant sequences) and show the more general result that two $5$-tuples of set-valued statistics on the set of permutations an…

FOS: Computer and information sciencesPolynomialDiscrete Mathematics (cs.DM)0102 computer and information sciences01 natural sciencesBijective proofCombinatoricsSet (abstract data type)symbols.namesakeEquidistributed sequence[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]FOS: MathematicsDiscrete Mathematics and CombinatoricsMathematics - Combinatorics0101 mathematicsComputingMilieux_MISCELLANEOUSMathematicsConjectureMathematics::CombinatoricsApplied Mathematics010102 general mathematicsGenerating functionEulerian path010201 computation theory & mathematicssymbolsBijectionCombinatorics (math.CO)Computer Science - Discrete Mathematics
researchProduct

Mahonian STAT on words

2016

In 2000, Babson and Steingrimsson introduced the notion of what is now known as a permutation vincular pattern, and based on it they re-defined known Mahonian statistics and introduced new ones, proving or conjecturing their Mahonity. These conjectures were proved by Foata and Zeilberger in 2001, and by Foata and Randrianarivony in 2006.In 2010, Burstein refined some of these results by giving a bijection between permutations with a fixed value for the major index and those with the same value for STAT , where STAT is one of the statistics defined and proved to be Mahonian in the 2000 Babson and Steingrimsson's paper. Several other statistics are preserved as well by Burstein's bijection.At…

FOS: Computer and information sciencesQA75[ INFO ] Computer Science [cs]Discrete Mathematics (cs.DM)Major index0102 computer and information sciencesMathematical Analysis01 natural sciencesWords and PermutationsCombinatorial problemsEquidistributionTheoretical Computer ScienceCombinatoricssymbols.namesakePermutationBijectionsFOS: MathematicsMathematics - CombinatoricsMathematical proofs[INFO]Computer Science [cs]0101 mathematicsStatisticMathematicsStatisticZ665Algebraic combinatoricsMathematics::CombinatoricsFormal power seriesPatternPermutationsEulerian path16. Peace & justiceComputer Science Applications010101 applied mathematics010201 computation theory & mathematicsCombinatoricsSignal ProcessingsymbolsBijectionCombinatorics (math.CO)Information SystemsComputer Science - Discrete Mathematics
researchProduct

Fermat'n pieni lause

2009

Tässä työssä tutkimme Fermat’n pientä lausetta, Eulerin funktiota ja yksiköiden ryhmää. Toteamme myös, että on olemassa lukuja, jotka toteuttavat Fermat’n lauseen kaavan olematta kuitenkaan alkulukuja. Todistamme lisäksi Fermat’n lausetta yleisemmän tuloksen. Lopuksi perehdymme hieman Eulerin ja Fermat’n lauseiden sovelluksiin salausmenetelmissä.

Fermat'n pieni lauseYksiköiden ryhmäEulerin funktio
researchProduct

Exact frequency response of bars with multiple dampers

2016

The paper addresses the frequency analysis of bars with an arbitrary number of dampers, subjected to harmonically varying loads. Multiple external/internal dampers occurring at the same position along the bar, modelling external damping devices and internal damping due to damage or imperfect connections, are considered. In this context, the challenge is to handle simultaneous discontinuities of the response variables, i.e. axial force/displacement discontinuities at the location of external/internal dampers. Based on the theory of generalized functions, the paper will present exact closed-form expressions of the frequency response under point/polynomial loads, which hold regardless of the n…

Frequency responseComputer sciencebusiness.industryBar (music)Mechanical EngineeringComputational MechanicsTruss020101 civil engineeringContext (language use)02 engineering and technologyStructural engineeringClassification of discontinuitiesDisplacement (vector)0201 civil engineeringDamper020303 mechanical engineering & transports0203 mechanical engineeringEuler-Bernoulli Beam Dynamic Green’s Function Frequency Response Function Kelvin-Voigt viscoelasticityControl theoryPosition (vector)business
researchProduct

The impacts of the ALE and hydrostatic-pressure approaches on the energy budget of unsteady free-surface flows

2008

Abstract This paper focuses on the energy budget in the calculation of unsteady free-surface flows on moving grids with and without using the ‘arbitrary Lagrangian–Eulerian’ (ALE) formulation or hydrostatic-pressure assumption. The numerical tool is an in-house general-purpose solver for the unsteady, incompressible and homogeneous Navier–Stokes equations in a Cartesian domain. An explicit fractional-step method and co-located finite-volume method are used for the second-order accurate integrations in time and space. The test cases are nonlinear and linear irrotational standing waves, which allow to characterise the impacts of an ALE or Eulerian formulation with moving grids by comparison w…

General Computer ScienceHydrostatic pressureGeneral EngineeringEulerian pathGeometryMechanicsNumerical methodConservative vector fieldSettore ICAR/01 - Idraulicalaw.inventionPhysics::Fluid DynamicsStanding waveNumerical method; Free-surface flow; Wavessymbols.namesakeNonlinear systemlawFree surfaceWavessymbolsCompressibilityFree-surface flowHydrostatic equilibriumMathematics
researchProduct

The pruning-grafting lattice of binary trees

2008

AbstractWe introduce a new lattice structure Bn on binary trees of size n. We exhibit efficient algorithms for computing meet and join of two binary trees and give several properties of this lattice. More precisely, we prove that the length of a longest (resp. shortest) path between 0 and 1 in Bn equals to the Eulerian numbers 2n−(n+1) (resp. (n−1)2) and that the number of coverings is (2nn−1). Finally, we exhibit a matching in a constructive way. Then we propose some open problems about this new structure.

General Computer ScienceMatching (graph theory)Distribution sequences0102 computer and information sciencesFeasible sequences01 natural sciencesTheoretical Computer ScienceCombinatoricsCatalan numbersymbols.namesakeLattice (order)[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]0101 mathematicsComputingMilieux_MISCELLANEOUSMathematicsBinary tree010102 general mathematicsEulerian pathLatticesJoin (topology)Binary trees010201 computation theory & mathematicsShortest path problemPath (graph theory)symbolsCatalan numbersComputer Science(all)
researchProduct

MAST-RT0 solution of the incompressible Navier–Stokes equations in 3D complex domains

2020

A new numerical methodology to solve the 3D Navier-Stokes equations for incompressible fluids within complex boundaries and unstructured body-fitted tetrahedral mesh is presented and validated with three literature and one real-case tests. We apply a fractional time step procedure where a predictor and a corrector problem are sequentially solved. The predictor step is solved applying the MAST (Marching in Space and Time) procedure, which explicitly handles the non-linear terms in the momentum equations, allowing numerical stability for Courant number greater than one. Correction steps are solved by a Mixed Hybrid Finite Elements discretization that assumes positive distances among tetrahedr…

General Computer Scienceeulerian methodMathematics::Analysis of PDEspredictor–corrector scheme02 engineering and technology01 natural sciencesnavier–stokes equationsSettore ICAR/01 - Idraulica010305 fluids & plasmasNumerical methodologyPhysics::Fluid Dynamics0203 mechanical engineeringNavier–Stokes equations 3D numerical model Eulerian method unstructured tetrahedral mesh predictor–corrector scheme Mixed Hybrid Finite elementIncompressible flow0103 physical sciencesNavier–Stokes equationsPhysicsMathematical analysisEulerian methodunstructured tetrahedral meshEngineering (General). Civil engineering (General)3d numerical modelTetrahedral meshes020303 mechanical engineering & transportsmixed hybrid finite elementModeling and SimulationCompressibilityTA1-2040Engineering Applications of Computational Fluid Mechanics
researchProduct

On the moving multi-loads problem in discontinuous beam structures with interlayer slip

2017

Abstract This contribution proposes an efficient approach to the moving multi-loads problem on two-layer beams with interlayer slip and elastic translational supports. The Euler-Bernoulli hypothesis is assumed to hold for each layer separately, and a linear constitutive relation between the horizontal slip and the interlaminar shear force is considered. It is shown that, using the theory of generalized functions to treat the discontinuous response variables, exact eigenfunctions can be derived from a characteristic equation built as determinant of a 6 x 6 matrix. Building pertinent orthogonality conditions for the deflection eigenfunctions, a closed-form analytical response is established i…

Generalized functionConstitutive equationMathematical analysisCharacteristic equation02 engineering and technologyGeneral MedicineSlip (materials science)Eigenfunction01 natural sciencestranslational supportEngineering (all)020303 mechanical engineering & transportsClassical mechanics0203 mechanical engineeringEuler-Bernoulli beaminterlayer slipmoving loadDeflection (engineering)0103 physical sciences010301 acousticsSlip line fieldBeam (structure)MathematicsProcedia Engineering
researchProduct