Search

In this paper we analyze the stability of the problem of performing a rational QZ step with a shift that is an eigenvalue of a given regular pencil H - λ K in unreduced Hessenberg–Hessenberg form. In exact arithmetic, the backward rational QZ step moves the eigenvalue to the top of the pencil, while the rest of the pencil is maintained in Hessenberg–Hessenberg form, which then yields a deflation of the given shift. But in finite-precision the rational QZ step gets "blurred" and precludes the deflation of the given shift at the top of the pencil. In this paper we show that when we first compute the corresponding eigenvector to sufficient accuracy, then the rational QZ step can be constructed using this eigenvector, so that the exact deflation is also obtained in finite-precision. [ABSTRACT FROM AUTHOR]

In this communication we provide our answers to the comments by Usoskin (2017) on our recent paper (Popova et al, 2017a). We show that Principal Component Analysis (PCA) allows us to derive eigen vectors with eigen values assigned to variance of solar magnetic field waves from full disk solar magnetograms obtained in cycles 21–23 which came in pairs. The current paper (Popova et al, 2017a) adds the second pair of magnetic waves generated by quadruple magnetic sources. This allows us to recover a centennial cycle, in addition to the grand cycle, and to produce a closer fit to the solar and terrestrial activity features in the past millennium. [ABSTRACT FROM AUTHOR]

The paper discusses systems with viscoelastic elements that exhibit repeated eigenvalues in the eigenvalue problem. The mechanical behavior of viscoelastic elements can be described using classical rheological models as well as models that involve fractional derivatives. Formulas have been derived to calculate first- and second-order sensitivities of repeated eigenvalues and their corresponding eigenvectors. A specific case was also examined, where the first derivatives of eigenvalues are repeated. Calculating derivatives of eigenvectors associated with repeated eigenvalues is complex because they are not unique. To compute their derivatives, it is necessary to identify appropriate adjacent eigenvectors to ensure stable control of eigenvector changes. The derivatives of eigenvectors are obtained by dividing them into particular and homogeneous solutions. Additionally, in the paper, a special factor in the coefficient matrix has been introduced to reduce its condition number. The provided examples validate the correctness of the derived formulas and offer a more detailed analysis of structural behavior for structures with viscoelastic elements when altering a single design parameter or simultaneously changing multiple parameters. [ABSTRACT FROM AUTHOR]

In this paper, we first present multiple numerical simulations of the anti-symmetric matrix in the stability criteria for fractional order systems (FOSs). Subsequently, this paper is devoted to the study of the admissibility criteria for descriptor fractional order systems (DFOSs) whose order belongs to (0, 2). The admissibility criteria are provided for DFOSs without eigenvalues on the boundary axes. In addition, a unified admissibility criterion for DFOSs involving the minimal linear matrix inequality (LMI) variable is provided. The results of this paper are all based on LMIs. Finally, numerical examples were provided to validate the accuracy and effectiveness of the conclusions. [ABSTRACT FROM AUTHOR]

Installing multi-camera systems and inertial measurement units (IMUs) in self-driving cars, micro aerial vehicles, and robots is becoming increasingly common. An IMU provides the vertical direction, allowing coordinate frames to be aligned in a common direction. The degrees of freedom (DOFs) of the rotation matrix are reduced from 3 to 1. In this paper, we propose a globally optimal solver to calculate the relative poses and scale of generalized cameras with a known vertical direction. First, the cost function is established to minimize algebraic error in the least-squares sense. Then, the cost function is transformed into two polynomials with only two unknowns. Finally, the eigenvalue method is used to solve the relative rotation angle. The performance of the proposed method is verified on both simulated and KITTI datasets. Experiments show that our method is more accurate than the existing state-of-the-art solver in estimating the relative pose and scale. Compared to the best method among the comparison methods, the method proposed in this paper reduces the rotation matrix error, translation vector error, and scale error by 53%, 67%, and 90%, respectively. [ABSTRACT FROM AUTHOR]

In this paper, we study the spectral properties of a class of degenerate third-order partial differential operators with variable coefficients presented in a rectangle. Conditions are found to ensure the existence and compactness of the inverse operator. A theorem on estimates of approximation numbers is proven. Here, we note that finding estimates of approximation numbers, as well as extremal subspaces, for a set of solutions to the equation is a task that is certainly important from both a theoretical and a practical point of view. The paper also obtained an upper bound for the eigenvalues. Note that, in this paper, estimates of eigenvalues and approximation numbers for the degenerate third-order partial differential operators are obtained for the first time. [ABSTRACT FROM AUTHOR]

