Results 1 to 10 of about 221 (121)

Permutative universal realizability [PDF]

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   +3 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   +3 more sources

On universal realizability of spectra [PDF]

open access: yesLinear Algebra and Its Applications, 2019
22 pages, 2 ...
Ana I Julio, C Marijuan, M Pisonero
exaly   +3 more sources

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

Quantitative Languages Defined by Functional Automata [PDF]

open access: yesLogical Methods in Computer Science, 2015
A weighted automaton is functional if any two accepting runs on the same finite word have the same value. In this paper, we investigate functional weighted automata for four different measures: the sum, the mean, the discounted sum of weights along edges
Emmanuel Filiot   +2 more
doaj   +1 more source

Centrosymmetric universal realizability

open access: yesThe Electronic Journal of Linear Algebra, 2021
A list $\Lambda =\{\lambda_{1},\ldots,\lambda_{n}\}$ of complex numbers is said to be realizable, if it is the spectrum of an entrywise nonnegative matrix $A$. In this case, $A$ is said to be a realizing matrix. $\Lambda$ is said to be universally realizable, if it is realizable for each possible Jordan canonical form (JCF) allowed by $\Lambda$.
Ana Julio   +2 more
openaire   +3 more sources

Procedures for realizing an approximate universal-not gate [PDF]

open access: yesPhysical Review A, 2012
We consider procedures to realize an approximate universal NOT gate in terms of average fidelity and fidelity deviation. The average fidelity indicates the optimality of operation on average, while the fidelity deviation does the universality of operation.
Bang, Jeongho   +3 more
openaire   +2 more sources

Realizing Universal Dependencies Structures [PDF]

open access: yesProceedings of the 2nd Workshop on Multilingual Surface Realisation (MSR 2019), 2019
We first describe a surface realizer forUniversal Dependencies (UD) structures. The system uses a symbolic approach to transform the dependency tree into a tree of constituents that is transformed into an English sentence by an existing realizer. This approach was then adapted for the two shared tasks of SR’19.
openaire   +1 more source

Realization of the optimal universal quantum entangler [PDF]

open access: yesPhysical Review A, 2004
We present the first experimental demonstration of the ''optimal'' and ''universal'' quantum entangling process involving qubits encoded in the polarization of single photons. The structure of the ''quantum entangling machine'' consists of the quantum injected optical parametric amplifier by which the contextual realization of the 1->2 universal ...
SCIARRINO, Fabio   +2 more
openaire   +3 more sources

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

Home - About - Disclaimer - Privacy