In Cholesky updating, Givens rotations or Householder transformations are used. In Cholesky downdating, where the matrix resulted from downdating is positive definite, hyperbolic rotations or hyperbolic Householder transformations are used. There are applications, for example, fast Toeplitz triangularization, where the matrix resulted from downdating may be indefinite. In this paper, we unify the unitary and hyperbolic rotations and Householder transformations (reflectors) and present a unified algorithm for both updating and general downdating where the downdated matrix can be either positive definite or indefinite. Key Words. Cholesky downdating, hyperbolic rotation, hyperbolic Householder transformation, fast Toeplitz triangularization. ...
was supported by an EPSRC Research Studentship. Abstract. Routines exist in LAPACK for computing the...
Given a sparse, symmetric positive definite matrix C and an associated sparse Cholesky factorization...
Abstract. In this paper, we present new algorithms that can replace the diagonal entries of a Hermit...
Abstract. This paper presents a Σ-unitary analogue to the CS decomposition of a partitioned unitary ...
AbstractIn this paper, we describe unified formulas for unitary and hyperbolic reflections and rotat...
AbstractThe rank-one modification of a Cholesky factorization R>TR−zzT=DTD, where R and D are upper ...
The updating and downdating of Cholesky decompositions has important applications in a number of are...
Given a symmetric and not necessarily positive definite matrix A, a modified Cholesky algorithm comp...
. Given a symmetric and not necessarily positive definite matrix A, a modified Cholesky algorithm co...
Perturbation theory is developed for the Cholesky decomposition of an n \Theta n symmetric positive...
This paper provides an error analysis of the generalized Schur algorithm of Kailath and Chun [SIAM J...
AbstractStarting from the Strassen method for rapid matrix multiplication and inversion as well as f...
Cholesky factorization is a type of matrix factorization which is used for solving system of linear ...
This article, aimed at a general audience of computational scientists, surveys the Cholesky factoriz...
We present new perturbation analyses, for the Cholesky factorization A = RJR of a symmetric positive...
was supported by an EPSRC Research Studentship. Abstract. Routines exist in LAPACK for computing the...
Given a sparse, symmetric positive definite matrix C and an associated sparse Cholesky factorization...
Abstract. In this paper, we present new algorithms that can replace the diagonal entries of a Hermit...
Abstract. This paper presents a Σ-unitary analogue to the CS decomposition of a partitioned unitary ...
AbstractIn this paper, we describe unified formulas for unitary and hyperbolic reflections and rotat...
AbstractThe rank-one modification of a Cholesky factorization R>TR−zzT=DTD, where R and D are upper ...
The updating and downdating of Cholesky decompositions has important applications in a number of are...
Given a symmetric and not necessarily positive definite matrix A, a modified Cholesky algorithm comp...
. Given a symmetric and not necessarily positive definite matrix A, a modified Cholesky algorithm co...
Perturbation theory is developed for the Cholesky decomposition of an n \Theta n symmetric positive...
This paper provides an error analysis of the generalized Schur algorithm of Kailath and Chun [SIAM J...
AbstractStarting from the Strassen method for rapid matrix multiplication and inversion as well as f...
Cholesky factorization is a type of matrix factorization which is used for solving system of linear ...
This article, aimed at a general audience of computational scientists, surveys the Cholesky factoriz...
We present new perturbation analyses, for the Cholesky factorization A = RJR of a symmetric positive...
was supported by an EPSRC Research Studentship. Abstract. Routines exist in LAPACK for computing the...
Given a sparse, symmetric positive definite matrix C and an associated sparse Cholesky factorization...
Abstract. In this paper, we present new algorithms that can replace the diagonal entries of a Hermit...