TITLE

# Super-Exponentially Convergent Parallel Algorithm for Eigenvalue Problems with Fractional Derivatives

AUTHOR(S)
Demkiv, Ihor; Gavrilyuk, Ivan P.; Makarov, Volodymyr L.
PUB. DATE
October 2016
SOURCE
Computational Methods in Applied Mathematics;Oct2016, Vol. 16 Issue 4, p633
SOURCE TYPE
DOC. TYPE
Article
ABSTRACT
No abstract available.
ACCESSION #
118479376

## Related Articles

• Superexponentially Convergent Algorithm for an Abstract Eigenvalue Problem with Applications to Ordinary Differential Equations. Gavrilyuk, I.; Makarov, V.; Romanyuk, N. // Journal of Mathematical Sciences;Jan2017, Vol. 220 Issue 3, p273

A new algorithm for the solution of eigenvalue problems for linear operators of the form A = A + B (with a special application to high-order ordinary differential equations) is proposed and justified. The algorithm is based on the approximation of A by an operator  \overline{A}=A+\overline{B}...

• Fractionally Spaced Mixed Blind Equalization Algorithm Based on Orthogonal Wavelet Transform. Guo Fu-dong; Guo Ye-cai; Ding Xue-jie // Proceedings of the International Workshop on Information Securit;2009, p22

Aiming at huge computation of super-exponential iteration (SEI) algorithm, meanwhile the severe inter-symbol interference (ISI) caused by multi-path fading, in the fractionally spaced blind equalization algorithm which based on superexponential iteration algorithm, fractionally spaced mixed...

• Efficient algorithms for computing the largest eigenvalue of a nonnegative tensor. Zhou, Guanglu; Qi, Liqun; Wu, Soon-Yi // Frontiers of Mathematics in China;Feb2013, Vol. 8 Issue 1, p155

Consider the problem of computing the largest eigenvalue for nonnegative tensors. In this paper, we establish the Q-linear convergence of a power type algorithm for this problem under a weak irreducibility condition. Moreover, we present a convergent algorithm for calculating the largest...

• NUMERICAL METHOD FOR FINDING BIFURCATION POINTS OF THE LINEAR TWO-PARAMETER EIGENVALUE PROBLEM. Khlobystov, V. V.; Podlevskyi, B. M. // Computational Methods in Applied Mathematics;2009, Vol. 9 Issue 4, p332

The iteration algorithm of finding bifurcation points of simple eigenvalue curves of the linear algebraic two-parameter eigenvalue problem is considered. The algorithm is based on the efficient numerical procedure of calculation of the derivative of matrix determinant. Numerical results are given.

• A DIRECT SEARCH FRAME-BASED CONJUGATE GRADIENTS METHOD. Coope, I. D.; Price, C. J. // Journal of Computational Mathematics;Jul2004, Vol. 22 Issue 4, p489

A derivative-free frame-based conjugate gradients algorithm is presented. Convergence is shown for C1 functions, and this is verified in numerical trials. The algorithm is tested on a variety of low dimensional problems, some of which axe ill-conditioned, and is also tested on problems of high...

• Non-linear eigensolver-based alternative to traditional SCF methods. Gavin, B.; Polizzi, E. // Journal of Chemical Physics;May2013, Vol. 138 Issue 19, p194101

The self-consistent procedure in electronic structure calculations is revisited using a highly efficient and robust algorithm for solving the non-linear eigenvector problem, i.e., H({Ïˆ})Ïˆ = EÏˆ. This new scheme is derived from a generalization of the FEAST eigenvalue algorithm to account...

• The Unique Positive Solution for Singular Hadamard Fractional Boundary Value Problems. Mao, Jinxiu; Zhao, Zengqin; Wang, Chenguang // Journal of Function Spaces;6/20/2019, p1

In this paper, we investigate singular Hadamard fractional boundary value problems. The existence and uniqueness of the exact iterative solution are established only by using an iterative algorithm. The iterative sequences have been proved to converge uniformly to the exact solution, and...

• LOCAL AND PARALLEL FINITE ELEMENT ALGORITHM BASED ON MULTILEVEL DISCRETIZATION FOR EIGENVALUE PROBLEMS. XIAOLE HAN; YU LI; HEHU XIE; CHUNGUANG YOU // International Journal of Numerical Analysis & Modeling;2016, Vol. 13 Issue 1, p73

In this paper, a local and parallel algorithm based on the multilevel discretization is proposed for solving the eigenvalue problem by the finite element method. With this new scheme, the eigenvalue problem solving in the finest grid is transferred to solutions of the eigenvalue problems on the...

• PROXIMAL POINT ALGORITHM FOR MINIMIZATION OF DC FUNCTION. Wen-yu Sun; Sampaio, Raimundo J. B.; Candido, M. A. B. // Journal of Computational Mathematics;Jul2003, Vol. 21 Issue 4, p451

In this paper we present some algorithms for minimization of DC function (difference of two convex functions). They are descent methods of the proximal-type which use the convex properties of the two convex functions separately. We also consider an approximate proximal point algorithm. Some...

• SYMBOLICAL COMBINATORY MODEL FOR SOLVING THE PROBLEM OF EIGENVALUES IN TASKS OF IDENTIFICATION OF DYNAMIC OBJECTS. Burovs, Genadijs // Computer Science (1407-7493);2008, Vol. 35, p143

The problem of calculating the eigenvalues of the matrix of systems of identification equations is considered. Traditional numerical methods possess a number of significant drawbacks. On the basis of symbolical combinatory models, a new more precise algorithm for finding the coefficients of the...

Share