In a real Hilbert space
H
we consider a linear self-adjoint positive definite operator
A
:
V
=
D
(
A
)
⊂
H
→
H
and investigate
the behavior of the difference
u
−
v
of solutions to the problems
...
Capcelea, Maria; Capcelea, Titu(Institutul de Matematică şi Informatică al AŞM, 2020)
In the present paper the Pad ́e approximation with Laurent polynomials is
examined for a meromorphic function on a finite domain of the c
omplex plane. Values
of the function are given at the points of a simple closed ...
Cheban, David(Institutul de Matematică şi Informatică al AŞM, 2019)
The known Levitan’s Theorem states that the finite-dimensional linear
differential equationx′=A(x+f(t)(1)with Bohr almost periodic coefficientsA(t) and f(t) admits at least one Levitan almostperiodic solution if it has a ...
The aim of this paper is to prove the existence of Levitan/Bohr almost periodic, almost automorphic, recurrent and Poisson stable solutions of the scalar differential equations. The existence of at least one quasi-periodic ...
We study the existence of the limits of solutions to the semilinear plate
equation with boundary Dirichlet condition with a small parameter coefficient of the
second order derivative in time. We establish the convergence ...
Perjan, Andrei; Rusu, Galina(Academia de Ştiinţe a Moldovei, 2022)
We study the existence of the limits of solutions to the semilinear plate
equation with boundary Dirichlet condition with a small parameter coefficient of the
second order derivative in time. We establish the convergence ...
Perjan, Andrei(Academia de Ştiinţe a Moldovei, 2006)
We study the existence of the limits of solution to singularly perturbed
initial boundary value problem of hyperbolic - parabolic type with boundary Dirichlet
condition for the semilinear wave equation. We prove the ...
We study the behavior of solutions to the problem εu′′ε(t) +u′ε(t) +A(t)uε(t) =fε(t), t∈(0, T),
uε(0) =u0ε, u′ε(0) =u1ε,in the Hilbert space H asε→0, whereA(t), t∈(0,∞),is a family of linear self-adjoint
În lucrare este demonstrată echivalenţa problemei decizionale Markov cu problema stocastică de control optimal pe reţea. Acest rezultat permite de a aplica metoda programării liniare la determinarea strategiilor staţionare ...
Perjan, Andrei(Academia de Ştiinţe a Moldovei, 2003)
We study the behavior of solutions of the problem εu′′(t)+u′(t)+Au(t) =f (t), u(0) = u0, u′(0) = u1 in the Hilbert space H as ε → 0, where A is a linear,symmetric, strong positive operator.
We prove that the linear stochastic equation dx(t) = (Ax(t)+f(t))dt+g(t)dW(t) (*) with linear operator A generating a C0-semigroup{U(t)}t≥0 and Levitan almost periodic forcing termsf and g admits a unique Levitan almost ...
In this paper we examine two algorithms for localization of singular points
of meromorphic functions. Both algorithms apply approximation by interpolation
with rational functions. The first one is based on global ...
The article examines the center and median problems on graphs with special structure. In scientific works these are frequently called location problems on graphs. Although efficient solutions for graphs with some well-known ...
Syrbu, Parascovia; Grecu, Ion(Institutul de Matematică şi Informatică al AŞM, 2020)
The question ”Are the loops with universal (i.e. invariant under the
isotopy of loops) flexibility law xy·x=x·yx
, middle Bol loops?” is open in the theory
of loops. If this conjecture is true then the loops for which ...
For the bidimensional polynomial systems of differential equations with nonlinearities of the fourth degree the recurent equations for determination of the Lyapunov quantities were established. Moreover, the general form ...
Se propune un sistem simetric de criptare a informaţiei, numit Crypto 2. Acest sistem se bazează pe utilizarea numerelor prime mari şi pe dezvoltarea lor polinomială. Un rol deosebit revine matricelor multidimensionale, ...
Buzatu, Radu(Institutul de Matematică şi Informatică al AŞM, 2021)
Let G be a connected graph. We say that a set S ⊆ X(G) is convex in G
if, for any two vertices x, y ∈ S, all vertices of every shortest path between x and y are
in S. If 3 ≤ |S| ≤ |X(G)| − 1, then S is a nontrivial set. ...
Let G be a connected graph. We say that a set S ⊆ X(G) is convex in G
if, for any two vertices x, y ∈ S, all vertices of every shortest path between x and y are
in S. If 3 ≤ |S| ≤ |X(G)| − 1, then S is a nontrivial set. ...
The nontrivial convex p-cover problem of a tree is studied.We propose the recursive formula that determines the maximum nontrivial convex cover number of a tree.
The stochastic version of discrete optimal control problem on networks with an average cost optimization criterion and with varying time of state transitions is studied.