When the conjugate gradient (CG) method for solving linear algebraic systems was formulated about 70 years ago by Lanczos, Hestenes, and Stiefel, it was considered an iterative process possessing a mathematical finite termination property. With the deep insight of the original authors, CG was placed into a very rich mathematical context, including links with Gauss quadrature and continued fractions. The optimality property of CG was described via a normalized weighted polynomial least squares approximation to zero. This highly nonlinear problem explains the adaptation of CG iterates to the given data. Karush and Hayes immediately considered CG in infinite dimensional Hilbert spaces and investigated its superlinear convergence. Since then, the view of CG, as well as other Krylov subspace methods developed in the meantime, has changed. Today these methods are considered primarily as computational tools, and their behavior is typically characterized using linear upper bounds, or heuristics based on clustering of eigenvalues. Such simplifications limit the mathematical understanding of Krylov subspace methods, and also negatively affect their practical application. This paper offers a different perspective. Focusing on CG and the generalized minimal residual (GMRES) method, it presents mathematically important as well as practically relevant phenomena that uncover their behavior through a discussion of computed examples. These examples provide an easily accessible approach that enables understanding of the methods, while pointers to more detailed analyses in the literature are given. This approach allows readers to choose the level of depth and thoroughness appropriate for their intentions. Some of the points made in this paper illustrate well known facts. Others challenge mainstream views and explain existing misunderstandings. Several points refer to recent results leading to open problems. We consider CG and GMRES crucially important for the mathematical understanding, further development, and practical applications also of other Krylov subspace methods. The paper additionally addresses the motivation of preconditioning. [ABSTRACT FROM AUTHOR]

The quantum system behaviour in the presence of a potential is best described by the Schrödinger equation. Maturation of analytical methods in solving the Schrödinger equation for various potentials provides a theorist with powerful tools for better understanding the behaviour of quantum systems. With this objective in mind, this paper introduces a novel potential, called the generalized hyperbolic cotangent potential. This potential is interesting because it encompasses a few exponential-type potentials. A quantum system interacting with such a potential, therefore, warrants careful study. The paper presents analytical solutions to the bound state problem of the generalized hyperbolic cotangent potential for arbitrary l states using a newly established quantization rule. Towards this end, the analytical formula is derived for the energy eigenvalue and respective eigenstate. Special cases of the analytical formula of the energy spectrum are discussed for the generalized hyperbolic cotangent potential. [ABSTRACT FROM AUTHOR]

Free vibration characteristics in uniform beams with several lumped attachments are an important problem in engineering applications that have to deal with mounting different equipment (e.g. motors, oscillators or engines) on a structural beam. In order to solve the lack of a generalized automatic procedure, this investigation presents a simple solving approach based on analytical means applied to a secular frequency equation for obtaining the natural frequencies of an arbitrarily supported single-span, or multi-span Euler–Bernoulli beam carrying any combination of miscellaneous attachments. The approach is obtained by solving a characteristic polynomial equation using a classical method for computing the roots of a polynomial. Interestingly, if the number of elements is greater than one, a pole-zero cancellation is needed, but it does not require manual interventions such as initial values and iteration. The mathematical approach is validated with bibliographic references and evaluated for accuracy and computational effectiveness. A good agreement is observed with relative error values practically negligible mostly ranging between 10−3 and 10−9 in the first five natural frequencies, which confirms the validity of the presented approach in this paper. The MatLab code that has been developed with the solving approach is freely available as a supplementary material to this paper. Additionally, a MatLab graphical user interface has also been developed in this work which allows to obtain the eigenvalues of a simply supported Euler–Bernoulli beam carrying an undetermined number of lumped elements. The graphical user interface is also available for download, along with help facilities to be run in a Windows operating system and detailed instructions to reproduce the case studies presented here. The proposed scheme (and also the MatLab graphical user interface) is very easy to code, and can be slightly modified to accommodate beams with arbitrary supports. [ABSTRACT FROM AUTHOR]

Laplacian matrix and its spectrum are commonly used for giving a measure in networks in order to analyse its topological properties. In this paper, Laplacian matrix of graphs and their spectrum are studied. Laplacian energy of a graph G of order n is defined as LE (G) = ∑ i = 1 n | λ i (L) - d ¯ | , where λ i (L) is the i-th eigenvalue of Laplacian matrix of G, and d ¯ is their average. If LE (G) = LE (K n) for the complete graph K n of order n, then G is known as L-borderenergetic graph. In the first part of this paper, we construct three infinite families of non-complete disconnected L-borderenergetic graphs: Λ 1 = { G b , j , k = [ (((j - 2) k - 2 j + 2) b + 1) K (j - 1) k - (j - 2) ] ∪ b (K j × K k) | b , j , k ∈ Z + } , Λ 2 = { G 2 , b = [ K 6 ∇ b (K 2 × K 3) ] ∪ (4 b - 2) K 9 | b ∈ Z + } , Λ 3 = { G 3 , b = [ b K 8 ∇ b (K 2 × K 4) ] ∪ (14 b - 4) K 8 b + 6 | b ∈ Z + } , where ∇ is join operator and × is direct product operator on graphs. Then, in the second part of this work, we construct new infinite families of non-complete connected L-borderenergetic graphs Ω 1 = { K 2 ∇ a K 2 r ¯ | a ∈ Z + } , Ω 2 = { a K 3 ∪ 2 (K 2 × K 3) ¯ | a ∈ Z + } and Ω 3 = { a K 5 ∪ (K 3 × K 3) ¯ | a ∈ Z + } , where G ¯ is the complement operator on G. [ABSTRACT FROM AUTHOR]

