Concept

Sylvester matrix

Related publications (12)

Preconditioning techniques for generalized Sylvester matrix equations

Sylvester matrix equations are ubiquitous in scientific computing. However, few solution techniques exist for their generalized multiterm version, as they recently arose in stochastic Galerkin finite element discretizations and isogeometric analysis. In th ...

2023

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

Daniel Kressner, Alice Cortinovis, Marcel Schweitzer

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 fast algorithm to find reduced hyperplane unit cells and solve N-dimensional Bezout's identities

Cyril Cayron

Deformation twinning on a plane is a simple shear that transforms a unit cell attached to the plane into another unit cell equivalent by mirror symmetry or 180 degrees rotation. Thus, crystallographic models of twinning require the determination of the sho ...

INT UNION CRYSTALLOGRAPHY2021

Recursive blocked algorithms for linear systems with Kronecker product structure

Daniel Kressner

Recursive blocked algorithms have proven to be highly efficient at the numerical solution of the Sylvester matrix equation and its generalizations. In this work, we show that these algorithms extend in a seamless fashion to higher-dimensional variants of g ...

SPRINGER2020

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

Projection Methods For Large-Scale T-Sylvester Equations

Daniel Kressner

The matrix Sylvester equation for congruence, or T-Sylvester equation, has recently attracted considerable attention as a consequence of its close relation to palindromic eigenvalue problems. The theory concerning T-Sylvester equations is rather well under ...

Amer Mathematical Soc2016

A New Identity for the Least-square Solution of Overdetermined Set of Linear Equations

Afsaneh Asaei, Mohammadjavad Taghizadeh, Saeid Haghighatshoar

In this paper, we prove a new identity for the least-square solution of an over-determined set of linear equation

Ax=b

, where

A

is an

m\times n

full-rank matrix,

b

is a column-vector of dimension

m

, and

m

(the number of equations) is larger tha ...

2015

A New Identity for the Least-square Solution of Overdetermined Set of Linear Equations

Afsaneh Asaei, Mohammadjavad Taghizadeh, Saeid Haghighatshoar

In this paper, we prove a new identity for the least-square solution of an over-determined set of linear equation

Ax=b

, where

A

is an

m\times n

full-rank matrix,

b

is a column-vector of dimension

m

, and

m

(the number of equations) is larger tha ...

Idiap2015

Interactive real-time physics: An intuitive approach to form-finding and structural analysis for design and education

Gennaro Senatore

Real-time physics simulation has been extensively used in computer games, but its potential has yet to be fully realized in design and education. We present an interactive 3D physics engine with a wide variety of applications. In common with traditional FE ...

2015

Fixed-Order H-infinity Controller Design via Convex Optimization Using an Alternative to Youla Prameterization

Alireza Karimi, Hamid Khatibi

All H-infinity controllers of a SISO LTI system are parameterized thanks to the relation between Bounded Real Lemma and Positive Real Lemma and a new concept of strict positive realness of two transfer functions with the same Lyapunov matrix in the matrix ...

Institute of Electrical and Electronics Engineers2010

Graph Chatbot

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.

A New Identity for the Least-square Solution of Overdetermined Set of Linear Equations

Afsaneh Asaei, Mohammadjavad Taghizadeh, Saeid Haghighatshoar

In this paper, we prove a new identity for the least-square solution of an over-determined set of linear equation

Ax=b

, where

A

is an

m\times n

full-rank matrix,

b

is a column-vector of dimension

m

, and

m

(the number of equations) is larger tha ...

Idiap2015