Results 21 to 30 of about 1,075 (62)

The Sinkhorn-Knopp algorithm : convergence and applications [PDF]

open access: yes, 2008
As long as a square nonnegative matrix A contains sufficient nonzero elements, then the Sinkhorn-Knopp algorithm can be used to balance the matrix, that is, to find a diagonal scaling of A that is doubly stochastic.
Kruithof R., Philip A. Knight
core   +1 more source

Shrinkage Function And Its Applications In Matrix Approximation

open access: yes, 2017
The shrinkage function is widely used in matrix low-rank approximation, compressive sensing, and statistical estimation. In this article, an elementary derivation of the shrinkage function is given. In addition, applications of the shrinkage function are
Boas, Toby   +4 more
core   +1 more source

Computing the smallest singular triplets of a large matrix

open access: yesResults in Applied Mathematics, 2019
In this paper we present a new type of restarted Krylov methods for calculating the smallest singular triplets of a large sparse matrix, A. The new framework avoids the Lanczos bidiagonalization process and the use of polynomial filtering.
Achiya Dax
doaj   +1 more source

THE HYPERBOLIC QUADRATIC EIGENVALUE PROBLEM

open access: yesForum of Mathematics, Sigma, 2015
The hyperbolic quadratic eigenvalue problem (HQEP) was shown to admit Courant–Fischer type min–max principles in 1955 by Duffin and Cauchy type interlacing inequalities in 2010 by Veselić.
XIN LIANG, REN-CANG LI
doaj   +1 more source

Variable-step finite difference schemes for the solution of Sturm-Liouville problems

open access: yes, 2014
We discuss the solution of regular and singular Sturm-Liouville problems by means of High Order Finite Difference Schemes. We describe a code to define a discrete problem and its numerical solution by means of linear algebra techniques.
Amodio, Pierluigi, Settanni, Giuseppina
core   +1 more source

A flexible and adaptive Simpler GMRES with deflated restarting for shifted linear systems [PDF]

open access: yes, 2018
In this paper, two efficient iterative algorithms based on the simpler GMRES method are proposed for solving shifted linear systems. To make full use of the shifted structure, the proposed algorithms utilizing the deflated restarting strategy and ...
Gu, Xian-Ming, Zhong, Hong-Xiu
core   +2 more sources

The smallest singular value anomaly: The reasons behind sharp anomaly

open access: yesSpecial Matrices
Let AA be an arbitrary matrix in which the number of rows, mm, is considerably larger than the number of columns, nn. Let the submatrix Ai,i=1,…,m{A}_{i},\hspace{0.33em}i=1,\ldots ,m, be composed from the first ii rows of AA, and let βi{\beta }_{i ...
Dax Achiya
doaj   +1 more source

Block diagonalization of (p, q)-tridiagonal matrices

open access: yesSpecial Matrices
In this article, we study the block diagonalization of (p,q)\left(p,q)-tridiagonal matrices and derive closed-form expressions for the number and structure of diagonal blocks as functions of the parameters pp, qq, and nn. This reduction enables efficient
Manjunath Hariprasad
doaj   +1 more source

M-tensors and The Positive Definiteness of a Multivariate Form [PDF]

open access: yes, 2012
We study M-tensors and various properties of M-tensors are given. Specially, we show that the smallest real eigenvalue of M-tensor is positive corresponding to a nonnegative eigenvector.
Qi, Liqun, Zhang, Liping, Zhou, Guanglu
core  

Recurrence relation for the 6j-symbol of su_q(2) as a symmetric eigenvalue problem

open access: yes, 2015
A well known recurrence relation for the 6j-symbol of the quantum group su_q(2) is realized as a tridiagonal, symmetric eigenvalue problem. This formulation can be used to implement an efficient numerical evaluation algorithm, taking advantage of ...
Anderson E.   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy