Results 1 to 10 of about 52 (51)

A recursive condition for the symmetric nonnegative inverse eigenvalue problem [PDF]

open access: yesRevista Integración, 2017
In this paper we present a sufficient ondition and a necessary condition for Symmetri Nonnegative Inverse Eigenvalue Problem. This condition is independent of the existing realizability criteria.
Elvis Ronald Valero   +2 more
doaj   +2 more sources

On new universal realizability criteria

open access: yesSpecial Matrices, 2022
A list Λ={λ1,λ2,…,λn}\Lambda =\left\{{\lambda }_{1},{\lambda }_{2},\ldots ,{\lambda }_{n}\right\} of complex numbers is said to be realizable if it is the spectrum of an entrywise nonnegative matrix and is said to be universally realizable (UR), if it is
Arrieta Luis E., Soto Ricardo L.
doaj   +1 more source

Assessing the credibility of the solutions of incomplete-data inverse problems

open access: yesPhysics Open, 2021
This paper proposes an approach to measure the credibility of solutions of inverse problems with incomplete or missing data, encountered in some physical problems.
Aydin M. Torkabadi, Esam M.A. Hussein
doaj   +1 more source

Spectra inhabiting the left half-plane that are universally realizable

open access: yesSpecial Matrices, 2021
Let Λ = {λ1, λ2, . . ., λn} be a list of complex numbers. Λ is said to be realizable if it is the spectrum of an entrywise nonnegative matrix. Λ is universally realizable if it is realizable for each possible Jordan canonical form allowed by Λ. Minc ([21]
Soto Ricardo L.
doaj   +1 more source

Permutative universal realizability

open access: yesSpecial Matrices, 2021
A list of complex numbers Λ is said to be realizable, if it is the spectrum of a nonnegative matrix. In this paper we provide a new sufficient condition for a given list Λ to be universally realizable (UR), that is, realizable for each possible Jordan ...
Soto Ricardo L.   +2 more
doaj   +1 more source

The core inverse and constrained matrix approximation problem

open access: yesOpen Mathematics, 2020
In this article, we study the constrained matrix approximation problem in the Frobenius norm by using the core inverse:||Mx−b||F=minsubjecttox∈ℛ(M),||Mx-b|{|}_{F}=\hspace{.25em}\min \hspace{1em}\text{subject}\hspace{.25em}\text{to}\hspace{1em}x\in ...
Wang Hongxing, Zhang Xiaoyan
doaj   +1 more source

Positive entries of stable matrices [PDF]

open access: yes, 2004
The question of how many elements of a real stable matrix must be positive is investigated. It is shown that any real stable matrix of order greater than 1 has at least two positive entries.
Rump, Siegfried   +6 more
core   +1 more source

Hard Thresholding Pursuit Algorithms: Number of Iterations [PDF]

open access: yes, 2016
The Hard Thresholding Pursuit algorithm for sparse recovery is revisited using a new theoretical analysis. The main result states that all sparse vectors can be exactly recovered from compressive linear measurements in a number of iterations at most ...
Pawel Hitczenko   +2 more
core   +1 more source

Toeplitz nonnegative realization of spectra via companion matrices

open access: yesSpecial Matrices, 2019
The nonnegative inverse eigenvalue problem (NIEP) is the problem of finding conditions for the existence of an n × n entrywise nonnegative matrix A with prescribed spectrum Λ = {λ1, . . ., λn}.
Collao Macarena   +2 more
doaj   +1 more source

Analytic sensing: Noniterative retrieval of point sources from boundary measurements [PDF]

open access: yes, 2009
. We consider the problem of locating point sources in the planar domain from overde-termined boundary measurements of solutions of Poisson’s equation. In this paper, we propose a novel technique, termed “analytic sensing”, that combines the ap-plication
Kandaswamy, D.   +5 more
core   +2 more sources

Home - About - Disclaimer - Privacy