Related papers: A Modified Version of the Waxman Algorithm
In this paper, we derive a randomized version of the Mirror-Prox method for solving some structured matrix saddle-point problems, such as the maximal eigenvalue minimization problem. Deterministic first-order schemes, such as Nesterov's…
The existing doubling algorithms have been proven efficient for several important nonlinear matrix equations arising from real-world engineering applications. In a nutshell, the algorithms iteratively compute a basis matrix, in one of the…
The FEAST algorithm, due to Polizzi, is a typical contour-integral based eigensolver for computing the eigenvalues, along with their eigenvectors, inside a given region in the complex plane. It was formulated under the circumstance that the…
This paper describes a trapezoidal quadrature method for the discretization of weakly singular, singular and hypersingular boundary integral operators with complex symmetric quadratic forms. Such integral operators naturally arise when…
We introduce an adaptive finite element scheme for the efficient approximation of a (large) collection of eigenpairs of selfadjoint elliptic operators in which the adaptive refinement is driven by the solution of a single source problem --…
Quantum algorithms are able to solve particular problems exponentially faster than conventional algorithms, when implemented on a quantum computer. However, all demonstrations to date have required already knowing the answer to construct…
The numerical solution of singular eigenvalue problems is complicated by the fact that small perturbations of the coefficients may have an arbitrarily bad effect on eigenvalue accuracy. However, it has been known for a long time that such…
Assume that the eigenvalues of a finite hermitian linear operator have been deduced accurately but the linear operator itself could not be determined with precision. Given a set of eigenvalues $\lambda$ and a hermitian matrix $M$, this…
We develop a fast algorithm for Kalman Filter applied to the random walk forecast model. The key idea is an efficient representation of the estimate covariance matrix at each time-step as a weighted sum of two contributions - the process…
In this paper, for solving inconsistent matrix equations we propose a dual-space residual-based randomized extended Kaczmarz method and its version with Nesterov momentum. Without the full column rank assumptions on coefficient matrices, we…
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…
The Cayley-Hamilton problem of expressing functions of matrices in terms of only their eigenvalues is well-known to simplify to finding the inverse of the confluent Vandermonde matrix. Here, we give a highly compact formula for the inverse…
We present a successive constraint approach that makes it possible to cheaply solve large-scale linear matrix inequalities for a large number of parameter values. The efficiency of our method is made possible by an offline/online…
This paper presents a new parameter estimation algorithm for the adaptive control of a class of time-varying plants. The main feature of this algorithm is a matrix of time-varying learning rates, which enables parameter estimation error…
Non-Hermitian generalized eigenvalue problems (GEPs) play a significant role in many practical applications, such as mechanical engineering. Based on the generalized Schur decomposition, we propose a variational quantum algorithm for…
We consider the eigenvalue problem of certain kind of non-compact linear operators given as the sum of a multiplication and a kernel operator. A degenerate kernel method is used to approximate isolated eigenvalues. It is shown that entries…
In this paper, we study the strong convergence of two Mann-type inertial extragradient algorithms, which are devised with a new step size, for solving a variational inequality problem with a monotone and Lipschitz continuous operator in…
This is an elementary review, aimed at non-specialists, of results that have been obtained for the limiting distribution of eigenvalues and for the operator norms of real symmetric random matrices via the method of moments. This method goes…
In this paper, we study an adaptive finite element method for multiple eigenvalue problems of a class of second order elliptic equations. By using some eigenspace approximation technology and its crucial property which is also presented in…
By using the Ishikawa iterative algorithm, we approximate the fixed points and the best proximity points of a relatively non expansive mapping. Also, we use the von Neumann sequence to prove the convergence result in a Hilbert space…