Related papers: Efficient method for calculating the eigenvalue of…
We present PNKH-B, a projected Newton-Krylov method for iteratively solving large-scale optimization problems with bound constraints. PNKH-B is geared toward situations in which function and gradient evaluations are expensive, and the…
We present a method for solving nonlinear eigenvalue problems using rational approximation. The method uses the AAA method by Nakatsukasa, S\`{e}te, and Trefethen to approximate the nonlinear eigenvalue problem by a rational eigenvalue…
In this paper, an efficient method is presented for solving three dimensional Volterra integral equations of the second kind with continuous kernel. Shifted Chebyshev polynomial is applied to approximate a solution for these integral…
Recently, a kind of eigensolvers based on contour integral were developed for computing the eigenvalues inside a given region in the complex plane. The CIRR method is a classic example among this kind of methods. In this paper, we propose a…
Let $\lambda_{max}$ be a shifted maximal real eigenvalue of a random $N\times N$ matrix with independent $N(0,1)$ entries (the `real Ginibre matrix') in the $N\to\infty$ limit. It was shown by Poplavskyi, Tribe, Zaboronski \cite{PZT} that…
We propose two finite-difference algorithms of fourth order of accuracy for solving the initial problem of the Zakharov-Shabat system. Both schemes have the exponential form and conserve quadratic invariant of Zakharov-Shabat system. The…
We consider the problem of parallelizing electronic structure computations in plane-wave Density Functional Theory. Because of the limited scalability of Fourier transforms, parallelism has to be found at the eigensolver level. We show how…
We propose a highly efficient numerical method to describe inhomogeneous superconductivity by using the kernel polynomial method in order to calculate the Green's functions of a superconductor. Broken translational invariance of any type…
This paper develops a computational method for studying stable/unstable manifolds attached to periodic orbits of differential equations. The method uses high order Chebyshev-Taylor series approximations in conjunction with the…
The bound state energy eigenvalues and the corresponding eigenfunctions of the generalized Woods Saxon potential are obtained in terms of the Jacobi polynomials. Nikiforov Uvarov method is used in the calculations. It is shown that the…
We present two approximation methods for computing eigenfrequencies and eigenmodes of large-scale nonlinear eigenvalue problems resulting from boundary element method (BEM) solutions of some types of acoustic eigenvalue problems in…
In this paper, we investigate the Kaczmarz-Tanabe method for exact and inexact linear systems. The Kaczmarz-Tanabe method is derived from the Kaczmarz method, but is more stable than that. We analyze the convergence and the convergence rate…
We present two new quantum algorithms for reaction-diffusion equations that employ the truncated Chebyshev polynomial approximation. This method is employed to numerically solve the ordinary differential equation emerging from 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…
In a recent paper Lima, Panario and Wang have provided a new method to multiply polynomials in Chebyshev basis which aims at reducing the total number of multiplication when polynomials have small degree. Their idea is to use Karatsuba's…
We extend the notion of some energy-type expressions based on two sets, developed in the abstract potential theory. We also give the discretized version of the quantities defined, similar to Chebyshev constant. This extension allows to…
Complex valued systems with an indefinite matrix term arise in important applications such as for certain time-harmonic partial differential equations such as the Maxwell's equation and for the Helmholtz equation. Complex systems with…
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…
This work presents a novel approach to compute the eigenvalues of non-Hermitian matrices using an enhanced shifted QR algorithm. The existing QR algorithms fail to converge early in the case of non-hermitian matrices, and our approach shows…
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…