Bivariate Matrix Functions

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (30)

A mathematical theory for mass lumping and its generalization with applications to isogeometric analysis

Annalisa Buffa, Yannis Dirk Voet, Espen Sande

Explicit time integration schemes coupled with Galerkin discretizations of time-dependent partial differential equations require solving a linear system with the mass matrix at each time step. For applications in structural dynamics, the solution of the li ...

2023

Spectral Hypergraph Sparsifiers of Nearly Linear Size

Mikhail Kapralov, Jakab Tardos

Graph sparsification has been studied extensively over the past two decades, culminating in spectral sparsifiers of optimal size (up to constant factors). Spectral hypergraph sparsification is a natural analogue of this problem, for which optimal bounds on ...

IEEE COMPUTER SOC2022

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

Daniel Kressner, Alice Cortinovis

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

2022

Eigendecomposition-Free Training of Deep Networks for Linear Least-Square Problems

Pascal Fua, Mathieu Salzmann, Fei Wang, Kwang Moo Yi, Zheng Dang, Yinlin Hu

Many classical Computer Vision problems, such as essential matrix computation and pose estimation from 3D to 2D correspondences, can be tackled by solving a linear least-square problem, which can be done by finding the eigenvector corresponding to the smal ...

IEEE COMPUTER SOC2021

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

Daniel Kressner, Marcel Schweitzer, Alice Cortinovis

This work develops novel rational Krylov methods for updating a large-scale matrix function f(A) when A is subject to low-rank modifications. It extends our previous work in this context on polynomial Krylov methods, for which we present a simplified conve ...

SIAM PUBLICATIONS2021

A computational workflow for the expansion of heterologous biosynthetic pathways to natural product derivatives

Vassily Hatzimanikatis, Jasmin Maria Hafner

Plant natural products (PNPs) and their derivatives are important but underexplored sources of pharmaceutical molecules. To access this untapped potential, the reconstitution of heterologous PNP biosynthesis pathways in engineered microbes provides a valua ...

Nature Research2021

Polarity Of Almost All Points For Systems Of Nonlinear Stochastic Heat Equations In The Critical Dimension

Robert Dalang

We study vector-valued solutions u(t, x) is an element of R-d to systems of nonlinear stochastic heat equations with multiplicative noise, ...

INST MATHEMATICAL STATISTICS-IMS2021

Robust Differentiable SVD

Pascal Fua, Mathieu Salzmann, Zheng Dang, Yinlin Hu, Wei Wang

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

2021

hm-toolbox: MATLAB SOFTWARE FOR HODLR AND HSS MATRICES

Daniel Kressner, Stefano Massei

Matrices with hierarchical low-rank structure, including HODLR and HSS matrices, constitute a versatile tool to develop fast algorithms for addressing large-scale problems. While existing software packages for such matrices often focus on linear systems, t ...

SIAM PUBLICATIONS2020

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

Daniel Kressner, Stefano Massei, Kathryn Dianne Lund

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

2020

Page 2 sur 2