Results 71 to 80 of about 62,500 (93)

Bidiagonal factorization

open access: yes
Prototypes for tw-sided bidiagonal factorization.
openaire   +1 more source

Approximate low-rank factorization with structured factors

open access: yes, 2010
An approximate rank revealing factorization problem with structure constraints on the normalized factors is considered. Examples of structure, motivated by an application in microarray data analysis, are sparsity, nonnegativity, periodicity, and ...
Niranjan, Mahesan, Markovsky, Ivan
core   +1 more source

On frequency-weighted coprime factorization based controller reduction [PDF]

open access: yes, 2003
We consider the efficient solution of a class of coprime factorization based controller approximation problems by using frequency-weighted balancing related model reduction approaches.
Varga, Andras
core  

A Superintegrable Quantum Field Theory. [PDF]

open access: yesCommun Math Phys
De Clerck M, Evnin O.
europepmc   +1 more source

Modifying a Sparse Cholesky Factorization

open access: yes, 1999
Given a sparse symmetric positive de nite matrix AA and an associated sparse Cholesky factorization LDL , we develop sparse techniques for obtaining the new factorization associated with either adding a column to A or deleting a column from A ...
Cholesky Factorization Ldl   +3 more
core  

Bidiagonal Factorization

open access: yes, 2011
This chapter introduces and methodically develops the important and useful topic of bidiagonal factorization. Factorization of matrices is one of the most important topics in matrix theory, and plays a central role in many related applied areas such as numerical analysis and statistics. Investigating when a class of matrices admits a particular type of
Shaun M. Fallat, Charles R. Johnson
exaly   +3 more sources

Successively Ordered Elementary Bidiagonal Factorization

SIAM Journal on Matrix Analysis and Applications, 2001
Let \(I\) be the identity matrix and \(E_{ij}\) the matrix with \((i,j)\)-entry \(1\) and zeros in all other positions. Define \(L_i(s)=I+sE_{i,i-1}\) and \(U_j(t)=I+tE_{j-1,j},\) where \(s,t\) are elements in a given field \(F.\) The matrices \(L_i(s)\) and \(U_j(t)\) are called elementary bidiagonal matrices. The authors give necessary and sufficient
D D Olesky
exaly   +3 more sources

Home - About - Disclaimer - Privacy