scholarly journals A block form of a singular pencil of operators and a method of obtaining it

A block form of a singular operator pencil $\lambda A+B$, where $\lambda$ is a complex parameter, and the linear operators $A$, $B$ act in finite-dimensional spaces, is described. An operator pencil $\lambda A+B$ is called regular if $n = m = rk(\lambda A+B)$, where $rk(\lambda A+B)$ is the rank of the pencil and $m$, $n$ are the dimensions of spaces (the operators map an $n$-dimensional space into an $m$-dimensional one); otherwise, if $n \ne m$ or $n = m$ and $rk(\lambda A+B)<n$, the pencil is called singular (irregular). The block form (structure) consists of a singular block, which is a purely singular pencil, i.e., it is impossible to separate out a regular block in this pencil, and a regular block. In these blocks, zero blocks and blocks, which are invertible operators, are separated out. A method of obtaining the block form of a singular operator pencil is described in detail for two special cases, when $rk(\lambda A+B) = m < n$ and $rk(\lambda A+B) = n < m$, and for the general case, when $rk(\lambda A+B) < n, m$. Methods for the construction of projectors onto subspaces from the direct decompositions, relative to which the pencil has the required block form, are given. Using these projectors, we can find the form of the blocks and, accordingly, the block form of the pencil. Examples of finding the block form for the various types of singular pencils are presented. To obtain the block form, in particular, the results regarding the reduction of a singular pencil of matrices to the canonical quasidiagonal form, which is called the Weierstrass-Kronecker canonical form, are used. Also, methods of linear algebra are used. The obtained block form of the pencil and the corresponding projectors can be used to solve various problems. In particular, it can be used to reduce a singular semilinear differential-operator equation to the equivalent system of purely differential and purely algebraic equations. This greatly simplifies the analysis and solution of differential-operator equations.

2021 ◽  
Vol 31 (08) ◽  
pp. 2150120
Author(s):  
Shengnan He ◽  
Xiaoli Sun ◽  
Mingqing Xiao

In this paper, we introduce a new concept, [Formula: see text]-mean Li–Yorke chaotic operator, which includes the standard mean Li–Yorke chaotic operators as special cases. We show that when [Formula: see text] or [Formula: see text], [Formula: see text]-mean Li–Yorke chaotic dynamics is strictly stronger than the ones that appeared in mean Li–Yorke chaos. When [Formula: see text] or [Formula: see text], it has completely different characteristics from the mean Li–Yorke chaos. We prove that no finite-dimensional Banach space can support [Formula: see text]-mean Li–Yorke chaotic operators. Moreover, we show that an operator is [Formula: see text]-mean Li–Yorke chaos if and only if there exists an [Formula: see text]-mean semi-irregular vector for the underlying operator, and if and only if there exists an [Formula: see text]-mean irregular vector when [Formula: see text], which generalizes the recent results by Bernardes et al. given in 2018. When [Formula: see text], we construct a counterexample in which it is an [Formula: see text]-mean Li–Yorke chaotic operator but does not admit an [Formula: see text]-mean irregular vector. In addition, we show that an operator with dense generalized kernel is [Formula: see text]-mean Li–Yorke chaotic if and only if there exists a residual set of [Formula: see text]-mean irregular vectors, and if and only if there exists an [Formula: see text]-mean unbounded orbit.


1994 ◽  
Vol 33 (01) ◽  
pp. 81-84 ◽  
Author(s):  
S. Cerutti ◽  
S. Guzzetti ◽  
R. Parola ◽  
M.G. Signorini

Abstract:Long-term regulation of beat-to-beat variability involves several different kinds of controls. A linear approach performed by parametric models enhances the short-term regulation of the autonomic nervous system. Some non-linear long-term regulation can be assessed by the chaotic deterministic approach applied to the beat-to-beat variability of the discrete RR-interval series, extracted from the ECG. For chaotic deterministic systems, trajectories of the state vector describe a strange attractor characterized by a fractal of dimension D. Signals are supposed to be generated by a deterministic and finite dimensional but non-linear dynamic system with trajectories in a multi-dimensional space-state. We estimated the fractal dimension through the Grassberger and Procaccia algorithm and Self-Similarity approaches of the 24-h heart-rate variability (HRV) signal in different physiological and pathological conditions such as severe heart failure, or after heart transplantation. State-space representations through Return Maps are also obtained. Differences between physiological and pathological cases have been assessed and generally a decrease in the system complexity is correlated to pathological conditions.


2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Andrey A. Pil’nik ◽  
Andrey A. Chernov ◽  
Damir R. Islamov

AbstractIn this study, we developed a discrete theory of the charge transport in thin dielectric films by trapped electrons or holes, that is applicable both for the case of countable and a large number of traps. It was shown that Shockley–Read–Hall-like transport equations, which describe the 1D transport through dielectric layers, might incorrectly describe the charge flow through ultra-thin layers with a countable number of traps, taking into account the injection from and extraction to electrodes (contacts). A comparison with other theoretical models shows a good agreement. The developed model can be applied to one-, two- and three-dimensional systems. The model, formulated in a system of linear algebraic equations, can be implemented in the computational code using different optimized libraries. We demonstrated that analytical solutions can be found for stationary cases for any trap distribution and for the dynamics of system evolution for special cases. These solutions can be used to test the code and for studying the charge transport properties of thin dielectric films.


2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Julián López-Gómez ◽  
Juan Carlos Sampedro

Abstract This paper generalizes the classical theory of perturbation of eigenvalues up to cover the most general setting where the operator surface 𝔏 : [ a , b ] × [ c , d ] → Φ 0 ⁢ ( U , V ) {\mathfrak{L}:[a,b]\times[c,d]\to\Phi_{0}(U,V)} , ( λ , μ ) ↦ 𝔏 ⁢ ( λ , μ ) {(\lambda,\mu)\mapsto\mathfrak{L}(\lambda,\mu)} , depends continuously on the perturbation parameter, μ, and holomorphically, as well as nonlinearly, on the spectral parameter, λ, where Φ 0 ⁢ ( U , V ) {\Phi_{0}(U,V)} stands for the set of Fredholm operators of index zero between U and V. The main result is a substantial extension of a classical finite-dimensional theorem of T. Kato (see [T. Kato, Perturbation Theory for Linear Operators, 2nd ed., Class. Math., Springer, Berlin, 1995, Chapter 2, Section 5]).


Symmetry ◽  
2021 ◽  
Vol 13 (6) ◽  
pp. 1063
Author(s):  
Vladimir Mityushev ◽  
Zhanat Zhunussova

A close relation between the optimal packing of spheres in Rd and minimal energy E (effective conductivity) of composites with ideally conducting spherical inclusions is established. The location of inclusions of the optimal-design problem yields the optimal packing of inclusions. The geometrical-packing and physical-conductivity problems are stated in a periodic toroidal d-dimensional space with an arbitrarily fixed number n of nonoverlapping spheres per periodicity cell. Energy E depends on Voronoi tessellation (Delaunay graph) associated with the centers of spheres ak (k=1,2,…,n). All Delaunay graphs are divided into classes of isomorphic periodic graphs. For any fixed n, the number of such classes is finite. Energy E is estimated in the framework of structural approximations and reduced to the study of an elementary function of n variables. The minimum of E over locations of spheres is attained at the optimal packing within a fixed class of graphs. The optimal-packing location is unique within a fixed class up to translations and can be found from linear algebraic equations. Such an approach is useful for random optimal packing where an initial location of balls is randomly chosen; hence, a class of graphs is fixed and can dynamically change following prescribed packing rules. A finite algorithm for any fixed n is constructed to determine the optimal random packing of spheres in Rd.


2005 ◽  
Vol 02 (03) ◽  
pp. 251-258
Author(s):  
HANLIN HE ◽  
QIAN WANG ◽  
XIAOXIN LIAO

The dual formulation of the maximal-minimal problem for an objective function of the error response to a fixed input in the continuous-time systems is given by a result of Fenchel dual. This formulation probably changes the original problem in the infinite dimensional space into the maximal problem with some restrained conditions in the finite dimensional space, which can be researched by finite dimensional space theory. When the objective function is given by the norm of the error response, the maximum of the error response or minimum of the error response, the dual formulation for the problems of L1-optimal control, the minimum of maximal error response, and the minimal overshoot etc. can be obtained, which gives a method for studying these problems.


Author(s):  
Jay L. Adams ◽  
Robert J. Veillette ◽  
Tom T. Hartley

This paper applies the Rayleigh-Ritz method to approximating the Hankel singular values of fractional-order systems. The algorithm is presented, and estimates of the first ten Hankel singular values of G(s) = 1/(sq+1) for several values of q ∈ (0, 1] are given. The estimates are computed by restricting the operator domain to a finite-dimensional space. The Hankel-norm estimates are found to be within 15% of the actual values for all q ∈ (0, 1].


2013 ◽  
Vol 2013 ◽  
pp. 1-13 ◽  
Author(s):  
Jian Xie ◽  
Yongquan Zhou ◽  
Huan Chen

Aiming at the phenomenon of slow convergence rate and low accuracy of bat algorithm, a novel bat algorithm based on differential operator and Lévy flights trajectory is proposed. In this paper, a differential operator is introduced to accelerate the convergence speed of proposed algorithm, which is similar to mutation strategy “DE/best/2” in differential algorithm. Lévy flights trajectory can ensure the diversity of the population against premature convergence and make the algorithm effectively jump out of local minima. 14 typical benchmark functions and an instance of nonlinear equations are tested; the simulation results not only show that the proposed algorithm is feasible and effective, but also demonstrate that this proposed algorithm has superior approximation capabilities in high-dimensional space.


Sign in / Sign up

Export Citation Format

Share Document