This paper discusses pseudospectra and stability radii for structured nonlinear matrix functions, such as Hermitian, skew‐Hermitian, H‐even, H‐odd, complex symmetric, and complex skew‐symmetric. To compute pseudospectra and stability radii, eigenvalue backward error is required. Hence, we initially present the structured eigenvalue backward error. Subsequently, we compute the structured pseudospectra using the obtained results for the eigenvalue backward error of a class of structured nonlinear matrix functions. Finally, we discuss the stability radii of the above‐structured problems arising in different applications. The paper also generalizes the results on the eigenvalue backward error of matrix polynomials in the literature for the above structures. [ABSTRACT FROM AUTHOR]

It is assumed that a sheet of paper performs transverse vibrations as a plate having additional stiffness due to static tension in its plane. The first eigenmodes are determined. The setup for experimental investigation of the nodal lines of the standing waves and for the determination of eigenmodes using projection moire is created for the analysis of unsymmetric loading of the paper. The comparison of the theoretical and experimental results of investigations is performed. The obtained results could be used in the process of design of the elements of the printing device. [ABSTRACT FROM AUTHOR]

The main purpose of this paper is to study the Laplacian eigenvalues of the extension of the zero divisor graph, Γ e (Z n) , for some particular values of n. We characterize the values of n that give the equality of the spectral radius and the second-smallest eigenvalue of Γ e (Z n). Finding Wiener index of Γ e (Z n) in terms of its Laplacian eigenvalues is another objective of this paper. [ABSTRACT FROM AUTHOR]

In this paper we ascertain the singular point-wise behavior of the positive solutions of a semilinear elliptic boundary value problem (1) at the critical value of the parameter, λ , where it begins its metasolution regime. As the weight function m (x) changes sign in Ω, our result is a substantial extension of a previous, very recent, result of Li et al. [8] , where it was imposed the (very strong) condition that m ≥ 0 on a neighborhood of b − 1 ({ 0 }). In this paper, we are simply assuming that m (x 0) > 0 for some x 0 ∈ b − 1 ({ 0 }). • Theorem 1.1 proves that the behavior of the solutions proved by Li et al. [8] also occurs with much weaker hypotheses. • Theorem 3.1 is a substantial extension of Theorem 2.1 of López-Gómez and Sabina de Lis [12]. • Lemma 2.1 provides a useful estimate of eigenfunctions associated to an eigenvalue problem with sign changing weight. [ABSTRACT FROM AUTHOR]

In this paper, we study the numerical method for the bi-Laplace problems with inhomogeneous coefficients; particularly, we propose finite element schemes on rectangular grids respectively for an inhomogeneous fourth-order elliptic singular perturbation problem and for the Helmholtz transmission eigenvalue problem. The new methods use the reduced rectangle Morley (RRM for short) element space with piecewise quadratic polynomials, which are of the lowest degree possible. For the finite element space, a discrete analogue of an equality by Grisvard is proved for the stability issue and a locally-averaged interpolation operator is constructed for the approximation issue. Optimal convergence rates of the schemes are proved, and numerical experiments are given to verify the theoretical analysis. • A discrete analogue of an equality (1.3) by Grisvard [1] on H 2 functions is proved for the reduced rectangular Morley (RRM for short in the sequel) element functions. This discrete equality makes the RRM space usable for bi-Laplacian problems with inhomogeneous coefficients. • Based on piecewise quadratic polynomials, the RRM scheme is the lowest-degree finite element scheme for the inhomogeneous bi-Laplace problems. Compared to other kinds of methods, it does not need tuning parameter or using indirect differential operators. • As revealed by [3] , the RRM element space does not admit a locally-defined projective interpolator. In this paper, however, a locally-defined stable interpolator (not projective) is carefully constructed for the RRM element space, and an optimal approximation is proved rigorously on both convex and nonconvex domains. [ABSTRACT FROM AUTHOR]

This paper is concerned with the exact delay range making input-delay systems unstabilizable. The exact range means that the systems are unstabilizable if and only if the delay is within this range. Contributions of this paper are to characterize the exact range and to present a computation method to derive this range. It is shown that the above range is related to unstable eigenvalues of the system matrix. In the discrete-time case, if none of the eigenvalues of the system matrix is a unit root, then the above range is a finite set. If there exist some eigenvalues which are unit roots, this range may be a finite set or may be composed of several arithmetic progressions. When this range contains finite elements, the number of these elements is bounded by the geometric multiplicities of eigenvalues. When this range contains arithmetic progressions, the number of such progressions is bounded by the above multiplicities. On the other hand, our results can provide an upper bound for the well-known delay margin, which is the maximal delay value achievable by a robust controller to stabilize systems. [ABSTRACT FROM AUTHOR]

In this paper, we prove a new extremal property of the Reuleaux triangle: it maximizes the Cheeger constant among all bodies of (same) constant width. The proof relies on a fine analysis of the optimality conditions satisfied by an optimal Reuleaux polygon together with an explicit upper bound for the inradius of the optimal domain. As a possible perspective, we conjecture that this maximal property of the Reuleaux triangle holds for the first eigenvalue of the p -Laplacian for any p ∈ (1 , + ∞) (this paper covers the case p = 1 whereas the case p = + ∞ was already known). [ABSTRACT FROM AUTHOR]

