Low-Rank Updates Of Matrix Functions Ii: Rational Krylov Methods

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.

We study continuous-domain linear inverse problems that involve a general data-fidelity term and a regularisation term. We consider a regularisation that is formed by the sparsity-promoting total-variation norm, pre-composed with a differential operator th ...

This work is concerned with the computation of the action of a matrix function f(A), such as the matrix exponential or the matrix square root, on a vector b. For a general matrix A, this can be done by computing the compression of A onto a suitable Krylov ...

In this thesis we will present and analyze randomized algorithms for numerical linear algebra problems. An important theme in this thesis is randomized low-rank approximation. In particular, we will study randomized low-rank approximation of matrix functio ...

A key challenge across many disciplines is to extract meaningful information from data which is often obscured by noise. These datasets are typically represented as large matrices. Given the current trend of ever-increasing data volumes, with datasets grow ...

Human babies have a natural desire to interact with new toys and objects, through which they learn how the world around them works, e.g., that glass shatters when dropped, but a rubber ball does not. When their predictions are proven incorrect, such as whe ...

For a high-dimensional problem, a randomized Gram-Schmidt (RGS) algorithm is beneficial in terms of both computational cost and numerical stability. We apply this dimension reduction technique by random sketching to Krylov subspace methods, e.g., to the ge ...

In the rapidly evolving landscape of machine learning research, neural networks stand out with their ever-expanding number of parameters and reliance on increasingly large datasets. The financial cost and computational resources required for the training p ...

Sylvester matrix equations are ubiquitous in scientific computing. However, few solution techniques exist for their generalized multiterm version, as they now arise in an increasingly large number of applications. In this work, we consider algebraic parame ...

The locally optimal block preconditioned conjugate gradient (LOBPCG) algorithm is a popular approach for computing a few smallest eigenvalues and the corresponding eigenvectors of a large Hermitian positive definite matrix A. In this work, we propose a mix ...

The finite element method is a well-established method for the numerical solution of partial differential equations (PDEs), both linear and nonlinear. However, the repeated re -assemblage of finite element matrices for nonlinear PDEs is frequently pointed ...

Is it possible to detect if the sample paths of a stochastic process almost surely admit a finite expansion with respect to some/any basis? The determination is to be made on the basis of a finite collection of discretely/noisily observed sample paths. We ...

By operating with the Scale Relativity Theory in the dynamics of complex systems, we can achieve a description of these complex systems through a holographic-type perspective. Then, gauge invariances of a Riccati-type become functional in complex system dy ...

State-of-the-art Artificial Intelligence (AI) algorithms, such as graph neural networks and recommendation systems, require floating-point computation of very large matrix multiplications over sparse data. Their execution in resource-constrained scenarios, ...

We face a rigidity problem for the fractional p-Laplace operator to extend to this new framework some tools useful for the linear case. It is known that (-Delta)(s)(1 - vertical bar x vertical bar(2))(+)(s) and -Delta(p)(1 - vertical bar x vertical bar(p/p ...

Fourier ptychography (FP) involves the acquisition of several low-resolution intensity images of a sample under varying illumination angles. They are then combined into a high-resolution complex-valued image by solving a phase-retrieval problem. The object ...

This article investigates the optimal containment control problem for a class of heterogeneous multi-agent systems with time-varying actuator faults and unmatched disturbances based on adaptive dynamic programming. Since there exist unknown input signals i ...

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

This work is concerned with computing low-rank approximations of a matrix function f(A) for a large symmetric positive semidefinite matrix A, a task that arises in, e.g., statistical learning and inverse problems. The application of popular randomized meth ...

Randomized trace estimation is a popular and well-studied technique that approximates the trace of a large-scale matrix B by computing the average of x(T) Bx for many samples of a random vector X. Often, B is symmetric positive definite (SPD) but a number ...

The Schur decomposition of a square matrix A is an important intermediate step of state-of-the-art numerical algorithms for addressing eigenvalue problems, matrix functions, and matrix equations. This work is concerned with the following task: Compute a (m ...

Low-Rank Updates Of Matrix Functions Ii: Rational Krylov Methods

Chat with Graph Search

Convergence analysis of the discretization of continuous-domain inverse problems

SPEEDING UP KRYLOV SUBSPACE METHODS FOR COMPUTING f(A)b VIA RANDOMIZATION

Randomized low-rank approximation and its applications

Spectral Estimators for High-Dimensional Matrix Inference

Seeking the new, learning from the unexpected: Computational models of surprise and novelty in the brain

Randomized flexible GMRES with deflated restarting

Random matrix methods for high-dimensional machine learning models

Preconditioning techniques for generalized Sylvester matrix equations

A mixed precision LOBPCG algorithm

On the fast assemblage of finite element matrices with application to nonlinear heat transfer problems

Detecting whether a stochastic process is finitely expressed in a basis

On A Special Symmetry In The Dynamics Of Complex Systems In A Holographic-Type Perspective

A 16-bit Floating-Point Near-SRAM Architecture for Low-power Sparse Matrix-Vector Multiplication

Some evaluations of the fractional p-Laplace operator on radial functions

Dynamic Fourier ptychography with deep spatiotemporal priors

Optimal containment control for a class of heterogeneous multi-agent systems with actuator faults

Linear and nonlinear substructured Restricted Additive Schwarz iterations and preconditioning

Randomized Low-Rank Approximation Of Monotone Matrix Functions

On Randomized Trace Estimates for Indefinite Matrices with an Application to Determinants

Iterative refinement of Schur decompositions