An official website of the United States government
Analytic perturbation theory for matrices and operators is an immensely useful mathematical technique. Most elementary introductions to this method have their background in the physics literature, and quantum mechanics in particular. In this note, we give an introduction to this method that is independent of any physics notions, and relies purely on concepts from linear algebra. An additional feature of this presentation is that matrix notation and methods are used throughout. In particular, we formulate the equations for each term of the analytic expansions of eigenvalues and eigenvectors as {\em matrix equations}, namely Sylvester equations in particular. Solvability conditions and explicit expressions for solutions of such matrix equations are given, and expressions for each term in the analytic expansions are given in terms of those solutions. This unified treatment simplifies somewhat the complex notation that is commonly seen in the literature, and in particular, provides relatively compact expressions for the non-Hermitian and degenerate cases, as well as for higher order terms.
more »
« less
The Flow Matrix Offers a Straightforward Alternative to the Problematic Markov Matrix
The Flow matrix is a novel method to describe and extrapolate transitions among categories. The Flow matrix extrapolates a constant transition size per unit of time on a time continuum with a maximum of one incident per observation during the extrapolation. The Flow matrix extrapolates linearly until the persistence of a category shrinks to zero. The Flow matrix has concepts and mathematics that are more straightforward than the Markov matrix. However, many scientists apply the Markov matrix by default because popular software packages offer no alternative to the Markov matrix, despite the conceptual and mathematical challenges that the Markov matrix poses. The Markov matrix extrapolates a constant transition proportion per time interval during whole-number multiples of the duration of the calibration time interval. The Markov extrapolation allows at most one incident per observation during each time interval but allows repeated incidents per observation through sequential time intervals. Many Markov extrapolations approach a steady state asymptotically through time as each category size approaches a constant. We use case studies concerning land change to illustrate the characteristics of the Flow and Markov matrices. The Flow and Markov extrapolations both deviate from the reference data during a validation time interval, implying there is no reason to prefer one matrix to the other in terms of correspondence with the processes that we analyzed. The two matrices differ substantially in terms of their underlying concepts and mathematical behaviors. Scientists should consider the ease of use and interpretation for each matrix when extrapolating transitions among categories.
more »
« less
- Award ID(s):
- 1637630
- PAR ID:
- 10485017
- Publisher / Repository:
- MDPI
- Date Published:
- Journal Name:
- Land
- Volume:
- 12
- Issue:
- 7
- ISSN:
- 2073-445X
- Page Range / eLocation ID:
- 1471
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
null (Ed.)Conventional methods to analyze a transition matrix do not offer in-depth signals concerning land changes. The land change community needs an effective approach to visualize both the size and intensity of land transitions while considering possible map errors. We propose a framework that integrates error analysis, intensity analysis, and difference components, and then uses the framework to analyze land change in Nanchang, the capital city of Jiangxi province, China. We used remotely sensed data for six categories at four time points: 1989, 2000, 2008, and 2016. We had a confusion matrix for only 2016, which estimated that the map of 2016 had a 12% error, while the temporal difference during 2008–2016 was 22% of the spatial extent. Our tools revealed suspected errors at other years by analyzing the patterns of temporal difference. For example, the largest component of temporal difference was exchange, which could indicate map errors. Our framework identified categories that gained during one time interval then lost during the subsequent time interval, which raised the suspicion of map error. This proposed framework facilitated visualization of the size and intensity of land transitions while illustrating possible map errors that the profession routinely ignores.more » « less
-
Meka, Raghu (Ed.)Matrix completion tackles the task of predicting missing values in a low-rank matrix based on a sparse set of observed entries. It is often assumed that the observation pattern is generated uniformly at random or has a very specific structure tuned to a given algorithm. There is still a gap in our understanding when it comes to arbitrary sampling patterns. Given an arbitrary sampling pattern, we introduce a matrix completion algorithm based on network flows in the bipartite graph induced by the observation pattern. For additive matrices, we show that the electrical flow is optimal, and we establish error upper bounds customized to each entry as a function of the observation set, along with matching minimax lower bounds. Our results show that the minimax squared error for recovery of a particular entry in the matrix is proportional to the effective resistance of the corresponding edge in the graph. Furthermore, we show that the electrical flow estimator is equivalent to the least squares estimator. We apply our estimator to the two-way fixed effects model and show that it enables us to accurately infer individual causal effects and the unit-specific and time-specific confounders. For rank-1 matrices, we use edge-disjoint paths to form an estimator that achieves minimax optimal estimation when the sampling is sufficiently dense. Our discovery introduces a new family of estimators parametrized by network flows, which provide a fine-grained and intuitive understanding of the impact of the given sampling pattern on the difficulty of estimation at an entry-specific level. This graph-based approach allows us to quantify the inherent complexity of matrix completion for individual entries, rather than relying solely on global measures of performance.more » « less
-
We present a Grassmann extrapolation method (G-Ext) that combines the mathematical framework of the Grassmann manifold with the direct inversion in the iterative subspace (DIIS) technique to accurately and efficiently extrapolate density matrices in electronic structure calculations. By overcoming the challenges of direct extrapolation on the Grassmann manifold, this indirect G-Ext-DIIS approach successfully preserves the geometric structure and physical constraints of the density matrices. Unlike Tikhonov regularized G-Ext, G-Ext-DIIS requires no tuning of regularization parameters. Its DIIS subspace is compact, numerically stable, and independent of descriptor dimensionality, system size, and basis set, ensuring both robustness and computational efficiency. We evaluate G-Ext-DIIS using alanine dipeptide and its zwitterionic form along ϕ and ψ torsional scans, employing Coulomb, overlap, and core Hamiltonian matrix descriptors with the diffuse 6-311++G(d,p) and aug-cc-pVTZ basis sets. When using overlap or core Hamiltonian descriptors, G-Ext-DIIS achieves sub-millihartree accuracy across angular extrapolation ranges that exceed typical geometry optimization step sizes. This indicates its potential for generating high quality initial density matrices in each optimization cycle. Compared to direct extrapolation methods with or without McWeeny purification, as well as the Löwdin extrapolation from nearby geometries, G-Ext-DIIS demonstrates superior accuracy, variational consistency, and reliability across basis sets. We also explore Fock matrix extrapolation using the same DIIS coefficients, although this strategy proves less reliable for distant geometries. Overall, G-Ext-DIIS offers a robust, efficient, and transferable framework for constructing accurate density matrices, with promising applications in geometry optimization and ab initio molecular dynamics simulations.more » « less
-
This manuscript provides guidance concerning how to use the Total Operating Characteristic (TOC) when (1) analyzing change through time, (2) ranking a categorical independent variable, and (3) constraining the extent for a gaining category. The illustrative variable is the marsh land-cover category in the Plum Island Ecosystems of northeastern Massachusetts, USA. The data are an elevation map and maps showing the land categories of water, marsh, and upland in 1938, 1971, and 2013. There were losses and gains near the edge of the marsh between 1938 and 1972 and between 1972 and 2013. The TOC curves show that marsh gained most intensively at intermediate elevations during the first time interval and then had a weaker association with elevation during the second time interval. Marsh gains more intensively from water than from upland during both time intervals. The TOC curves also demonstrate that the marsh gains occurred where marsh was previously lost, a phenomenon called Alternation. Furthermore, eliminating far distances and extreme elevations from the spatial extent decreased the area under the curve (AUC) for distance and increased the AUC for elevation. We invite scientists to use the TOC because the TOC is easier to interpret and shows more information than the Relative Operative Characteristic.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.3390/land12071471