In the field of radar target detection, the conventional approach is to employ the range profile energy accumulation method for detecting extended targets. However, this method becomes ineffective when dealing with non-stationary and non-uniform radar clutter scenarios, as well as long-distance targets with weak radar cross sections (RCSs). In such cases, the signal-to-noise ratio (SNR) of the target echo is severely degraded, rendering the energy accumulation detection algorithm unreliable. To address this issue, this paper presents a new extended target detection method based on the maximum eigenvalue of the Hermitian matrix. This method utilizes a detection model that incorporates observed data and employs the likelihood ratio test (LRT) theory to derive the maximum eigenvalue detector at low SNR. Specifically, the detector constructs a matrix using a sliding window block with the available data and then computes the maximum eigenvalue of the covariance matrix. Subsequently, the maximum eigenvalue matrix is transformed into a one-dimensional eigenvalue image, enabling extended target detection through analogy with the energy accumulation detection method. Furthermore, this paper analyzes the proposed extended target detection method from both theoretical and experimental perspectives, validating it through field-measured data. The results obtained from the measured data demonstrate that the method effectively enhances the SNR in low SNR conditions, thereby improving target detection performance. Additionally, the method exhibits robustness across different scattering center targets. [ABSTRACT FROM AUTHOR]

We prove that solutions to several shape optimization problems in the plane, with a convexity constraint on the admissible domains, are polygons. The main terms of the shape functionals we consider are either the Dirichlet energy E f ⁢ (Ω) of the Laplacian in the domain Ω or the first eigenvalue λ 1 ⁢ (Ω) of the Dirichlet-Laplacian. Usually, one considers minimization of such functionals (often with measure constraint), as for example for the famous Saint-Venant and Faber-Krahn inequalities. By adding the convexity constraint (and possibly other natural constraints), we instead consider the rather unusual and difficult question of maximizing these functionals. This paper follows a series of papers by the authors, where the leading idea is that a certain concavity property of the shape functional that is minimized leads optimal shapes to locally saturate their convexity constraint, which geometrically means that they are polygonal. In these previous papers, the leading term in the shape functional was usually the opposite of the perimeter, for which the aforementioned concavity property was rather easy to obtain through computations of its second order shape derivative. By carrying classical shape calculus, a similar concavity property can be observed for the opposite of E f ⁢ (Ω) or λ 1 ⁢ (Ω) when shapes are smooth and convex. The main novelty in the present paper is the proof of a weak convexity property of E f ⁢ (Ω) and λ 1 ⁢ (Ω) among planar convex shapes, namely rather nonsmooth shapes. This involves new computations and estimates of the second order shape derivatives of E f ⁢ (Ω) and λ 1 ⁢ (Ω) interesting for themselves. [ABSTRACT FROM AUTHOR]

In this paper, we study the existence solutions to nonlinear Fučík problems of the form (1) A x = α x + − β x − + g (x) , where A is a symmetric n × n matrix, α , β are real numbers, and g : R n → R n is continuous. The nonlinear problem (1) is motivated by application to nonlinear oscillating systems such as the Tacoma Narrows Bridge. The paper begins by developing a qualitative picture of Fučík spectrum associated with the matrix equation A x = α x + − β x −. In this setting, we present two characterizations: first, we show that under appropriate assumptions the Fučík spectrum consists of curves bifurcating from points (λ , λ) ∈ R 2 , where λ is an eigenvalue of A ; second, we give more global variational characterization of the Fučík curves. In both cases, we present various qualitative properties of the Fučík curves. The paper finishes by presenting two existence theorems for the nonlinear Fučík problem under mild assumptions on the nonlinear term g. [ABSTRACT FROM AUTHOR]

We consider a diffusive Rosenzweig–MacArthur predator–prey model in the situation when the prey diffuses at a rate much smaller than that of the predator. In a certain parameter regime, the existence of fronts in the system is known: the underlying dynamical system in a singular limit is reduced to a scalar Fisher–KPP (Kolmogorov–Petrovski–Piskunov) equation and the fronts supported by the full system are small perturbations of the Fisher–KPP fronts. The existence proof is based on the application of the Geometric Singular Perturbation Theory with respect to two small parameters. This paper is focused on the stability of the fronts. We show that, for some parameter regime, the fronts are spectrally and asymptotically stable using energy estimates, exponential dichotomies, the Evans function calculation, and a technique that involves constructing unstable augmented bundles. The energy estimates provide bounds on the unstable spectrum which depend on the small parameters of the system; the bounds are inversely proportional to these parameters. We further improve these estimates by showing that the eigenvalue problem is a small perturbation of some limiting (as the modulus of the eigenvalue parameter goes to infinity) system and that the limiting system has exponential dichotomies. Persistence of the exponential dichotomies then leads to bounds uniform in the small parameters. The main novelty of this approach is related to the fact that the limit of the eigenvalue problem is not autonomous. We then use the concept of the unstable augmented bundles and by treating these as multiscale topological structures with respect to the same two small parameters consequently as in the existence proof, we show that the stability of the fronts is also governed by the scalar Fisher–KPP equation. Furthermore, we perform numerical computations of the Evans function to explicitly identify regions in the parameter space where the fronts are spectrally stable. [ABSTRACT FROM AUTHOR]

