Many standard linear algebra problems can be solved on a quantum computer by using recently developed quantum linear algebra algorithms that make use of block encodings and quantum eigenvalue/singu…
Tensors are often studied by introducing preorders such as restriction and degeneration. The former describes transformations of the tensors by local linear maps on its tensor factors; the latter d…
We consider the solution of large stiff systems of ODEs with explicit exponential Runge–Kutta integrators. These problems arise from semidiscretized semilinear parabolic PDEs on continuous domain…
This paper develops a new class of nonlinear acceleration algorithms based on extending conjugate residual-type procedures from linear to nonlinear equations. The main algorithm has strong similari…
We provide a rearrangement based algorithm for detection of subgraphs of k vertices with long escape times for directed or undirected networks that is not combinatorially complex to compute. Comple…
Given a family of nearly commuting symmetric matrices, we consider the task of computing an orthogonal matrix that nearly diagonalizes every matrix in the family. In this paper, we propose and anal…
Matrix factorizations in dual number algebra, a hypercomplex number system, have been applied to kinematics, spatial mechanisms, and other fields recently. We develop an approach to identify spatio…
This work is concerned with the computation of the action of a matrix function f(A), such as the matrix exponential or the matrix square root, on a vector b. For a general matrix A, this can be don…
In prioritization schemes, based on pairwise comparisons, such as the analytical hierarchy process, it is important to extract a cardinal ranking vector from a reciprocal matrix that is unlikely to…
It is widely believed that typical finite families of matrices admit finite products that attain the joint spectral radius. This conjecture is supported by computational experiments and it …