相关论文: Fast linear algebra is stable

For large-scale discrete-time algebraic Riccati equations (DAREs) with high-rank nonlinear and constant terms, the stabilizing solutions are no longer numerically low-rank, resulting in the obstacle in the computation and storage. However,…

We develop foundational aspects of stability theory in affine logic. On the one hand, we prove appropriate affine versions of many classical results, including definability of types, existence of non-forking extensions, and other…

We show that accelerated gradient descent, averaged gradient descent and the heavy-ball method for non-strongly-convex problems may be reformulated as constant parameter second-order difference equation algorithms, where stability of the…

A multivariate polynomial is {\em stable} if it is nonvanishing whenever all variables have positive imaginary parts. We classify all linear partial differential operators in the Weyl algebra $\A_n$ that preserve stability. An important…

We prove that, in a class of spherically symmetric spacetimes exhibiting stable trapping of null geodesics, linear waves cannot (uniformly) decay faster than logarithmically. When these linear waves are treated as a model for nonlinear…

A matrix algorithm is said to be superfast (that is, runs at sublinear cost) if it involves much fewer scalars and flops than the input matrix has entries. Such algorithms have been extensively studied and widely applied in modern…

We introduce an efficient stable algorithm for transforms associated with expansions in Hermite functions interpolated at Hermite polynomial roots. The Hermite transform matrix can be factorised into a diagonal component and an orthogonal…

Let ${\bf M}_n(\mathbb{F})$ be the algebra of $n\times n$ matrices over an arbitrary field $\mathbb{F}$. We consider linear maps $\Phi: {\bf M}_n(\mathbb{F}) \rightarrow {\bf M}_r(\mathbb{F})$ preserving matrices annihilated by a fixed…

Known classification results allow us to find the number of (equivalence classes of) fine gradings on matrix algebras and on classical simple Lie algebras over an algebraically closed field $\mathbb{F}$ (assuming $\mathrm{char}…

The problem of efficient multiplication of large numbers has been a long-standing challenge in classical computation and has been extensively studied for centuries. It appears that the existing classical algorithms are close to their…

Many iterative algorithms in optimization, computational geometry, computer algebra, and other areas of computer science require repeated computation of some algebraic expression whose input changes slightly from one iteration to the next.…

The computation of the matrix exponential is a ubiquitous operation in numerical mathematics, and for a general, unstructured $n\times n$ matrix it can be computed in $\mathcal{O}(n^3)$ operations. An interesting problem arises if the input…

This paper is to study vertex operator superalgebras which are strongly generated by their weight-$2$ and weight-$\frac{3}{2}$ homogeneous subspaces. Among the main results, it is proved that if such a vertex operator superalgebra $V$ is…

In the classical linear degeneracy testing problem, we are given $n$ real numbers and a $k$-variate linear polynomial $F$, for some constant $k$, and have to determine whether there exist $k$ numbers $a_1,\ldots,a_k$ from the set such that…

This paper deals with circulant matrices. It is shown that a circulant matrix can be multiplied by a vector in time O(n log(n)) in a ring with roots of unity without making use of an FFT algorithm. With our algorithm we achieve a speedup of…

We consider the question of determining whether or not a given system of fractional-order differential equations is (asymptotically) stable. In particular, we admit systems where each constituent equation may have its own order, independent…

We use lookup tables to design faster algorithms for important algebraic problems over finite fields. These faster algorithms, which only use arithmetic operations and lookup table operations, may help to explain the difficulty of…

We prove Holder regularity for solutions of non divergence integro-differential equations with non necessarily even kernels. The even/odd decomposition of the kernel can be understood as a sum of a diffusion and a drift term. In our case we…

Linear algebraic expressions are the essence of many computationally intensive problems, including scientific simulations and machine learning applications. However, translating high-level formulations of these expressions to efficient…

This paper considers finite-automata based algorithms for handling linear arithmetic with both real and integer variables. Previous work has shown that this theory can be dealt with by using finite automata on infinite words, but this…