Aiming to improve the robustness and adaptiveness of the recently investigated capped norm linear discriminant analysis (CLDA), this paper proposes a regularized linear discriminant analysis based on the generalized capped l 2 , q -norm (GCLDA). Compared to CLDA, there are two improvements in GCLDA. Firstly, GCLDA uses the capped l 2 , q -norm rather than the capped l 2 , 1 -norm to measure the within-class and between-class distances for arbitrary q > 0 . By selecting an appropriate q, GCLDA is adaptive to different data, and also removes extreme outliers and suppresses the effect of noise more effectively. Secondly, by taking into account a regularization term, GCLDA not only improves its generalization ability but also avoids singularity. GCLDA is solved through a series of generalized eigenvalue problems. Experiments on an artificial dataset, some real world datasets and a high-dimensional dataset demonstrate the effectiveness of GCLDA. [ABSTRACT FROM AUTHOR]

Isospectral surfaces provide a rich family of benchmark problems. In this paper the efficacy of a hp -finite element method in such Laplace-Beltrami eigenvalue problems has been studied. In addition, for the p -version natural auxiliary space error estimators have been shown to be effective also in this context. As part of the numerical experiments further numerical evidence of the validity of the so-called Quarter Sphere Conjecture has been produced. For the isospectral surface pairs constructed via transplantation, the extension for perforated surfaces is derived. The lack of such constraints for surfaces with isothermal coordinates is also demonstrated. [ABSTRACT FROM AUTHOR]

This paper investigates the coupled Patlak–Keller–Segel–Navier–Stokes (PKS–NS) system in two-dimensional bounded domains with a focus on global well-posedness and the formation of striking patterns, in which the boundary conditions are Neumann conditions for the cell density and the chemical concentration, and the Navier slip boundary condition with zero friction for the fluid velocity. We prove that the solution of the system exists globally in time in the case of subcritical mass. Concerning the critical mass case, we construct the boundary spot steady states rigorously via the inner-outer gluing method. While studying the global existence and the concentration phenomenon of the chemotaxis–fluid model, we develop the global W 2 , p theory for the 2D stationary Stokes system subject to Navier boundary conditions with zero friction and further establish semigroup estimates of the nonstationary counterpart by analyzing the Stokes eigenvalue problem. [ABSTRACT FROM AUTHOR]

An eigenvalue λ of a signed graph S of order n is a main eigenvalue if its eigenspace is not orthogonal to the all-ones vector j. Characterizing signed graphs with exactly k (1 ≤ k ≤ n) main eigenvalues is a problem in algebraic and graph theory that has been studied since 2020. Z. Stanić has noticed that a signed graph has exactly one main eigenvalue if and only if it is net-regular, and in this paper, we study signed graphs with exactly two distinct main eigenvalues by studying (0 , 1 , 2) -multi-graphs with exactly two distinct main eigenvalues. We partially characterize the case when the basic graphs of the (0 , 1 , 2) -multi-graphs are trees, and propose some problems for further research. [ABSTRACT FROM AUTHOR]

A graph is claw-free if it does not contain a star of order 4 as an induced subgraph. In this paper, we characterize all claw-free connected graphs with all but four eigenvalues equal to 0 or − 1. [ABSTRACT FROM AUTHOR]

In this paper, the Riemann‐Hilbert (RH) approach for the integrable discrete Hirota equation with bounded boundary conditions is presented. In the direct scattering problem, we study the analyticity, asymptotics, symmetries of the eigenfunctions, and scattering coefficients and analyze the distribution of discrete eigenvalues. In the inverse scattering problem, the RH problem is constructed and solved as well as the reconstruction formula of potential is derived based on asymptotics. Finally, combining the time evolution, we solve the first‐ and second‐order dark soliton solutions on the nonzero background under the reflectionless condition. [ABSTRACT FROM AUTHOR]

Fermat–Wiener index based on topological Wiener index is the total sum of Fermat distance over all the triplets for vertices. In this paper, we construct a class of hierarchical graphs based on hierarchical product generalized from Cartesian product. We study some critical properties of the hierarchical networks by investigating its topological indices. Applying the finite pattern method, we analytically deduce the dominant term of average Fermat distance and obtain its asymptotic formula, which implies small-world property. We finally exhibit a close connection between Fermat–Wiener index and related graph invariants like average geodesic distance, Wiener index and eigenvalues of Laplacian matrix. [ABSTRACT FROM AUTHOR]

In this paper, we study a problem of normal oscillations of a homogeneous mixture of several viscous compressible fluids filling a bounded domain of three-dimensional space with an infinitely smooth boundary. Two boundary conditions are considered: the no-slip condition and the slip condition without shear stresses. It is proved that the essential spectrum of the problem in both cases is a finite set of segments located on the real axis. The discrete spectrum lies on the real axis, except perhaps for a finite number of complex conjugate eigenvalues. The spectrum of the problem contains a subsequence of eigenvalues with a limit point at infinity and a power-law asymptotic distribution. [ABSTRACT FROM AUTHOR]

