Supplemental Material
Available for Download
matrix Riccati equation AX + XB = C
- 1 Bickley, W.G. and McNamee, J. Matrix and other direct methods for the solution of systems of linear difference equations. Philos. Trans. Roy. Soc. (London) Sea'. A, 252 (1960), 69-131.Google Scholar
- 2 borr, Fred W. The direct solution of the discrete Poisson equation on a rectangle. SlAM Rev. 12 (1970), 248-263.Google Scholar
- 3 Martin, R.S., Peters, G., and Wilkinson, J.H. The QR algorithm for real Hessenberg matrices. (Handbook series linear algebra.) Numer. Math. 14 (1970), 219-231.Google ScholarDigital Library
- 4 Wilkinson, J.H. The Algebraic Eigenvahle Problem. Clarendon, Oxford, 1965. Google ScholarDigital Library
Recommendations
Algorithm 887: CHOLMOD, Supernodal Sparse Cholesky Factorization and Update/Downdate
CHOLMOD is a set of routines for factorizing sparse symmetric positive definite matrices of the form A or AAT, updating/downdating a sparse Cholesky factorization, solving linear systems, updating/downdating the solution to the triangular system Lx = b, ...
Computing tall skinny solutions of AX - XB = C
MODELLING 2001 - Second IMACS conference on mathematical modelling and computational methods in mechanics, physics, biomechanics and geodynamicsWe will concentrate on the numerical computation of so-called tall and skinny solutions X of the Sylvester equations AX - XB = C. By this we mean that A is an n × n matrix with cheaply applicable action (A is for example sparse), and B a k × k matrix, ...
A note on a three-term recurrence for a tridiagonal matrix
In this article the author shows that under certain conditions a three-term recurrence for a tridiagonal matrix becomes a two-term recurrence. Using this new recurrence, the possibility of the LU factorization of any tridiagonal matrix is now easy to ...
Comments