2,397 research outputs found
A DEIM Induced CUR Factorization
We derive a CUR matrix factorization based on the Discrete Empirical
Interpolation Method (DEIM). For a given matrix , such a factorization
provides a low rank approximate decomposition of the form ,
where and are subsets of the columns and rows of , and is
constructed to make a good approximation. Given a low-rank singular value
decomposition , the DEIM procedure uses and to
select the columns and rows of that form and . Through an error
analysis applicable to a general class of CUR factorizations, we show that the
accuracy tracks the optimal approximation error within a factor that depends on
the conditioning of submatrices of and . For large-scale problems,
and can be approximated using an incremental QR algorithm that makes one
pass through . Numerical examples illustrate the favorable performance of
the DEIM-CUR method, compared to CUR approximations based on leverage scores
Spectral Properties of Schr\"odinger Operators Arising in the Study of Quasicrystals
We survey results that have been obtained for self-adjoint operators, and
especially Schr\"odinger operators, associated with mathematical models of
quasicrystals. After presenting general results that hold in arbitrary
dimensions, we focus our attention on the one-dimensional case, and in
particular on several key examples. The most prominent of these is the
Fibonacci Hamiltonian, for which much is known by now and to which an entire
section is devoted here. Other examples that are discussed in detail are given
by the more general class of Schr\"odinger operators with Sturmian potentials.
We put some emphasis on the methods that have been introduced quite recently in
the study of these operators, many of them coming from hyperbolic dynamics. We
conclude with a multitude of numerical calculations that illustrate the
validity of the known rigorous results and suggest conjectures for further
exploration.Comment: 56 page
The Spectra of Large Toeplitz Band Matrices with a Randomly Perturbed Entry
This report is concerned with the union of all possible spectra that may emerge when perturbing a large Toeplitz band matrix in the site by a number randomly chosen from some set . The main results give descriptive bounds and, in several interesting situations, even provide complete identifications of the limit of as . Also discussed are the cases of small and large sets as well as the "discontinuity of the infinite volume case", which means that in general does not converge to something close to as , where is the corresponding infinite Toeplitz matrix. Illustrations are provided for tridiagonal Toeplitz matrices, a notable special case. \ud
\ud
The second author was supported by UK Enginering and Physical Sciences Research Council Grant GR/M1241
Weighted Inner Products for GMRES and GMRES-DR
The convergence of the restarted GMRES method can be significantly improved,
for some problems, by using a weighted inner product that changes at each
restart. How does this weighting affect convergence, and when is it useful? We
show that weighted inner products can help in two distinct ways: when the
coefficient matrix has localized eigenvectors, weighting can allow restarted
GMRES to focus on eigenvalues that otherwise slow convergence; for general
problems, weighting can break the cyclic convergence pattern into which
restarted GMRES often settles. The eigenvectors of matrices derived from
differential equations are often not localized, thus limiting the impact of
weighting. For such problems, incorporating the discrete cosine transform into
the inner product can significantly improve GMRES convergence, giving a method
we call W-GMRES-DCT. Integrating weighting with eigenvalue deflation via
GMRES-DR also can give effective solutions.Comment: Revision containing edits to the text, corrections, and removal of
the section on Arnoldi in weighted inner products (to reduce the manuscript's
length
The maintenance of fertility: field experiments with fertilizers on corn, oats and wheat in 1899 and 1900
"The director of the station is responsible for the general plan of these experiments and for the discussion of results"--p. 103.Cover title.Mode of access: Internet
Green's functions for multiply connected domains via conformal mapping
A method is described for the computation of the Green's function in the complex plane corresponding to a set of K symmetrically placed polygons along the real axis. An important special case is a set of K real intervals. The method is based on a Schwarz-Christoffel conformal map of the part of the upper half-plane exterior to the problem domain onto a semi-infinite strip whose end contains K-1 slits. From the Green's function one can obtain a great deal of information about polynomial approximations, with applications in digital filters and matrix iteration. By making the end of the strip jagged, the method can be generalised to weighted Green's functions and weighted approximations
- …