Complementarity spectrum of a connected graph G, denoted by $ \Pi (G) $ Π (G) , is the set of spectral radii of all connected induced subgraphs of G. Further, G is said to be spectrally non-redundant if $ c(G) $ c (G) , the cardinality of $ \Pi (G) $ Π (G) , is equal to $ b(G) $ b (G) , the number of all non-isomorphic induced subgraphs of G. In this paper, we give a sufficient condition for a family of graphs to be spectrally non-redundant. Using this criterion, we show that several infinite families of graphs are spectrally non-redundant. Moreover, we apply the same condition to distinguish graphs by their spectral radius, which illustrates the main reason for associating a graph with its complementarity spectrum. [ABSTRACT FROM AUTHOR]

In the paper, we introduce the signless Laplacian A B C -matrix Q ̃ (G) = D ¯ (G) + A ̃ (G) , where D ¯ (G) is the diagonal matrix of A B C -degrees and A ̃ (G) is the A B C -matrix of G. The eigenvalues of the matrix Q ̃ (G) are the signless Laplacian A B C -eigenvalues of G. We give some basic properties of the matrix Q ̃ (G) , which includes relating independence number and clique number with signless Laplacian A B C -eigenvalues. For bipartite graphs, we show that the signless Laplacian A B C -spectrum and the Laplacian A B C -spectrum are the same. We characterize the graphs with exactly two distinct signless Laplacian A B C -eigenvalues. Also, we consider the problem of the characterization of the graphs with exactly three distinct signless Laplacian A B C -eigenvalues and solve it for bipartite graphs and, in some cases, for non-bipartite graphs. We also introduce the concept of the trace norm of the matrix Q ̃ (G) − t r (Q ̃ (G)) n I , called the signless Laplacian A B C -energy of G. We obtain some upper and lower bounds for signless Laplacian A B C -energy and characterize the extremal graphs attaining it. Further, for graphs of order at most 6, we compare the signless Laplacian energy and the A B C -energy with the signless Laplacian A B C -energy and found that the latter behaves well, as there is a single pair of graphs with the same signless Laplacian A B C -energy unlike the 26 pairs of graphs with same signless Laplacian energy and eight pairs of graphs with the same A B C -energy. [ABSTRACT FROM AUTHOR]

The hybrid active power filter (HAPF) can effectively suppress the 75–125 Hz low-frequency harmonic current generated by the EAST poloidal field power supply. However, the low-frequency harmonic current suppression performance of HAPF is greatly affected by its control parameters when the circuit parameters are determined. In this paper, the state–space equation of the HAPF system is established, and the relationship between the eigenvalues of the state–space matrix and the HAPF control parameters is analyzed using the Lyapunov method. Based on the variation law of the eigenvalues, by optimizing the control parameters of the HAPF system, the low-frequency harmonic current suppression performance of HAPF is improved by 41.9%. [ABSTRACT FROM AUTHOR]

The goal of this paper is to investigate complete noncompact warped product gradient Ricci solitons. Nonexistence results, estimates for the warping function and for its gradient are proven. When the soliton is steady or expanding these nonexistence results generalize to a broader context certain estimates and rigidity obtained when studying warped product Einstein manifolds. When the soliton is shrinking, it is presented as a nonexistence theorem with no counterpart in the Einstein case, which is proved using properties of the first eigenvalue of a weighted Laplacian. [ABSTRACT FROM AUTHOR]

In this paper, we consider a diffusive–advective predator–prey system in a spatially heterogeneous environment subject to a hostile boundary condition, where the interaction term is governed by a Holling type II functional response. We investigate the existence and global attractivity of both trivial and semi-trivial steady-state solutions and the existence and local stability of coexistence steady-state solutions, depending on the size of a key principal eigenvalue. In addition, we show that the effect of advection on the principal eigenvalue is monotonic for small advection rates, depending on the concavity of the resource distribution. For arbitrary advection rates, we consider two explicit resource distributions for which we can say precisely the behaviour of the principal eigenvalue as it depends on advection, highlighting that advection can either improve or impair a population's ability to persist, depending on the characteristics of the resource distribution. We present some numerical simulations to demonstrate the outcomes as they depend on the advection rates for the full predator–prey system. These insights highlight the intimate relationship between environmental heterogeneity, directed movement, and the hostile boundary. The methods employed include upper and lower solution techniques, bifurcation theory, spectral analysis, and the comparison principle. [ABSTRACT FROM AUTHOR]

In this paper we develop a comprehensive study on principal eigenvalues and both the (weak and strong) maximum and comparison principles related to an important class of nonlinear systems involving fractional m-Laplacian operators. Explicit lower bounds for principal eigenvalues of this system in terms of the diameter of bounded domain Ω ⊂ R N are also proved. As application, we measure explicitly how small has to be diam (Ω) so that weak and strong maximum principles associated to this problem hold in Ω . [ABSTRACT FROM AUTHOR]

