Search results for "Methods"
showing 10 items of 4526 documents
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 …
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
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.
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…
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…
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…
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.
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.
Performance analysis of optical imaging systems based on the fractional fourier transform
1998
Some image quality parameters, such as the Strehl ratio and the optical transfer function, are analysed in the generalized phase-space, or x-p domain, of the fractional Fourier transform associated with a modified one-dimensional pupil function. Some experimental results together with computer simulations are performed which illustrate the tolerance to defocus of different apertures.
ADI schemes for valuing European options under the Bates model
2018
Abstract This paper is concerned with the adaptation of alternating direction implicit (ADI) time discretization schemes for the numerical solution of partial integro-differential equations (PIDEs) with application to the Bates model in finance. Three different adaptations are formulated and their (von Neumann) stability is analyzed. Ample numerical experiments are provided for the Bates PIDE, illustrating the actual stability and convergence behaviour of the three adaptations.