Search results for "Computational Mathematic"
showing 10 items of 987 documents
Solving fully randomized higher-order linear control differential equations: Application to study the dynamics of an oscillator
2021
[EN] In this work, we consider control problems represented by a linear differential equation assuming that all the coefficients are random variables and with an additive control that is a stochastic process. Specifically, we will work with controllable problems in which the initial condition and the final target are random variables. The probability density function of the solution and the control has been calculated. The theoretical results have been applied to study, from a probabilistic standpoint, a damped oscillator.
Weakened acute type condition for tetrahedral triangulations and the discrete maximum principle
2000
We prove that a discrete maximum principle holds for continuous piecewise linear finite element approximations for the Poisson equation with the Dirichlet boundary condition also under a condition of the existence of some obtuse internal angles between faces of terahedra of triangulations of a given space domain. This result represents a weakened form of the acute type condition for the three-dimensional case.
The effects of convolution and gradient dependence on a parametric Dirichlet problem
2020
Our objective is to study a new type of Dirichlet boundary value problem consisting of a system of equations with parameters, where the reaction terms depend on both the solution and its gradient (i.e., they are convection terms) and incorporate the effects of convolutions. We present results on existence, uniqueness and dependence of solutions with respect to the parameters involving convolutions.
Information potential for some probability density functions
2021
Abstract This paper is related to the information theoretic learning methodology, whose goal is to quantify global scalar descriptors (e.g., entropy) of a given probability density function (PDF). In this context, the core concept is the information potential (IP) S [ s ] ( x ) : = ∫ R p s ( t , x ) d t , s > 0 of a PDF p(t, x) depending on a parameter x; it is naturally related to the Renyi and Tsallis entropies. We present several such PDF, viewed also as kernels of integral operators, for which a precise relation exists between S[2](x) and the variance Var[p(t, x)]. For these PDF we determine explicitly the IP and the Shannon entropy. As an application to Information Theoretic Learning w…
Adjacent vertices can be hard to find by quantum walks
2018
Quantum walks have been useful for designing quantum algorithms that outperform their classical versions for a variety of search problems. Most of the papers, however, consider a search space containing a single marked element. We show that if the search space contains more than one marked element, their placement may drastically affect the performance of the search. More specifically, we study search by quantum walks on general graphs and show a wide class of configurations of marked vertices, for which search by quantum walk needs Ω(N) steps, that is, it has no speed-up over the classical exhaustive search. The demonstrated configurations occur for certain placements of two or more adjace…
On ergodic operator means in Banach spaces
2016
We consider a large class of operator means and prove that a number of ergodic theorems, as well as growth estimates known for particular cases, continue to hold in the general context under fairly mild regularity conditions. The methods developed in the paper not only yield a new approach based on a general point of view, but also lead to results that are new, even in the context of the classical Cesaro means.
Common Fixed points for multivalued generalized contractions on partial metric spaces
2013
We establish some common fixed point results for multivalued mappings satisfying generalized contractive conditions on a complete partial metric space. The presented theorems extend some known results to partial metric spaces. We motivate our results by some given examples and an application for finding the solution of a functional equation arising in dynamic programming.
Point counting on Picard curves in large characteristic
2005
We present an algorithm for computing the cardinality of the Jacobian of a random Picard curve over a finite field. If the underlying field is a prime field Fp, the algorithm has complexity O(p).
Infinite games and chain conditions
2015
We apply the theory of infinite two-person games to two well-known problems in topology: Suslin's Problem and Arhangel'skii's problem on $G_\delta$ covers of compact spaces. More specifically, we prove results of which the following two are special cases: 1) every linearly ordered topological space satisfying the game-theoretic version of the countable chain condition is separable and 2) in every compact space satisfying the game-theoretic version of the weak Lindel\"of property, every cover by $G_\delta$ sets has a continuum-sized subcollection whose union is $G_\delta$-dense.
Some integral type fixed point theorems in Non-Archimedean Menger PM-Spaces with common property (E.A) and application of functional equations in dyn…
2013
In this paper, we prove some integral type common fixed point theorems for weakly compatible mappings in Non-Archimedean Menger PM-spaces employing common property (E.A). Some examples are furnished which demonstrate the validity of our results. We extend our main result to four finite families of self-mappings employing the notion of pairwise commuting. Moreover, we give an application which supports the usability of our main theorem.