Related papers: Structure Preserving Parallel Algorithms for Solvi…
In this paper we solve the eigenvalue problem of stochastic Hamiltonian system with boundary conditions. Firstly, we extend the results in S. Peng \cite{peng} from time-invariant case to time-dependent case, proving the existence of a…
Standard perturbation theory of eigenvalue problems consists of obtaining approximations of eigenmodes in the neighborhood of an operator where the corresponding eigenmode is known. Nevertheless, if the corresponding eigenmodes of several…
Quadratic eigenvalue problems (QEP) and more generally polynomial eigenvalue problems (PEP) are among the most common types of nonlinear eigenvalue problems. Both problems, especially the QEP, have extensive applications. A typical approach…
We are interested in the numerical approximation of non-linear stochastic differential equations (SDEs) with solution in a certain domain. Our goal is to construct explicit numerical schemes that preserve that structure. We generalize the…
We propose a novel parallel numerical algorithm for calculating the smallest eigenvalues of highly ill-conditioned matrices. It is based on the {\it LDLT} decomposition and involves finding a $k \times k$ sub-matrix of the inverse of the…
Studying the optoelectronic structure of materials can require the computation of several thousands of the smallest positive eigenpairs of a pseudo-hermitian Hamiltonian. Iterative eigensolvers may be preferred over direct methods for this…
Model order reduction provides low-complexity high-fidelity surrogate models that allow rapid and accurate solutions of parametric differential equations. The development of reduced order models for parametric \emph{nonlinear} Hamiltonian…
We consider the eigenvalue problem for the case where the input matrix is symmetric and its entries perturb in some given intervals. We present a characterization of some of the exact boundary points, which allows us to introduce an inner…
Starting from the Bethe ansatz solution for the open Totally Asymmetric Simple Exclusion Process (TASEP), we compute the largest eigenvalue of the deformed Markovian matrix, in exact agreement with results obtained by the matrix ansatz. We…
We describe algorithms for computing eigenpairs (eigenvalue-eigenvector pairs) of a complex $n\times n$ matrix $A$. These algorithms are numerically stable, strongly accurate, and theoretically efficient (i.e., polynomial-time). We do not…
We consider two problems that arise in machine learning applications: the problem of recovering a planted sparse vector in a random linear subspace and the problem of decomposing a random low-rank overcomplete 3-tensor. For both problems,…
We describe a parallel solver for the discretized weakly singular space-time boundary integral equation of the spatially two-dimensional heat equation. The global space-time nature of the system matrices leads to improved parallel…
Distributed optimization for resource allocation problems is investigated and a sub-optimal continuous-time algorithm is proposed. Our algorithm has lower order dynamics than others to reduce burdens of computation and communication, and is…
We present a massively parallel, GPU-accelerated implementation of the Bethe-Salpeter equation (BSE) for the calculation of the vertical excitation energies (VEEs) and optical absorption spectra of condensed and molecular systems, starting…
In the simulation of differential-algebraic equations (DAEs), it is essential to employ numerical schemes that take into account the inherent structure and maintain explicit or hidden algebraic constraints without altering them. This paper…
In simulation sciences, it is desirable to capture the real-world problem features as accurately as possible. Methods popular for scientific simulations such as the finite element method (FEM) and finite volume method (FVM) use piecewise…
We consider nonlinear eigenvalue problems to compute all eigenvalues in a bounded region on the complex plane. Based on domain decomposition and contour integrals, two robust and scalable parallel multi-step methods are proposed. The first…
In this paper we solve $m$-parameter eigenvalue problems ($m$EPs), with $m$ any natural number by representing the problem using Tensor-Trains (TT) and designing a method based on this format. $m$EPs typically arise when separation of…
In this article we consider the inversion problem for polynomially computable discrete functions. These functions describe behavior of many discrete systems and are used in model checking, hardware verification, cryptanalysis, computer…
We discuss the problems arising when computing eigenvalues of self-adjoint operators which lie in a gap between two parts of the essential spectrum. Spectral pollution, i.e. the apparent existence of eigenvalues in numerical computations,…