Search results for "eigenvalues"

Continuous spectrum for a two phase eigenvalue problem with an indefinite and unbounded potential

2020

Abstract We consider a two phase eigenvalue problem driven by the ( p , q ) -Laplacian plus an indefinite and unbounded potential, and Robin boundary condition. Using a modification of the Nehari manifold method, we show that there exists a nontrivial open interval I ⊆ R such that every λ ∈ I is an eigenvalue with positive eigenfunctions. When we impose additional regularity conditions on the potential function and the boundary coefficient, we show that we have smooth eigenfunctions.

A family of complex potentials with real spectrum

1999

We consider a two-parameter non-Hermitian quantum mechanical Hamiltonian operator that is invariant under the combined effects of parity and time reversal transformations. Numerical investigation shows that for some values of the potential parameters the Hamiltonian operator supports real eigenvalues and localized eigenfunctions. In contrast with other parity times time reversal symmetric models which require special integration paths in the complex plane, our model is integrable along a line parallel to the real axis.

The inverse eigenvalue problem for a Hermitian reflexive matrix and the optimization problem

2016

The inverse eigenvalue problem and the associated optimal approximation problem for Hermitian reflexive matrices with respect to a normal {k+1}-potent matrix are considered. First, we study the existence of the solutions of the associated inverse eigenvalue problem and present an explicit form for them. Then, when such a solution exists, an expression for the solution to the corresponding optimal approximation problem is obtained.

Fast Decentralized Linear Functions via Successive Graph Shift Operators

2019

Decentralized signal processing performs learning tasks on data distributed over a multi-node network which can be represented by a graph. Implementing linear transformations emerges as a key task in a number of applications of decentralized signal processing. Recently, some decentralized methods have been proposed to accomplish that task by leveraging the notion of graph shift operator, which captures the local structure of the graph. However, existing approaches have some drawbacks such as considering special instances of linear transformations, or reducing the family of transformations by assuming that a shift matrix is given such that a subset of its eigenvectors spans the subspace of i…

Algorithms for {K, s+1}-potent matrix constructions

2013

In this paper, we deal with {K, s + 1}-potent matrices. These matrices generalize all the following classes of matrices: k-potent matrices, periodic matrices, idempotent matrices, involutory matrices, centrosymmetric matrices, mirrorsymmetric matrices, circulant matrices, among others. Several applications of these classes of matrices can be found in the literature. We develop algorithms in order to compute {K, s + 1}-potent matrices and {K, s + 1}-potent linear combinations of {K, s + 1}-potent matrices. In addition, some examples are presented in order to show the numerical performance of the method. (C) 2012 Elsevier B.V. All rights reserved.

On the convergence of the finite element approximation of eigenfrequencies and eigenvectors to Maxwell's boundary value problem

1981

Diagonalization of large matrices: a new parallel algorithm.

2015

On the basis of a dressed matrices formalism, a new algorithm has been devised for obtaining the lowest eigenvalue and the corresponding eigenvector of large real symmetric matrices. Given an N × N matrix, the proposed algorithm consists in the diagonalization of (N - 1)2 × 2 dressed matrices. Both sequential and parallel versions of the proposed algorithm have been implemented. Tests have been performed on a Hilbert matrix, and the results show that this algorithm is up 340 times faster than the corresponding LAPACK routine for N = 10(4) and about 10% faster than the Davidson method. The parallel MPI version has been tested using up to 512 nodes. The speed-up for a N = 10(6) matrix is fair…

Efficient Pruning LMI Conditions for Branch-and-Prune Rank and Chirality-Constrained Estimation of the Dual Absolute Quadric

2014

International audience; We present a new globally optimal algorithm for self- calibrating a moving camera with constant parameters. Our method aims at estimating the Dual Absolute Quadric (DAQ) under the rank-3 and, optionally, camera centers chirality constraints. We employ the Branch-and-Prune paradigm and explore the space of only 5 parameters. Pruning in our method relies on solving Linear Matrix Inequality (LMI) feasibility and Generalized Eigenvalue (GEV) problems that solely depend upon the entries of the DAQ. These LMI and GEV problems are used to rule out branches in the search tree in which a quadric not satisfy- ing the rank and chirality conditions on camera centers is guarantee…

Critical points for nondifferentiable functions in presence of splitting

2006

A classical critical point theorem in presence of splitting established by Brézis-Nirenberg is extended to functionals which are the sum of a locally Lipschitz continuous term and of a convex, proper, lower semicontinuous function. The obtained result is then exploited to prove a multiplicity theorem for a family of elliptic variational-hemivariational eigenvalue problems. © 2005 Elsevier Inc. All rights reserved.

On attracting sets in artificial networks: cross activation

2018

Mathematical models of artificial networks can be formulated in terms of dynamical systems describing the behaviour of a network over time. The interrelation between nodes (elements) of a network is encoded in the regulatory matrix. We consider a system of ordinary differential equations that describes in particular also genomic regulatory networks (GRN) and contains a sigmoidal function. The results are presented on attractors of such systems for a particular case of cross activation. The regulatory matrix is then of particular form consisting of unit entries everywhere except the main diagonal. We show that such a system can have not more than three critical points. At least n–1 eigenvalu…