Related papers: A multishift, multipole rational QZ method with ag…
A multigrid method is proposed in this paper to solve eigenvalue problems by the finite element method based on the shifted-inverse power iteration technique. With this scheme, solving eigenvalue problem is transformed to a series of…
A multiscale optimization framework for problems over a space of Lipschitz continuous functions is developed. The method solves a coarse-grid discretization followed by linear interpolation to warm-start project gradient descent on…
The non-linear induction problem in ferromagnetic media is solved using the fixed-point iteration method, where the linearized problem at each iteration is treated by means of a modal approach. The proposed approach does not require meshing…
This paper lays the groundwork for the theory of categorical diagonalization. Given a diagonalizable operator, tools in linear algebra (such as Lagrange interpolation) allow one to construct a collection of idempotents which project to each…
In the case of rational Cherednik algebras associated with cyclic groups, we give an alternative proof that the projective object $P_{\text{KZ}}$ representing the KZ-functor is isomorphic to the $\Delta$-module associated with the…
We present two new algorithms for the computation of the q-integer linear decomposition of a multivariate polynomial. Such a decomposition is essential for the treatment of q-hypergeometric symbolic summation via creative telescoping and…
In this paper, we propose a type of tensor-neural-network-based machine learning method to compute multi-eigenpairs of high dimensional eigenvalue problems without Monte-Carlo procedure. Solving multi-eigenvalues and their corresponding…
We present fast numerical methods for computing the Hessenberg reduction of a unitary plus low-rank matrix $A=G+U V^H$, where $G\in \mathbb C^{n\times n}$ is a unitary matrix represented in some compressed format using $O(nk)$ parameters…
Using the steepest descent method for oscillatory Riemann-Hilbert problems introduced by Deift and Zhou [Ann. Math. {\bf 137}(1993), 295-368], we derive asymptotic formulas for the Meixner polynomials in two regions of the complex plane…
We introduce new multilevel methods for solving large-scale unconstrained optimization problems. Specifically, the philosophy of multilevel methods is applied to Newton-type methods that regularize the Newton sub-problem using second order…
Matrix diagonalization is at the cornerstone of numerous fields of scientific computing. Diagonalizing a matrix to solve an eigenvalue problem requires a sequential path of iterations that eventually reaches a sufficiently converged and…
In this article we are interested for the numerical study of nonlinear eigenvalue problems. We begin with a review of theoretical results obtained by functional analysis methods, especially for the Schrodinger pencils. Some recall are given…
We introduce a one parameter deformation of Zwegers' multivariable $\mu$-function by applying iterations of the $q$-Borel summation method, which is also a multivariate analogue of the generalized $\mu$-function introduced by the authors.…
In this paper we generalize and improve a recently developed domain decomposition preconditioner for the iterative solution of discretized Helmholtz equations. We introduce an improved method for transmission at the internal boundaries…
Finding a Z-eigenpair of a symmetric tensor is equivalent to finding a KKT point of a sphere constrained minimization problem. Based on this equivalency, in this paper, we first propose a class of iterative methods to get a Z-eigenpair of a…
The polar decomposition of a matrix is a key element in the quantum linear algebra toolbox. We show that the problem of quantum polar decomposition, recently studied in Lloyd et al. [LBP+20], has a simple and concise implementation via the…
Deep equilibrium models (DEQs) achieve infinitely deep network representations without stacking layers by exploring fixed points of layer transformations in neural networks. Such models constitute an innovative approach that achieves…
A thorough backward stability analysis of Hotelling's deflation, an explicit external deflation procedure through low-rank updates for computing many eigenpairs of a symmetric matrix, is presented. Computable upper bounds of the loss of the…
The QCD at finite density is not well understood yet, where standard Monte Carlo simulation suffers from the sign problem. In order to overcome the sign problem, the method of Lefschetz thimble has been explored. Basically, the original…
We give a quantum algorithm for solving a shifted multiplicative character problem over Z/nZ and finite fields. We show that the algorithm can be interpreted as a matrix factorization or as solving a deconvolution problem and give…