Results 1 
5 of
5
Spectra, Pseudospectra, and Localization for Random Bidiagonal Matrices
 Comm. Pure Appl. Math
"... There has been much recent interest, initiated by work of the physicists Hatano and Nelson, in the eigenvalues of certain random nonhermitian periodic tridiagonal matrices and their bidiagonal limits. These eigenvalues cluster along a \bubble with wings" in the complex plane, and the corresponding ..."
Abstract

Cited by 13 (4 self)
 Add to MetaCart
There has been much recent interest, initiated by work of the physicists Hatano and Nelson, in the eigenvalues of certain random nonhermitian periodic tridiagonal matrices and their bidiagonal limits. These eigenvalues cluster along a \bubble with wings" in the complex plane, and the corresponding eigenvectors are localized in the wings, delocalized in the bubble. Here, in addition to eigenvalues, pseudospectra are analyzed, making it possible to treat the nonperiodic analogues of these random matrix problems. Inside the bubble, the resolvent norm grows exponentially with the dimension. Outside, it grows subexponentially in a bounded region that is the spectrum of the in nitedimensional operator. Localization and delocalization correspond to resolvent matrices whose entries exponentially decrease or increase, respectively, with distance from the diagonal. This article presents theorems that characterize the spectra, pseudospectra, and numerical range for the four cases of nite bidiagonal matrices, in nite bidiagonal matrices (\stochastic Toeplitz operators"), nite periodic matrices, and doubly in nite bidiagonal matrices (\stochastic Laurent operators").
A Survey of Regularization Methods for FirstKind Volterra Equations
 SURVEYS ON SOLUTION METHODS FOR INVERSE PROBLEMS
, 2000
"... We survey continuous and discrete regularization methods for firstkind Volterra problems with continuous kernels. Classical regularization methods tend to destroy the nonanticipatory (or causal) nature of the original Volterra problem because such methods typically rely on computation of the V ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
We survey continuous and discrete regularization methods for firstkind Volterra problems with continuous kernels. Classical regularization methods tend to destroy the nonanticipatory (or causal) nature of the original Volterra problem because such methods typically rely on computation of the Volterra adjoint operator, an anticipatory operator. In this survey we pay special attention to particular regularization methods, both classical and nontraditional, which tend to retain the Volterra structure of the original problem. Our attention will primarily be focused on linear problems, although extensions of methods to nonlinear and integrooperator Volterra equations are mentioned when known.
Toying With Jordan Matrices
"... Gamma1 \Gamma \Gamma2 \Delta \Delta \Delta (\Gamma1) n\Gamma1 \Gamman \Gamma1 \Delta \Delta \Delta (\Gamma1) n\Gamma2 \Gamman+1 . . . O . . . \Gamma1 1 C C C C C C C C A Lemma 2. In X = ` n p = i l C n ; k k p j for 0 ! 1 holds fl fl flJ n () \Gamma1 fl fl fl \Gamm ..."
Abstract
 Add to MetaCart
Gamma1 \Gamma \Gamma2 \Delta \Delta \Delta (\Gamma1) n\Gamma1 \Gamman \Gamma1 \Delta \Delta \Delta (\Gamma1) n\Gamma2 \Gamman+1 . . . O . . . \Gamma1 1 C C C C C C C C A Lemma 2. In X = ` n p = i l C n ; k k p j for 0 ! 1 holds fl fl flJ n () \Gamma1 fl fl fl \Gamman : Proof. Let e n be the n th unit vector, then kJ n<F37.7