Publications associées à Complément de Schur

Iterative refinement of Schur decompositions

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

SPRINGER2023

Form-finding of tensegrity structures via rank minimization of force density matrix

Yafeng Wang

This study proposes a general computational framework for the form-finding of tensegrity structures. The procedure is divided into two stages in which the member force densities and nodal coordinates are obtained respectively. In the first stage, the deter ...

ELSEVIER SCI LTD2021

A unifying framework for form-finding and topology-finding of tensegrity structures

Yafeng Wang

This paper presents a unifying framework for the form-finding and topology-finding of tensegrity structures. The novel computational framework is based on rank-constrained linear matrix inequalities. For form-finding, given the topology (i.e., member conne ...

PERGAMON-ELSEVIER SCIENCE LTD2021

A hierarchical preconditioner for wave problems in quasilinear complexity

Jan Sickmann Hesthaven, Boris Bonev

The paper introduces a novel, hierarchical preconditioner based on nested dissection and hierarchical matrix compression. The preconditioner is intended for continuous and discontinuous Galerkin formulations of elliptic problems. We exploit the property th ...

2022

Bootstrapping massive quantum field theories

Denis Karateev, João Miguel Augusto Penedones Fernandes

We propose a new non-perturbative method for studying UV complete unitary quantum field theories (QFTs) with a mass gap in general number of spacetime dimensions. The method relies on unitarity formulated as positive semi-definiteness of the matrix of inne ...

Springer Nature2020

Accelerated Stochastic Matrix Inversion: General Theory and Speeding up BFGS Rules for Faster Second-Order Optimization

Sebastian Urban Stich

We present the first accelerated randomized algorithm for solving linear systems in Euclidean spaces. One essential problem of this type is the matrix inversion problem. In particular, our algorithm can be specialized to invert positive definite matrices i ...

2018

Efficient Preconditioning of hp-FEM Matrices by Hierarchical Low-Rank Approximations

Jan Sickmann Hesthaven, Paolo Gatto

We introduce a preconditioner based on a hierarchical low-rank compression scheme of Schur complements. The construction is inspired by standard nested dissection, and relies on the assumption that the Schur complements can be approximated, to high precisi ...

Springer Verlag2017

Block-Floating-Point Enhanced MMSE Filter Matrix Computation for MIMO-OFDM Communication Systems

Andreas Peter Burg, Carl Christian Sten Dominic Senning

n this paper we present an architecture for an MMSE ﬁlter matrix computation unit for signal detection in MIMO-OFDM communication systems. We propose to compute the required matrix inverse based on a Cholesky decomposition, followed by a Gauss-Jordan matri ...

2013

Proof of the Outage Probability Conjecture for MISO Channels

Emre Telatar, Emmanuel Abbé

It is conjectured that the covariance matrices minimizing the outage probability under a power constraint for multiple-input multiple-output channels with Gaussian fading are diagonal with either zeros or constant values on the diagonal. In the multiple-in ...

Institute of Electrical and Electronics Engineers2013

Multiple signal classification technique for phase estimation from a fringe pattern

Pramod Rastogi, Rajshekhar Gannavarpu

The paper introduces a multiple signal classification technique based method for fringe analysis. In the proposed method, the phase of a fringe pattern is locally approximated as a polynomial. The polynomial phase signal is then transformed to obtain signa ...

Optical Society of America2012