Low-Rank Tensor Methods With Subspace Correction For Symmetric Eigenvalue Problems

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Global spectral methods offer the potential to compute solutions of partial differential equations numerically to very high accuracy. In this work, we develop a novel global spectral method for linear partial differential equations on cubes by extending th ...

Cakoni and Nguyen recently proposed very general conditions on the coefficients of Maxwell equations for which they established the discreten ess of the set of eigenvalues of the transmission problem and studied their locations. In this paper, we establish ...

Recently, several theories including the replica method made predictions for the generalization error of Kernel Ridge Regression. In some regimes, they predict that the method has a 'spectral bias': decomposing the true function f* on the eigenbasis of the ...

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 ...

Two-level domain decomposition methods are very powerful techniques for the efficient numerical solution of partial differential equations (PDEs). A two-level domain decomposition method requires two main components: a one-level preconditioner (or its corr ...

Iterative substructuring Domain Decomposition (DD) methods have been extensively studied, and they are usually associated with nonoverlapping decompositions. It is less known that classical overlapping DD methods can also be formulated in substructured for ...

Based on the spectral divide-and-conquer algorithm by Nakatsukasa and Higham [SIAM J. Sci. Comput., 35(3):A1325-A1349, 2013], we propose a new algorithm for computing all the eigenvalues and eigenvectors of a symmetric banded matrix with small bandwidth, w ...

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) ...

Inverse reconstruction from images is a central problem in many scientific and engineering disciplines. Recent progress on differentiable rendering has led to methods that can efficiently differentiate the full process of image formation with respect to mi ...

Wave phenomena manifest in nature as electromagnetic waves, acoustic waves, and gravitational waves among others. Their descriptions as partial differential equations in electromagnetics, acoustics, and fluid dynamics are ubiquitous in science and engineer ...

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. ...

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 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 ...

Low-Rank Tensor Methods With Subspace Correction For Symmetric Eigenvalue Problems

Chat with Graph Search

Fast global spectral methods for three-dimensional partial differential equations

The completeness of the generalized eigenfunctions and an upper bound for the counting function of the transmission eigenvalue problem for Maxwell equations

Failure and success of the spectral bias prediction for Laplace Kernel Ridge Regression: the case of low-dimensional data

On the nonlinear Dirichlet-Neumann method and preconditioner for Newton's method

Substructured Two-grid and Multi-grid Domain Decomposition Methods

Linear and nonlinear substructured Restricted Additive Schwarz iterations and preconditioning

A fast spectral divide-and-conquer method for banded matrices

Robust Differentiable SVD

Large Steps in Inverse Rendering of Geometry

Efficient algorithms for wave problems

Second-order adjoint-based sensitivity for hydrodynamic stability and control

Compress-and-restart block Krylov subspace methods for Sylvester matrix equations

Complementary Asymptotically Sharp Estimates for Eigenvalue Means of Laplacians