An indefinite variant of LOBPCG for definite matrix pencils
Publications associées (46)
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
Adjoint-based sensitivity analysis is routinely used today to assess efficiently the effect of open-loop control on the linear stability properties of unstable flows. Sensitivity maps identify regions where small-amplitude control is the most effective, i. ...
This paper is concerned with the asymptotic optimality of spectral coarse spaces for two-level iterative methods. Spectral coarse spaces, namely coarse spaces obtained as the span of the slowest modes of the used one-level smoother, are known to be very ef ...
We determine the asymptotic behavior of eigenvalues of clamped plates under large compression by relating this problem to eigenvalues of the Laplacian with Robin boundary conditions. Using the method of fundamental solutions, we then carry out a numerical ...
In this thesis we address the computation of a spectral decomposition for symmetric
banded matrices. In light of dealing with large-scale matrices, where classical dense
linear algebra routines are not applicable, it is essential to design alternative tech ...
The Dirichlet-Neumann (DN) method has been extensively studied for linear partial differential equations, while little attention has been devoted to the nonlinear case. In this paper, we analyze the DN method both as a nonlinear iterative method and as a p ...
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 perturbations are ...
We present asymptotically sharp inequalities, containing a 2nd term, for the Dirichlet and Neumann eigenvalues of the Laplacian on a domain, which are complementary to the familiar Berezin-Li-Yau and Kroger inequalities in the limit as the eigenvalues tend ...
Eigendecomposition of symmetric matrices is at the heart of many computer vision algorithms. However, the derivatives of the eigenvectors tend to be numerically unstable, whether using the SVD to compute them analytically or using the Power Iteration (PI) ...
Block Krylov subspace methods (KSMs) comprise building blocks in many state-of-the-art solvers for large-scale matrix equations as they arise, for example, from the discretization of partial differential equations. While extended and rational block Krylov ...
We present outlier-free isogeometric Galerkin discretizations of eigenvalue problems related to the biharmonic and the polyharmonic operator in the univariate setting. These are Galerkin discretizations in certain spline subspaces that provide accurate app ...