The need to evaluate expressions of the form $f(A)\mathbf{b}$, where $A$ is a square matrix, $f$ is a function, and $\mathbf{b}$ is a vector, arises in several areas of applied mathematics. When the matrix $A$ is very large, it is usually not attractive to evaluate $f(A)$. Instead, $f(A)\mathbf{b}$ often is approximated by computing an estimate in a Krylov subspace that depends on $A$ and $\mathbf{b}$, and only requires that $f$ be evaluated at a small matrix. This paper explores the application of several variants of randomized block Krylov methods to the approximation of $f(A)\mathbf{b}$. Computed examples suggest that block Krylov methods with an initial block vector that contains $\mathbf{b}$ as well as a few randomly generated vectors may require less computing time and reduce the number of Krylov steps than standard Krylov methods.
We initiate the study of approximating the top eigenvalue and eigenvector of a random symmetric matrix $ A \in \mathbb{R}^{n\times n} $ using $ q(A)b $ where $q$ is a degree-$d$ polynomial and $b$ is a standard Gaussian vector independent of $A$. For spiked GOE $ Y = \lambda vv^\top + X $, we identify $ d_\star = \frac...
If $f$ is a tuple of functions satisfying an algebraic ODE and $P\in{\mathbb C}(x)[f]$, it is common in applications to transcendental number theory to consider upper bounds for the order of zero of $P(x,f)$ at a given point in terms of $\operatorname{deg}_x P,\operatorname{deg}_f P$. Nesterenko introduced a condition...
We study the problem of constructing highly nonlinear vectorial maps $F: \mathbb F_2^n \to \mathbb F_2^m$. Concretely, we want an $F$ and an $A = A(m,n)>0$ as small as possible, so that for every affine map $L: \mathbb F_2^n \to \mathbb F_2^m$ (of the form $L(x) = M x + b $) we have: $$\mathrm{agree}(F, L) := |\{ x \in...
Swastik Kopparty, Rishabh Kothary, Shanthanu S. Rai· 0 citations
In this note, we provide a deterministic algorithm that computes the $(\min, +)$-Matrix Product $C = A * B$ of two $N \times N$ matrices $A$ and $B$ with polynomially bounded integer entries in $\tilde{O}(N^{2.9964})$ time, improving upon the exponent of $O(N^{2.9995})$ time obtained in the recent breakthrough by Anthr...
We continue our studies on parametric norm forms $F_t({\bf x})$, with ${\bf x}=(x_0,x_1,\ldots,x_{d-1})$ lying in some parametric linear subvariety $W_t$ and integers $t$ sufficiently large. In a previous paper [Am-Ma-Za2] we proved some effective specialization results for integer solutions $\bf x$ of $F_t({\bf x})=1$...
Given a field $\mathbb{F}$ and an integer $n \geq 2$, denote by $t_n(\mathbb{F})$ the greatest possible dimension for a vector space of $n$-by-$n$ matrices over $\mathbb{F}$ in which every element is triangularizable. It was recently proved that $t_n(\mathbb{F})=\frac{n(n+1)}{2}$ if and only if $\mathbb{F}$ is not quad...
Clément de Seguins Pazzis· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
