Related papers: Randomized algorithms for Generalized Hermitian Ei…
We study the fluctuation behavior of individual eigenvalues of kernel matrices arising from dense graphon-based random graphs. Under minimal integrability and boundedness assumptions on the graphon, we establish distributional limits for…
The reduced basis method (RBM) empowers repeated and rapid evaluation of parametrized partial differential equations through an offline-online decomposition, a.k.a. a learning-execution process. A key feature of the method is a greedy…
The Karhunen-Lo\`eve series expansion (KLE) decomposes a stochastic process into an infinite series of pairwise uncorrelated random variables and pairwise $L^2$-orthogonal functions. For any given truncation order of the infinite series the…
We consider large non-Hermitian random matrices $X$ with complex, independent, identically distributed centred entries and show that the linear statistics of their eigenvalues are asymptotically Gaussian for test functions having…
Pseudo-hermitian matrices are matrices hermitian with respect to an indefinite metric. They can be thought of as the truncation of pseudo-hermitian operators, defined over some Krein space, together with the associated metric, to a finite…
Recent studies have shown that many nonconvex machine learning problems satisfy a generalized-smooth condition that extends beyond traditional smooth nonconvex optimization. However, the existing algorithms are not fully adapted to such…
We reconsider the problem of calculating a general spectral correlation function containing an arbitrary number of products and ratios of characteristic polynomials for a N x N random matrix taken from the Gaussian Unitary Ensemble (GUE).…
In Parts I and II of this series of papers, three new methods for the computation of eigenvalues of singular pencils were developed: rank-completing perturbations, rank-projections, and augmentation. It was observed that a straightforward…
Using diagrammatic techniques, we provide explicit functional relations between the cumulant generating functions for the biunitarily invariant ensembles in the limit of large size of matrices. The formalism allows to map two distinct areas…
Template histograms are the foundation of statistical inference at the Large Hadron Collider. The HistFactory likelihood encodes template uncertainty through per-bin Barlow-Beeston gamma factors for Monte Carlo statistical error and through…
Several tensor eigenpair definitions have been put forth in the past decade, but these can all be unified under generalized tensor eigenpair framework, introduced by Chang, Pearson, and Zhang (2009). Given mth-order, n-dimensional…
This paper addresses the Bayesian calibration of dynamic models with parametric and structural uncertainties, in particular where the uncertain parameters are unknown/poorly known spatio-temporally varying subsystem models. Independent…
We extend results known for the randomized Gauss-Seidel and the Gauss-Southwell methods for the case of a Hermitian and positive definite matrix to certain classes of non-Hermitian matrices. We obtain convergence results for a whole range…
In this paper, a Parallel Direct Eigensolver for Sequences of Hermitian Eigenvalue Problems with no tridiagonalization is proposed, denoted by \texttt{PDESHEP}, and it combines direct methods with iterative methods. \texttt{PDESHEP} first…
We consider the smallest eigenvalues of perturbed Hermitian operators with zero modes, either topological or system specific. To leading order for small generic perturbation we show that the corresponding eigenvalues broaden to a Gaussian…
Using the standard concepts of free random variables, we show that for a large class of nonhermitean random matrix models, the support of the eigenvalue distribution follows from their hermitean analogs using a conformal transformation. We…
Randomized parallel algorithms for many fundamental problems achieve optimal linear work in expectation, but upgrading this guarantee to hold with high probability (whp) remains a recurring theoretical challenge. In this paper, we address…
The local Hamiltonian (LH) problem, the quantum analog of the classical constraint satisfaction problem, is a cornerstone of quantum computation and complexity theory. It is known to be QMA-complete, indicating that it is challenging even…
In this paper the problem of recovering a regularized solution of the Fredholm integral equations of the first kind with Hermitian and square-integrable kernels, and with data corrupted by additive noise, is considered. Instead of using a…
This paper proposes a new hybrid high-order discretization for the biharmonic problem and the corresponding eigenvalue problem. The discrete ansatz space includes degrees of freedom in $n-2$ dimensional submanifolds (e.g., nodal values in…