The Experts below are selected from a list of 141 Experts worldwide ranked by ideXlab platform
Sean Bradley - One of the best experts on this subject based on the ideXlab platform.
-
Finite Rank Operators in Certain Algebras
Canadian Mathematical Bulletin, 1999Co-Authors: Sean BradleyAbstract:Let Alg(L) be the algebra of all bounded linear Operators on a normed linear spaceX leaving in- variant each member of the complete lattice of closed subspacesL. We discuss when the subalgebra of Finite Rank Operators in Alg(L) is non-zero, and give an example which shows this subalgebra may be zero even for Finite lattices. We then give a necessary and sufficient lattice condition for decomposing a Finite Rank Operator F into a sum of a Rank one Operator and an Operator whose range is smaller than that of F, each of which lies in Alg(L). This unifies results of Erdos, Longstaff, Lambrou, and Spanoudakis. Finally, we use the existence of Finite Rank Operators in certain algebras to characterize the spectra of Riesz Operators (generalizing results of Ringrose and Clauss) and compute the Jacobson radical for closed algebras of Riesz Operators and Alg(L) for various types of lattices.
Alexander G. Ramm - One of the best experts on this subject based on the ideXlab platform.
-
Dynamical systems method for solving linear Finite-Rank Operator equations
Annales Polonici Mathematici, 2009Co-Authors: Nguyen S. Hoang, Alexander G. RammAbstract:A version of the dynamical systems method (DSM) for solving ill-condi- tioned linear algebraic systems is studied. An a priori and an a posteriori stopping rules are justied. An iterative scheme is constructed for solving ill-conditioned linear algebraic systems.
-
Dynamical systems method for solving linear Finite-Rank Operator equations
arXiv: Numerical Analysis, 2008Co-Authors: Nguyen S. Hoang, Alexander G. RammAbstract:A version of the Dynamical Systems Method (DSM) for solving ill-conditioned linear algebraic systems is studied in this paper. An {\it a priori} and {\it a posteriori} stopping rules are justified. An iterative scheme is constructed for solving ill-conditioned linear algebraic systems.
Alexander Y. Gordon - One of the best experts on this subject based on the ideXlab platform.
-
Instability of Dense Point Spectrum Under Finite Rank Perturbations
Communications in Mathematical Physics, 1997Co-Authors: Alexander Y. GordonAbstract:We prove that if A is a self-adjoint Operator and R a non-negative Finite Rank Operator whose range is cyclic for A, then for a generic (in the Baire sense) t in \(\)$, each eigenvalue of the Operator \(\) has a neighborhood containing no other eigenvalues.
H. Raubenheimer - One of the best experts on this subject based on the ideXlab platform.
-
Riesz Operators with Finite Rank iterates
Journal of Mathematical Analysis and Applications, 2018Co-Authors: Niels Jakob Laustsen, H. RaubenheimerAbstract:Abstract Every inFinite dimensional Banach space admits Riesz Operators that are not Finite Rank. In this note we discuss conditions under which a Riesz Operator, or some power thereof, is a Finite Rank Operator.
-
Finite Rank RIESZ OperatorS
Glasgow Mathematical Journal, 2013Co-Authors: U. Koumba, H. RaubenheimerAbstract:AbstractWe provide conditions under which a Riesz Operator defined on a Banach space is a Finite Rank Operator.
M. K. Vemuri - One of the best experts on this subject based on the ideXlab platform.
-
A new proof of Benedicks' Theorem for the Weyl Transform
arXiv: Functional Analysis, 2020Co-Authors: M. K. VemuriAbstract:Benedicks theorem for the Weyl Transform states: If the set of points where a function is nonzero is of Finite measure, and its Weyl transform is a Finite Rank Operator, then the function is identically zero. A new, more transparent proof of this theorem is given.
-
Benedicks' theorem for the Weyl transform
Journal of Mathematical Analysis and Applications, 2017Co-Authors: M. K. VemuriAbstract:Abstract If the set of points where a function is nonzero is of Finite measure, and its Weyl transform is a Finite Rank Operator, then the function is identically zero.