Publications related to Tridiagonal matrix

Fast Computation Of Spectral Projectors Of Banded Matrices

We consider the approximate computation of spectral projectors for symmetric banded matrices. While this problem has received considerable attention, especially in the context of linear scaling electronic structure methods, the presence of small relative s ...

Siam Publications2017

A generalized definition of reactivity for ecological systems and the problem of transient species dynamics

Andrea Rinaldo, Lorenzo Mari, Marino Gatto

Perturbations to an ecosystem's steady state can trigger transient responses of great ecological relevance. Asymptotic stability determines whether a generic perturbation will fade out in the long run, but falls short of characterizing the dynamics imme ...

Wiley2017

ALS Scheme using Extent-based Constraints for the Analysis of Chemical Reaction Systems

Dominique Bonvin, Julien Léo Billeter, Michael Amrhein

Multivariate curve resolution via alternating least squares (ALS) is used to resolve the concentration profiles C and the pure component spectra E of S species from the multivariate absorbance data A, assuming the bilinear model ...

2016

MATHICSE Technical Report : Fast computation of the matrix exponential for a Toeplitz matrix

Daniel Kressner, Robert Gerhard Jérôme Luce

The computation of the matrix exponential is a ubiquitous operation in numerical mathematics, and for a general, unstructured n×n matrix it can be computed in O(n3) operations. An interesting problem arises if the input matrix is a Toeplitz matrix, for exa ...

MATHICSE2016

Charge transport in superionic and melted AgI under a magnetic field studied via molecular dynamics

Sara Bonella, Luca Gagliardi

Charge transport in AgI subject to an external magnetic field is studied via computer simulations. We demonstrate that a recently developed algorithm can effectively complement problematic experiments to detect the ionic Hall effect, and identify previousl ...

Amer Physical Soc2016

Accelerated Spectral Clustering Using Graph Filtering of Random Signals

Pierre Vandergheynst, Rémi Gribonval, Gilles Puy, Nicolas Tremblay

We build upon recent advances in graph signal processing to propose a faster spectral clustering algorithm. Indeed, classical spectral clustering is based on the computation of the first

k

eigenvectors of the similarity matrix' Laplacian, whose computati ...

Ieee2016

MATHICSE Technical Report : Fast computation of spectral projectors of banded matrices

Daniel Kressner, Ana Susnjara

We consider the approximate computation of spectral projectors for symmetric banded matrices. While this problem has received considerable attention, especially in the context of linear scaling electronic structure methods, the presence of small relative s ...

MATHICSE2016

A block algorithm for computing antitriangular factorizations of symmetric matrices

Daniel Kressner, Zvonimir Bujanovic

Any symmetric matrix can be reduced to antitriangular form in finitely many steps by orthogonal similarity transformations. This form reveals the inertia of the matrix and has found applications in, e.g., model predictive control and constraint preconditio ...

Springer2016

Nonadiabatic dynamics with intersystem crossings: A time-dependent density functional theory implementation

Ivano Tavernelli

In this work, we derive a method to perform trajectory-based nonadiabatic dynamics that is able to describe both nonadiabatic transitions and intersystem crossing events (transitions between states of different spin-multiplicity) at the same level of theor ...

Amer Inst Physics2015

Optimally Packed Chains of Bulges in Multishift QR Algorithms

Daniel Kressner

The QR algorithm is the method of choice for computing all eigenvalues of a dense nonsymmetric matrix A. After an initial reduction to Hessenberg form, a QR iteration can be viewed as chasing a small bulge from the top left to the bottom right corner along ...

Association for Computing Machinery2014

Tridiagonal matrix

Graph Chatbot

Chat with Graph Search

Fast Computation Of Spectral Projectors Of Banded Matrices

A generalized definition of reactivity for ecological systems and the problem of transient species dynamics

ALS Scheme using Extent-based Constraints for the Analysis of Chemical Reaction Systems

MATHICSE Technical Report : Fast computation of the matrix exponential for a Toeplitz matrix

Charge transport in superionic and melted AgI under a magnetic field studied via molecular dynamics

Accelerated Spectral Clustering Using Graph Filtering of Random Signals

MATHICSE Technical Report : Fast computation of spectral projectors of banded matrices

A block algorithm for computing antitriangular factorizations of symmetric matrices

Nonadiabatic dynamics with intersystem crossings: A time-dependent density functional theory implementation

Optimally Packed Chains of Bulges in Multishift QR Algorithms

Optimally Packed Chains of Bulges in Multishift QR Algorithms

Nonadiabatic dynamics with intersystem crossings: A time-dependent density functional theory implementation

MATHICSE Technical Report : Fast computation of spectral projectors of banded matrices

A block algorithm for computing antitriangular factorizations of symmetric matrices

Fast Computation Of Spectral Projectors Of Banded Matrices

ALS Scheme using Extent-based Constraints for the Analysis of Chemical Reaction Systems

A generalized definition of reactivity for ecological systems and the problem of transient species dynamics

MATHICSE Technical Report : Fast computation of the matrix exponential for a Toeplitz matrix

Charge transport in superionic and melted AgI under a magnetic field studied via molecular dynamics

Accelerated Spectral Clustering Using Graph Filtering of Random Signals