Search results for "Ode"

showing 10 items of 40424 documents

F-contractions of Hardy–Rogers-type and application to multistage decision

2016

We prove fixed point theorems for F-contractions of Hardy–Rogers type involving self-mappings defined on metric spaces and ordered metric spaces. An example and an application to multistage decision processes are given to show the usability of the obtained theorems.

010101 applied mathematicsCombinatoricsApplied Mathematics010102 general mathematicslcsh:QA299.6-433F-contractions of Hardy–Rogers type and application to multistage decision processeslcsh:Analysis0101 mathematicsType (model theory)01 natural sciencesAnalysisMathematicsNonlinear Analysis: Modelling and Control
researchProduct

A comprehensive probabilistic analysis of approximate SIR‐type epidemiological models via full randomized discrete‐time Markov chain formulation with…

2020

Spanish Ministerio de Economia y Competitividad, Grant/Award Number: MTM2017-89664-P; Generalitat Valenciana, Grant/Award Number: APOSTD/2019/128; Ministerio de Economia y Competitividad, Grant/Award Number: MTM2017-89664-P

010101 applied mathematicsDiscrete mathematicsMarkov chainDiscrete time and continuous timeGeneral Mathematics010102 general mathematicsGeneral EngineeringProbabilistic analysis of algorithms0101 mathematicsType (model theory)01 natural sciencesMathematicsMathematical Methods in the Applied Sciences
researchProduct

Jakimovski–Leviatan operators of Kantorovich type involving multiple Appell polynomials

2019

Abstract The purpose of the present paper is to obtain the degree of approximation in terms of a Lipschitz type maximal function for the Kantorovich type modification of Jakimovski–Leviatan operators based on multiple Appell polynomials. Also, we study the rate of approximation of these operators in a weighted space of polynomial growth and for functions having a derivative of bounded variation. A Voronvskaja type theorem is obtained. Further, we illustrate the convergence of these operators for certain functions through tables and figures using the Maple algorithm and, by a numerical example, we show that our Kantorovich type operator involving multiple Appell polynomials yields a better r…

010101 applied mathematicsPure mathematicsGeneral Mathematics010102 general mathematics0101 mathematicsType (model theory)01 natural sciencesMathematicsGeorgian Mathematical Journal
researchProduct

The uniform convergence of a double sequence of functions at a point and Korovkin-type approximation theorems

2020

Abstract In this paper, we introduce an interesting kind of convergence for a double sequence called the uniform convergence at a point. We give an example and demonstrate a Korovkin-type approximation theorem for a double sequence of functions using the uniform convergence at a point. Then we show that our result is stronger than the Korovkin theorem given by Volkov and present several graphs. Finally, in the last section, we compute the rate of convergence.

010101 applied mathematicsPure mathematicsGeneral MathematicsUniform convergence010102 general mathematicsPoint (geometry)0101 mathematicsType (model theory)01 natural sciencesDouble sequenceMathematicsGeorgian Mathematical Journal
researchProduct

Voronovskaya type results and operators fixing two functions

2021

The present paper deals with positive linear operators which fix two functions. The transfer of a given sequence (Ln) of positive linear operators to a new sequence (Kn) is investigated. A general procedure to construct sequences of positive linear operators fixing two functions which form an Extended Complete Chebyshev system is described. The Voronovskaya type formula corresponding to the new sequence which is strongly influenced by the nature of the fixed functions is obtained. In the last section our results are compared with other results existing in literature.

010101 applied mathematicsextended complete Chebyshev systemModeling and Simulation010102 general mathematicsQA1-939operators fixing two functionsVoronovskaya type theorem0101 mathematics01 natural sciencesAnalysisMathematicspositive linear operatorsMathematical Modelling and Analysis
researchProduct

Efficient generation of restricted growth words

2013

A length n restricted growth word is a word w=w"1w"2...w"n over the set of integers where w"1=0 and each w"i, i>1, lies between 0 and the value of a word statistics of the prefix w"1w"2...w"i"-"1 of w, plus one. Restricted growth words simultaneously generalize combinatorial objects as restricted growth functions, staircase words and ascent or binary sequences. Here we give a generic generating algorithm for restricted growth words. It produces a Gray code and runs in constant average time provided that the corresponding statistics has some local properties.

010102 general mathematicsBinary numberValue (computer science)0102 computer and information sciences[ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO]01 natural sciencesComputer Science ApplicationsTheoretical Computer SciencePrefixCombinatoricsGray code010201 computation theory & mathematics[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]Signal ProcessingPartial word0101 mathematicsConstant (mathematics)ComputingMilieux_MISCELLANEOUSWord (group theory)Information SystemsMathematicsInformation Processing Letters
researchProduct

Constant sign and nodal solutions for nonlinear robin equations with locally defined source term

2020