Summary: In this paper, we describe and analyze the spectral properties of several exact block preconditioners for a class of double saddle point problems. Among all these, we consider an inexact version of a block triangular preconditioner providing extremely fast convergence of the (F)GMRES method. We develop a spectral analysis of the preconditioned matrix showing that the complex eigenvalues lie in a circle of center (1,0)$$ \left(1,0\right) $$ and radius 1, while the real eigenvalues are described in terms of the roots of a third order polynomial with real coefficients. Numerical examples are reported to illustrate the efficiency of inexact versions of the proposed preconditioners, and to verify the theoretical bounds. [ABSTRACT FROM AUTHOR]

This paper focuses on the design, analysis and implementation of a new preconditioning concept for linear second order partial differential equations, including the convection‐diffusion‐reaction problems discretized by Galerkin or discontinuous Galerkin methods. We expand on the approach introduced by Gergelits et al. and adapt it to the more general settings, assuming that both the original and preconditioning matrices are composed of sparse matrices of very low ranks, representing local contributions to the global matrices. When applied to a symmetric problem, the method provides bounds to all individual eigenvalues of the preconditioned matrix. We show that this preconditioning strategy works not only for Galerkin discretization, but also for the discontinuous Galerkin discretization, where local contributions are associated with individual edges of the triangulation. In the case of nonsymmetric problems, the method yields guaranteed bounds to real and imaginary parts of the resulting eigenvalues. We include some numerical experiments illustrating the method and its implementation, showcasing its effectiveness for the two variants of discretized (convection‐)diffusion‐reaction problems. [ABSTRACT FROM AUTHOR]

The problem of generalized tensor eigenvalue is the focus of this paper. To solve the problem, we suggest using the normalized Newton generalized eigenproblem approach (NNGEM). Since the rate of convergence of the spectral gradient projection method (SGP), the generalized eigenproblem adaptive power (GEAP), and other approaches is only linear, they are significantly improved by our proposed method, which is demonstrated to be locally and cubically convergent. Additionally, the modified normalized Newton method (MNNM), which converges to symmetric tensors Z‐eigenpairs under the same γ$$ \gamma $$‐Newton stability requirement, is extended by the NNGEM technique. Using a Gröbner basis, a polynomial system solver (NSolve) generates all of the real eigenvalues for us. To illustrate the efficacy of our methodology, we present a few numerical findings. [ABSTRACT FROM AUTHOR]

In the present paper, we deepen the works of L. Abatangelo, V. Felli, L. Hillairet and C. Léna on the asymptotic estimates of the eigenvalue variation under removal of segments from the domain in \mathbb {R}^2. We get a sharp asymptotic estimate when the eigenvalue is simple and the removed segment is tangent to a nodal line of the associated eigenfunction. Moreover, we extend their results to the case when the eigenvalue is not simple. [ABSTRACT FROM AUTHOR]

We continue the program first initiated by Laptev, Schimmer, and Takhtajan [Geom. Funct. Anal. 26 (2016), pp. 288–305] and develop a modification of the technique introduced in that paper to study the spectral asymptotics, namely the Riesz means and eigenvalue counting functions, of functional difference operators H_0 = \mathcal {F}^{-1} M_{\cosh (\xi)} \mathcal {F} with potentials of the form W(x) = \left \lvert {x} \right \rvert ^pe^{\left \lvert {x} \right \rvert ^\beta } for either \beta = 0 and p > 0 or \beta \in (0, 2] and p \geq 0. We provide a new method for studying general potentials which includes the potentials studied by Laptev, Schimmer, and Takhtajan [Geom. Funct. Anal. 26 (2016), pp. 288–305] and [J. Math. Phys. 60 (2019), p. 103505]. The proof involves dilating the variance of the gaussian defining the coherent state transform in a controlled manner preserving the expected asymptotics. [ABSTRACT FROM AUTHOR]

In this paper we consider 0-th order pseudodifferential operators on the circle. We show that inside any interval disjoint from the critical values of the principal symbol, the spectrum is absolutely continuous with possibly finitely many embedded eigenvalues. We also give an example of embedded eigenvalues. [ABSTRACT FROM AUTHOR]

In this paper, we develop a new approach to study the spectral properties of Boolean graphs using the zeta and Möbius functions on the Boolean algebra B n of order 2 n. This approach yields new proofs of the previously known results about the reciprocal eigenvalue property of Boolean graphs. Further, this approach allows us to extend the results to a more general setting of the zero-divisor graphs Γ (P) of complement-closed and convex subposets P of B n. To do this, we consider the left linear representation of the incidence algebra of a poset P on the vector space of all real-valued functions V (P) on P. We then write down the adjacency operator A of the graph Γ (P) as the composition of two linear operators on V (P) , namely, the operator that multiplies elements of V (P) on the left by the zeta function ζ of P and the complementation operator. This allows us to obtain the determinant of A and the inverse of A in terms of the Möbius function μ of the complement-closed posets P. Additionally, if we impose convexity on the poset P , then we obtain the strong reciprocal or strong anti-reciprocal eigenvalue property of Γ (P) and also obtain the absolute palindromicity of the characteristic polynomial of A. This produces a large family of examples of graphs having the strong reciprocal or strong anti-reciprocal eigenvalue property. [ABSTRACT FROM AUTHOR]

