Search results for " Methods"

showing 10 items of 4102 documents

Elliptic problems with convection terms in Orlicz spaces

2021

Abstract The existence of a solution to a Dirichlet problem, for a class of nonlinear elliptic equations, with a convection term, is established. The main novelties of the paper stand on general growth conditions on the gradient variable, and on minimal assumptions on Ω. The approach is based on the method of sub and supersolutions. The solution is a zero of an auxiliary pseudomonotone operator build via truncation techniques. We present also some examples in which we highlight the generality of our growth conditions.

Dirichlet problemGradient dependenceClass (set theory)Truncation methodsTruncationApplied Mathematics010102 general mathematicsZero (complex analysis)Orlicz-Sobolev spacesNonlinear elliptic equationsTerm (logic)01 natural sciences010101 applied mathematicsNonlinear systemOperator (computer programming)Subsolution and supersolutionSettore MAT/05 - Analisi MatematicaApplied mathematics0101 mathematicsAnalysisMathematicsVariable (mathematics)Journal of Mathematical Analysis and Applications
researchProduct

IMPLICIT MESH DISCONTINUOUS GALERKIN FOR VARIABLE ANGLE TOW MULTILAYERED PLATES

2018

This works presents a novel computational scheme for variable angle tow (VAT) multilayered plates [1]. The characteristic features of the proposed scheme are the combined use of a discontinuous Galerkin (dG) formulation and an implicitly defined mesh. The formulation is based on the principle of virtual displacements (PVD) and the Equivalent Single Layer (ESL) assumption for the mechanical behavior of the VAT plates [2]. The problem is first placed within the dG framework by suitably introducing an auxiliary variable and by rewriting the set of equations governing ESL VAT plates as a firstorder system of differential equations. Following Arnold et al.[3] and by introducing suitably defined …

Discontinuous Galerkin methods Variable angle tow composites multi-layered plates higher order theoriesSettore ING-IND/04 - Costruzioni E Strutture Aerospaziali
researchProduct

TRANSIENT AND FREE-VIBRATION ANALYSIS OF LAMINATED SHELLS THROUGH THE DISCONTINUOUS GALERKIN METHOD

2022

This paper presents a novel formulation for linear transient and free-vibration analysis of laminated shell structures based on Interior Penalty discontinuous Galerkin (DG) methods and variable-order through-the-thickness kinematics, whose combined use allows solving the shell problem with high-order accuracy throughout both the shell thickness and the shell modelling domain. The shell geometry is described via a generic system of curvilinear coordinates using either an analytical or a NURBS-based parametrization of the shell mid surface; the formulation also allows for the presence of cut-outs, which are implicitly represented by means of a level set function. After deriving the governing …

Discontinuous Galerkin methods transient analysis free-vibration analysis composite shellsSettore ING-IND/04 - Costruzioni E Strutture Aerospaziali
researchProduct

Guaranteed error bounds for a class of Picard-Lindelöf iteration methods

2013

We present a new version of the Picard-Lindelof method for ordinary dif- ¨ ferential equations (ODEs) supplied with guaranteed and explicitly computable upper bounds of an approximation error. The upper bounds are based on the Ostrowski estimates and the Banach fixed point theorem for contractive operators. The estimates derived in the paper take into account interpolation and integration errors and, therefore, provide objective information on the accuracy of computed approximations. peerReviewed

Discrete mathematicsClass (set theory)Banach fixed-point theoremOdeguaranteed error boundsPicard-Lindelöf methodsinversio-ongelmatelliptic boundary value problemsPower iterationApproximation errorOrdinary differential equationComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONApplied mathematicsa posteriori estimatesObjective informationInterpolationMathematics
researchProduct

The Asynchronous Leontief Model

1992

International audience; The traditional dynamic Leontief model is synchronous: every vertex acts simultaneously. A model with delays of action has been proposed, but it still remains synchronous. In this paper we propose an asynchronous version of the model that allows realistic computations. We fiurnish an algorithm and a program.

Discrete mathematicsLeontief modelVertex (graph theory)JEL : C - Mathematical and Quantitative Methods/C.C6 - Mathematical Methods • Programming Models • Mathematical and Simulation Modeling/C.C6.C67 - Input–Output ModelsEconomics and EconometricsJEL: C - Mathematical and Quantitative Methods/C.C6 - Mathematical Methods • Programming Models • Mathematical and Simulation Modeling/C.C6.C67 - Input–Output ModelsComputer scienceComputationJEL: D - Microeconomics/D.D5 - General Equilibrium and Disequilibrium/D.D5.D57 - Input–Output Tables and Analysis[SHS.ECO]Humanities and Social Sciences/Economics and FinanceAction (physics)JEL: C - Mathematical and Quantitative Methods/C.C6 - Mathematical Methods • Programming Models • Mathematical and Simulation Modeling/C.C6.C63 - Computational Techniques • Simulation ModelingJEL : C - Mathematical and Quantitative Methods/C.C6 - Mathematical Methods • Programming Models • Mathematical and Simulation Modeling/C.C6.C63 - Computational Techniques • Simulation ModelingAsynchronous communicationJEL : D - Microeconomics/D.D5 - General Equilibrium and Disequilibrium/D.D5.D57 - Input–Output Tables and Analysis[ SHS.ECO ] Humanities and Social Sciences/Economies and finances[SHS.ECO] Humanities and Social Sciences/Economics and Finance
researchProduct