We consider a parametric Robin problem driven by a nonlinear, nonhomogeneous differential operator which includes as special cases the p-Laplacian and the (p,q)-Laplacian. The source term is parametric and only locally defined (that is, in a neighborhood of zero). Using suitable cut-off techniques together with variational tools and comparison principles, we show that for all big values of the parameter, the problem has at least three nontrivial smooth solutions, all with sign information (positive, negative and nodal).

010102 general mathematicsMathematical analysisMathematics::Spectral Theory01 natural sciencesLocally defined reactionTerm (time)Critical groups010101 applied mathematicsNonlinear systemConstant sign and nodal solutionsSettore MAT/05 - Analisi MatematicaModeling and SimulationQA1-9390101 mathematicsNonlinear maximum principleConstant (mathematics)NODALMathematicsAnalysisSign (mathematics)MathematicsNonlinear regularity
researchProduct

Vertical versus horizontal Sobolev spaces

2020

Let $\alpha \geq 0$, $1 < p < \infty$, and let $\mathbb{H}^{n}$ be the Heisenberg group. Folland in 1975 showed that if $f \colon \mathbb{H}^{n} \to \mathbb{R}$ is a function in the horizontal Sobolev space $S^{p}_{2\alpha}(\mathbb{H}^{n})$, then $\varphi f$ belongs to the Euclidean Sobolev space $S^{p}_{\alpha}(\mathbb{R}^{2n + 1})$ for any test function $\varphi$. In short, $S^{p}_{2\alpha}(\mathbb{H}^{n}) \subset S^{p}_{\alpha,\mathrm{loc}}(\mathbb{R}^{2n + 1})$. We show that the localisation can be omitted if one only cares for Sobolev regularity in the vertical direction: the horizontal Sobolev space $S_{2\alpha}^{p}(\mathbb{H}^{n})$ is continuously contained in the vertical Sobolev sp…

010102 general mathematicsMetric Geometry (math.MG)Function (mathematics)Lipschitz continuity01 natural sciencesFunctional Analysis (math.FA)Fractional calculusSobolev spaceCombinatoricsMathematics - Functional AnalysisMathematics - Metric GeometryMathematics - Classical Analysis and ODEsBounded function0103 physical sciencesVertical directionClassical Analysis and ODEs (math.CA)FOS: MathematicsHeisenberg groupOrder (group theory)010307 mathematical physics0101 mathematics46E35 (Primary) 26A33 35R03 43A15 (Secondary)AnalysisMathematics
researchProduct

Restricted compositions and permutations: from old to new Gray codes

2011

Any Gray code for a set of combinatorial objects defines a total order relation on this set: x is less than y if and only if y occurs after x in the Gray code list. Let @? denote the order relation induced by the classical Gray code for the product set (the natural extension of the Binary Reflected Gray Code to k-ary tuples). The restriction of @? to the set of compositions and bounded compositions gives known Gray codes for those sets. Here we show that @? restricted to the set of bounded compositions of an interval yields still a Gray code. An n-composition of an interval is an n-tuple of integers whose sum lies between two integers; and the set of bounded n-compositions of an interval si…

0102 computer and information sciences02 engineering and technologyInterval (mathematics)[ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO]01 natural sciencesTheoretical Computer ScienceCombinatoricsGray codePermutationsymbols.namesakeInteger020204 information systems[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]0202 electrical engineering electronic engineering information engineeringComputingMilieux_MISCELLANEOUSMathematicsDiscrete mathematicsExtension (predicate logic)Composition (combinatorics)Cartesian productComputer Science Applications010201 computation theory & mathematicsComputer Science::Computer Vision and Pattern RecognitionBounded functionSignal ProcessingsymbolsInformation Systems
researchProduct

Generalised bisection method for optimum ultrasonic ray tracing and focusing in multi-layered structures

2021

Ultrasonic testing has been used for many decades, proving itself very efficient for detecting defects in many industrial sectors. The desire to apply ultrasonic testing to geometrically complex structures, and to anisotropic, inhomogeneous materials, together with the advent of more powerful electronics and software, is constantly pushing the applicability of ultrasonic waves to their limits. General ray tracing models, suitable for calculating the proper incident angle of single element probes and the proper time delay of phased array, are currently required. They can support the development of new imaging techniques, as Full Matrix Capture and Total Focusing Method, and the execution of …

010302 applied physicsAcoustics and UltrasonicsComputer scienceIterative methodbusiness.industryTKComputationUltrasonic testing01 natural sciencesRay tracing (physics)Settore ING-IND/14 - Progettazione Meccanica E Costruzione Di MacchineSoftware0103 physical sciencesBisection methodUltrasonic wave propagation Ray tracing Mathematical modelling Bisection method Multi-layered structures Weld inspection CompositesA priori and a posterioriUltrasonic sensorbusiness010301 acousticsAlgorithmUltrasonics
researchProduct