Hyperspectral super-resolution (HSR) fuses a low-resolution hyperspectral image (HSI) and high-resolution multispectral (MSI) to obtain HSI (HR-HSI). In this paper, we propose new model called coupled tensor ring factorization (CTRF) for HSR. The proposed CTRF approach simultaneously learns the core tensors of HR-HSI from pair MSI. can separately exploit low-rank property each class (Section 3....

Lyndon words have been largely investigated and showned to be a useful tool prove interesting combinatorial properties of words. In this paper we state new both inverse factorizations word $w$, with the aim exploring their use in some classical queries on $w$. The main property is related query We that there are relations between length longest common extension (or prefix) $lcp(x,y)$ two differ...

We present an approximate structured factorization method which is efficient, robust, and also relatively insensitive to ill conditioning, high frequencies, or wavenumbers for some discretized PDEs. Given a sparse symmetric positive definite discretized matrix A, we compute a structured approximate factorization A ≈ LLT with a desired accuracy, where L is lower triangular and data sparse. This ...

The recently proposed hard-pion chiral perturbation theory predicts that the leading chiral logarithms factorize with respect to the energy dependence in the chiral limit. This claim has been successfully tested in the pion form factors up to two loops in chiral perturbation theory. In the present paper we explain this factorization property at two loops and even show that it is valid to all or...

In order to facilitate a natural choice for morphisms created by the (left or right) lifting property as used in the definition of weak factorization systems, the notion of natural weak factorization system in the category K is introduced, as a pair (comonad, monad) over K. The link with existing notions in terms of morphism classes is given via the respective Eilenberg–Moore categories. Dedica...

An H∞ control problem for a class of discrete-time systems with additional nonminimum phase property at the control input is addressed. First, the full information problem is dealt with by developing a discrete-time counterpart of the J-spectral factorization technique in the literature. Second, the output estimation problem is reduced to finite-dimensional one by examining the J-spectral facto...

We consider minimal 1-factor covers of regular multigraphs, focusing on those that are 1-factorizations. In particular, we classify cubic graphs such that every minimal 1-factor cover is also a 1-factorization, and also classify simple regular bipartite graphs with this property. For r > 3, we show that there are finitely many simple r-regular graphs such that every minimal 1-factor cover is al...

A new preconditioner for symmetric positive definite systems is proposed, analyzed, and tested. The preconditioner, compressed incomplete modified Gram–Schmidt (CIMGS), is based on an incomplete orthogonal factorization. CIMGS is robust both theoretically and empirically, existing (in exact arithmetic) for any full rank matrix. Numerically it is more robust than an incomplete Cholesky factoriza...