Related papers: Three New Arnoldi-Type Methods for the Quadratic E…
We formulate the two-dimensional gravity-capillary water wave equations in a spatially quasi-periodic setting and present a numerical study of solutions of the initial value problem. We propose a Fourier pseudo-spectral discretization of…
We show how random subspace methods can be adapted to estimating local projections with many controls. Random subspace methods have their roots in the machine learning literature and are implemented by averaging over regressions estimated…
Quantum computing is an advancing area of research in which computer hardware and algorithms are developed to take advantage of quantum mechanical phenomena. In recent studies, quantum algorithms have shown promise in solving linear systems…
In this paper, by introducing a class of relaxed filtered Krylov subspaces, we propose the relaxed filtered Krylov subspace method for computing the eigenvalues with the largest real parts and the corresponding eigenvectors of non-symmetric…
This work investigates a new approach to find closed form analytical approximate solution of linear initial value problems. Classical Bernoulli polynomials have been used to derive a finite set of orthonormal polynomials and a finite…
We study the pseudogap Anderson model as a prototype system for critical Kondo destruction. We obtain finite-temperature (T) scaling functions near its quantum critical point, using a continuous-time quantum Monte Carlo method and also…
We present a novel technique to significantly reduce the offline cost associated to non-intrusive nonlinear tensors identification in reduced order models (ROMs) of geometrically nonlinear, finite elements (FE)-discretized structural…
Optimization on the Stiefel manifold or with orthogonality constraints is an important problem in many signal processing and data analysis applications such as Sparse Principal Component Analysis (SPCA). Algorithms such as the Riemannian…
We propose a new method for solving the semidefinite (SD) relaxation of the quadratic assignment problem (QAP), called Centering ADMM. Centering ADMM is an alternating direction method of multipliers (ADMM) combining the centering steps…
Time-dependent kinetic models are ubiquitous in computational science and engineering. The underlying integro-differential equations in these models are high-dimensional, comprised of a six--dimensional phase space, making simulations of…
We provide two new methods for computing lower bounds of eigenvalues of symmetric elliptic second-order differential operators with mixed boundary conditions of Dirichlet, Neumann, and Robin type. The methods generalize ideas of Weinstein's…
In two and three dimensional domains, we analyze mixed finite element methods for a velocity-pressure-pseudostress formulation of the Stokes eigenvalue problem. The methods consist in two schemes: the velocity and pressure are approximated…
Quantum subspace diagonalization and quantum Krylov algorithms offer a feasible, pre- or early-fault tolerant alternative to quantum phase estimation for using quantum computers to estimate the low-lying spectra of quantum systems. However,…
The Quasi-Frozen Spin (QFS) method was proposed by Yu. Senichev et al. in [1] as an alternative to the Frozen Spin (FS) method [2] for the search of deuteron electric dipole moment (dEDM). The QFS approach simplifies the design of the…
In this paper, the generalized finite element method (GFEM) for solving second order elliptic equations with rough coefficients is studied. New optimal local approximation spaces for GFEMs based on local eigenvalue problems involving a…
Physics-based models often involve large systems of parametrized partial differential equations, where design parameters control various properties. However, high-fidelity simulations of such systems on large domains or with high grid…
In this work, we analyze Parametrized Advection-Dominated distributed Optimal Control Problems with random inputs in a Reduced Order Model (ROM) context. All the simulations are initially based on a finite element method (FEM)…
In this work, we propose an alternating low-rank decomposition (ALRD) approach and novel subspace algorithms for direction-of-arrival (DOA) estimation. In the ALRD scheme, the decomposition matrix for rank reduction is composed of a set of…
The optimal execution problem has always been a continuously focused research issue, and many reinforcement learning (RL) algorithms have been studied. In this article, we consider the execution problem of targeting the volume weighted…
The Alternating Direction Method of Multipliers (ADMM) has gained significant attention across a broad spectrum of machine learning applications. Incorporating the over-relaxation technique shows potential for enhancing the convergence rate…