A class of label-correcting methods for the K shortest paths problem

2001

In this paper we deal with the problem of finding the first K shortest paths from a single origin node to all other nodes of a directed graph. In particular, we define the necessary and sufficient conditions for a set of distance label vectors, on the basis of which we propose a class of methods which can be viewed as an extension of the generic label-correcting method for solving the classical single-origin all-destinations shortest path problem. The data structure used is characterized by a set of K lists of candidate nodes, and the proposed methods differ in the strategy used to select the node to be extracted at each iteration. The computational results show that: 1. some label-correct…

Discrete mathematicsManagement Science and Operations ResearchComputer Science ApplicationsEuclidean shortest pathShortest Path Faster AlgorithmSettore SECS-S/06 -Metodi Mat. dell'Economia e d. Scienze Attuariali e Finanz.Shortest path problemK shortest path routingCanadian traveller problemYen's algorithmConstrained Shortest Path FirstDistanceK shortest paths problem label correcting methodsMathematics
researchProduct

Rank structured approximation method for quasi--periodic elliptic problems

2016

We consider an iteration method for solving an elliptic type boundary value problem $\mathcal{A} u=f$, where a positive definite operator $\mathcal{A}$ is generated by a quasi--periodic structure with rapidly changing coefficients (typical period is characterized by a small parameter $\epsilon$) . The method is based on using a simpler operator $\mathcal{A}_0$ (inversion of $\mathcal{A}_0$ is much simpler than inversion of $\mathcal{A}$), which can be viewed as a preconditioner for $\mathcal{A}$. We prove contraction of the iteration method and establish explicit estimates of the contraction factor $q$. Certainly the value of $q$ depends on the difference between $\mathcal{A}$ and $\mathcal…

Discrete mathematicsNumerical AnalysisRank (linear algebra)PreconditionerApplied Mathematicsprecondition methodsguaranteed error boundsOrder (ring theory)65F30 65F50 65N35 65F10tensor type methods010103 numerical & computational mathematicsNumerical Analysis (math.NA)elliptic problems with periodic and quasi-periodic coefficients01 natural sciencesFinite element method010101 applied mathematicsComputational MathematicsOperator (computer programming)Simple (abstract algebra)FOS: MathematicsBoundary value problemTensorMathematics - Numerical Analysis0101 mathematicsMathematics
researchProduct

A Generalization of Girod’s Bidirectional Decoding Method to Codes with a Finite Deciphering Delay

2012

In this paper we generalize an encoding method due to Girod (cf. [6]) using prefix codes, that allows a bidirectional decoding of the encoded messages. In particular we generalize it to any finite alphabet A, to any operation defined on A, to any code with finite deciphering delay and to any key x ∈ A+ , on a length depending on the deciphering delay. We moreover define, as in [4], a deterministic transducer for such generalized method. We prove that, fixed a code X ∈ A* with finite deciphering delay and a key x ∈ A *, the transducers associated to different operations are isomorphic as unlabelled graphs. We also prove that, for a fixed code X with finite deciphering delay, transducers asso…

Discrete mathematicsPrefix codeStrongly connected componentSettore INF/01 - InformaticaGeneralization020206 networking & telecommunications0102 computer and information sciences02 engineering and technology01 natural sciencesPrefix010201 computation theory & mathematicsEncoding (memory)0202 electrical engineering electronic engineering information engineeringCode (cryptography)AlphabetGirod's encoding codes finite deciphering delayDecoding methodsMathematics
researchProduct

Impact of common property (E.A.) on fixed point theorems in fuzzy metric spaces

2011

We observe that the notion of common property (E.A.) relaxes the required containment of range of one mapping into the range of other which is utilized to construct the sequence of joint iterates. As a consequence, a multitude of recent fixed point theorems of the existing literature are sharpened and enriched.

Discrete mathematicsT57-57.97QA299.6-433Containment (computer programming)Pure mathematicsSequenceApplied mathematics. Quantitative methodsApplied MathematicsFixed-point theoremConstruct (python library)Fuzzy metric space property (E.A.) common property (E.A.) common fixed point generalized fuzzy contractionRange (mathematics)Differential geometryIterated functionSettore MAT/05 - Analisi MatematicaCommon propertyGeometry and TopologyAnalysisMathematics
researchProduct

Fixed Points for Pseudocontractive Mappings on Unbounded Domains

2010

We give some fixed point results for pseudocontractive mappings on nonbounded domains which allow us to obtain generalizations of recent fixed point theorems of Penot, Isac, and Németh. An application to integral equations is given.

Discrete mathematicsT57-57.97QA299.6-433Mathematics::Functional AnalysisApplied mathematics. Quantitative methodsApplied MathematicsFixed-point theoremFixed pointIntegral equationDifferential geometryGeometry and TopologyCoincidence pointAnalysisTopology (chemistry)MathematicsFixed Point Theory and Applications
researchProduct