نتایج جستجو برای: large eigenvalue problems
تعداد نتایج: 1549518 فیلتر نتایج به سال:
Many eigenvalue problems are most naturally viewed as product eigenvalue problems. The eigenvalues of a matrix A are wanted, but A is not given explicitly. Instead it is presented as a product of several factors: A = AkAk−1 · · ·A1. Usually more accurate results are obtained by working with the factors rather than forming A explicitly. For example, if we want eigenvalues/vectors of BTB, it is b...
An inverse eigenvalue problem concerns the reconstruction of a structured matrix from prescribed spectral data. Such an inverse problem arises in many applications where parameters of a certain physical system are to be determined from the knowledge or expectation of its dynamical behavior. Spectral information is entailed because the dynamical behavior often is governed by the underlying natur...
We propose a new interpretation of the generalized overdetermined eigenvalue problem (A− λB)v ≈ 0 for two m × n (m > n) matrices A and B, its stability analysis, and an efficient algorithm for solving it. Usually, the matrix pencil {A− λB} does not have any rank deficient member. Therefore we aim to compute λ for which A − λB is as close as possible to rank deficient; i.e., we search for λ that...
Most eigenvalue problems arising in practice are known to be structured. Structure is often introduced by discretization and linearization techniques but may also be a consequence of properties induced by the original problem. Preserving this structure can help preserve physically relevant symmetries in the eigenvalues of the matrix and may improve the accuracy and efficiency of an eigenvalue c...
Large scale eigenvalue computation is about approximating certain invariant subspaces associated with the interested part of the spectrum, and the interested eigenvalues are then extracted from projecting the problem by approximate invariant subspaces into a much smaller eigenvalue problem. In the case of the linear response eigenvalue problem (aka the random phase eigenvalue problem), it is th...
Large-scale electronic structure calculations usually involve huge nonlinear eigenvalue problems. A method for solving these problems without employing expensive eigenvalue decompositions of the Fock matrix is presented in this work. The sparsity of the input and output matrices is preserved at every iteration, and the memory required by the algorithm scales linearly with the number of atoms of...
Even if both A and B are real-valued, it is likely that λ and x are complexvalued. Finding the solution of eigensystems is a fairly complicated procedure. It is at least as difficult as finding the roots of polynomials. Therefore, any numerical method for solving eigenvalue problems is expected to be iterative in nature. Algorithms for solving eigenvalue problems include the power method, subsp...
We consider the solution of large-scale symmetric eigenvalue problems for which it is known that the eigenvectors admit a low-rank tensor approximation. Such problems arise, for example, from the discretization of high-dimensional elliptic PDE eigenvalue problems or in strongly correlated spin systems. Our methods are built on imposing low-rank (block) TT structure on the trace minimization cha...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید