Related papers: Solving the Parametric Eigenvalue Problem by Taylo…
In this chapter we are examining several iterative methods for solving nonlinear eigenvalue problems. These arise in variational image-processing, graph partition and classification, nonlinear physics and more. The canonical eigenproblem we…
In two phase materials, each phase having a non-local response in time, it has been found that for some driving fields the response somehow untangles at specific times, and allows one to directly infer useful information about the geometry…
Finding the eigenvalues of a Sturm-Liouville problem can be a computationally challenging task, especially when a large set of eigenvalues is computed, or just when particularly large eigenvalues are sought. This is a consequence of the…
This note starts from work done by Dai, Geary, and Kadanoff (Hui Dai, Zachary Geary, and Leo P. Kadanoff, H. Dai, Z. Geary and L. P. Kadanoff, Journal of Statistical Mechanics, P05012 (2009)) on exact eigenfunctions for Toeplitz operators.…
We consider approximating solutions to parameterized linear systems of the form $A(\mu_1,\mu_2) x(\mu_1,\mu_2) = b$. Here the matrix $A(\mu_1,\mu_2) \in \mathbb{R}^{n \times n}$ is nonsingular, large, and sparse and depends nonlinearly on…
In this paper, we derive an asymptotic error expansion for the eigenvalue approximations by the lowest order Raviart-Thomas mixed finite element method for the general second order elliptic eigenvalue problems. Extrapolation based on such…
In this paper, we derive optimality conditions (Chebyshev approximation) for multivariate functions. The theory of Chebyshev (uniform) approximation for univariate functions is very elegant. The optimality conditions are based on the notion…
Assumed that the parameters of a generalized hypergeometric function depend linearly on a small variable $\varepsilon$, the successive derivatives of the function with respect to that small variable are evaluated at $\varepsilon=0$ to…
Solving the Kohn-Sham eigenvalue problem constitutes the most computationally expensive part in self-consistent density functional theory (DFT) calculations. In a previous paper, we have proposed a nonlinear Chebyshev-filtered subspace…
In this paper, to the best of our knowledge, we make the first attempt at studying the parametric semilinear elliptic eigenvalue problems with the parametric coefficient and some power-type nonlinearities. The parametric coefficient is…
A Chebyshev expansion is a series in the basis of Chebyshev polynomials of the first kind. When such a series solves a linear differential equation, its coefficients satisfy a linear recurrence equation. We interpret this equation as the…
We propose a numerical method for computing all eigenvalues (and the corresponding eigenvectors) of a nonlinear holomorphic eigenvalue problem that lie within a given contour in the complex plane. The method uses complex integrals of the…
Various types of expansions in series of Chebyshev-Hermite polynomials currently used in astrophysics for weakly non-normal distributions are compared, namely the Gram-Charlier, Gauss-Hermite and Edgeworth expansions. It is shown that the…
We consider multicriteria problems of evaluating absolute ratings (scores, priorities, weights) of given alternatives for making decisions, which are compared in pairs under several criteria. Given matrices of pairwise comparisons of…
In the present paper, we study the analyticity of the leftmost eigenvalue of the linear elliptic partial differential operator with random coefficient and analyze the convergence rate of the quasi-Monte Carlo method for approximation of the…
We describe an algorithm to compute the extremal eigenvalues and corresponding eigenvectors of a symmetric matrix by solving a sequence of Quadratic Binary Optimization problems. This algorithm is robust across many different classes of…
We propose a general, very fast method to quickly approximate the solution of a parabolic Partial Differential Equation (PDEs) with explicit formulas. Our method also provides equaly fast approximations of the derivatives of the solution,…
We address the problem of the best uniform approximation by linear combinations of a finite system of functions. If the system is Chebyshev and the problem is unconstrained, then the classical Remez algorithm provides a fast and precise…
By application of the theory for second-order linear differential equations with two turning points developed in [Olver F.W.J., Philos. Trans. Roy. Soc. London Ser. A 278 (1975), 137-174], uniform asymptotic approximations are obtained in…
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…