A matrix spectral problem in one complex space dimension
Journal of Physics A: Mathematical and General, 1993Summary: The inverse spectral method for an \(N\times N\) spectral problem is studied via the \(\overline{\partial}\)-problem for a one-dimensional complex space. The complex mKdV equations are explicitly solved as an example.
openaire +2 more sources
The integrable coupling system of a 3×3 discrete matrix spectral problem
Applied Mathematics and Computation, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhao, Qiu-Lan, Wang, Xin-Zeng
openaire +2 more sources
An inverse spectral problem for rational matrix functions and minimal divisibility
Integral Equations and Operator Theory, 1987This paper concerns the study of regular rational matrix functions in terms of their local spectral data. A concise account is given of the main ideas and recent results in this area. In particular, the paper gives short and selfcontained proofs of an inverse spectral theorem of \textit{J. A. Ball} and \textit{A. C. M. Ran}, ibid.
Gohberg, I., Kaashoek, M. A.
openaire +2 more sources
Inverse spectral problems for difference operators with rational scattering matrix function
Integral Equations and Operator Theory, 1994zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alpay, Daniel, Gohberg, Israel
openaire +1 more source
Quadratic (Weakly) Hyperbolic Matrix Polynomials: Direct and Inverse Spectral Problems
2009Let L be a monic quadratic weakly hyperbolic or hyperbolic n × n matrix polynomial. We solve some direct spectral problems: We prove that the eigenvalues of a compression of L to an (n − 1)-dimensional subspace of ℂ n block-interlace and that the eigenvalues of a one-dimensional perturbation of L (−,+)-interlace the eigenvalues of L.
T. Ya. Azizov +3 more
openaire +1 more source
The Spectral Matrix and Green's Function for Singular Self-Adjoint Boundary Value Problems
Canadian Journal of Mathematics, 1954Let L denote the formal ordinary differential operator,where we assume the pk are complex-valued functions with n-k continuous derivatives on an open real interval a < x < b (a = — ∞, b = + ∞, or both may occur), p0(x) ≠ 0 on a < x < b, and L coincides with its Lagrange adjoint L+ given by.
openaire +2 more sources
Connection between the spectral problem for linear matrix pencils and some problems of algebra
Journal of Soviet Mathematics, 1985Translation from Zap. Nauchn. Semin. Leningr. Otd. Mat. Inst. Steklova 80, 98-116 (1978; Zbl 0434.65028).
openaire +2 more sources
Relaxation and Matrix Randomized Rounding for the Maximum Spectral Subgraph Problem
2018Modifying the topology of a network to mitigate the spread of an epidemic with epidemiological constant \(\lambda \) amounts to the NP-hard problem of finding a partial subgraph with maximum number of edges and spectral radius bounded above by \(\lambda \).
Cristina Bazgan +2 more
openaire +1 more source
Navigating financial toxicity in patients with cancer: A multidisciplinary management approach
Ca-A Cancer Journal for Clinicians, 2022Grace Li Smith +2 more
exaly
The biofilm matrix: multitasking in a shared space
Nature Reviews Microbiology, 2022Hans-Curt Flemming +2 more
exaly