相关论文: Computing eigenfunctions and eigenvalues of bounda…

The study of resonances of the Schr\"{o}dinger operator has a long-standing tradition in mathematical physics. Extensive theoretical investigations have explored the proximity of resonances to the real axis, their distribution, and bounds…

The real symmetric tridiagonal eigenproblem is of outstanding importance in numerical computations; it arises frequently as part of eigensolvers for standard and generalized dense Hermitian eigenproblems that are based on a reduction to…

A randomized Gram-Schmidt algorithm is developed for orthonormalization of high-dimensional vectors or QR factorization. The proposed process can be less computationally expensive than the classical Gram-Schmidt process while being at least…

We study the problem of estimating the coefficients in linear ordinary differential equations (ODE's) with a diverging number of variables when the solutions are observed with noise. The solution trajectories are first smoothed with local…

Iterative multiscale methods for electronic structure calculations offer several advantages for large-scale problems. Here we examine a nonlinear full approximation scheme (FAS) multigrid method for solving fixed potential and…

We are concerned with the study of some classical spectral collocation methods as well as with the new software system Chebfun in computing high order eigenpairs of singular and regular Schrodinger eigenproblems. We want to highlight both…

In this work we present a fast, globally convergent, iterative algorithm for computing the asymptotically stable states of nonlinear large--scale systems of quadratic autonomous Ordinary Differential Equations (ODEs) modeling, e.g., the…

We consider and analyze applying a spectral inverse iteration algorithm and its subspace iteration variant for computing eigenpairs of an elliptic operator with random coefficients. With these iterative algorithms the solution is sought…

Based on the novel prescription for the power of a complex number, a new expression for the eigenfunction of the operator of the third component of the angular momentum is presented. These functions are normalizable, single valued and are…

The starting point of this paper is that a spectral method is essentially a combination of an orthonormal basis of the underlying Hilbert space with Galerkin conditions. The choice of an orthonormal basis depends on a number of desirable…

In this paper, we propose a new method for estimating the conditional risk-neutral density (RND) directly from a cross-section of put option bid-ask quotes. More precisely, we propose to view the RND recovery problem as an inverse problem.…

The method of computing eigenvectors from eigenvalues of submatrices can be shown as equivalent to a method of computing the constraint which achieves specified stationary values of a quadratic optimization. Similarly, we show computation…

In this paper, a quantum dot mathematical model based on a two-dimensional Schr\"odinger equation assuming the 1/r inter-electronic potential is revisited. Generally, it is argued that the solutions of this model obtained by solving a…

We present an iteration for the computation of simple eigenvalues using a pseudospectrum approach. The most appealing characteristic of the proposed iteration is that it reduces the computation of a single eigenvalue to a small number of…

We consider accelerated versions of the operator Sinkhorn iteration (OSI) for solving scaling problems for completely positive maps. Based on the interpretation of OSI as alternating fixed point iteration, it has been recently proposed to…

This work introduces a novel algorithm to solve large-scale eigenvalue problems and seek a small set of eigenpairs. The method, called randomized Krylov-Schur (rKS), has a simple implementation and benefits from fast and efficient…

We consider the computations of the action ground state for a rotating nonlinear Schr\"odinger equation. It reads as a minimization of the action functional under the Nehari constraint. In the focusing case, we identify an equivalent…

A key question in modern statistics is how to make fast and reliable inferences for complex, high-dimensional data. While there has been much interest in sparse techniques, current methods do not generalize well to data with nonlinear…

The practical success of polynomial-time tensor network methods for computing ground states of certain quantum local Hamiltonians has recently been given a sound theoretical basis by Arad, Landau, Vazirani, and Vidick. The convergence…

Within the framework of field-theoretical description of second-order phase transitions via the 3-dimensional O(N) vector model, accurate predictions for critical exponents can be obtained from (resummation of) the perturbative series of…