Related papers: On the block Eberlein diagonalization method
In this work we are interested in general linear inverse problems where the corresponding forward problem is solved iteratively using fixed point methods. Then one-shot methods, which iterate at the same time on the forward problem solution…
Many real-world problems rely on finding eigenvalues and eigenvectors of a matrix. The power iteration algorithm is a simple method for determining the largest eigenvalue and associated eigenvector of a general matrix. This algorithm relies…
In this article, a formulation of a point-collocation method in which the unknown function is approximated using global expansion in tensor product Bernstein polynomial basis is presented. Bernstein polynomials used in this study are…
In a previous article, the authors developed two conversion methods to improve the $\Sigma$-method for structural analysis (SA) of differential-algebraic equations (DAEs). These methods reformulate a DAE on which the $\Sigma$-method fails…
We propose a new iterative scheme to compute the numerical solution to an over-determined boundary value problem for a general quasilinear elliptic PDE. The main idea is to repeatedly solve its linearization by using the quasi-reversibility…
In this paper, we are concerned with Jacobi polynomials $P_n^{(\alpha,\beta)}(x)$ on the Bernstein ellipse with motivation mainly coming from recent studies of convergence rate of spectral interpolation. An explicit representation of…
An entirely quantum mechanical approach to diagonalize hermitean matrices has been presented recently. Here, the genuinely quantum mechanical approach is considered in detail for (2x2) matrices. The method is based on the measurement of…
The Replica Fourier Transform introduced previously is related to the standard definition of Fourier transforms over a group. Its use is illustrated by block-diagonalizing the eigenvalue equation of a four-replica Parisi matrix.
The aim of this paper is to develop an algebraic multigrid method to solve eigenvalue problems based on the combination of the multilevel correction scheme and the algebraic multigrid method for linear equations. Our approach uses the…
We propose a inexact Newton method for solving inverse eigenvalue problems (IEP). This method is globalized by employing the classical backtracking techniques. A global convergence analysis of this method is provided and the R-order…
A generalized inversion of block T+H matrix is obtained for the first time. In a particular case when T+H matrix is invertible, the method allows to obtain its inverse matrix without an additional condition of invertibility of the…
The block Kaczmarz method and its variants are designed for solving the over-determined linear system. They involve iteratively projecting the current point onto the solution space of a subset of constraints. In this work, by alternately…
The data input model is a fundamental component of every quantum algorithm, as its efficiency is crucial for achieving potential speed-ups over classical methods. For quantum linear algebra tasks that utilize quantum eigenvalue or singular…
We propose a high precision algorithm for solving the Gelfand-Levitan-Marchenko equation. The algorithm is based on the block version of the Toeplitz Inner-Bordering algorithm of Levinson's type. To approximate integrals, we use the…
In this paper we extend the polynomial time integration framework to include exponential integration for both partitioned and unpartitioned initial value problems. We then demonstrate the utility of the exponential polynomial framework by…
Finding eigenvalue distributions for a number of sparse random matrix ensembles can be reduced to solving nonlinear integral equations of the Hammerstein type. While a systematic mathematical theory of such equations exists, it has not been…
We describe two main classes of one-sided trigonometric and hyperbolic Jacobi-type algorithms for computing eigenvalues and eigenvectors of Hermitian matrices. These types of algorithms exhibit significant advantages over many other…
We consider regular polynomial interpolation algorithms on recursively defined sets of interpolation points which approximate global solutions of arbitrary well-posed systems of linear partial differential equations. Convergence of the…
An approximate diagonalization method is proposed that combines exact diagonalization and perturbation expansion to calculate low energy eigenvalues and eigenfunctions of a Hamiltonian. The method involves deriving an effective Hamiltonian…
This paper presents a framework for the analysis of discretization methods based on the decomposition into local and global problems. We apply the framework to provide a comprehensive error analysis for the embedded Trefftz discontinuous…