A block algorithm for computing antitriangular factorizations of symmetric matrices

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.

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

Two prominent categories for achieving coordinated multirobot displacement are flocking and navigation in formation. Both categories have their own body of literature and characteristics, including their respective advantages and disadvantages. While typic ...

Dynamical potentials appear in many advanced electronic-structure methods, including self-energies from many-body perturbation theory, dynamical mean-field theory, electronic-transport formulations, and many embedding approaches. Here, we propose a novel t ...

In this work, isogeometric mortaring is used for the simulation of a six-pole permanent magnet synchronous machine. Isogeometric mortaring is especially well suited for the efficient computation of rotating electric machines, as it allows for an exact geom ...

By taking inspiration from the backflow transformation for correlated systems, we introduce a tensor network Ansatz which extends the well-established matrix product state representation of a quantum many-body wave function. This structure provides enough ...

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

This work is concerned with approximating matrix functions for banded matrices, hierarchically semiseparable matrices, and related structures. We develop a new divide-and-conquer method based on (rational) Krylov subspace methods for performing low-rank up ...

The presence of aerodynamic vortices is widespread in nature. They can be found at small scales near the wing tip of flying insects or at bigger scale in the form of hurricanes, cyclones or even galaxies. They are identified as coherent regions of high vor ...

Astrobot swarms are used to capture astronomical signals to generate the map of the observable universe for the purpose of dark energy studies. The convergence of each swarm in the course of its coordination has to surpass a particular threshold to yield a ...

We propose a principled method for projecting an arbitrary square matrix to the non- convex set of asymptotically stable matrices. Leveraging ideas from large deviations theory, we show that this projection is optimal in an information-theoretic sense and ...

As historical stone masonry structures are vulnerable and prone to damage in earthquakes, investigating their structural integrity is important to reduce injuries and casualties while preserving their historical value. Stone masonry is a composite material ...

One of the most basic graph problems, All-Pairs Shortest Paths (APSP) is known to be solvable in n^{3-o(1)} time, and it is widely open whether it has an O(n^{3-ε}) time algorithm for ε > 0. To better understand APSP, one often strives to obtain subcubic t ...

We show that a constant factor approximation of the shortest and closest lattice vector problem in any l(p)-norm can be computed in time 2((0.802 + epsilon)n). This matches the currently fastest constant factor approximation algorithm for the shortest vect ...

A block algorithm for computing antitriangular factorizations of symmetric matrices

Chat with Graph Search

Iterative refinement of Schur decompositions

Hybrid Flock - Formation Control Algorithms

Unified Green's function approach for spectral and thermodynamic properties from algorithmic inversion of dynamical potentials

Torque Computation With the Isogeometric Mortar Method for the Simulation of Electric Machines

Matrix product states with backflow correlations

Robust Differentiable SVD

DIVIDE-AND-CONQUER METHODS FOR FUNCTIONS OF MATRICES WITH BANDED OR HIERARCHICAL LOW-RANK STRUCTURE\ast

Growth, timing, & trajectory of vortices behind a rotating plate

Learning convergence prediction of astrobots in multi-object spectrographs

Efficient Learning of a Linear Dynamical System with Stability Guarantees

Geometrical Treatise on the Modelling of 3D Particulate Inclusion-Matrix Microstructures with an Application to Historical Stone Masonry Walls

Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths

Approximate CVPp in time 2(0.802n)