The multiplicity of an eigenvalue λ of a graph G is denoted by m (G , λ). In a connected graph G with at least two vertices, a vertex is called external if it is not a cut vertex. In a tree, an external vertex is exactly a pendant vertex. Let ϵ (G) be the number of external vertices in G. In this paper, we prove that m (G , λ) ≤ ϵ (G) − 1 for any λ and characterize the extremal graphs with m (G , − 1) = ϵ (G) − 1 , which generalizes the main result of Wang et al. [Linear Multi. Alg., 2020] from a tree to an arbitrary connected graph. [ABSTRACT FROM AUTHOR]

In this paper, we study the dynamical stability analysis by considering the torsion field ϕ which is proportional to the Hubble parameter and barotropic equation-of-state parameter in the framework of the homogenous and isotropic FLRW metric with non-zero torsion in the scenario of dark matter and dark energy interacting terms. We discuss the stability of the critical points corresponding to the eigenvalues in the presence of dust and radiation at quintessence, ΛCDM and phantom regimes by utilizing the different linear and nonlinear interaction models which depend on the energy density. As a result, we observe that the first linear model shows the stable behavior throughout the universe for dust and radiation phase. The other linear and nonlinear models show the stable critical points, computing with the eigenvalues at phantom and ΛCDM era with the best fit value of interaction strength and coupling constant for dust and radiation. [ABSTRACT FROM AUTHOR]

The spectral spread of the eccentricity matrix E (G) of a graph G is defined as the difference between the largest and the smallest eigenvalue of E (G). While the trace norm of the eccentricity matrix is the absolute sum of the eigenvalues of E (G). In this paper, we obtain various bounds for the spread in terms of the various parameters of G and related it with the trace norm of E (G). We characterize some extremal graphs attaining such bounds. [ABSTRACT FROM AUTHOR]

The asymmetric quantum Rabi model (AQRM) is a fundamental model in quantum optics describing the interaction of light and matter. Besides its immediate physical interest, the AQRM possesses an intriguing mathematical structure which is far from being completely understood. In this paper, we focus on the distribution of the level spacing, the difference between consecutive eigenvalues of the AQRM in the limit of high energies, i.e. large quantum numbers. In the symmetric case, that is the quantum Rabi model (QRM), the spacing distribution for each parity (given by the Z 2 -symmetry) is fully clarified by an asymptotic expression derived by de Monvel and Zielinski, though some questions remain for the full spectrum spacing. However, in the general AQRM case, there is no parity decomposition for the eigenvalues. In connection with numerically exact studies and recent theoretical results, we describe the spacing distribution for the AQRM which is characterized by a new type of periodicity and symmetric behavior of the distribution with respect to the bias parameter, reflecting the hidden symmetry of the AQRM. In addition, we observe in the AQRM the excited state quantum phase transition for large values of the bias parameter, analogous to the QRM with large qubit energy, and an internal symmetry of the level spacing distribution for fixed bias. This novel symmetry is independent from the symmetry for half-integer bias and not explained by current theoretical knowledge. [ABSTRACT FROM AUTHOR]

In this paper we generalize the transition probability matrix for a random walk on a finite network by defining the transition probabilities through a symmetric M -matrix. Usually, the walker jumps from a vertex to a neighbor according to the probabilities given by the adjacency matrix. Moreover, we can find in the literature the relation between random walks and the normalized laplacian or the combinatorial laplacian that are singular and symmetric M -matrices. Our model takes into consideration not only the probability of transitioning given by the adjacency matrix but also some added probability that depends on a node property. This also includes the probability of remaining in each node, when the M -matrix is not singular. The nodes importance is taking into account by considering the lower eigenvalue and its associated eigenfunction for the given M -matrix. We give expressions for the mean first passage time and Kemeny's constant for such a random walks in terms of 1-inverses of the considered M -matrix. [ABSTRACT FROM AUTHOR]

A well known method to solve the Polynomial Eigenvalue Problem (PEP) is via linearization. That is, transforming the PEP into a generalized linear eigenvalue problem with the same spectral information and solving such linear problem with some of the eigenvalue algorithms available in the literature. Linearizations of matrix polynomials are usually defined using unimodular transformations. In this paper we establish a connection between the standard definition of linearization for matrix polynomials introduced by Gohberg, Lancaster and Rodman and the notion of polynomial system matrix introduced by Rosenbrock. This connection gives new techniques to show that a matrix pencil is a linearization of the corresponding matrix polynomial arising in a PEP. [ABSTRACT FROM AUTHOR]

In this paper, we primarily focus on the eigenvalues of the adjacency matrix and Seidel matrix of chain graphs, referred to as eigenvalues and Seidel eigenvalues of these graphs, respectively. Firstly, we utilize the characteristic polynomial of the adjacency matrix of a chain graph to construct infinite pairs of non-isomorphic cospectral chain graphs. Next, we determine the inertia of the Seidel matrix of a chain graph and establish an interval that does not contain the Seidel eigenvalues of chain graphs. Lastly, we characterize chain graphs with distinct Seidel eigenvalues. [ABSTRACT FROM AUTHOR]