Related papers: Schur analysis of matricial Hausdorff moment seque…
Eigenvalue transformations, which include solving time-dependent differential equations as a special case, have a wide range of applications in scientific and engineering computation. While quantum algorithms for singular value…
We introduce a general method for transforming the equations of motion following from a Das-Jevicki-Sakita Hamiltonian, with boundary conditions, into a boundary value problem in one-dimensional quantum mechanics. For the particular case of…
We consider 1D discrete Schr\"odinger operators with aperiodic potentials given by a Sturmian word, which is a natural generalisation of the Fibonacci Hamiltonian. Via a standard approximation by periodic potentials, we establish Hausdorff…
Matrix concentration inequalities provide information about the probability that a random matrix is close to its expectation with respect to the $l_2$ operator norm. This paper uses semigroup methods to derive sharp nonlinear matrix…
We establish connections between Schur parameters of the Schur class operator-valued functions, the corresponding simple conservative realizations, lower triangular Toeplitz matrices, and Kre\u\i n shorted operators. By means of Schur…
We consider Calder\'{o}n's inverse boundary value problems for a class of nonlinear Helmholtz Schr\"{o}dinger equations and Maxwell's equations in a bounded domain in $\R^n$. The main method is the higher-order linearization of the…
Recently, Keating and the second author of this paper devised a heuristic for predicting asymptotic formulas for moments of the Riemann zeta-function $\zeta(s)$. Their approach indicates how lower twisted moments of $\zeta(s)$ may be used…
In this talk we go over several new developments regarding the techniques for a large class of non-hermitian matrix models with unitary randomness (complex random numbers). In particular, we discuss: (a) - A diagrammatic approach based on a…
A finite element scheme for an entirely fractional Allen-Cahn equation with non-smooth initial data is introduced and analyzed. In the proposed nonlocal model, the Caputo fractional in-time derivative and the fractional Laplacian replace…
An algorithm for a family of self-starting high-order implicit time integration schemes with controllable numerical dissipation is proposed for both linear and nonlinear transient problems. This work builds on the previous works of the…
For a matrix ${\bf A}$ with linearly independent columns, this work studies to use its normalization $\bar{\bf A}$ and ${\bf A}$ itself to approximate its orthonormalization $\bf V$. We theoretically analyze the order of the approximation…
We propose the relaxation bootstrap method for the numerical solution of multi-matrix models in the large $N$ limit, developing and improving the recent proposal of H.Lin. It gives rigorous inequalities on the single trace moments of the…
Computing the permanent of a non-negative matrix is a computationally challenging, \#P-complete problem with wide-ranging applications. We introduce a novel permanental analogue of Schur's determinant formula, leveraging a newly defined…
We present a new sublinear time algorithm for approximating the spectral density (eigenvalue distribution) of an $n\times n$ normalized graph adjacency or Laplacian matrix. The algorithm recovers the spectrum up to $\epsilon$ accuracy in…
A global solution of the Schr\"odinger equation for explicitly time-dependent Hamiltonians is derived by integrating the non-linear differential equation associated with the time-dependent wave operator. A fast iterative solution method is…
In this note we take a new look at the local convergence of alternating optimization methods for low-rank matrices and tensors. Our abstract interpretation as sequential optimization on moving subspaces yields insightful reformulations of…
Rapid convergence of the shifted QR algorithm on symmetric matrices was shown more than fifty years ago. Since then, despite significant interest and its practical relevance, an understanding of the dynamics and convergence properties of…
In this paper we prove that there exists an asymptotical diagonalization algorithm for a class of sparse Hermitian (or real symmetric) matrices if and only if the matrices become Hessenberg matrices after some permutation of rows and…
We present an algorithm of the reduction of the differential equations for master integrals the Fuchsian form with the right-hand side matrix linearly depending on dimensional regularization parameter $\epsilon$. We consider linear…
Given a matrix A \in R^{m x n}, we present a randomized algorithm that sparsifies A by retaining some of its elements by sampling them according to a distribution that depends on both the square and the absolute value of the entries. We…