Results 41 to 50 of about 340,902 (280)
Manipulator systems are widely used in payload capture and movement in the ground/space operation due to their dexterous manipulation capability. In this study, a method for identifying the payload parameters of a flexible space manipulator using the ...
Zhiyu Ni +3 more
doaj +1 more source
Bifurcations of global reinjection orbits near a saddle-node Hopf bifurcation [PDF]
The saddle-node Hopf bifurcation (SNH) is a generic codimension-two bifurcation of equilibria of vector fields in dimension at least three. It has been identified as an organizing centre in numerous vector field models arising in applications.
Krauskopf, B, Oldeman, BE
core +3 more sources
On the cone eigenvalue complementarity problem for higher-order tensors
In this paper, we consider the tensor generalized eigenvalue complementarity problem (TGEiCP), which is an interesting generalization of matrix eigenvalue complementarity problem (EiCP).
He, Hongjin, Ling, Chen, Qi, Liqun
core +1 more source
Stable polefinding and rational least-squares fitting via eigenvalues [PDF]
A common way of finding the poles of a meromorphic function f in a domain, where an explicit expression of f is unknown but f can be evaluated at any given z, is to interpolate f by a rational function pq such that r(γi)=f(γi) at prescribed sample points {γi}i=1L , and then find the roots of q.
Ito, S, Nakatsukasa, Y
openaire +2 more sources
The second least eigenvalue of the signless Laplacian of the complements of trees
Suppose that Tnc is a set, such that the elements of Tnc are the complements of trees of order n. In 2012, Li and Wang gave the unique graph in the set Tnc ∖ {K1, n − 1c} with minimum 1st ‘least eigenvalue of the signless Laplacian’ (abbreviated to a ...
Muhammad Ajmal +2 more
doaj +1 more source
Graphs with Least Eigenvalue −2: The Star Complement Technique [PDF]
If a connected graph has \(-2\) as its least eigenvalue, then it is either a generalized line graph or a graph representable in the root system \(E_8\) (which is proved in \textit{R. I. Cameron} et al. [J. Algebra 43, 305-327 (1976; Zbl 0337.05142)]).
Cvetković, D. +2 more
openaire +1 more source
Spectral Statistics of Erd{\H o}s-R\'enyi Graphs II: Eigenvalue Spacing and the Extreme Eigenvalues
We consider the ensemble of adjacency matrices of Erd{\H o}s-R\'enyi random graphs, i.e.\ graphs on $N$ vertices where every edge is chosen independently and with probability $p \equiv p(N)$.
A. Auffinger +28 more
core +2 more sources
Analyzing Electronic Excitations and Exciton Binding Energies in Y6 Films
The Y6 molecule is used for increasing the efficiency of organic solar cells. The exciton binding energy is calculated for ensembles of Y6 molecules that are representative of the typically used films. The calculations show that the excitons typically spread out over many molecules.
Sahar Javaid Akram +2 more
wiley +1 more source
An integral method for solving nonlinear eigenvalue problems
We propose a numerical method for computing all eigenvalues (and the corresponding eigenvectors) of a nonlinear holomorphic eigenvalue problem that lie within a given contour in the complex plane.
A. Jentzen +32 more
core +1 more source
On the least eigenvalue of cacti
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Petrović, Miroslav +2 more
openaire +2 more sources

