English
Related papers

Related papers: The LAPW method with eigendecomposition based on t…

200 papers

We introduce an efficient stable algorithm for transforms associated with expansions in Hermite functions interpolated at Hermite polynomial roots. The Hermite transform matrix can be factorised into a diagonal component and an orthogonal…

Numerical Analysis · Mathematics 2026-05-07 Marcus Webb , Georg Maierhofer

A framework to systematically decouple high order elliptic equations into combination of Poisson-type and Stokes-type equations is developed. The key is to systematically construct the underling commutative diagrams involving the complexes…

Numerical Analysis · Mathematics 2018-07-03 Long Chen , Xuehai Huang

SVD (singular value decomposition) is one of the basic tools of machine learning, allowing to optimize basis for a given matrix. However, sometimes we have a set of matrices $\{A_k\}_k$ instead, and would like to optimize a single common…

Machine Learning · Computer Science 2022-04-19 Jarek Duda

It is known that the decomposition in low-rank and sparse matrices (\textbf{L+S} for short) can be achieved by several Robust PCA techniques. Besides the low rankness, the local smoothness (\textbf{LSS}) is a vitally essential prior for…

Computer Vision and Pattern Recognition · Computer Science 2022-12-19 Jiangjun Peng , Yao Wang , Hongying Zhang , Jianjun Wang , Deyu Meng

In signal processing and identification, generalized singular value decomposition (GSVD), related to a sequence of matrices in product/quotient form are essential numerical linear algebra tools. On behalf of the growing demand for efficient…

Numerical Analysis · Mathematics 2025-11-13 Sitao Ling , Wenxuan Ma , Musheng Wei

The canonical polyadic decomposition (CPD) is a fundamental tensor decomposition which expresses a tensor as a sum of rank one tensors. In stark contrast to the matrix case, with light assumptions, the CPD of a low rank tensor is…

Numerical Analysis · Mathematics 2022-02-24 Eric Evert , Michiel Vandecappelle , Lieven De Lathauwer

We consider sweeping domain decomposition preconditioners to solve the Helmholtz equation in the case of stripwise domain decomposition with or without overlaps. We unify their derivation and convergence studies by expressing them as…

Numerical Analysis · Mathematics 2023-12-06 Nacime Bouziani , Frédéric Nataf , Pierre-Henri Tournier

Shared-memory parallelization (SMP) strategies for density matrix renormalization group (DMRG) algorithms enable the treatment of complex systems in solid state physics. We present two different approaches by which parallelization of the…

Strongly Correlated Electrons · Physics 2009-11-10 G. Hager , E. Jeckelmann , H. Fehske , G. Wellein

Suppose $\mu$ is a partition of $n$ and $\lambda$ a composition of $n$, and let $S^\mu$, $M^\lambda$ denote the Specht module and permutation module defined by Dipper and James for the Iwahori--Hecke algebra $\mathscr{H}_n$ of the symmetric…

Representation Theory · Mathematics 2012-05-16 Matthew Fayers

A thick-restart Lanczos type algorithm is proposed for Hermitian $J$-symmetric matrices. Since Hermitian $J$-symmetric matrices possess doubly degenerate spectra or doubly multiple eigenvalues with a simple relation between the degenerate…

Numerical Analysis · Mathematics 2020-09-14 Ken-Ichi Ishikawa , Tomohiro Sogabe

The generalized singular value decomposition (GSVD) is a valuable tool that has many applications in computational science. However, computing the GSVD for large-scale problems is challenging. Motivated by applications in hyper-differential…

Numerical Analysis · Mathematics 2020-02-10 Arvind K. Saibaba , Joseph Hart , Bart van Bloemen Waanders

We present fast numerical methods for computing the Hessenberg reduction of a unitary plus low-rank matrix $A=G+U V^H$, where $G\in \mathbb C^{n\times n}$ is a unitary matrix represented in some compressed format using $O(nk)$ parameters…

Numerical Analysis · Mathematics 2019-08-30 Roberto Bevilacqua , Gianna M. Del Corso , Luca Gemignani

A successful computational approach for solving large-scale positive semidefinite (PSD) programs is to enforce PSD-ness on only a collection of submatrices. For our study, we let $\mathcal{S}^{n,k}$ be the convex cone of $n\times n$…

Optimization and Control · Mathematics 2021-07-22 Grigoriy Blekherman , Santanu S. Dey , Kevin Shu , Shengding Sun

The joint bidiagonalization (JBD) process iteratively reduces a matrix pair $\{A,L\}$ to two bidiagonal forms simultaneously, which can be used for computing a partial generalized singular value decomposition (GSVD) of $\{A,L\}$. The…

Numerical Analysis · Mathematics 2024-02-06 Haibo Li

Hessenberg decomposition is the basic tool used in computational linear algebra to approximate the eigenvalues of a matrix. In this article, we generalize Hessenberg decomposition to continuous matrix fields over topological spaces. This…

Spectral Theory · Mathematics 2009-06-16 Benoit Jacob

In this paper we prove the global convergence of the complex Jacobi method for Hermitian matrices for a large class of generalized serial pivot strategies. For a given Hermitian matrix $A$ of order $n$ we find a constant $\gamma<1$…

Numerical Analysis · Mathematics 2024-03-19 Vjeran Hari , Erna Begovic

In this paper, we provide novel algorithms with identifiability guarantees for simplex-structured matrix factorization (SSMF), a generalization of nonnegative matrix factorization. Current state-of-the-art algorithms that provide…

Machine Learning · Computer Science 2021-05-12 Maryam Abdolali , Nicolas Gillis

Knowledge of the electric field of femtosecond, high intensity laser pulses is of paramount importance to study the interaction of this class of lasers with matter. A novel, hybrid method to reconstruct the laser field from fluence…

Computational Physics · Physics 2023-09-19 Ioaquin Moulanier , Lewis Thomas Dickson , Francesco Massimo , Brigitte Cros

Let $G$, $B$, and $H$ denote a complex semi-simple algebraic group, a Borel subgroup of $G$, and a maximal complex torus in $B$, respectively. Choose a compact real form $K$ of $G$ such that $T=K\cap H$ is a maximal torus in $T$. Then there…

Differential Geometry · Mathematics 2015-03-03 Arlo Caine

We present a new approach to solve the exponential retrieval problem. We derive a stable technique, based on the singular value decomposition (SVD) of lag-covariance and crosscovariance matrices consisting of covariance coefficients…

Signal Processing · Electrical Eng. & Systems 2020-08-11 D. J Nicolsky , G. S. Tipenko